/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/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-5.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-16 15:39:38,932 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-16 15:39:39,016 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-16 15:39:39,021 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-16 15:39:39,021 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-16 15:39:39,048 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-16 15:39:39,048 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-16 15:39:39,048 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-16 15:39:39,049 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-16 15:39:39,052 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-16 15:39:39,053 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-16 15:39:39,053 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-16 15:39:39,054 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-16 15:39:39,055 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-16 15:39:39,055 INFO L153 SettingsManager]: * Use SBE=true [2023-12-16 15:39:39,055 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-16 15:39:39,056 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-16 15:39:39,056 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-16 15:39:39,056 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-16 15:39:39,057 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-16 15:39:39,057 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-16 15:39:39,058 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-16 15:39:39,058 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-16 15:39:39,058 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-16 15:39:39,058 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-16 15:39:39,059 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-16 15:39:39,059 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-16 15:39:39,059 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-16 15:39:39,059 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-16 15:39:39,059 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-16 15:39:39,060 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-16 15:39:39,060 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-16 15:39:39,061 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-16 15:39:39,061 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-16 15:39:39,061 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 15:39:39,061 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-16 15:39:39,061 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-16 15:39:39,061 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-16 15:39:39,061 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-16 15:39:39,062 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-16 15:39:39,062 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-16 15:39:39,062 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-16 15:39:39,062 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-16 15:39:39,062 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-16 15:39:39,063 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-16 15:39:39,063 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-16 15:39:39,063 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-16 15:39:39,280 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-16 15:39:39,305 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-16 15:39:39,308 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-16 15:39:39,309 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-16 15:39:39,309 INFO L274 PluginConnector]: CDTParser initialized [2023-12-16 15:39:39,311 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-5.i [2023-12-16 15:39:40,474 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-16 15:39:40,683 INFO L384 CDTParser]: Found 1 translation units. [2023-12-16 15:39:40,683 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-5.i [2023-12-16 15:39:40,691 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/58af4e36b/7a8422e995254aa982a80d6ce905515a/FLAGc781e6be9 [2023-12-16 15:39:40,708 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/58af4e36b/7a8422e995254aa982a80d6ce905515a [2023-12-16 15:39:40,711 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-16 15:39:40,712 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-16 15:39:40,713 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-16 15:39:40,713 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-16 15:39:40,717 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-16 15:39:40,718 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 03:39:40" (1/1) ... [2023-12-16 15:39:40,719 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@527b8f44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:39:40, skipping insertion in model container [2023-12-16 15:39:40,719 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 03:39:40" (1/1) ... [2023-12-16 15:39:40,759 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-16 15:39:40,912 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-5.i[916,929] [2023-12-16 15:39:40,983 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 15:39:41,003 INFO L202 MainTranslator]: Completed pre-run [2023-12-16 15:39:41,014 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-5.i[916,929] [2023-12-16 15:39:41,046 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 15:39:41,066 INFO L206 MainTranslator]: Completed translation [2023-12-16 15:39:41,067 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:39:41 WrapperNode [2023-12-16 15:39:41,067 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-16 15:39:41,068 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-16 15:39:41,068 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-16 15:39:41,068 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-16 15:39:41,072 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:39:41" (1/1) ... [2023-12-16 15:39:41,084 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:39:41" (1/1) ... [2023-12-16 15:39:41,118 INFO L138 Inliner]: procedures = 33, calls = 158, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 430 [2023-12-16 15:39:41,118 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-16 15:39:41,119 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-16 15:39:41,119 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-16 15:39:41,119 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-16 15:39:41,128 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:39:41" (1/1) ... [2023-12-16 15:39:41,129 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:39:41" (1/1) ... [2023-12-16 15:39:41,139 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:39:41" (1/1) ... [2023-12-16 15:39:41,180 INFO L175 MemorySlicer]: Split 122 memory accesses to 6 slices as follows [2, 6, 3, 28, 59, 24]. 48 percent of accesses are in the largest equivalence class. The 17 initializations are split as follows [2, 1, 1, 6, 4, 3]. The 17 writes are split as follows [0, 1, 1, 6, 6, 3]. [2023-12-16 15:39:41,180 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:39:41" (1/1) ... [2023-12-16 15:39:41,181 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:39:41" (1/1) ... [2023-12-16 15:39:41,206 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:39:41" (1/1) ... [2023-12-16 15:39:41,209 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:39:41" (1/1) ... [2023-12-16 15:39:41,213 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:39:41" (1/1) ... [2023-12-16 15:39:41,216 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:39:41" (1/1) ... [2023-12-16 15:39:41,221 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-16 15:39:41,222 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-16 15:39:41,223 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-16 15:39:41,223 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-16 15:39:41,224 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:39:41" (1/1) ... [2023-12-16 15:39:41,230 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 15:39:41,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 15:39:41,273 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-16 15:39:41,300 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-16 15:39:41,311 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-16 15:39:41,311 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2023-12-16 15:39:41,312 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2023-12-16 15:39:41,313 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2023-12-16 15:39:41,314 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2023-12-16 15:39:41,314 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2023-12-16 15:39:41,314 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2023-12-16 15:39:41,314 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2023-12-16 15:39:41,314 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2023-12-16 15:39:41,314 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2023-12-16 15:39:41,314 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2023-12-16 15:39:41,315 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#4 [2023-12-16 15:39:41,315 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#5 [2023-12-16 15:39:41,315 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-16 15:39:41,315 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-12-16 15:39:41,315 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2023-12-16 15:39:41,316 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2023-12-16 15:39:41,316 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2023-12-16 15:39:41,316 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2023-12-16 15:39:41,316 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2023-12-16 15:39:41,316 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2023-12-16 15:39:41,317 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2023-12-16 15:39:41,317 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2023-12-16 15:39:41,317 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2023-12-16 15:39:41,317 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#5 [2023-12-16 15:39:41,319 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2023-12-16 15:39:41,319 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2023-12-16 15:39:41,319 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2023-12-16 15:39:41,319 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2023-12-16 15:39:41,319 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2023-12-16 15:39:41,319 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#5 [2023-12-16 15:39:41,319 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2023-12-16 15:39:41,319 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2023-12-16 15:39:41,319 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#2 [2023-12-16 15:39:41,320 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#3 [2023-12-16 15:39:41,320 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#4 [2023-12-16 15:39:41,320 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#5 [2023-12-16 15:39:41,320 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-16 15:39:41,320 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-16 15:39:41,320 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-16 15:39:41,320 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-16 15:39:41,320 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2023-12-16 15:39:41,320 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2023-12-16 15:39:41,320 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2023-12-16 15:39:41,321 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2023-12-16 15:39:41,321 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2023-12-16 15:39:41,321 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2023-12-16 15:39:41,322 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2023-12-16 15:39:41,322 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2023-12-16 15:39:41,322 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#2 [2023-12-16 15:39:41,322 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#3 [2023-12-16 15:39:41,322 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#4 [2023-12-16 15:39:41,322 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#5 [2023-12-16 15:39:41,322 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2023-12-16 15:39:41,322 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2023-12-16 15:39:41,322 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2023-12-16 15:39:41,323 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2023-12-16 15:39:41,323 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2023-12-16 15:39:41,323 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#5 [2023-12-16 15:39:41,513 INFO L241 CfgBuilder]: Building ICFG [2023-12-16 15:39:41,515 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-16 15:39:42,246 INFO L282 CfgBuilder]: Performing block encoding [2023-12-16 15:39:42,290 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-16 15:39:42,290 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-16 15:39:42,291 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 03:39:42 BoogieIcfgContainer [2023-12-16 15:39:42,291 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-16 15:39:42,293 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-16 15:39:42,293 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-16 15:39:42,296 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-16 15:39:42,296 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.12 03:39:40" (1/3) ... [2023-12-16 15:39:42,296 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32c8d6d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 03:39:42, skipping insertion in model container [2023-12-16 15:39:42,297 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 03:39:41" (2/3) ... [2023-12-16 15:39:42,297 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32c8d6d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 03:39:42, skipping insertion in model container [2023-12-16 15:39:42,297 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 03:39:42" (3/3) ... [2023-12-16 15:39:42,298 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-ap_file-5.i [2023-12-16 15:39:42,312 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-16 15:39:42,312 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-16 15:39:42,352 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-16 15:39:42,365 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;@86717bf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-16 15:39:42,365 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-16 15:39:42,369 INFO L276 IsEmpty]: Start isEmpty. Operand has 88 states, 65 states have (on average 1.3692307692307693) internal successors, (89), 66 states have internal predecessors, (89), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-12-16 15:39:42,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2023-12-16 15:39:42,382 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 15:39:42,382 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 15:39:42,383 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 15:39:42,387 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 15:39:42,387 INFO L85 PathProgramCache]: Analyzing trace with hash 1626294328, now seen corresponding path program 1 times [2023-12-16 15:39:42,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 15:39:42,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [103576237] [2023-12-16 15:39:42,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 15:39:42,400 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-16 15:39:42,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 15:39:42,404 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-16 15:39:42,409 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-16 15:39:42,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 15:39:42,688 INFO L262 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-16 15:39:42,697 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 15:39:42,735 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 390 proven. 0 refuted. 0 times theorem prover too weak. 370 trivial. 0 not checked. [2023-12-16 15:39:42,736 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 15:39:42,736 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 15:39:42,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [103576237] [2023-12-16 15:39:42,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [103576237] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 15:39:42,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 15:39:42,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-16 15:39:42,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483984518] [2023-12-16 15:39:42,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 15:39:42,743 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-16 15:39:42,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 15:39:42,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-16 15:39:42,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-16 15:39:42,769 INFO L87 Difference]: Start difference. First operand has 88 states, 65 states have (on average 1.3692307692307693) internal successors, (89), 66 states have internal predecessors, (89), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2023-12-16 15:39:42,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 15:39:42,826 INFO L93 Difference]: Finished difference Result 173 states and 276 transitions. [2023-12-16 15:39:42,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-16 15:39:42,829 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 142 [2023-12-16 15:39:42,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 15:39:42,839 INFO L225 Difference]: With dead ends: 173 [2023-12-16 15:39:42,840 INFO L226 Difference]: Without dead ends: 86 [2023-12-16 15:39:42,844 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 141 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-16 15:39:42,849 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 15:39:42,851 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 119 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 15:39:42,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2023-12-16 15:39:42,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2023-12-16 15:39:42,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 64 states have (on average 1.3125) internal successors, (84), 64 states have internal predecessors, (84), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-12-16 15:39:42,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 124 transitions. [2023-12-16 15:39:42,914 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 124 transitions. Word has length 142 [2023-12-16 15:39:42,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 15:39:42,915 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 124 transitions. [2023-12-16 15:39:42,915 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2023-12-16 15:39:42,915 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 124 transitions. [2023-12-16 15:39:42,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2023-12-16 15:39:42,919 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 15:39:42,919 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 15:39:42,932 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-16 15:39:43,120 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-16 15:39:43,121 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 15:39:43,121 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 15:39:43,121 INFO L85 PathProgramCache]: Analyzing trace with hash -1696479216, now seen corresponding path program 1 times [2023-12-16 15:39:43,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 15:39:43,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1407556042] [2023-12-16 15:39:43,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 15:39:43,123 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-16 15:39:43,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 15:39:43,125 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-16 15:39:43,135 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-16 15:39:43,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 15:39:43,481 INFO L262 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-16 15:39:43,488 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 15:39:43,567 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-12-16 15:39:43,567 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 15:39:43,567 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 15:39:43,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1407556042] [2023-12-16 15:39:43,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1407556042] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 15:39:43,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 15:39:43,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 15:39:43,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638400492] [2023-12-16 15:39:43,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 15:39:43,570 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 15:39:43,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 15:39:43,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 15:39:43,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 15:39:43,572 INFO L87 Difference]: Start difference. First operand 86 states and 124 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-16 15:39:43,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 15:39:43,681 INFO L93 Difference]: Finished difference Result 192 states and 278 transitions. [2023-12-16 15:39:43,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-16 15:39:43,683 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 142 [2023-12-16 15:39:43,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 15:39:43,684 INFO L225 Difference]: With dead ends: 192 [2023-12-16 15:39:43,685 INFO L226 Difference]: Without dead ends: 107 [2023-12-16 15:39:43,685 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-16 15:39:43,687 INFO L413 NwaCegarLoop]: 135 mSDtfsCounter, 46 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 374 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 15:39:43,687 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 374 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 15:39:43,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2023-12-16 15:39:43,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 88. [2023-12-16 15:39:43,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 66 states have (on average 1.303030303030303) internal successors, (86), 66 states have internal predecessors, (86), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-12-16 15:39:43,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 126 transitions. [2023-12-16 15:39:43,698 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 126 transitions. Word has length 142 [2023-12-16 15:39:43,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 15:39:43,700 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 126 transitions. [2023-12-16 15:39:43,700 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-16 15:39:43,700 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 126 transitions. [2023-12-16 15:39:43,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2023-12-16 15:39:43,702 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 15:39:43,702 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 15:39:43,711 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-16 15:39:43,903 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-16 15:39:43,903 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 15:39:43,904 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 15:39:43,904 INFO L85 PathProgramCache]: Analyzing trace with hash 420762677, now seen corresponding path program 1 times [2023-12-16 15:39:43,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 15:39:43,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [697306302] [2023-12-16 15:39:43,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 15:39:43,905 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-16 15:39:43,905 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 15:39:43,906 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-16 15:39:43,907 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-16 15:39:44,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 15:39:44,157 INFO L262 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-16 15:39:44,162 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 15:39:44,198 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-12-16 15:39:44,198 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 15:39:44,198 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 15:39:44,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [697306302] [2023-12-16 15:39:44,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [697306302] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 15:39:44,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 15:39:44,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 15:39:44,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191603973] [2023-12-16 15:39:44,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 15:39:44,200 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 15:39:44,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 15:39:44,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 15:39:44,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-16 15:39:44,201 INFO L87 Difference]: Start difference. First operand 88 states and 126 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-16 15:39:44,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 15:39:44,335 INFO L93 Difference]: Finished difference Result 196 states and 281 transitions. [2023-12-16 15:39:44,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-16 15:39:44,339 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 144 [2023-12-16 15:39:44,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 15:39:44,341 INFO L225 Difference]: With dead ends: 196 [2023-12-16 15:39:44,341 INFO L226 Difference]: Without dead ends: 109 [2023-12-16 15:39:44,342 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-12-16 15:39:44,343 INFO L413 NwaCegarLoop]: 114 mSDtfsCounter, 46 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 457 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 15:39:44,343 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 457 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 15:39:44,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2023-12-16 15:39:44,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 92. [2023-12-16 15:39:44,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 70 states have (on average 1.2857142857142858) internal successors, (90), 70 states have internal predecessors, (90), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-12-16 15:39:44,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 130 transitions. [2023-12-16 15:39:44,351 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 130 transitions. Word has length 144 [2023-12-16 15:39:44,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 15:39:44,353 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 130 transitions. [2023-12-16 15:39:44,353 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-16 15:39:44,353 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 130 transitions. [2023-12-16 15:39:44,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2023-12-16 15:39:44,355 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 15:39:44,355 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 15:39:44,362 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-16 15:39:44,560 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-16 15:39:44,560 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 15:39:44,561 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 15:39:44,561 INFO L85 PathProgramCache]: Analyzing trace with hash -388583949, now seen corresponding path program 1 times [2023-12-16 15:39:44,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 15:39:44,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1929917863] [2023-12-16 15:39:44,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 15:39:44,562 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-16 15:39:44,562 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 15:39:44,563 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-16 15:39:44,580 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-16 15:39:44,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 15:39:44,795 INFO L262 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-16 15:39:44,798 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 15:39:44,829 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-12-16 15:39:44,829 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 15:39:44,830 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 15:39:44,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1929917863] [2023-12-16 15:39:44,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1929917863] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 15:39:44,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 15:39:44,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-16 15:39:44,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976716043] [2023-12-16 15:39:44,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 15:39:44,831 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-16 15:39:44,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 15:39:44,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-16 15:39:44,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-16 15:39:44,832 INFO L87 Difference]: Start difference. First operand 92 states and 130 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-16 15:39:44,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 15:39:44,985 INFO L93 Difference]: Finished difference Result 203 states and 286 transitions. [2023-12-16 15:39:44,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-16 15:39:44,987 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 144 [2023-12-16 15:39:44,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 15:39:44,988 INFO L225 Difference]: With dead ends: 203 [2023-12-16 15:39:44,988 INFO L226 Difference]: Without dead ends: 112 [2023-12-16 15:39:44,989 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2023-12-16 15:39:44,990 INFO L413 NwaCegarLoop]: 112 mSDtfsCounter, 49 mSDsluCounter, 453 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 565 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 15:39:44,990 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 565 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 15:39:44,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2023-12-16 15:39:44,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 94. [2023-12-16 15:39:44,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 72 states have (on average 1.2777777777777777) internal successors, (92), 72 states have internal predecessors, (92), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-12-16 15:39:44,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 132 transitions. [2023-12-16 15:39:44,999 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 132 transitions. Word has length 144 [2023-12-16 15:39:45,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 15:39:45,000 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 132 transitions. [2023-12-16 15:39:45,000 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-16 15:39:45,000 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 132 transitions. [2023-12-16 15:39:45,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2023-12-16 15:39:45,002 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 15:39:45,002 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 15:39:45,012 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-12-16 15:39:45,213 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-16 15:39:45,213 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 15:39:45,214 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 15:39:45,214 INFO L85 PathProgramCache]: Analyzing trace with hash -331325647, now seen corresponding path program 1 times [2023-12-16 15:39:45,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 15:39:45,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1329506524] [2023-12-16 15:39:45,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 15:39:45,215 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-16 15:39:45,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 15:39:45,216 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-16 15:39:45,217 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-16 15:39:45,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 15:39:45,438 INFO L262 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-16 15:39:45,441 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 15:39:45,492 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-12-16 15:39:45,492 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 15:39:45,492 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 15:39:45,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1329506524] [2023-12-16 15:39:45,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1329506524] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 15:39:45,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 15:39:45,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-16 15:39:45,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266510342] [2023-12-16 15:39:45,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 15:39:45,493 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-16 15:39:45,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 15:39:45,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-16 15:39:45,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-16 15:39:45,495 INFO L87 Difference]: Start difference. First operand 94 states and 132 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-16 15:39:45,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 15:39:45,707 INFO L93 Difference]: Finished difference Result 206 states and 286 transitions. [2023-12-16 15:39:45,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-12-16 15:39:45,707 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 144 [2023-12-16 15:39:45,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 15:39:45,708 INFO L225 Difference]: With dead ends: 206 [2023-12-16 15:39:45,708 INFO L226 Difference]: Without dead ends: 113 [2023-12-16 15:39:45,709 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=186, Unknown=0, NotChecked=0, Total=272 [2023-12-16 15:39:45,710 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 40 mSDsluCounter, 556 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 667 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 15:39:45,710 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 667 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 15:39:45,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2023-12-16 15:39:45,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 96. [2023-12-16 15:39:45,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 74 states have (on average 1.2702702702702702) internal successors, (94), 74 states have internal predecessors, (94), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-12-16 15:39:45,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 134 transitions. [2023-12-16 15:39:45,719 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 134 transitions. Word has length 144 [2023-12-16 15:39:45,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 15:39:45,719 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 134 transitions. [2023-12-16 15:39:45,719 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-16 15:39:45,720 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 134 transitions. [2023-12-16 15:39:45,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2023-12-16 15:39:45,721 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 15:39:45,721 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 15:39:45,731 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-16 15:39:45,929 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-16 15:39:45,929 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 15:39:45,929 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 15:39:45,930 INFO L85 PathProgramCache]: Analyzing trace with hash -331266065, now seen corresponding path program 1 times [2023-12-16 15:39:45,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 15:39:45,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1693736102] [2023-12-16 15:39:45,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 15:39:45,930 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-16 15:39:45,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 15:39:45,932 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-16 15:39:45,932 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-16 15:39:46,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 15:39:46,170 INFO L262 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 13 conjunts are in the unsatisfiable core [2023-12-16 15:39:46,174 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 15:39:46,215 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-12-16 15:39:46,216 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 15:39:46,216 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 15:39:46,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1693736102] [2023-12-16 15:39:46,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1693736102] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 15:39:46,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 15:39:46,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 15:39:46,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013747212] [2023-12-16 15:39:46,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 15:39:46,217 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 15:39:46,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 15:39:46,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 15:39:46,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 15:39:46,218 INFO L87 Difference]: Start difference. First operand 96 states and 134 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-16 15:39:46,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 15:39:46,464 INFO L93 Difference]: Finished difference Result 191 states and 267 transitions. [2023-12-16 15:39:46,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 15:39:46,464 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 144 [2023-12-16 15:39:46,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 15:39:46,465 INFO L225 Difference]: With dead ends: 191 [2023-12-16 15:39:46,466 INFO L226 Difference]: Without dead ends: 96 [2023-12-16 15:39:46,466 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 142 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-16 15:39:46,467 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 0 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-16 15:39:46,467 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 198 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-16 15:39:46,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2023-12-16 15:39:46,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2023-12-16 15:39:46,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 74 states have (on average 1.2567567567567568) internal successors, (93), 74 states have internal predecessors, (93), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-12-16 15:39:46,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 133 transitions. [2023-12-16 15:39:46,474 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 133 transitions. Word has length 144 [2023-12-16 15:39:46,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 15:39:46,475 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 133 transitions. [2023-12-16 15:39:46,475 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-16 15:39:46,475 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 133 transitions. [2023-12-16 15:39:46,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2023-12-16 15:39:46,476 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 15:39:46,476 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 15:39:46,484 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-16 15:39:46,684 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-16 15:39:46,685 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 15:39:46,685 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 15:39:46,685 INFO L85 PathProgramCache]: Analyzing trace with hash -1352406572, now seen corresponding path program 1 times [2023-12-16 15:39:46,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 15:39:46,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1706295504] [2023-12-16 15:39:46,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 15:39:46,686 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-16 15:39:46,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 15:39:46,687 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-16 15:39:46,687 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-16 15:39:46,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 15:39:46,935 INFO L262 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-16 15:39:46,939 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 15:39:46,975 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-16 15:39:47,019 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-12-16 15:39:47,019 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 15:39:47,020 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 15:39:47,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1706295504] [2023-12-16 15:39:47,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1706295504] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 15:39:47,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 15:39:47,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 15:39:47,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838700480] [2023-12-16 15:39:47,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 15:39:47,026 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 15:39:47,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 15:39:47,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 15:39:47,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 15:39:47,027 INFO L87 Difference]: Start difference. First operand 96 states and 133 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-16 15:39:47,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 15:39:47,090 INFO L93 Difference]: Finished difference Result 191 states and 265 transitions. [2023-12-16 15:39:47,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 15:39:47,093 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 146 [2023-12-16 15:39:47,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 15:39:47,094 INFO L225 Difference]: With dead ends: 191 [2023-12-16 15:39:47,094 INFO L226 Difference]: Without dead ends: 96 [2023-12-16 15:39:47,094 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 144 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-16 15:39:47,095 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 1 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 15:39:47,095 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 230 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 15:39:47,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2023-12-16 15:39:47,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2023-12-16 15:39:47,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 74 states have (on average 1.2432432432432432) internal successors, (92), 74 states have internal predecessors, (92), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-12-16 15:39:47,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 132 transitions. [2023-12-16 15:39:47,101 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 132 transitions. Word has length 146 [2023-12-16 15:39:47,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 15:39:47,102 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 132 transitions. [2023-12-16 15:39:47,102 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-16 15:39:47,102 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 132 transitions. [2023-12-16 15:39:47,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2023-12-16 15:39:47,103 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 15:39:47,103 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 15:39:47,114 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-16 15:39:47,304 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-16 15:39:47,304 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 15:39:47,305 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 15:39:47,305 INFO L85 PathProgramCache]: Analyzing trace with hash 1253616982, now seen corresponding path program 1 times [2023-12-16 15:39:47,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 15:39:47,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [905132508] [2023-12-16 15:39:47,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 15:39:47,305 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-16 15:39:47,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 15:39:47,306 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-16 15:39:47,307 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-16 15:39:47,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 15:39:47,533 INFO L262 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-16 15:39:47,537 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 15:39:47,569 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-16 15:39:47,588 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-12-16 15:39:47,588 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 15:39:47,588 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 15:39:47,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [905132508] [2023-12-16 15:39:47,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [905132508] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 15:39:47,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 15:39:47,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 15:39:47,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273760150] [2023-12-16 15:39:47,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 15:39:47,589 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 15:39:47,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 15:39:47,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 15:39:47,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 15:39:47,590 INFO L87 Difference]: Start difference. First operand 96 states and 132 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-16 15:39:47,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 15:39:47,943 INFO L93 Difference]: Finished difference Result 216 states and 297 transitions. [2023-12-16 15:39:47,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 15:39:47,948 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 146 [2023-12-16 15:39:47,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 15:39:47,949 INFO L225 Difference]: With dead ends: 216 [2023-12-16 15:39:47,950 INFO L226 Difference]: Without dead ends: 121 [2023-12-16 15:39:47,950 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 15:39:47,952 INFO L413 NwaCegarLoop]: 135 mSDtfsCounter, 33 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 347 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-16 15:39:47,952 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 347 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-16 15:39:47,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2023-12-16 15:39:47,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 96. [2023-12-16 15:39:47,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 74 states have (on average 1.2297297297297298) internal successors, (91), 74 states have internal predecessors, (91), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-12-16 15:39:47,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 131 transitions. [2023-12-16 15:39:47,968 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 131 transitions. Word has length 146 [2023-12-16 15:39:47,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 15:39:47,968 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 131 transitions. [2023-12-16 15:39:47,968 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-16 15:39:47,968 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 131 transitions. [2023-12-16 15:39:47,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2023-12-16 15:39:47,970 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 15:39:47,970 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 15:39:47,980 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-16 15:39:48,177 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-16 15:39:48,178 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 15:39:48,178 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 15:39:48,178 INFO L85 PathProgramCache]: Analyzing trace with hash -26246696, now seen corresponding path program 1 times [2023-12-16 15:39:48,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 15:39:48,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1259314517] [2023-12-16 15:39:48,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 15:39:48,179 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-16 15:39:48,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 15:39:48,180 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-16 15:39:48,180 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-16 15:39:48,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 15:39:48,483 INFO L262 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 30 conjunts are in the unsatisfiable core [2023-12-16 15:39:48,492 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 15:39:50,526 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 15:39:50,532 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 23 treesize of output 22 [2023-12-16 15:39:51,124 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 15:39:51,134 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 15:39:51,137 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 35 [2023-12-16 15:39:52,073 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 15:39:52,073 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 48 treesize of output 38 [2023-12-16 15:39:57,633 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 28 treesize of output 24 [2023-12-16 15:39:57,708 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 56 [2023-12-16 15:39:57,793 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 15:39:57,793 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 61 treesize of output 45 [2023-12-16 15:39:57,856 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 15:39:57,856 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 68 treesize of output 36 [2023-12-16 15:39:57,982 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 184 proven. 364 refuted. 0 times theorem prover too weak. 212 trivial. 0 not checked. [2023-12-16 15:39:57,983 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 15:39:58,407 INFO L349 Elim1Store]: treesize reduction 22, result has 67.6 percent of original size [2023-12-16 15:39:58,408 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 89 treesize of output 104 [2023-12-16 15:39:58,589 INFO L349 Elim1Store]: treesize reduction 40, result has 50.0 percent of original size [2023-12-16 15:39:58,589 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 94 treesize of output 113 [2023-12-16 15:39:58,628 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 15:39:58,629 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 173 treesize of output 175 [2023-12-16 15:39:58,645 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 70 [2023-12-16 15:39:58,713 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 13 treesize of output 11 [2023-12-16 15:39:58,751 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 82 treesize of output 78 [2023-12-16 15:39:58,831 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2023-12-16 15:39:58,910 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 15:39:58,910 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 32 treesize of output 36 [2023-12-16 15:39:59,059 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 15:39:59,060 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 325 treesize of output 321 [2023-12-16 15:40:02,080 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 15:40:02,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1259314517] [2023-12-16 15:40:02,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1259314517] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 15:40:02,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [980112228] [2023-12-16 15:40:02,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 15:40:02,081 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-16 15:40:02,081 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-16 15:40:02,121 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-16 15:40:02,121 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (11)] Waiting until timeout for monitored process [2023-12-16 15:40:02,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 15:40:02,512 INFO L262 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 33 conjunts are in the unsatisfiable core [2023-12-16 15:40:02,517 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 15:40:04,265 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 12 [2023-12-16 15:40:04,679 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 21 treesize of output 20 [2023-12-16 15:40:05,422 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2023-12-16 15:40:06,889 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 28 treesize of output 24 [2023-12-16 15:40:07,015 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 56 [2023-12-16 15:40:07,143 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 45 [2023-12-16 15:40:07,223 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 32 [2023-12-16 15:40:07,239 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 120 proven. 364 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2023-12-16 15:40:07,239 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 15:40:07,708 INFO L349 Elim1Store]: treesize reduction 22, result has 67.6 percent of original size [2023-12-16 15:40:07,709 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 89 treesize of output 104 [2023-12-16 15:40:07,823 INFO L349 Elim1Store]: treesize reduction 40, result has 50.0 percent of original size [2023-12-16 15:40:07,823 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 94 treesize of output 113 [2023-12-16 15:40:07,867 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 15:40:07,868 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 331 treesize of output 331 [2023-12-16 15:40:07,881 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 63 treesize of output 61 [2023-12-16 15:40:07,905 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 70 treesize of output 66 [2023-12-16 15:40:07,947 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 13 treesize of output 11 [2023-12-16 15:40:07,987 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 15:40:07,988 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 32 treesize of output 36 [2023-12-16 15:40:08,028 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2023-12-16 15:40:08,096 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 15:40:08,096 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 126 treesize of output 126 [2023-12-16 15:40:09,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [980112228] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 15:40:09,503 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 15:40:09,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 19 [2023-12-16 15:40:09,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903075604] [2023-12-16 15:40:09,503 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 15:40:09,504 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-12-16 15:40:09,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 15:40:09,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-12-16 15:40:09,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=658, Unknown=7, NotChecked=0, Total=756 [2023-12-16 15:40:09,505 INFO L87 Difference]: Start difference. First operand 96 states and 131 transitions. Second operand has 20 states, 20 states have (on average 4.95) internal successors, (99), 19 states have internal predecessors, (99), 7 states have call successors, (40), 7 states have call predecessors, (40), 7 states have return successors, (40), 7 states have call predecessors, (40), 7 states have call successors, (40) [2023-12-16 15:40:13,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 15:40:13,285 INFO L93 Difference]: Finished difference Result 343 states and 467 transitions. [2023-12-16 15:40:13,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-16 15:40:13,286 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 4.95) internal successors, (99), 19 states have internal predecessors, (99), 7 states have call successors, (40), 7 states have call predecessors, (40), 7 states have return successors, (40), 7 states have call predecessors, (40), 7 states have call successors, (40) Word has length 146 [2023-12-16 15:40:13,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 15:40:13,288 INFO L225 Difference]: With dead ends: 343 [2023-12-16 15:40:13,288 INFO L226 Difference]: Without dead ends: 248 [2023-12-16 15:40:13,289 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 353 GetRequests, 315 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 265 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=315, Invalid=1160, Unknown=7, NotChecked=0, Total=1482 [2023-12-16 15:40:13,289 INFO L413 NwaCegarLoop]: 110 mSDtfsCounter, 614 mSDsluCounter, 1137 mSDsCounter, 0 mSdLazyCounter, 1011 mSolverCounterSat, 161 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 614 SdHoareTripleChecker+Valid, 1247 SdHoareTripleChecker+Invalid, 1172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 161 IncrementalHoareTripleChecker+Valid, 1011 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2023-12-16 15:40:13,289 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [614 Valid, 1247 Invalid, 1172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [161 Valid, 1011 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2023-12-16 15:40:13,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2023-12-16 15:40:13,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 191. [2023-12-16 15:40:13,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 145 states have (on average 1.2137931034482758) internal successors, (176), 146 states have internal predecessors, (176), 42 states have call successors, (42), 3 states have call predecessors, (42), 3 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) [2023-12-16 15:40:13,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 260 transitions. [2023-12-16 15:40:13,328 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 260 transitions. Word has length 146 [2023-12-16 15:40:13,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 15:40:13,331 INFO L495 AbstractCegarLoop]: Abstraction has 191 states and 260 transitions. [2023-12-16 15:40:13,331 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 4.95) internal successors, (99), 19 states have internal predecessors, (99), 7 states have call successors, (40), 7 states have call predecessors, (40), 7 states have return successors, (40), 7 states have call predecessors, (40), 7 states have call successors, (40) [2023-12-16 15:40:13,331 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 260 transitions. [2023-12-16 15:40:13,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2023-12-16 15:40:13,333 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 15:40:13,333 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 15:40:13,343 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (11)] Forceful destruction successful, exit code 0 [2023-12-16 15:40:13,550 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2023-12-16 15:40:13,743 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,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-16 15:40:13,744 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 15:40:13,744 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 15:40:13,744 INFO L85 PathProgramCache]: Analyzing trace with hash -1532718106, now seen corresponding path program 1 times [2023-12-16 15:40:13,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 15:40:13,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1121248710] [2023-12-16 15:40:13,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 15:40:13,745 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-16 15:40:13,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 15:40:13,745 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-16 15:40:13,747 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-16 15:40:13,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 15:40:13,952 INFO L262 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-16 15:40:13,954 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 15:40:13,981 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-12-16 15:40:13,981 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 15:40:13,981 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 15:40:13,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1121248710] [2023-12-16 15:40:13,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1121248710] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 15:40:13,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 15:40:13,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 15:40:13,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852635296] [2023-12-16 15:40:13,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 15:40:13,982 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 15:40:13,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 15:40:13,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 15:40:13,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-16 15:40:13,983 INFO L87 Difference]: Start difference. First operand 191 states and 260 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-16 15:40:14,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 15:40:14,061 INFO L93 Difference]: Finished difference Result 413 states and 561 transitions. [2023-12-16 15:40:14,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-16 15:40:14,061 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 146 [2023-12-16 15:40:14,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 15:40:14,064 INFO L225 Difference]: With dead ends: 413 [2023-12-16 15:40:14,064 INFO L226 Difference]: Without dead ends: 227 [2023-12-16 15:40:14,065 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-12-16 15:40:14,065 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 54 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 445 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 15:40:14,066 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 445 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 15:40:14,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2023-12-16 15:40:14,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 197. [2023-12-16 15:40:14,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 151 states have (on average 1.205298013245033) internal successors, (182), 152 states have internal predecessors, (182), 42 states have call successors, (42), 3 states have call predecessors, (42), 3 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) [2023-12-16 15:40:14,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 266 transitions. [2023-12-16 15:40:14,085 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 266 transitions. Word has length 146 [2023-12-16 15:40:14,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 15:40:14,085 INFO L495 AbstractCegarLoop]: Abstraction has 197 states and 266 transitions. [2023-12-16 15:40:14,085 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-16 15:40:14,085 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 266 transitions. [2023-12-16 15:40:14,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2023-12-16 15:40:14,086 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 15:40:14,087 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 15:40:14,094 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2023-12-16 15:40:14,294 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-16 15:40:14,295 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 15:40:14,295 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 15:40:14,295 INFO L85 PathProgramCache]: Analyzing trace with hash 873320681, now seen corresponding path program 1 times [2023-12-16 15:40:14,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 15:40:14,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1405042073] [2023-12-16 15:40:14,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 15:40:14,296 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-16 15:40:14,296 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 15:40:14,297 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-16 15:40:14,298 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-16 15:40:14,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 15:40:14,622 INFO L262 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 26 conjunts are in the unsatisfiable core [2023-12-16 15:40:14,627 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 15:40:16,139 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 28 treesize of output 24 [2023-12-16 15:40:16,179 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 56 [2023-12-16 15:40:16,222 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 15:40:16,222 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 61 treesize of output 45 [2023-12-16 15:40:16,251 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 59 treesize of output 35 [2023-12-16 15:40:16,299 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-12-16 15:40:16,299 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 15:40:16,299 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 15:40:16,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1405042073] [2023-12-16 15:40:16,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1405042073] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 15:40:16,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 15:40:16,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-16 15:40:16,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662486552] [2023-12-16 15:40:16,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 15:40:16,300 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-16 15:40:16,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 15:40:16,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-16 15:40:16,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2023-12-16 15:40:16,301 INFO L87 Difference]: Start difference. First operand 197 states and 266 transitions. Second operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 9 states have internal predecessors, (50), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-16 15:40:17,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 15:40:17,635 INFO L93 Difference]: Finished difference Result 356 states and 477 transitions. [2023-12-16 15:40:17,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-16 15:40:17,636 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 9 states have internal predecessors, (50), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 147 [2023-12-16 15:40:17,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 15:40:17,637 INFO L225 Difference]: With dead ends: 356 [2023-12-16 15:40:17,638 INFO L226 Difference]: Without dead ends: 258 [2023-12-16 15:40:17,638 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=83, Invalid=189, Unknown=0, NotChecked=0, Total=272 [2023-12-16 15:40:17,639 INFO L413 NwaCegarLoop]: 126 mSDtfsCounter, 232 mSDsluCounter, 489 mSDsCounter, 0 mSdLazyCounter, 364 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 232 SdHoareTripleChecker+Valid, 615 SdHoareTripleChecker+Invalid, 374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 364 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-12-16 15:40:17,639 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [232 Valid, 615 Invalid, 374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 364 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-12-16 15:40:17,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2023-12-16 15:40:17,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 197. [2023-12-16 15:40:17,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 150 states have (on average 1.2) internal successors, (180), 151 states have internal predecessors, (180), 42 states have call successors, (42), 4 states have call predecessors, (42), 4 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) [2023-12-16 15:40:17,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 264 transitions. [2023-12-16 15:40:17,662 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 264 transitions. Word has length 147 [2023-12-16 15:40:17,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 15:40:17,663 INFO L495 AbstractCegarLoop]: Abstraction has 197 states and 264 transitions. [2023-12-16 15:40:17,663 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 9 states have internal predecessors, (50), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-16 15:40:17,663 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 264 transitions. [2023-12-16 15:40:17,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2023-12-16 15:40:17,664 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 15:40:17,664 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 15:40:17,676 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-16 15:40:17,873 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-16 15:40:17,873 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 15:40:17,873 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 15:40:17,873 INFO L85 PathProgramCache]: Analyzing trace with hash -1280630248, now seen corresponding path program 1 times [2023-12-16 15:40:17,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 15:40:17,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2141143449] [2023-12-16 15:40:17,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 15:40:17,874 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-16 15:40:17,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 15:40:17,875 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-16 15:40:17,875 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-16 15:40:18,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 15:40:18,092 INFO L262 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-16 15:40:18,096 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 15:40:18,401 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 18 proven. 130 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-12-16 15:40:18,401 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 15:40:18,498 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-12-16 15:40:18,499 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 15:40:18,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2141143449] [2023-12-16 15:40:18,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2141143449] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-16 15:40:18,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-16 15:40:18,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 11 [2023-12-16 15:40:18,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421979133] [2023-12-16 15:40:18,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 15:40:18,500 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 15:40:18,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 15:40:18,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 15:40:18,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2023-12-16 15:40:18,500 INFO L87 Difference]: Start difference. First operand 197 states and 264 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-16 15:40:18,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 15:40:18,592 INFO L93 Difference]: Finished difference Result 433 states and 576 transitions. [2023-12-16 15:40:18,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-16 15:40:18,593 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 148 [2023-12-16 15:40:18,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 15:40:18,595 INFO L225 Difference]: With dead ends: 433 [2023-12-16 15:40:18,595 INFO L226 Difference]: Without dead ends: 241 [2023-12-16 15:40:18,596 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 295 GetRequests, 285 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2023-12-16 15:40:18,597 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 101 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 15:40:18,597 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 338 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 15:40:18,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2023-12-16 15:40:18,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 203. [2023-12-16 15:40:18,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 156 states have (on average 1.185897435897436) internal successors, (185), 157 states have internal predecessors, (185), 42 states have call successors, (42), 4 states have call predecessors, (42), 4 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) [2023-12-16 15:40:18,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 269 transitions. [2023-12-16 15:40:18,639 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 269 transitions. Word has length 148 [2023-12-16 15:40:18,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 15:40:18,640 INFO L495 AbstractCegarLoop]: Abstraction has 203 states and 269 transitions. [2023-12-16 15:40:18,640 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-16 15:40:18,640 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 269 transitions. [2023-12-16 15:40:18,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2023-12-16 15:40:18,641 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 15:40:18,642 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 15:40:18,652 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-16 15:40:18,852 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-16 15:40:18,852 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 15:40:18,852 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 15:40:18,852 INFO L85 PathProgramCache]: Analyzing trace with hash 1143921882, now seen corresponding path program 1 times [2023-12-16 15:40:18,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 15:40:18,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1102306139] [2023-12-16 15:40:18,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 15:40:18,853 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-16 15:40:18,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 15:40:18,855 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-16 15:40:18,855 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-16 15:40:19,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 15:40:19,136 INFO L262 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 13 conjunts are in the unsatisfiable core [2023-12-16 15:40:19,139 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 15:40:19,179 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-16 15:40:19,185 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-16 15:40:19,211 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-12-16 15:40:19,211 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 15:40:19,212 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 15:40:19,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1102306139] [2023-12-16 15:40:19,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1102306139] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 15:40:19,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 15:40:19,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 15:40:19,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644390796] [2023-12-16 15:40:19,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 15:40:19,212 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 15:40:19,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 15:40:19,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 15:40:19,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-16 15:40:19,213 INFO L87 Difference]: Start difference. First operand 203 states and 269 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-16 15:40:19,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 15:40:19,503 INFO L93 Difference]: Finished difference Result 401 states and 531 transitions. [2023-12-16 15:40:19,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-16 15:40:19,503 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 148 [2023-12-16 15:40:19,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 15:40:19,505 INFO L225 Difference]: With dead ends: 401 [2023-12-16 15:40:19,505 INFO L226 Difference]: Without dead ends: 203 [2023-12-16 15:40:19,505 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-16 15:40:19,506 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 33 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 356 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-16 15:40:19,506 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 356 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-16 15:40:19,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2023-12-16 15:40:19,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 203. [2023-12-16 15:40:19,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 156 states have (on average 1.1666666666666667) internal successors, (182), 157 states have internal predecessors, (182), 42 states have call successors, (42), 4 states have call predecessors, (42), 4 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) [2023-12-16 15:40:19,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 266 transitions. [2023-12-16 15:40:19,527 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 266 transitions. Word has length 148 [2023-12-16 15:40:19,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 15:40:19,528 INFO L495 AbstractCegarLoop]: Abstraction has 203 states and 266 transitions. [2023-12-16 15:40:19,528 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-16 15:40:19,528 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 266 transitions. [2023-12-16 15:40:19,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2023-12-16 15:40:19,529 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 15:40:19,529 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 15:40:19,539 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-16 15:40:19,738 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-16 15:40:19,739 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 15:40:19,739 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 15:40:19,739 INFO L85 PathProgramCache]: Analyzing trace with hash -313637823, now seen corresponding path program 1 times [2023-12-16 15:40:19,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 15:40:19,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [790477998] [2023-12-16 15:40:19,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 15:40:19,740 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-16 15:40:19,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 15:40:19,741 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-16 15:40:19,741 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-16 15:40:20,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 15:40:20,051 INFO L262 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 12 conjunts are in the unsatisfiable core [2023-12-16 15:40:20,054 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 15:40:20,066 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 46 [2023-12-16 15:40:20,076 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 47 [2023-12-16 15:40:20,112 INFO L349 Elim1Store]: treesize reduction 20, result has 47.4 percent of original size [2023-12-16 15:40:20,112 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 1 case distinctions, treesize of input 28 treesize of output 33 [2023-12-16 15:40:20,163 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 54 treesize of output 42 [2023-12-16 15:40:20,164 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 42 treesize of output 30 [2023-12-16 15:40:20,176 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-12-16 15:40:20,176 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 15:40:20,176 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 15:40:20,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [790477998] [2023-12-16 15:40:20,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [790477998] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 15:40:20,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 15:40:20,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 15:40:20,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115873342] [2023-12-16 15:40:20,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 15:40:20,177 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 15:40:20,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 15:40:20,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 15:40:20,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-16 15:40:20,178 INFO L87 Difference]: Start difference. First operand 203 states and 266 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-16 15:40:20,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 15:40:20,443 INFO L93 Difference]: Finished difference Result 212 states and 276 transitions. [2023-12-16 15:40:20,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-16 15:40:20,444 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 150 [2023-12-16 15:40:20,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 15:40:20,445 INFO L225 Difference]: With dead ends: 212 [2023-12-16 15:40:20,445 INFO L226 Difference]: Without dead ends: 210 [2023-12-16 15:40:20,445 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-12-16 15:40:20,446 INFO L413 NwaCegarLoop]: 110 mSDtfsCounter, 34 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 379 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-16 15:40:20,446 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 379 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-16 15:40:20,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2023-12-16 15:40:20,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 207. [2023-12-16 15:40:20,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 160 states have (on average 1.1625) internal successors, (186), 161 states have internal predecessors, (186), 42 states have call successors, (42), 4 states have call predecessors, (42), 4 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) [2023-12-16 15:40:20,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 270 transitions. [2023-12-16 15:40:20,468 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 270 transitions. Word has length 150 [2023-12-16 15:40:20,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 15:40:20,468 INFO L495 AbstractCegarLoop]: Abstraction has 207 states and 270 transitions. [2023-12-16 15:40:20,469 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-16 15:40:20,469 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 270 transitions. [2023-12-16 15:40:20,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2023-12-16 15:40:20,469 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 15:40:20,470 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 15:40:20,483 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-16 15:40:20,679 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-16 15:40:20,679 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 15:40:20,680 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 15:40:20,680 INFO L85 PathProgramCache]: Analyzing trace with hash -313578241, now seen corresponding path program 1 times [2023-12-16 15:40:20,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 15:40:20,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1908021328] [2023-12-16 15:40:20,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 15:40:20,680 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-16 15:40:20,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 15:40:20,681 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-16 15:40:20,682 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-16 15:40:21,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 15:40:21,031 INFO L262 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 22 conjunts are in the unsatisfiable core [2023-12-16 15:40:21,039 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 15:40:22,043 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-16 15:40:22,044 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 26 treesize of output 14 [2023-12-16 15:40:22,282 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 25 treesize of output 24 [2023-12-16 15:40:22,757 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 15:40:22,758 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 1 case distinctions, treesize of input 33 treesize of output 35 [2023-12-16 15:40:23,629 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 29 [2023-12-16 15:40:24,057 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 15:40:24,058 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 96 treesize of output 104 [2023-12-16 15:40:24,070 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 15:40:24,071 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 39 [2023-12-16 15:40:24,114 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 120 proven. 364 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2023-12-16 15:40:24,114 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 15:40:24,176 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 15:40:24,177 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 1 case distinctions, treesize of input 65 treesize of output 65 [2023-12-16 15:40:24,188 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 15:40:24,188 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 46 treesize of output 50 [2023-12-16 15:40:24,194 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 13 treesize of output 11 [2023-12-16 15:40:24,220 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 65 treesize of output 61 [2023-12-16 15:40:24,240 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 14 treesize of output 12 [2023-12-16 15:40:24,389 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 15:40:24,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1908021328] [2023-12-16 15:40:24,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1908021328] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 15:40:24,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1719659925] [2023-12-16 15:40:24,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 15:40:24,390 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-16 15:40:24,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-16 15:40:24,392 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-16 15:40:24,400 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (18)] Waiting until timeout for monitored process [2023-12-16 15:40:24,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 15:40:24,868 INFO L262 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 25 conjunts are in the unsatisfiable core [2023-12-16 15:40:24,872 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 15:40:26,112 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 21 treesize of output 20 [2023-12-16 15:40:26,529 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2023-12-16 15:40:27,043 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2023-12-16 15:40:28,219 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 29 [2023-12-16 15:40:28,648 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 15:40:28,648 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 84 treesize of output 84 [2023-12-16 15:40:28,653 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 39 [2023-12-16 15:40:28,662 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 160 proven. 364 refuted. 0 times theorem prover too weak. 236 trivial. 0 not checked. [2023-12-16 15:40:28,662 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 15:40:28,720 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 15:40:28,720 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 1 case distinctions, treesize of input 65 treesize of output 65 [2023-12-16 15:40:28,726 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 14 treesize of output 12 [2023-12-16 15:40:28,747 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 15:40:28,747 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 46 treesize of output 50 [2023-12-16 15:40:28,754 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 13 treesize of output 11 [2023-12-16 15:40:28,773 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 65 treesize of output 61 [2023-12-16 15:40:28,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1719659925] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 15:40:28,974 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 15:40:28,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2023-12-16 15:40:28,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662282636] [2023-12-16 15:40:28,975 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 15:40:28,975 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-16 15:40:28,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 15:40:28,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-16 15:40:28,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2023-12-16 15:40:28,976 INFO L87 Difference]: Start difference. First operand 207 states and 270 transitions. Second operand has 12 states, 12 states have (on average 9.416666666666666) internal successors, (113), 11 states have internal predecessors, (113), 6 states have call successors, (40), 6 states have call predecessors, (40), 6 states have return successors, (40), 6 states have call predecessors, (40), 6 states have call successors, (40) [2023-12-16 15:40:30,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 15:40:30,599 INFO L93 Difference]: Finished difference Result 414 states and 539 transitions. [2023-12-16 15:40:30,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-16 15:40:30,600 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 9.416666666666666) internal successors, (113), 11 states have internal predecessors, (113), 6 states have call successors, (40), 6 states have call predecessors, (40), 6 states have return successors, (40), 6 states have call predecessors, (40), 6 states have call successors, (40) Word has length 150 [2023-12-16 15:40:30,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 15:40:30,601 INFO L225 Difference]: With dead ends: 414 [2023-12-16 15:40:30,601 INFO L226 Difference]: Without dead ends: 212 [2023-12-16 15:40:30,602 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 362 GetRequests, 345 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=92, Invalid=214, Unknown=0, NotChecked=0, Total=306 [2023-12-16 15:40:30,602 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 366 mSDsluCounter, 529 mSDsCounter, 0 mSdLazyCounter, 355 mSolverCounterSat, 153 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 366 SdHoareTripleChecker+Valid, 626 SdHoareTripleChecker+Invalid, 508 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 153 IncrementalHoareTripleChecker+Valid, 355 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-12-16 15:40:30,603 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [366 Valid, 626 Invalid, 508 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [153 Valid, 355 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2023-12-16 15:40:30,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2023-12-16 15:40:30,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 207. [2023-12-16 15:40:30,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 160 states have (on average 1.15625) internal successors, (185), 161 states have internal predecessors, (185), 42 states have call successors, (42), 4 states have call predecessors, (42), 4 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) [2023-12-16 15:40:30,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 269 transitions. [2023-12-16 15:40:30,626 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 269 transitions. Word has length 150 [2023-12-16 15:40:30,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 15:40:30,626 INFO L495 AbstractCegarLoop]: Abstraction has 207 states and 269 transitions. [2023-12-16 15:40:30,626 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.416666666666666) internal successors, (113), 11 states have internal predecessors, (113), 6 states have call successors, (40), 6 states have call predecessors, (40), 6 states have return successors, (40), 6 states have call predecessors, (40), 6 states have call successors, (40) [2023-12-16 15:40:30,627 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 269 transitions. [2023-12-16 15:40:30,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2023-12-16 15:40:30,627 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 15:40:30,627 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 15:40:30,647 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-16 15:40:30,844 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (18)] Forceful destruction successful, exit code 0 [2023-12-16 15:40:31,039 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,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2023-12-16 15:40:31,039 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 15:40:31,040 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 15:40:31,040 INFO L85 PathProgramCache]: Analyzing trace with hash -256319939, now seen corresponding path program 1 times [2023-12-16 15:40:31,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 15:40:31,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1741342519] [2023-12-16 15:40:31,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 15:40:31,041 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-16 15:40:31,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 15:40:31,042 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-16 15:40:31,045 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-16 15:40:31,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 15:40:31,316 INFO L262 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-16 15:40:31,318 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 15:40:31,324 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 11 treesize of output 9 [2023-12-16 15:40:31,361 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-12-16 15:40:31,361 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 15:40:31,361 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 15:40:31,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1741342519] [2023-12-16 15:40:31,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1741342519] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 15:40:31,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 15:40:31,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 15:40:31,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298958078] [2023-12-16 15:40:31,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 15:40:31,362 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 15:40:31,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 15:40:31,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 15:40:31,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-16 15:40:31,362 INFO L87 Difference]: Start difference. First operand 207 states and 269 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-16 15:40:31,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 15:40:31,518 INFO L93 Difference]: Finished difference Result 472 states and 618 transitions. [2023-12-16 15:40:31,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-16 15:40:31,520 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 150 [2023-12-16 15:40:31,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 15:40:31,522 INFO L225 Difference]: With dead ends: 472 [2023-12-16 15:40:31,522 INFO L226 Difference]: Without dead ends: 270 [2023-12-16 15:40:31,523 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-12-16 15:40:31,523 INFO L413 NwaCegarLoop]: 190 mSDtfsCounter, 113 mSDsluCounter, 452 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 642 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 15:40:31,523 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 642 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 15:40:31,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2023-12-16 15:40:31,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 247. [2023-12-16 15:40:31,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 181 states have (on average 1.12707182320442) internal successors, (204), 182 states have internal predecessors, (204), 60 states have call successors, (60), 5 states have call predecessors, (60), 5 states have return successors, (60), 59 states have call predecessors, (60), 60 states have call successors, (60) [2023-12-16 15:40:31,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 324 transitions. [2023-12-16 15:40:31,560 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 324 transitions. Word has length 150 [2023-12-16 15:40:31,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 15:40:31,560 INFO L495 AbstractCegarLoop]: Abstraction has 247 states and 324 transitions. [2023-12-16 15:40:31,561 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-16 15:40:31,561 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 324 transitions. [2023-12-16 15:40:31,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2023-12-16 15:40:31,561 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 15:40:31,562 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 15:40:31,572 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 (19)] Forceful destruction successful, exit code 0 [2023-12-16 15:40:31,772 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 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-16 15:40:31,772 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 15:40:31,773 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 15:40:31,773 INFO L85 PathProgramCache]: Analyzing trace with hash -1065666565, now seen corresponding path program 1 times [2023-12-16 15:40:31,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 15:40:31,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [387047556] [2023-12-16 15:40:31,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 15:40:31,774 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-16 15:40:31,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 15:40:31,775 INFO L229 MonitoredProcess]: Starting monitored process 20 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-16 15:40:31,812 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 (20)] Waiting until timeout for monitored process [2023-12-16 15:40:32,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 15:40:32,058 INFO L262 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-16 15:40:32,060 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 15:40:32,075 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-12-16 15:40:32,075 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 15:40:32,075 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 15:40:32,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [387047556] [2023-12-16 15:40:32,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [387047556] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 15:40:32,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 15:40:32,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 15:40:32,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191068343] [2023-12-16 15:40:32,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 15:40:32,076 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 15:40:32,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 15:40:32,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 15:40:32,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-16 15:40:32,076 INFO L87 Difference]: Start difference. First operand 247 states and 324 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-16 15:40:32,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 15:40:32,189 INFO L93 Difference]: Finished difference Result 466 states and 604 transitions. [2023-12-16 15:40:32,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-16 15:40:32,190 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 150 [2023-12-16 15:40:32,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 15:40:32,191 INFO L225 Difference]: With dead ends: 466 [2023-12-16 15:40:32,192 INFO L226 Difference]: Without dead ends: 264 [2023-12-16 15:40:32,192 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-12-16 15:40:32,193 INFO L413 NwaCegarLoop]: 112 mSDtfsCounter, 20 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 437 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 15:40:32,193 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 437 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 15:40:32,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2023-12-16 15:40:32,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 253. [2023-12-16 15:40:32,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 187 states have (on average 1.1229946524064172) internal successors, (210), 188 states have internal predecessors, (210), 60 states have call successors, (60), 5 states have call predecessors, (60), 5 states have return successors, (60), 59 states have call predecessors, (60), 60 states have call successors, (60) [2023-12-16 15:40:32,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 330 transitions. [2023-12-16 15:40:32,229 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 330 transitions. Word has length 150 [2023-12-16 15:40:32,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 15:40:32,229 INFO L495 AbstractCegarLoop]: Abstraction has 253 states and 330 transitions. [2023-12-16 15:40:32,229 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-16 15:40:32,230 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 330 transitions. [2023-12-16 15:40:32,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2023-12-16 15:40:32,230 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 15:40:32,230 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 15:40:32,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 (20)] Forceful destruction successful, exit code 0 [2023-12-16 15:40:32,440 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /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-16 15:40:32,441 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 15:40:32,441 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 15:40:32,441 INFO L85 PathProgramCache]: Analyzing trace with hash -308746224, now seen corresponding path program 1 times [2023-12-16 15:40:32,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 15:40:32,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [82327082] [2023-12-16 15:40:32,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 15:40:32,442 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-16 15:40:32,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 15:40:32,443 INFO L229 MonitoredProcess]: Starting monitored process 21 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-16 15:40:32,460 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2023-12-16 15:40:32,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 15:40:32,809 INFO L262 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 24 conjunts are in the unsatisfiable core [2023-12-16 15:40:32,813 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 15:40:33,442 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 12 treesize of output 8 [2023-12-16 15:40:33,661 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 21 treesize of output 20 [2023-12-16 15:40:33,992 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 31 [2023-12-16 15:40:34,573 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 43 [2023-12-16 15:40:34,837 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 15:40:34,838 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 75 treesize of output 43 [2023-12-16 15:40:34,896 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 184 proven. 364 refuted. 0 times theorem prover too weak. 212 trivial. 0 not checked. [2023-12-16 15:40:34,896 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 15:40:35,062 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-12-16 15:40:35,062 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 15:40:35,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [82327082] [2023-12-16 15:40:35,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [82327082] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-16 15:40:35,062 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-16 15:40:35,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [10] total 14 [2023-12-16 15:40:35,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319708054] [2023-12-16 15:40:35,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 15:40:35,063 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-16 15:40:35,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 15:40:35,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-16 15:40:35,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2023-12-16 15:40:35,064 INFO L87 Difference]: Start difference. First operand 253 states and 330 transitions. Second operand has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-16 15:40:36,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 15:40:36,032 INFO L93 Difference]: Finished difference Result 465 states and 594 transitions. [2023-12-16 15:40:36,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-16 15:40:36,033 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 151 [2023-12-16 15:40:36,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 15:40:36,035 INFO L225 Difference]: With dead ends: 465 [2023-12-16 15:40:36,035 INFO L226 Difference]: Without dead ends: 347 [2023-12-16 15:40:36,036 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 309 GetRequests, 288 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=99, Invalid=407, Unknown=0, NotChecked=0, Total=506 [2023-12-16 15:40:36,036 INFO L413 NwaCegarLoop]: 166 mSDtfsCounter, 156 mSDsluCounter, 650 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 816 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-12-16 15:40:36,037 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 816 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-12-16 15:40:36,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2023-12-16 15:40:36,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 303. [2023-12-16 15:40:36,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 303 states, 227 states have (on average 1.1233480176211454) internal successors, (255), 229 states have internal predecessors, (255), 68 states have call successors, (68), 7 states have call predecessors, (68), 7 states have return successors, (68), 66 states have call predecessors, (68), 68 states have call successors, (68) [2023-12-16 15:40:36,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 391 transitions. [2023-12-16 15:40:36,078 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 391 transitions. Word has length 151 [2023-12-16 15:40:36,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 15:40:36,079 INFO L495 AbstractCegarLoop]: Abstraction has 303 states and 391 transitions. [2023-12-16 15:40:36,079 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-16 15:40:36,079 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 391 transitions. [2023-12-16 15:40:36,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2023-12-16 15:40:36,080 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 15:40:36,080 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 15:40:36,088 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 (21)] Forceful destruction successful, exit code 0 [2023-12-16 15:40:36,287 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /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-16 15:40:36,288 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 15:40:36,288 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 15:40:36,288 INFO L85 PathProgramCache]: Analyzing trace with hash 2115865488, now seen corresponding path program 1 times [2023-12-16 15:40:36,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 15:40:36,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [307526683] [2023-12-16 15:40:36,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 15:40:36,289 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-16 15:40:36,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 15:40:36,290 INFO L229 MonitoredProcess]: Starting monitored process 22 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-16 15:40:36,290 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 (22)] Waiting until timeout for monitored process [2023-12-16 15:40:36,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 15:40:36,553 INFO L262 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-16 15:40:36,563 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 15:40:36,927 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 27 treesize of output 15 [2023-12-16 15:40:36,951 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 18 proven. 130 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-12-16 15:40:36,952 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 15:40:37,071 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-12-16 15:40:37,072 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 15:40:37,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [307526683] [2023-12-16 15:40:37,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [307526683] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-16 15:40:37,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-16 15:40:37,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 13 [2023-12-16 15:40:37,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298501694] [2023-12-16 15:40:37,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 15:40:37,072 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 15:40:37,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 15:40:37,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 15:40:37,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2023-12-16 15:40:37,073 INFO L87 Difference]: Start difference. First operand 303 states and 391 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-16 15:40:37,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 15:40:37,207 INFO L93 Difference]: Finished difference Result 473 states and 604 transitions. [2023-12-16 15:40:37,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-16 15:40:37,208 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 151 [2023-12-16 15:40:37,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 15:40:37,210 INFO L225 Difference]: With dead ends: 473 [2023-12-16 15:40:37,210 INFO L226 Difference]: Without dead ends: 305 [2023-12-16 15:40:37,211 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 301 GetRequests, 289 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2023-12-16 15:40:37,211 INFO L413 NwaCegarLoop]: 147 mSDtfsCounter, 65 mSDsluCounter, 316 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 463 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 15:40:37,211 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 463 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 15:40:37,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2023-12-16 15:40:37,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 303. [2023-12-16 15:40:37,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 303 states, 227 states have (on average 1.118942731277533) internal successors, (254), 229 states have internal predecessors, (254), 68 states have call successors, (68), 7 states have call predecessors, (68), 7 states have return successors, (68), 66 states have call predecessors, (68), 68 states have call successors, (68) [2023-12-16 15:40:37,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 390 transitions. [2023-12-16 15:40:37,256 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 390 transitions. Word has length 151 [2023-12-16 15:40:37,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 15:40:37,256 INFO L495 AbstractCegarLoop]: Abstraction has 303 states and 390 transitions. [2023-12-16 15:40:37,256 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-16 15:40:37,256 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 390 transitions. [2023-12-16 15:40:37,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2023-12-16 15:40:37,257 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 15:40:37,257 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 15:40:37,268 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 (22)] Forceful destruction successful, exit code 0 [2023-12-16 15:40:37,468 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /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-16 15:40:37,468 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 15:40:37,468 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 15:40:37,468 INFO L85 PathProgramCache]: Analyzing trace with hash 1229082198, now seen corresponding path program 1 times [2023-12-16 15:40:37,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 15:40:37,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [801821801] [2023-12-16 15:40:37,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 15:40:37,469 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-16 15:40:37,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 15:40:37,470 INFO L229 MonitoredProcess]: Starting monitored process 23 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-16 15:40:37,471 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 (23)] Waiting until timeout for monitored process [2023-12-16 15:40:37,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 15:40:37,834 INFO L262 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 13 conjunts are in the unsatisfiable core [2023-12-16 15:40:37,837 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 15:40:40,580 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 15:40:40,580 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 67 treesize of output 107 [2023-12-16 15:40:42,554 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 364 refuted. 0 times theorem prover too weak. 396 trivial. 0 not checked. [2023-12-16 15:40:42,554 INFO L327 TraceCheckSpWp]: Computing backward predicates... Received shutdown request... [2023-12-16 15:40:44,834 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 (23)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-16 15:40:44,860 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-16 15:40:45,844 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 (23)] Forceful destruction successful, exit code 0 [2023-12-16 15:40:46,061 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forcibly destroying the process [2023-12-16 15:40:46,072 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 137 [2023-12-16 15:40:46,074 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-16 15:40:46,074 WARN L619 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was analyzing trace of length 153 with TraceHistMax 20,while TraceCheckSpWp was constructing backward predicates,while executing Executor. [2023-12-16 15:40:46,078 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 15:40:46,083 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-16 15:40:46,085 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.12 03:40:46 BoogieIcfgContainer [2023-12-16 15:40:46,085 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-16 15:40:46,085 INFO L158 Benchmark]: Toolchain (without parser) took 65373.71ms. Allocated memory was 244.3MB in the beginning and 508.6MB in the end (delta: 264.2MB). Free memory was 190.7MB in the beginning and 164.9MB in the end (delta: 25.8MB). Peak memory consumption was 291.1MB. Max. memory is 8.0GB. [2023-12-16 15:40:46,085 INFO L158 Benchmark]: CDTParser took 0.62ms. Allocated memory is still 186.6MB. Free memory is still 133.4MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-16 15:40:46,086 INFO L158 Benchmark]: CACSL2BoogieTranslator took 354.25ms. Allocated memory is still 244.3MB. Free memory was 190.1MB in the beginning and 173.8MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2023-12-16 15:40:46,086 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.57ms. Allocated memory is still 244.3MB. Free memory was 173.8MB in the beginning and 170.7MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-16 15:40:46,086 INFO L158 Benchmark]: Boogie Preprocessor took 103.01ms. Allocated memory is still 244.3MB. Free memory was 170.7MB in the beginning and 165.5MB in the end (delta: 5.2MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. [2023-12-16 15:40:46,086 INFO L158 Benchmark]: RCFGBuilder took 1068.57ms. Allocated memory is still 244.3MB. Free memory was 165.5MB in the beginning and 124.1MB in the end (delta: 41.4MB). Peak memory consumption was 40.9MB. Max. memory is 8.0GB. [2023-12-16 15:40:46,086 INFO L158 Benchmark]: TraceAbstraction took 63792.28ms. Allocated memory was 244.3MB in the beginning and 508.6MB in the end (delta: 264.2MB). Free memory was 123.6MB in the beginning and 164.9MB in the end (delta: -41.3MB). Peak memory consumption was 224.0MB. Max. memory is 8.0GB. [2023-12-16 15:40:46,087 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.62ms. Allocated memory is still 186.6MB. Free memory is still 133.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 354.25ms. Allocated memory is still 244.3MB. Free memory was 190.1MB in the beginning and 173.8MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 50.57ms. Allocated memory is still 244.3MB. Free memory was 173.8MB in the beginning and 170.7MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 103.01ms. Allocated memory is still 244.3MB. Free memory was 170.7MB in the beginning and 165.5MB in the end (delta: 5.2MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. * RCFGBuilder took 1068.57ms. Allocated memory is still 244.3MB. Free memory was 165.5MB in the beginning and 124.1MB in the end (delta: 41.4MB). Peak memory consumption was 40.9MB. Max. memory is 8.0GB. * TraceAbstraction took 63792.28ms. Allocated memory was 244.3MB in the beginning and 508.6MB in the end (delta: 264.2MB). Free memory was 123.6MB in the beginning and 164.9MB in the end (delta: -41.3MB). Peak memory consumption was 224.0MB. 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: 19]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 19). Cancelled while NwaCegarLoop was analyzing trace of length 153 with TraceHistMax 20,while TraceCheckSpWp was constructing backward predicates,while executing Executor. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 88 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 63.7s, OverallIterations: 20, TraceHistogramMax: 20, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 10.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2003 SdHoareTripleChecker+Valid, 7.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2003 mSDsluCounter, 9321 SdHoareTripleChecker+Invalid, 6.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6963 mSDsCounter, 346 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2600 IncrementalHoareTripleChecker+Invalid, 2946 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 346 mSolverCounterUnsat, 2358 mSDtfsCounter, 2600 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3684 GetRequests, 3510 SyntacticMatches, 2 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 454 ImplicationChecksByTransitivity, 9.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=303occurred in iteration=18, InterpolantAutomatonStates: 137, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 19 MinimizatonAttempts, 370 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.8s SsaConstructionTime, 3.3s SatisfiabilityAnalysisTime, 33.9s InterpolantComputationTime, 3085 NumberOfCodeBlocks, 3085 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 3511 ConstructedInterpolants, 424 QuantifiedInterpolants, 34165 SizeOfPredicates, 201 NumberOfNonLiveVariables, 7004 ConjunctsInSsa, 262 ConjunctsInUnsatCore, 24 InterpolantComputations, 17 PerfectInterpolantSequences, 16160/18240 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