/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-p_file-5.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-24 16:41:57,182 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-24 16:41:57,220 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-24 16:41:57,223 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-24 16:41:57,223 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-24 16:41:57,240 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-24 16:41:57,241 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-24 16:41:57,241 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-24 16:41:57,241 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-24 16:41:57,241 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-24 16:41:57,242 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-24 16:41:57,242 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-24 16:41:57,242 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-24 16:41:57,242 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-24 16:41:57,243 INFO L153 SettingsManager]: * Use SBE=true [2023-12-24 16:41:57,243 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-24 16:41:57,243 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-24 16:41:57,243 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-24 16:41:57,244 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-24 16:41:57,244 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-24 16:41:57,244 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-24 16:41:57,247 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-24 16:41:57,247 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-24 16:41:57,247 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-24 16:41:57,250 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-24 16:41:57,250 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-24 16:41:57,250 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-24 16:41:57,251 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-24 16:41:57,251 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-24 16:41:57,252 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-24 16:41:57,252 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-24 16:41:57,252 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-24 16:41:57,253 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-24 16:41:57,253 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-24 16:41:57,253 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-24 16:41:57,253 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-24 16:41:57,253 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-24 16:41:57,253 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-24 16:41:57,253 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-24 16:41:57,253 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-24 16:41:57,253 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-24 16:41:57,254 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-24 16:41:57,254 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-24 16:41:57,254 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-24 16:41:57,254 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-24 16:41:57,255 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-24 16:41:57,255 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-24 16:41:57,426 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-24 16:41:57,441 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-24 16:41:57,442 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-24 16:41:57,443 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-24 16:41:57,447 INFO L274 PluginConnector]: CDTParser initialized [2023-12-24 16:41:57,448 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-5.i [2023-12-24 16:41:58,441 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-24 16:41:58,602 INFO L384 CDTParser]: Found 1 translation units. [2023-12-24 16:41:58,602 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-5.i [2023-12-24 16:41:58,609 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/faf712e2f/e98e18e00a7140f5af4da378618de59a/FLAG3496b4a6f [2023-12-24 16:41:58,621 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/faf712e2f/e98e18e00a7140f5af4da378618de59a [2023-12-24 16:41:58,623 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-24 16:41:58,625 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-24 16:41:58,627 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-24 16:41:58,627 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-24 16:41:58,630 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-24 16:41:58,631 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.12 04:41:58" (1/1) ... [2023-12-24 16:41:58,631 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b5ed048 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 04:41:58, skipping insertion in model container [2023-12-24 16:41:58,632 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.12 04:41:58" (1/1) ... [2023-12-24 16:41:58,662 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-24 16:41:58,760 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-p_file-5.i[915,928] [2023-12-24 16:41:58,792 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-24 16:41:58,809 INFO L202 MainTranslator]: Completed pre-run [2023-12-24 16:41:58,817 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-p_file-5.i[915,928] [2023-12-24 16:41:58,836 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-24 16:41:58,853 INFO L206 MainTranslator]: Completed translation [2023-12-24 16:41:58,853 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 04:41:58 WrapperNode [2023-12-24 16:41:58,853 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-24 16:41:58,856 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-24 16:41:58,856 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-24 16:41:58,857 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-24 16:41:58,861 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 04:41:58" (1/1) ... [2023-12-24 16:41:58,874 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 04:41:58" (1/1) ... [2023-12-24 16:41:58,900 INFO L138 Inliner]: procedures = 33, calls = 168, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 450 [2023-12-24 16:41:58,900 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-24 16:41:58,901 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-24 16:41:58,901 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-24 16:41:58,901 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-24 16:41:58,914 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 04:41:58" (1/1) ... [2023-12-24 16:41:58,914 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 04:41:58" (1/1) ... [2023-12-24 16:41:58,918 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 04:41:58" (1/1) ... [2023-12-24 16:41:58,946 INFO L175 MemorySlicer]: Split 122 memory accesses to 16 slices as follows [2, 3, 6, 6, 29, 6, 6, 14, 8, 7, 9, 8, 8, 3, 3, 4]. 24 percent of accesses are in the largest equivalence class. The 17 initializations are split as follows [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]. The 17 writes are split as follows [0, 1, 1, 1, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]. [2023-12-24 16:41:58,946 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 04:41:58" (1/1) ... [2023-12-24 16:41:58,946 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 04:41:58" (1/1) ... [2023-12-24 16:41:58,960 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 04:41:58" (1/1) ... [2023-12-24 16:41:58,963 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 04:41:58" (1/1) ... [2023-12-24 16:41:58,967 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 04:41:58" (1/1) ... [2023-12-24 16:41:58,970 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 04:41:58" (1/1) ... [2023-12-24 16:41:58,987 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-24 16:41:58,988 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-24 16:41:58,988 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-24 16:41:58,988 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-24 16:41:58,989 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 04:41:58" (1/1) ... [2023-12-24 16:41:58,999 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-24 16:41:59,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-24 16:41:59,016 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-24 16:41:59,022 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-24 16:41:59,040 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-24 16:41:59,041 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2023-12-24 16:41:59,041 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2023-12-24 16:41:59,041 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2023-12-24 16:41:59,041 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2023-12-24 16:41:59,041 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2023-12-24 16:41:59,041 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2023-12-24 16:41:59,041 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#6 [2023-12-24 16:41:59,041 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#7 [2023-12-24 16:41:59,041 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#8 [2023-12-24 16:41:59,041 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#9 [2023-12-24 16:41:59,041 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#10 [2023-12-24 16:41:59,042 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#11 [2023-12-24 16:41:59,042 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#12 [2023-12-24 16:41:59,042 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#13 [2023-12-24 16:41:59,042 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#14 [2023-12-24 16:41:59,042 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#15 [2023-12-24 16:41:59,042 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2023-12-24 16:41:59,042 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2023-12-24 16:41:59,042 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2023-12-24 16:41:59,042 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2023-12-24 16:41:59,042 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#4 [2023-12-24 16:41:59,042 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#5 [2023-12-24 16:41:59,042 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#6 [2023-12-24 16:41:59,043 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#7 [2023-12-24 16:41:59,043 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#8 [2023-12-24 16:41:59,043 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#9 [2023-12-24 16:41:59,043 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#10 [2023-12-24 16:41:59,043 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#11 [2023-12-24 16:41:59,043 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#12 [2023-12-24 16:41:59,043 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#13 [2023-12-24 16:41:59,043 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#14 [2023-12-24 16:41:59,043 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#15 [2023-12-24 16:41:59,043 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-24 16:41:59,043 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-12-24 16:41:59,043 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2023-12-24 16:41:59,043 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2023-12-24 16:41:59,043 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2023-12-24 16:41:59,044 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2023-12-24 16:41:59,044 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#6 [2023-12-24 16:41:59,044 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#7 [2023-12-24 16:41:59,044 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#8 [2023-12-24 16:41:59,044 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#9 [2023-12-24 16:41:59,044 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#10 [2023-12-24 16:41:59,044 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#11 [2023-12-24 16:41:59,044 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#12 [2023-12-24 16:41:59,044 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#13 [2023-12-24 16:41:59,044 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#14 [2023-12-24 16:41:59,044 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#15 [2023-12-24 16:41:59,044 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2023-12-24 16:41:59,044 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2023-12-24 16:41:59,044 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2023-12-24 16:41:59,045 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2023-12-24 16:41:59,045 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2023-12-24 16:41:59,045 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#5 [2023-12-24 16:41:59,045 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#6 [2023-12-24 16:41:59,045 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#7 [2023-12-24 16:41:59,045 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#8 [2023-12-24 16:41:59,045 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#9 [2023-12-24 16:41:59,045 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#10 [2023-12-24 16:41:59,045 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#11 [2023-12-24 16:41:59,045 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#12 [2023-12-24 16:41:59,045 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#13 [2023-12-24 16:41:59,045 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#14 [2023-12-24 16:41:59,045 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#15 [2023-12-24 16:41:59,045 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2023-12-24 16:41:59,045 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2023-12-24 16:41:59,046 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2023-12-24 16:41:59,046 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2023-12-24 16:41:59,046 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2023-12-24 16:41:59,046 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#5 [2023-12-24 16:41:59,046 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#6 [2023-12-24 16:41:59,046 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#7 [2023-12-24 16:41:59,046 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#8 [2023-12-24 16:41:59,046 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#9 [2023-12-24 16:41:59,046 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#10 [2023-12-24 16:41:59,046 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#11 [2023-12-24 16:41:59,046 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#12 [2023-12-24 16:41:59,046 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#13 [2023-12-24 16:41:59,046 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#14 [2023-12-24 16:41:59,046 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#15 [2023-12-24 16:41:59,046 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2023-12-24 16:41:59,047 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2023-12-24 16:41:59,047 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#2 [2023-12-24 16:41:59,047 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#3 [2023-12-24 16:41:59,047 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#4 [2023-12-24 16:41:59,047 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#5 [2023-12-24 16:41:59,047 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#6 [2023-12-24 16:41:59,047 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#7 [2023-12-24 16:41:59,047 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#8 [2023-12-24 16:41:59,047 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#9 [2023-12-24 16:41:59,047 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#10 [2023-12-24 16:41:59,047 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#11 [2023-12-24 16:41:59,047 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#12 [2023-12-24 16:41:59,047 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#13 [2023-12-24 16:41:59,048 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#14 [2023-12-24 16:41:59,048 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#15 [2023-12-24 16:41:59,048 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-24 16:41:59,048 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-24 16:41:59,048 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-24 16:41:59,048 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-24 16:41:59,048 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2023-12-24 16:41:59,048 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2023-12-24 16:41:59,048 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2023-12-24 16:41:59,048 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2023-12-24 16:41:59,048 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2023-12-24 16:41:59,048 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2023-12-24 16:41:59,048 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#6 [2023-12-24 16:41:59,048 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#7 [2023-12-24 16:41:59,048 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#8 [2023-12-24 16:41:59,049 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#9 [2023-12-24 16:41:59,049 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#10 [2023-12-24 16:41:59,049 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#11 [2023-12-24 16:41:59,049 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#12 [2023-12-24 16:41:59,049 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#13 [2023-12-24 16:41:59,049 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#14 [2023-12-24 16:41:59,049 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#15 [2023-12-24 16:41:59,049 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2023-12-24 16:41:59,049 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2023-12-24 16:41:59,049 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#2 [2023-12-24 16:41:59,049 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#3 [2023-12-24 16:41:59,049 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#4 [2023-12-24 16:41:59,049 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#5 [2023-12-24 16:41:59,049 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#6 [2023-12-24 16:41:59,049 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#7 [2023-12-24 16:41:59,050 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#8 [2023-12-24 16:41:59,050 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#9 [2023-12-24 16:41:59,050 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#10 [2023-12-24 16:41:59,050 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#11 [2023-12-24 16:41:59,050 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#12 [2023-12-24 16:41:59,050 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#13 [2023-12-24 16:41:59,050 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#14 [2023-12-24 16:41:59,050 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#15 [2023-12-24 16:41:59,050 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2023-12-24 16:41:59,050 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2023-12-24 16:41:59,050 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2023-12-24 16:41:59,050 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2023-12-24 16:41:59,050 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2023-12-24 16:41:59,050 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#5 [2023-12-24 16:41:59,050 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#6 [2023-12-24 16:41:59,050 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#7 [2023-12-24 16:41:59,051 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#8 [2023-12-24 16:41:59,051 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#9 [2023-12-24 16:41:59,051 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#10 [2023-12-24 16:41:59,051 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#11 [2023-12-24 16:41:59,051 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#12 [2023-12-24 16:41:59,051 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#13 [2023-12-24 16:41:59,051 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#14 [2023-12-24 16:41:59,051 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#15 [2023-12-24 16:41:59,212 INFO L241 CfgBuilder]: Building ICFG [2023-12-24 16:41:59,213 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-24 16:41:59,770 INFO L282 CfgBuilder]: Performing block encoding [2023-12-24 16:41:59,818 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-24 16:41:59,821 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-24 16:41:59,821 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.12 04:41:59 BoogieIcfgContainer [2023-12-24 16:41:59,821 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-24 16:41:59,823 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-24 16:41:59,823 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-24 16:41:59,825 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-24 16:41:59,825 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.12 04:41:58" (1/3) ... [2023-12-24 16:41:59,826 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d91c7cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.12 04:41:59, skipping insertion in model container [2023-12-24 16:41:59,826 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 04:41:58" (2/3) ... [2023-12-24 16:41:59,826 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d91c7cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.12 04:41:59, skipping insertion in model container [2023-12-24 16:41:59,826 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.12 04:41:59" (3/3) ... [2023-12-24 16:41:59,827 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-5.i [2023-12-24 16:41:59,840 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-24 16:41:59,840 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-24 16:41:59,882 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-24 16:41:59,887 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;@52ebc733, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-24 16:41:59,887 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-24 16:41:59,895 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-24 16:41:59,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2023-12-24 16:41:59,904 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 16:41:59,905 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-24 16:41:59,905 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 16:41:59,908 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 16:41:59,909 INFO L85 PathProgramCache]: Analyzing trace with hash 1626294328, now seen corresponding path program 1 times [2023-12-24 16:41:59,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 16:41:59,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [356831234] [2023-12-24 16:41:59,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 16:41:59,918 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-24 16:41:59,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 16:41:59,920 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-24 16:41:59,923 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-24 16:42:00,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 16:42:00,194 INFO L262 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-24 16:42:00,200 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 16:42:00,243 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-24 16:42:00,244 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 16:42:00,244 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 16:42:00,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [356831234] [2023-12-24 16:42:00,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [356831234] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 16:42:00,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 16:42:00,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-24 16:42:00,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50712296] [2023-12-24 16:42:00,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 16:42:00,250 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-24 16:42:00,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 16:42:00,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-24 16:42:00,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-24 16:42:00,283 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-24 16:42:00,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 16:42:00,358 INFO L93 Difference]: Finished difference Result 173 states and 276 transitions. [2023-12-24 16:42:00,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-24 16:42:00,360 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-24 16:42:00,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 16:42:00,367 INFO L225 Difference]: With dead ends: 173 [2023-12-24 16:42:00,367 INFO L226 Difference]: Without dead ends: 86 [2023-12-24 16:42:00,370 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-24 16:42:00,374 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-24 16:42:00,374 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-24 16:42:00,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2023-12-24 16:42:00,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2023-12-24 16:42:00,411 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-24 16:42:00,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 124 transitions. [2023-12-24 16:42:00,420 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 124 transitions. Word has length 142 [2023-12-24 16:42:00,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 16:42:00,421 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 124 transitions. [2023-12-24 16:42:00,421 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-24 16:42:00,421 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 124 transitions. [2023-12-24 16:42:00,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2023-12-24 16:42:00,430 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 16:42:00,430 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-24 16:42:00,437 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2023-12-24 16:42:00,639 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-24 16:42:00,639 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 16:42:00,640 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 16:42:00,640 INFO L85 PathProgramCache]: Analyzing trace with hash -1696479216, now seen corresponding path program 1 times [2023-12-24 16:42:00,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 16:42:00,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2106117231] [2023-12-24 16:42:00,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 16:42:00,641 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-24 16:42:00,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 16:42:00,642 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-24 16:42:00,644 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-12-24 16:42:00,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 16:42:00,955 INFO L262 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-24 16:42:00,960 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 16:42:01,288 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 18 treesize of output 10 [2023-12-24 16:42:01,298 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-12-24 16:42:01,321 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-24 16:42:01,322 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 16:42:01,322 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 16:42:01,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2106117231] [2023-12-24 16:42:01,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2106117231] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 16:42:01,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 16:42:01,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-24 16:42:01,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574359969] [2023-12-24 16:42:01,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 16:42:01,323 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-24 16:42:01,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 16:42:01,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-24 16:42:01,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-24 16:42:01,324 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), 3 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-24 16:42:01,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 16:42:01,480 INFO L93 Difference]: Finished difference Result 256 states and 370 transitions. [2023-12-24 16:42:01,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-24 16:42:01,481 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 3 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-24 16:42:01,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 16:42:01,483 INFO L225 Difference]: With dead ends: 256 [2023-12-24 16:42:01,483 INFO L226 Difference]: Without dead ends: 171 [2023-12-24 16:42:01,484 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-24 16:42:01,484 INFO L413 NwaCegarLoop]: 115 mSDtfsCounter, 54 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-24 16:42:01,485 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 345 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-24 16:42:01,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2023-12-24 16:42:01,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 167. [2023-12-24 16:42:01,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 124 states have (on average 1.3064516129032258) internal successors, (162), 124 states have internal predecessors, (162), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2023-12-24 16:42:01,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 242 transitions. [2023-12-24 16:42:01,500 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 242 transitions. Word has length 142 [2023-12-24 16:42:01,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 16:42:01,500 INFO L495 AbstractCegarLoop]: Abstraction has 167 states and 242 transitions. [2023-12-24 16:42:01,501 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 3 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-24 16:42:01,501 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 242 transitions. [2023-12-24 16:42:01,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2023-12-24 16:42:01,502 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 16:42:01,502 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-24 16:42:01,511 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-24 16:42:01,708 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-24 16:42:01,708 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 16:42:01,709 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 16:42:01,709 INFO L85 PathProgramCache]: Analyzing trace with hash 496869173, now seen corresponding path program 1 times [2023-12-24 16:42:01,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 16:42:01,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [378452902] [2023-12-24 16:42:01,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 16:42:01,710 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-24 16:42:01,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 16:42:01,711 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-24 16:42:01,712 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-24 16:42:01,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 16:42:01,960 INFO L262 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-24 16:42:01,965 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 16:42:02,202 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-12-24 16:42:02,216 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-24 16:42:02,216 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 16:42:02,217 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 16:42:02,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [378452902] [2023-12-24 16:42:02,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [378452902] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 16:42:02,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 16:42:02,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-24 16:42:02,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526798301] [2023-12-24 16:42:02,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 16:42:02,217 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-24 16:42:02,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 16:42:02,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-24 16:42:02,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-24 16:42:02,218 INFO L87 Difference]: Start difference. First operand 167 states and 242 transitions. Second operand has 4 states, 4 states have (on average 11.75) 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-24 16:42:02,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 16:42:02,631 INFO L93 Difference]: Finished difference Result 499 states and 724 transitions. [2023-12-24 16:42:02,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-24 16:42:02,632 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) 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-24 16:42:02,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 16:42:02,634 INFO L225 Difference]: With dead ends: 499 [2023-12-24 16:42:02,634 INFO L226 Difference]: Without dead ends: 333 [2023-12-24 16:42:02,635 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 141 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-24 16:42:02,636 INFO L413 NwaCegarLoop]: 102 mSDtfsCounter, 52 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-24 16:42:02,636 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 303 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-24 16:42:02,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2023-12-24 16:42:02,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 327. [2023-12-24 16:42:02,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 327 states, 242 states have (on average 1.2892561983471074) internal successors, (312), 242 states have internal predecessors, (312), 80 states have call successors, (80), 4 states have call predecessors, (80), 4 states have return successors, (80), 80 states have call predecessors, (80), 80 states have call successors, (80) [2023-12-24 16:42:02,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 472 transitions. [2023-12-24 16:42:02,662 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 472 transitions. Word has length 144 [2023-12-24 16:42:02,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 16:42:02,663 INFO L495 AbstractCegarLoop]: Abstraction has 327 states and 472 transitions. [2023-12-24 16:42:02,663 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) 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-24 16:42:02,663 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 472 transitions. [2023-12-24 16:42:02,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2023-12-24 16:42:02,664 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 16:42:02,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] [2023-12-24 16:42:02,673 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-24 16:42:02,869 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-24 16:42:02,869 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 16:42:02,870 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 16:42:02,870 INFO L85 PathProgramCache]: Analyzing trace with hash -1091478729, now seen corresponding path program 1 times [2023-12-24 16:42:02,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 16:42:02,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1592221900] [2023-12-24 16:42:02,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 16:42:02,871 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-24 16:42:02,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 16:42:02,872 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-24 16:42:02,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 (5)] Waiting until timeout for monitored process [2023-12-24 16:42:03,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 16:42:03,137 INFO L262 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 11 conjunts are in the unsatisfiable core [2023-12-24 16:42:03,142 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 16:42:03,829 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-12-24 16:42:03,835 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-12-24 16:42:03,851 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-24 16:42:03,852 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 16:42:03,852 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 16:42:03,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1592221900] [2023-12-24 16:42:03,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1592221900] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 16:42:03,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 16:42:03,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-24 16:42:03,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129675366] [2023-12-24 16:42:03,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 16:42:03,853 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-24 16:42:03,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 16:42:03,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-24 16:42:03,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-24 16:42:03,853 INFO L87 Difference]: Start difference. First operand 327 states and 472 transitions. Second operand has 4 states, 4 states have (on average 11.75) 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-24 16:42:04,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 16:42:04,186 INFO L93 Difference]: Finished difference Result 659 states and 951 transitions. [2023-12-24 16:42:04,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-24 16:42:04,188 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) 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-24 16:42:04,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 16:42:04,190 INFO L225 Difference]: With dead ends: 659 [2023-12-24 16:42:04,190 INFO L226 Difference]: Without dead ends: 333 [2023-12-24 16:42:04,191 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 141 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-24 16:42:04,191 INFO L413 NwaCegarLoop]: 135 mSDtfsCounter, 79 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 347 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-24 16:42:04,192 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 347 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-24 16:42:04,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2023-12-24 16:42:04,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 327. [2023-12-24 16:42:04,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 327 states, 242 states have (on average 1.2851239669421488) internal successors, (311), 242 states have internal predecessors, (311), 80 states have call successors, (80), 4 states have call predecessors, (80), 4 states have return successors, (80), 80 states have call predecessors, (80), 80 states have call successors, (80) [2023-12-24 16:42:04,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 471 transitions. [2023-12-24 16:42:04,210 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 471 transitions. Word has length 144 [2023-12-24 16:42:04,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 16:42:04,210 INFO L495 AbstractCegarLoop]: Abstraction has 327 states and 471 transitions. [2023-12-24 16:42:04,210 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) 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-24 16:42:04,210 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 471 transitions. [2023-12-24 16:42:04,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2023-12-24 16:42:04,211 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 16:42:04,212 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-24 16:42:04,218 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-24 16:42:04,418 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-24 16:42:04,418 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 16:42:04,418 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 16:42:04,419 INFO L85 PathProgramCache]: Analyzing trace with hash 180707509, now seen corresponding path program 1 times [2023-12-24 16:42:04,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 16:42:04,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1028084228] [2023-12-24 16:42:04,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 16:42:04,419 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-24 16:42:04,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 16:42:04,420 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-24 16:42:04,421 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-24 16:42:04,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 16:42:04,686 INFO L262 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-24 16:42:04,689 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 16:42:04,701 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-24 16:42:04,701 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 16:42:04,701 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 16:42:04,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1028084228] [2023-12-24 16:42:04,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1028084228] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 16:42:04,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 16:42:04,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-24 16:42:04,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546324522] [2023-12-24 16:42:04,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 16:42:04,702 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-24 16:42:04,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 16:42:04,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-24 16:42:04,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-24 16:42:04,703 INFO L87 Difference]: Start difference. First operand 327 states and 471 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 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-24 16:42:04,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 16:42:04,757 INFO L93 Difference]: Finished difference Result 637 states and 922 transitions. [2023-12-24 16:42:04,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-24 16:42:04,757 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 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-24 16:42:04,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 16:42:04,759 INFO L225 Difference]: With dead ends: 637 [2023-12-24 16:42:04,759 INFO L226 Difference]: Without dead ends: 390 [2023-12-24 16:42:04,760 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 141 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-24 16:42:04,760 INFO L413 NwaCegarLoop]: 135 mSDtfsCounter, 46 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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.0s IncrementalHoareTripleChecker+Time [2023-12-24 16:42:04,761 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.0s Time] [2023-12-24 16:42:04,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2023-12-24 16:42:04,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 333. [2023-12-24 16:42:04,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 333 states, 248 states have (on average 1.278225806451613) internal successors, (317), 248 states have internal predecessors, (317), 80 states have call successors, (80), 4 states have call predecessors, (80), 4 states have return successors, (80), 80 states have call predecessors, (80), 80 states have call successors, (80) [2023-12-24 16:42:04,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 477 transitions. [2023-12-24 16:42:04,778 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 477 transitions. Word has length 144 [2023-12-24 16:42:04,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 16:42:04,778 INFO L495 AbstractCegarLoop]: Abstraction has 333 states and 477 transitions. [2023-12-24 16:42:04,778 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 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-24 16:42:04,778 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 477 transitions. [2023-12-24 16:42:04,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2023-12-24 16:42:04,779 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 16:42:04,779 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-24 16:42:04,789 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-24 16:42:04,990 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-24 16:42:04,992 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 16:42:04,993 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 16:42:04,993 INFO L85 PathProgramCache]: Analyzing trace with hash 2005645724, now seen corresponding path program 1 times [2023-12-24 16:42:04,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 16:42:04,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2071265672] [2023-12-24 16:42:04,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 16:42:04,993 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-24 16:42:04,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 16:42:04,994 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-24 16:42:04,995 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-24 16:42:05,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 16:42:05,237 INFO L262 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-24 16:42:05,240 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 16:42:05,452 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-12-24 16:42:05,463 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-24 16:42:05,463 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 16:42:05,463 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 16:42:05,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2071265672] [2023-12-24 16:42:05,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2071265672] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 16:42:05,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 16:42:05,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-24 16:42:05,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614753043] [2023-12-24 16:42:05,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 16:42:05,464 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-24 16:42:05,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 16:42:05,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-24 16:42:05,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-24 16:42:05,465 INFO L87 Difference]: Start difference. First operand 333 states and 477 transitions. Second operand has 4 states, 4 states have (on average 12.25) 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-24 16:42:05,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 16:42:05,801 INFO L93 Difference]: Finished difference Result 690 states and 990 transitions. [2023-12-24 16:42:05,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-24 16:42:05,802 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) 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-24 16:42:05,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 16:42:05,803 INFO L225 Difference]: With dead ends: 690 [2023-12-24 16:42:05,803 INFO L226 Difference]: Without dead ends: 358 [2023-12-24 16:42:05,804 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 143 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-24 16:42:05,805 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 97 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-24 16:42:05,805 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 314 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-24 16:42:05,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2023-12-24 16:42:05,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 333. [2023-12-24 16:42:05,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 333 states, 248 states have (on average 1.2701612903225807) internal successors, (315), 248 states have internal predecessors, (315), 80 states have call successors, (80), 4 states have call predecessors, (80), 4 states have return successors, (80), 80 states have call predecessors, (80), 80 states have call successors, (80) [2023-12-24 16:42:05,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 475 transitions. [2023-12-24 16:42:05,817 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 475 transitions. Word has length 146 [2023-12-24 16:42:05,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 16:42:05,818 INFO L495 AbstractCegarLoop]: Abstraction has 333 states and 475 transitions. [2023-12-24 16:42:05,818 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) 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-24 16:42:05,818 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 475 transitions. [2023-12-24 16:42:05,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2023-12-24 16:42:05,819 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 16:42:05,819 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-24 16:42:05,828 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-24 16:42:06,026 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-24 16:42:06,026 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 16:42:06,027 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 16:42:06,027 INFO L85 PathProgramCache]: Analyzing trace with hash 725782046, now seen corresponding path program 1 times [2023-12-24 16:42:06,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 16:42:06,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [50289902] [2023-12-24 16:42:06,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 16:42:06,027 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-24 16:42:06,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 16:42:06,028 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-24 16:42:06,029 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-24 16:42:06,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 16:42:06,301 INFO L262 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 15 conjunts are in the unsatisfiable core [2023-12-24 16:42:06,305 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 16:42:06,516 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-24 16:42:06,538 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 33 treesize of output 25 [2023-12-24 16:42:06,579 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 48 treesize of output 28 [2023-12-24 16:42:06,619 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-24 16:42:06,619 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 16:42:06,619 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 16:42:06,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [50289902] [2023-12-24 16:42:06,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [50289902] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 16:42:06,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 16:42:06,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-24 16:42:06,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360797930] [2023-12-24 16:42:06,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 16:42:06,620 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-24 16:42:06,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 16:42:06,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-24 16:42:06,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2023-12-24 16:42:06,621 INFO L87 Difference]: Start difference. First operand 333 states and 475 transitions. Second operand has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 8 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-24 16:42:07,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 16:42:07,766 INFO L93 Difference]: Finished difference Result 888 states and 1270 transitions. [2023-12-24 16:42:07,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-12-24 16:42:07,766 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 8 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-24 16:42:07,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 16:42:07,769 INFO L225 Difference]: With dead ends: 888 [2023-12-24 16:42:07,769 INFO L226 Difference]: Without dead ends: 556 [2023-12-24 16:42:07,770 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=280, Unknown=0, NotChecked=0, Total=380 [2023-12-24 16:42:07,770 INFO L413 NwaCegarLoop]: 210 mSDtfsCounter, 356 mSDsluCounter, 1019 mSDsCounter, 0 mSdLazyCounter, 539 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 356 SdHoareTripleChecker+Valid, 1229 SdHoareTripleChecker+Invalid, 543 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 539 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-12-24 16:42:07,770 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [356 Valid, 1229 Invalid, 543 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 539 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-12-24 16:42:07,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2023-12-24 16:42:07,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 460. [2023-12-24 16:42:07,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 460 states, 333 states have (on average 1.2492492492492493) internal successors, (416), 333 states have internal predecessors, (416), 120 states have call successors, (120), 6 states have call predecessors, (120), 6 states have return successors, (120), 120 states have call predecessors, (120), 120 states have call successors, (120) [2023-12-24 16:42:07,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 656 transitions. [2023-12-24 16:42:07,787 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 656 transitions. Word has length 146 [2023-12-24 16:42:07,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 16:42:07,787 INFO L495 AbstractCegarLoop]: Abstraction has 460 states and 656 transitions. [2023-12-24 16:42:07,788 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 8 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-24 16:42:07,788 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 656 transitions. [2023-12-24 16:42:07,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2023-12-24 16:42:07,789 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 16:42:07,789 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-24 16:42:07,798 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-24 16:42:07,997 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-24 16:42:07,998 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 16:42:07,998 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 16:42:07,998 INFO L85 PathProgramCache]: Analyzing trace with hash -768922596, now seen corresponding path program 1 times [2023-12-24 16:42:07,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 16:42:07,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1914899390] [2023-12-24 16:42:07,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 16:42:07,999 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-24 16:42:07,999 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 16:42:08,000 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-24 16:42:08,004 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-24 16:42:08,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 16:42:08,232 INFO L262 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 12 conjunts are in the unsatisfiable core [2023-12-24 16:42:08,236 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 16:42:08,454 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-24 16:42:08,454 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 16:42:08,455 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 16:42:08,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1914899390] [2023-12-24 16:42:08,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1914899390] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 16:42:08,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 16:42:08,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-24 16:42:08,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045777018] [2023-12-24 16:42:08,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 16:42:08,455 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-24 16:42:08,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 16:42:08,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-24 16:42:08,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-24 16:42:08,456 INFO L87 Difference]: Start difference. First operand 460 states and 656 transitions. Second operand has 4 states, 4 states have (on average 12.25) 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-24 16:42:08,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 16:42:08,857 INFO L93 Difference]: Finished difference Result 638 states and 911 transitions. [2023-12-24 16:42:08,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-24 16:42:08,858 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) 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-24 16:42:08,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 16:42:08,860 INFO L225 Difference]: With dead ends: 638 [2023-12-24 16:42:08,860 INFO L226 Difference]: Without dead ends: 389 [2023-12-24 16:42:08,861 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-24 16:42:08,861 INFO L413 NwaCegarLoop]: 137 mSDtfsCounter, 46 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-24 16:42:08,861 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 296 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-24 16:42:08,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2023-12-24 16:42:08,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 331. [2023-12-24 16:42:08,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 331 states, 246 states have (on average 1.2601626016260163) internal successors, (310), 246 states have internal predecessors, (310), 80 states have call successors, (80), 4 states have call predecessors, (80), 4 states have return successors, (80), 80 states have call predecessors, (80), 80 states have call successors, (80) [2023-12-24 16:42:08,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 470 transitions. [2023-12-24 16:42:08,875 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 470 transitions. Word has length 146 [2023-12-24 16:42:08,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 16:42:08,875 INFO L495 AbstractCegarLoop]: Abstraction has 331 states and 470 transitions. [2023-12-24 16:42:08,875 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) 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-24 16:42:08,875 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 470 transitions. [2023-12-24 16:42:08,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2023-12-24 16:42:08,876 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 16:42:08,877 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-24 16:42:08,888 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-24 16:42:09,086 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-24 16:42:09,086 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 16:42:09,086 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 16:42:09,087 INFO L85 PathProgramCache]: Analyzing trace with hash 299189547, now seen corresponding path program 1 times [2023-12-24 16:42:09,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 16:42:09,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [44280590] [2023-12-24 16:42:09,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 16:42:09,087 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-24 16:42:09,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 16:42:09,088 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-24 16:42:09,121 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-24 16:42:09,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 16:42:09,363 INFO L262 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-24 16:42:09,366 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 16:42:09,380 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-24 16:42:09,380 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 16:42:09,380 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 16:42:09,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [44280590] [2023-12-24 16:42:09,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [44280590] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 16:42:09,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 16:42:09,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-24 16:42:09,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661769268] [2023-12-24 16:42:09,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 16:42:09,381 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-24 16:42:09,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 16:42:09,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-24 16:42:09,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-24 16:42:09,382 INFO L87 Difference]: Start difference. First operand 331 states and 470 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 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-24 16:42:09,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 16:42:09,454 INFO L93 Difference]: Finished difference Result 727 states and 1033 transitions. [2023-12-24 16:42:09,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-24 16:42:09,454 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 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-24 16:42:09,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 16:42:09,456 INFO L225 Difference]: With dead ends: 727 [2023-12-24 16:42:09,456 INFO L226 Difference]: Without dead ends: 397 [2023-12-24 16:42:09,457 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 143 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-24 16:42:09,457 INFO L413 NwaCegarLoop]: 114 mSDtfsCounter, 46 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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.0s IncrementalHoareTripleChecker+Time [2023-12-24 16:42:09,458 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.0s Time] [2023-12-24 16:42:09,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2023-12-24 16:42:09,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 343. [2023-12-24 16:42:09,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 343 states, 258 states have (on average 1.248062015503876) internal successors, (322), 258 states have internal predecessors, (322), 80 states have call successors, (80), 4 states have call predecessors, (80), 4 states have return successors, (80), 80 states have call predecessors, (80), 80 states have call successors, (80) [2023-12-24 16:42:09,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 482 transitions. [2023-12-24 16:42:09,469 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 482 transitions. Word has length 147 [2023-12-24 16:42:09,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 16:42:09,470 INFO L495 AbstractCegarLoop]: Abstraction has 343 states and 482 transitions. [2023-12-24 16:42:09,470 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 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-24 16:42:09,470 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 482 transitions. [2023-12-24 16:42:09,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2023-12-24 16:42:09,471 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 16:42:09,471 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-24 16:42:09,496 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-24 16:42:09,678 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 16:42:09,678 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 16:42:09,679 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 16:42:09,679 INFO L85 PathProgramCache]: Analyzing trace with hash -510157079, now seen corresponding path program 1 times [2023-12-24 16:42:09,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 16:42:09,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [663366578] [2023-12-24 16:42:09,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 16:42:09,679 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-24 16:42:09,679 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 16:42:09,680 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 16:42:09,683 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2023-12-24 16:42:09,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 16:42:09,930 INFO L262 TraceCheckSpWp]: Trace formula consists of 381 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-24 16:42:09,933 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 16:42:09,951 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-24 16:42:09,951 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 16:42:09,952 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 16:42:09,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [663366578] [2023-12-24 16:42:09,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [663366578] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 16:42:09,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 16:42:09,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-24 16:42:09,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765211554] [2023-12-24 16:42:09,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 16:42:09,952 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-24 16:42:09,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 16:42:09,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-24 16:42:09,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-24 16:42:09,953 INFO L87 Difference]: Start difference. First operand 343 states and 482 transitions. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 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-24 16:42:10,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 16:42:10,080 INFO L93 Difference]: Finished difference Result 751 states and 1053 transitions. [2023-12-24 16:42:10,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-24 16:42:10,081 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 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-24 16:42:10,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 16:42:10,082 INFO L225 Difference]: With dead ends: 751 [2023-12-24 16:42:10,082 INFO L226 Difference]: Without dead ends: 409 [2023-12-24 16:42:10,083 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2023-12-24 16:42:10,084 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-24 16:42:10,085 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-24 16:42:10,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2023-12-24 16:42:10,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 351. [2023-12-24 16:42:10,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 351 states, 266 states have (on average 1.2406015037593985) internal successors, (330), 266 states have internal predecessors, (330), 80 states have call successors, (80), 4 states have call predecessors, (80), 4 states have return successors, (80), 80 states have call predecessors, (80), 80 states have call successors, (80) [2023-12-24 16:42:10,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 490 transitions. [2023-12-24 16:42:10,097 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 490 transitions. Word has length 147 [2023-12-24 16:42:10,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 16:42:10,097 INFO L495 AbstractCegarLoop]: Abstraction has 351 states and 490 transitions. [2023-12-24 16:42:10,097 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 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-24 16:42:10,097 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 490 transitions. [2023-12-24 16:42:10,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2023-12-24 16:42:10,098 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 16:42:10,098 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-24 16:42:10,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 (11)] Forceful destruction successful, exit code 0 [2023-12-24 16:42:10,308 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 16:42:10,308 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 16:42:10,308 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 16:42:10,309 INFO L85 PathProgramCache]: Analyzing trace with hash -452898777, now seen corresponding path program 1 times [2023-12-24 16:42:10,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 16:42:10,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1905148164] [2023-12-24 16:42:10,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 16:42:10,309 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-24 16:42:10,309 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 16:42:10,311 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-24 16:42:10,347 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-24 16:42:10,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 16:42:10,579 INFO L262 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-24 16:42:10,582 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 16:42:10,613 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-24 16:42:10,613 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 16:42:10,613 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 16:42:10,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1905148164] [2023-12-24 16:42:10,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1905148164] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 16:42:10,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 16:42:10,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-24 16:42:10,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829739658] [2023-12-24 16:42:10,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 16:42:10,614 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-24 16:42:10,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 16:42:10,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-24 16:42:10,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-24 16:42:10,614 INFO L87 Difference]: Start difference. First operand 351 states and 490 transitions. Second operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 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-24 16:42:10,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 16:42:10,757 INFO L93 Difference]: Finished difference Result 763 states and 1055 transitions. [2023-12-24 16:42:10,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-12-24 16:42:10,758 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 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-24 16:42:10,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 16:42:10,759 INFO L225 Difference]: With dead ends: 763 [2023-12-24 16:42:10,759 INFO L226 Difference]: Without dead ends: 413 [2023-12-24 16:42:10,760 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 141 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-24 16:42:10,761 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-24 16:42:10,761 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-24 16:42:10,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2023-12-24 16:42:10,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 359. [2023-12-24 16:42:10,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 359 states, 274 states have (on average 1.2335766423357664) internal successors, (338), 274 states have internal predecessors, (338), 80 states have call successors, (80), 4 states have call predecessors, (80), 4 states have return successors, (80), 80 states have call predecessors, (80), 80 states have call successors, (80) [2023-12-24 16:42:10,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 498 transitions. [2023-12-24 16:42:10,773 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 498 transitions. Word has length 147 [2023-12-24 16:42:10,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 16:42:10,773 INFO L495 AbstractCegarLoop]: Abstraction has 359 states and 498 transitions. [2023-12-24 16:42:10,773 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 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-24 16:42:10,774 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 498 transitions. [2023-12-24 16:42:10,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2023-12-24 16:42:10,774 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 16:42:10,774 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-24 16:42:10,785 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2023-12-24 16:42:10,975 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-24 16:42:10,975 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 16:42:10,976 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 16:42:10,976 INFO L85 PathProgramCache]: Analyzing trace with hash -452839195, now seen corresponding path program 1 times [2023-12-24 16:42:10,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 16:42:10,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2123624167] [2023-12-24 16:42:10,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 16:42:10,976 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-24 16:42:10,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 16:42:10,977 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-24 16:42:10,996 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-24 16:42:11,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 16:42:11,237 INFO L262 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-24 16:42:11,240 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 16:42:11,245 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-24 16:42:11,262 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-24 16:42:11,262 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 16:42:11,262 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 16:42:11,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2123624167] [2023-12-24 16:42:11,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2123624167] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 16:42:11,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 16:42:11,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-24 16:42:11,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514172946] [2023-12-24 16:42:11,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 16:42:11,263 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-24 16:42:11,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 16:42:11,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-24 16:42:11,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-24 16:42:11,263 INFO L87 Difference]: Start difference. First operand 359 states and 498 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 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-24 16:42:11,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 16:42:11,314 INFO L93 Difference]: Finished difference Result 545 states and 759 transitions. [2023-12-24 16:42:11,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-24 16:42:11,315 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 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-24 16:42:11,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 16:42:11,316 INFO L225 Difference]: With dead ends: 545 [2023-12-24 16:42:11,316 INFO L226 Difference]: Without dead ends: 359 [2023-12-24 16:42:11,317 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 145 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-24 16:42:11,317 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 1 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 232 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.0s IncrementalHoareTripleChecker+Time [2023-12-24 16:42:11,318 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 232 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-24 16:42:11,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2023-12-24 16:42:11,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 359. [2023-12-24 16:42:11,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 359 states, 274 states have (on average 1.2262773722627738) internal successors, (336), 274 states have internal predecessors, (336), 80 states have call successors, (80), 4 states have call predecessors, (80), 4 states have return successors, (80), 80 states have call predecessors, (80), 80 states have call successors, (80) [2023-12-24 16:42:11,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 496 transitions. [2023-12-24 16:42:11,328 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 496 transitions. Word has length 147 [2023-12-24 16:42:11,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 16:42:11,329 INFO L495 AbstractCegarLoop]: Abstraction has 359 states and 496 transitions. [2023-12-24 16:42:11,329 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 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-24 16:42:11,329 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 496 transitions. [2023-12-24 16:42:11,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2023-12-24 16:42:11,330 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 16:42:11,330 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-24 16:42:11,336 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-24 16:42:11,536 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-24 16:42:11,537 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 16:42:11,537 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 16:42:11,537 INFO L85 PathProgramCache]: Analyzing trace with hash -2141782937, now seen corresponding path program 1 times [2023-12-24 16:42:11,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 16:42:11,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1826589608] [2023-12-24 16:42:11,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 16:42:11,538 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 16:42:11,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 16:42:11,539 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-24 16:42:11,574 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-24 16:42:11,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 16:42:11,795 INFO L262 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-24 16:42:11,798 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 16:42:11,815 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-24 16:42:11,831 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-24 16:42:11,831 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 16:42:11,831 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 16:42:11,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1826589608] [2023-12-24 16:42:11,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1826589608] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 16:42:11,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 16:42:11,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-24 16:42:11,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286082164] [2023-12-24 16:42:11,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 16:42:11,832 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-24 16:42:11,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 16:42:11,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-24 16:42:11,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-24 16:42:11,833 INFO L87 Difference]: Start difference. First operand 359 states and 496 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 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-24 16:42:12,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 16:42:12,055 INFO L93 Difference]: Finished difference Result 622 states and 859 transitions. [2023-12-24 16:42:12,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-24 16:42:12,055 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 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-24 16:42:12,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 16:42:12,057 INFO L225 Difference]: With dead ends: 622 [2023-12-24 16:42:12,057 INFO L226 Difference]: Without dead ends: 436 [2023-12-24 16:42:12,057 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 144 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-24 16:42:12,058 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 33 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-24 16:42:12,058 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 363 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-24 16:42:12,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2023-12-24 16:42:12,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 359. [2023-12-24 16:42:12,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 359 states, 274 states have (on average 1.218978102189781) internal successors, (334), 274 states have internal predecessors, (334), 80 states have call successors, (80), 4 states have call predecessors, (80), 4 states have return successors, (80), 80 states have call predecessors, (80), 80 states have call successors, (80) [2023-12-24 16:42:12,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 494 transitions. [2023-12-24 16:42:12,071 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 494 transitions. Word has length 147 [2023-12-24 16:42:12,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 16:42:12,071 INFO L495 AbstractCegarLoop]: Abstraction has 359 states and 494 transitions. [2023-12-24 16:42:12,071 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 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-24 16:42:12,071 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 494 transitions. [2023-12-24 16:42:12,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2023-12-24 16:42:12,072 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 16:42:12,072 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-24 16:42:12,080 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-24 16:42:12,280 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-24 16:42:12,281 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 16:42:12,281 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 16:42:12,281 INFO L85 PathProgramCache]: Analyzing trace with hash 873320681, now seen corresponding path program 1 times [2023-12-24 16:42:12,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 16:42:12,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1074322270] [2023-12-24 16:42:12,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 16:42:12,282 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-24 16:42:12,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 16:42:12,283 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-24 16:42:12,319 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-24 16:42:12,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 16:42:12,545 INFO L262 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 17 conjunts are in the unsatisfiable core [2023-12-24 16:42:12,548 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 16:42:12,561 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-24 16:42:12,578 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 33 treesize of output 25 [2023-12-24 16:42:12,598 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-24 16:42:12,637 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-24 16:42:12,637 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 16:42:12,637 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 16:42:12,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1074322270] [2023-12-24 16:42:12,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1074322270] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 16:42:12,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 16:42:12,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-24 16:42:12,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238996580] [2023-12-24 16:42:12,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 16:42:12,638 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-24 16:42:12,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 16:42:12,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-24 16:42:12,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-12-24 16:42:12,638 INFO L87 Difference]: Start difference. First operand 359 states and 494 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 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-24 16:42:13,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 16:42:13,373 INFO L93 Difference]: Finished difference Result 804 states and 1107 transitions. [2023-12-24 16:42:13,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-24 16:42:13,376 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 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-24 16:42:13,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 16:42:13,378 INFO L225 Difference]: With dead ends: 804 [2023-12-24 16:42:13,378 INFO L226 Difference]: Without dead ends: 618 [2023-12-24 16:42:13,379 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2023-12-24 16:42:13,379 INFO L413 NwaCegarLoop]: 196 mSDtfsCounter, 260 mSDsluCounter, 918 mSDsCounter, 0 mSdLazyCounter, 305 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 260 SdHoareTripleChecker+Valid, 1114 SdHoareTripleChecker+Invalid, 311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 305 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-24 16:42:13,379 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [260 Valid, 1114 Invalid, 311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 305 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-24 16:42:13,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2023-12-24 16:42:13,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 492. [2023-12-24 16:42:13,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 492 states, 365 states have (on average 1.2191780821917808) internal successors, (445), 365 states have internal predecessors, (445), 120 states have call successors, (120), 6 states have call predecessors, (120), 6 states have return successors, (120), 120 states have call predecessors, (120), 120 states have call successors, (120) [2023-12-24 16:42:13,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 492 states and 685 transitions. [2023-12-24 16:42:13,398 INFO L78 Accepts]: Start accepts. Automaton has 492 states and 685 transitions. Word has length 147 [2023-12-24 16:42:13,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 16:42:13,399 INFO L495 AbstractCegarLoop]: Abstraction has 492 states and 685 transitions. [2023-12-24 16:42:13,399 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 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-24 16:42:13,399 INFO L276 IsEmpty]: Start isEmpty. Operand 492 states and 685 transitions. [2023-12-24 16:42:13,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2023-12-24 16:42:13,401 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 16:42:13,401 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-24 16:42:13,409 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0 [2023-12-24 16:42:13,607 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-24 16:42:13,607 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 16:42:13,608 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 16:42:13,608 INFO L85 PathProgramCache]: Analyzing trace with hash -633150729, now seen corresponding path program 1 times [2023-12-24 16:42:13,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 16:42:13,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [41386718] [2023-12-24 16:42:13,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 16:42:13,609 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-24 16:42:13,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 16:42:13,610 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-24 16:42:13,646 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-24 16:42:13,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 16:42:13,861 INFO L262 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-24 16:42:13,864 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 16:42:14,199 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-24 16:42:14,220 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 14 proven. 342 refuted. 0 times theorem prover too weak. 404 trivial. 0 not checked. [2023-12-24 16:42:14,220 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 16:42:14,328 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-24 16:42:14,328 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 16:42:14,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [41386718] [2023-12-24 16:42:14,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [41386718] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-24 16:42:14,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-24 16:42:14,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 13 [2023-12-24 16:42:14,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056233397] [2023-12-24 16:42:14,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 16:42:14,329 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-24 16:42:14,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 16:42:14,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-24 16:42:14,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2023-12-24 16:42:14,329 INFO L87 Difference]: Start difference. First operand 492 states and 685 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 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-24 16:42:14,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 16:42:14,421 INFO L93 Difference]: Finished difference Result 1032 states and 1410 transitions. [2023-12-24 16:42:14,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-24 16:42:14,421 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 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-24 16:42:14,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 16:42:14,424 INFO L225 Difference]: With dead ends: 1032 [2023-12-24 16:42:14,424 INFO L226 Difference]: Without dead ends: 763 [2023-12-24 16:42:14,425 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 293 GetRequests, 281 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-24 16:42:14,426 INFO L413 NwaCegarLoop]: 159 mSDtfsCounter, 110 mSDsluCounter, 387 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 546 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-24 16:42:14,426 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 546 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-24 16:42:14,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 763 states. [2023-12-24 16:42:14,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 763 to 651. [2023-12-24 16:42:14,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 651 states, 509 states have (on average 1.231827111984283) internal successors, (627), 512 states have internal predecessors, (627), 132 states have call successors, (132), 9 states have call predecessors, (132), 9 states have return successors, (132), 129 states have call predecessors, (132), 132 states have call successors, (132) [2023-12-24 16:42:14,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 651 states to 651 states and 891 transitions. [2023-12-24 16:42:14,453 INFO L78 Accepts]: Start accepts. Automaton has 651 states and 891 transitions. Word has length 147 [2023-12-24 16:42:14,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 16:42:14,454 INFO L495 AbstractCegarLoop]: Abstraction has 651 states and 891 transitions. [2023-12-24 16:42:14,454 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 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-24 16:42:14,454 INFO L276 IsEmpty]: Start isEmpty. Operand 651 states and 891 transitions. [2023-12-24 16:42:14,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2023-12-24 16:42:14,455 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 16:42:14,455 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-24 16:42:14,465 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-24 16:42:14,662 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-24 16:42:14,662 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 16:42:14,663 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 16:42:14,663 INFO L85 PathProgramCache]: Analyzing trace with hash -621383961, now seen corresponding path program 1 times [2023-12-24 16:42:14,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 16:42:14,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2001793828] [2023-12-24 16:42:14,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 16:42:14,663 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-24 16:42:14,663 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 16:42:14,664 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-24 16:42:14,665 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-24 16:42:14,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 16:42:14,921 INFO L262 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 13 conjunts are in the unsatisfiable core [2023-12-24 16:42:14,924 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 16:42:14,949 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-24 16:42:14,949 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 16:42:14,950 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 16:42:14,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2001793828] [2023-12-24 16:42:14,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2001793828] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 16:42:14,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 16:42:14,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-24 16:42:14,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523708249] [2023-12-24 16:42:14,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 16:42:14,950 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-24 16:42:14,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 16:42:14,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-24 16:42:14,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-24 16:42:14,951 INFO L87 Difference]: Start difference. First operand 651 states and 891 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 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-24 16:42:15,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 16:42:15,157 INFO L93 Difference]: Finished difference Result 799 states and 1092 transitions. [2023-12-24 16:42:15,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-24 16:42:15,160 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 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-24 16:42:15,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 16:42:15,165 INFO L225 Difference]: With dead ends: 799 [2023-12-24 16:42:15,165 INFO L226 Difference]: Without dead ends: 509 [2023-12-24 16:42:15,166 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 145 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-24 16:42:15,166 INFO L413 NwaCegarLoop]: 114 mSDtfsCounter, 0 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-24 16:42:15,167 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 212 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-24 16:42:15,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 509 states. [2023-12-24 16:42:15,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 509 to 230. [2023-12-24 16:42:15,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 182 states have (on average 1.2197802197802199) internal successors, (222), 183 states have internal predecessors, (222), 44 states have call successors, (44), 3 states have call predecessors, (44), 3 states have return successors, (44), 43 states have call predecessors, (44), 44 states have call successors, (44) [2023-12-24 16:42:15,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 310 transitions. [2023-12-24 16:42:15,182 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 310 transitions. Word has length 147 [2023-12-24 16:42:15,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 16:42:15,183 INFO L495 AbstractCegarLoop]: Abstraction has 230 states and 310 transitions. [2023-12-24 16:42:15,183 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 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-24 16:42:15,183 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 310 transitions. [2023-12-24 16:42:15,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2023-12-24 16:42:15,184 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 16:42:15,184 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-24 16:42:15,191 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 (17)] Ended with exit code 0 [2023-12-24 16:42:15,390 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 16:42:15,391 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 16:42:15,391 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 16:42:15,391 INFO L85 PathProgramCache]: Analyzing trace with hash 1098164493, now seen corresponding path program 1 times [2023-12-24 16:42:15,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 16:42:15,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1274298522] [2023-12-24 16:42:15,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 16:42:15,392 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-24 16:42:15,392 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 16:42:15,393 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 16:42:15,393 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2023-12-24 16:42:15,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 16:42:15,680 INFO L262 TraceCheckSpWp]: Trace formula consists of 374 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-24 16:42:15,682 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 16:42:15,699 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-24 16:42:15,700 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 16:42:15,700 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 16:42:15,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1274298522] [2023-12-24 16:42:15,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1274298522] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 16:42:15,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 16:42:15,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-24 16:42:15,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654785315] [2023-12-24 16:42:15,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 16:42:15,701 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-24 16:42:15,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 16:42:15,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-24 16:42:15,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-24 16:42:15,701 INFO L87 Difference]: Start difference. First operand 230 states and 310 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-24 16:42:15,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 16:42:15,796 INFO L93 Difference]: Finished difference Result 495 states and 667 transitions. [2023-12-24 16:42:15,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-24 16:42:15,796 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-24 16:42:15,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 16:42:15,798 INFO L225 Difference]: With dead ends: 495 [2023-12-24 16:42:15,798 INFO L226 Difference]: Without dead ends: 266 [2023-12-24 16:42:15,798 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 144 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-24 16:42:15,799 INFO L413 NwaCegarLoop]: 118 mSDtfsCounter, 54 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 442 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-24 16:42:15,799 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 442 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-24 16:42:15,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2023-12-24 16:42:15,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 236. [2023-12-24 16:42:15,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 188 states have (on average 1.2127659574468086) internal successors, (228), 189 states have internal predecessors, (228), 44 states have call successors, (44), 3 states have call predecessors, (44), 3 states have return successors, (44), 43 states have call predecessors, (44), 44 states have call successors, (44) [2023-12-24 16:42:15,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 316 transitions. [2023-12-24 16:42:15,808 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 316 transitions. Word has length 148 [2023-12-24 16:42:15,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 16:42:15,808 INFO L495 AbstractCegarLoop]: Abstraction has 236 states and 316 transitions. [2023-12-24 16:42:15,808 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-24 16:42:15,808 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 316 transitions. [2023-12-24 16:42:15,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2023-12-24 16:42:15,809 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 16:42:15,809 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] [2023-12-24 16:42:15,823 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2023-12-24 16:42:16,017 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 16:42:16,017 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 16:42:16,017 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 16:42:16,017 INFO L85 PathProgramCache]: Analyzing trace with hash -84807447, now seen corresponding path program 1 times [2023-12-24 16:42:16,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 16:42:16,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [40406905] [2023-12-24 16:42:16,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 16:42:16,018 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-24 16:42:16,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 16:42:16,019 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-24 16:42:16,055 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2023-12-24 16:42:16,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 16:42:16,278 INFO L262 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 13 conjunts are in the unsatisfiable core [2023-12-24 16:42:16,281 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 16:42:16,473 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 17 treesize of output 13 [2023-12-24 16:42:16,511 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-24 16:42:16,544 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 396 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2023-12-24 16:42:16,545 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 16:42:16,638 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-24 16:42:16,638 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 16:42:16,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [40406905] [2023-12-24 16:42:16,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [40406905] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-24 16:42:16,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-24 16:42:16,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 11 [2023-12-24 16:42:16,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866565482] [2023-12-24 16:42:16,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 16:42:16,639 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-24 16:42:16,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 16:42:16,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-24 16:42:16,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2023-12-24 16:42:16,639 INFO L87 Difference]: Start difference. First operand 236 states and 316 transitions. Second operand has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 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-24 16:42:17,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 16:42:17,351 INFO L93 Difference]: Finished difference Result 447 states and 594 transitions. [2023-12-24 16:42:17,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-24 16:42:17,351 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 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 149 [2023-12-24 16:42:17,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 16:42:17,353 INFO L225 Difference]: With dead ends: 447 [2023-12-24 16:42:17,353 INFO L226 Difference]: Without dead ends: 300 [2023-12-24 16:42:17,353 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 287 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2023-12-24 16:42:17,354 INFO L413 NwaCegarLoop]: 163 mSDtfsCounter, 164 mSDsluCounter, 722 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 885 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-24 16:42:17,354 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 885 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-24 16:42:17,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2023-12-24 16:42:17,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 252. [2023-12-24 16:42:17,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 199 states have (on average 1.2010050251256281) internal successors, (239), 200 states have internal predecessors, (239), 48 states have call successors, (48), 4 states have call predecessors, (48), 4 states have return successors, (48), 47 states have call predecessors, (48), 48 states have call successors, (48) [2023-12-24 16:42:17,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 335 transitions. [2023-12-24 16:42:17,364 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 335 transitions. Word has length 149 [2023-12-24 16:42:17,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 16:42:17,365 INFO L495 AbstractCegarLoop]: Abstraction has 252 states and 335 transitions. [2023-12-24 16:42:17,365 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 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-24 16:42:17,365 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 335 transitions. [2023-12-24 16:42:17,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2023-12-24 16:42:17,365 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 16:42:17,366 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-24 16:42:17,381 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-24 16:42:17,566 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-24 16:42:17,566 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 16:42:17,567 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 16:42:17,567 INFO L85 PathProgramCache]: Analyzing trace with hash 1556777343, now seen corresponding path program 1 times [2023-12-24 16:42:17,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 16:42:17,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1352912188] [2023-12-24 16:42:17,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 16:42:17,567 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-24 16:42:17,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 16:42:17,568 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-24 16:42:17,571 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-24 16:42:17,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 16:42:17,834 INFO L262 TraceCheckSpWp]: Trace formula consists of 381 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-24 16:42:17,836 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 16:42:18,206 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 14 proven. 342 refuted. 0 times theorem prover too weak. 404 trivial. 0 not checked. [2023-12-24 16:42:18,206 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 16:42:18,295 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-24 16:42:18,295 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 16:42:18,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1352912188] [2023-12-24 16:42:18,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1352912188] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-24 16:42:18,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-24 16:42:18,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 11 [2023-12-24 16:42:18,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877986673] [2023-12-24 16:42:18,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 16:42:18,296 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-24 16:42:18,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 16:42:18,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-24 16:42:18,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2023-12-24 16:42:18,297 INFO L87 Difference]: Start difference. First operand 252 states and 335 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-24 16:42:18,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 16:42:18,381 INFO L93 Difference]: Finished difference Result 495 states and 652 transitions. [2023-12-24 16:42:18,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-24 16:42:18,381 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-24 16:42:18,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 16:42:18,382 INFO L225 Difference]: With dead ends: 495 [2023-12-24 16:42:18,383 INFO L226 Difference]: Without dead ends: 244 [2023-12-24 16:42:18,383 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 299 GetRequests, 289 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-24 16:42:18,384 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 101 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 333 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-24 16:42:18,384 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 333 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-24 16:42:18,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2023-12-24 16:42:18,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 242. [2023-12-24 16:42:18,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 187 states have (on average 1.1711229946524064) internal successors, (219), 188 states have internal predecessors, (219), 48 states have call successors, (48), 6 states have call predecessors, (48), 6 states have return successors, (48), 47 states have call predecessors, (48), 48 states have call successors, (48) [2023-12-24 16:42:18,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 315 transitions. [2023-12-24 16:42:18,395 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 315 transitions. Word has length 150 [2023-12-24 16:42:18,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 16:42:18,395 INFO L495 AbstractCegarLoop]: Abstraction has 242 states and 315 transitions. [2023-12-24 16:42:18,395 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-24 16:42:18,395 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 315 transitions. [2023-12-24 16:42:18,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2023-12-24 16:42:18,396 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 16:42:18,396 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-24 16:42:18,403 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-24 16:42:18,603 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-24 16:42:18,603 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 16:42:18,603 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 16:42:18,603 INFO L85 PathProgramCache]: Analyzing trace with hash -313637823, now seen corresponding path program 1 times [2023-12-24 16:42:18,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 16:42:18,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1112160722] [2023-12-24 16:42:18,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 16:42:18,604 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-24 16:42:18,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 16:42:18,605 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-24 16:42:18,608 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-24 16:42:18,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 16:42:18,945 INFO L262 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 11 conjunts are in the unsatisfiable core [2023-12-24 16:42:18,948 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 16:42:18,960 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 18 treesize of output 14 [2023-12-24 16:42:19,009 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-24 16:42:19,011 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-24 16:42:19,026 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-24 16:42:19,026 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 16:42:19,026 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 16:42:19,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1112160722] [2023-12-24 16:42:19,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1112160722] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 16:42:19,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 16:42:19,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-24 16:42:19,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323547403] [2023-12-24 16:42:19,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 16:42:19,027 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-24 16:42:19,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 16:42:19,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-24 16:42:19,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-24 16:42:19,028 INFO L87 Difference]: Start difference. First operand 242 states and 315 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-24 16:42:19,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 16:42:19,126 INFO L93 Difference]: Finished difference Result 282 states and 362 transitions. [2023-12-24 16:42:19,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-24 16:42:19,127 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-24 16:42:19,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 16:42:19,128 INFO L225 Difference]: With dead ends: 282 [2023-12-24 16:42:19,128 INFO L226 Difference]: Without dead ends: 280 [2023-12-24 16:42:19,128 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-24 16:42:19,128 INFO L413 NwaCegarLoop]: 135 mSDtfsCounter, 53 mSDsluCounter, 338 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 473 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.1s IncrementalHoareTripleChecker+Time [2023-12-24 16:42:19,129 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 473 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-24 16:42:19,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2023-12-24 16:42:19,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 230. [2023-12-24 16:42:19,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 174 states have (on average 1.1494252873563218) internal successors, (200), 175 states have internal predecessors, (200), 48 states have call successors, (48), 7 states have call predecessors, (48), 7 states have return successors, (48), 47 states have call predecessors, (48), 48 states have call successors, (48) [2023-12-24 16:42:19,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 296 transitions. [2023-12-24 16:42:19,140 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 296 transitions. Word has length 150 [2023-12-24 16:42:19,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 16:42:19,140 INFO L495 AbstractCegarLoop]: Abstraction has 230 states and 296 transitions. [2023-12-24 16:42:19,140 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-24 16:42:19,140 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 296 transitions. [2023-12-24 16:42:19,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2023-12-24 16:42:19,141 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 16:42:19,141 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-24 16:42:19,168 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 (21)] Ended with exit code 0 [2023-12-24 16:42:19,349 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-24 16:42:19,350 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 16:42:19,350 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 16:42:19,350 INFO L85 PathProgramCache]: Analyzing trace with hash -313578241, now seen corresponding path program 1 times [2023-12-24 16:42:19,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 16:42:19,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [463534212] [2023-12-24 16:42:19,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 16:42:19,351 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-24 16:42:19,351 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 16:42:19,352 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-24 16:42:19,385 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2023-12-24 16:42:19,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 16:42:19,696 INFO L262 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 11 conjunts are in the unsatisfiable core [2023-12-24 16:42:19,699 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 16:42:19,902 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 18 treesize of output 14 [2023-12-24 16:42:19,983 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 62 treesize of output 46 [2023-12-24 16:42:19,986 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 45 treesize of output 33 [2023-12-24 16:42:19,999 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-24 16:42:19,999 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 16:42:20,000 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 16:42:20,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [463534212] [2023-12-24 16:42:20,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [463534212] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 16:42:20,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 16:42:20,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-24 16:42:20,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195370030] [2023-12-24 16:42:20,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 16:42:20,001 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-24 16:42:20,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 16:42:20,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-24 16:42:20,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-24 16:42:20,001 INFO L87 Difference]: Start difference. First operand 230 states and 296 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) 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-24 16:42:20,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 16:42:20,652 INFO L93 Difference]: Finished difference Result 580 states and 749 transitions. [2023-12-24 16:42:20,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-24 16:42:20,653 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) 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-24 16:42:20,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 16:42:20,654 INFO L225 Difference]: With dead ends: 580 [2023-12-24 16:42:20,654 INFO L226 Difference]: Without dead ends: 371 [2023-12-24 16:42:20,655 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 145 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-24 16:42:20,655 INFO L413 NwaCegarLoop]: 173 mSDtfsCounter, 121 mSDsluCounter, 473 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 646 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-24 16:42:20,655 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 646 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-24 16:42:20,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2023-12-24 16:42:20,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 349. [2023-12-24 16:42:20,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 349 states, 257 states have (on average 1.132295719844358) internal successors, (291), 258 states have internal predecessors, (291), 80 states have call successors, (80), 11 states have call predecessors, (80), 11 states have return successors, (80), 79 states have call predecessors, (80), 80 states have call successors, (80) [2023-12-24 16:42:20,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 451 transitions. [2023-12-24 16:42:20,673 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 451 transitions. Word has length 150 [2023-12-24 16:42:20,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 16:42:20,673 INFO L495 AbstractCegarLoop]: Abstraction has 349 states and 451 transitions. [2023-12-24 16:42:20,673 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) 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-24 16:42:20,674 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 451 transitions. [2023-12-24 16:42:20,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2023-12-24 16:42:20,674 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 16:42:20,674 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-24 16:42:20,682 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-24 16:42:20,882 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-24 16:42:20,882 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 16:42:20,883 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 16:42:20,883 INFO L85 PathProgramCache]: Analyzing trace with hash -256319939, now seen corresponding path program 1 times [2023-12-24 16:42:20,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 16:42:20,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1644936912] [2023-12-24 16:42:20,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 16:42:20,883 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-24 16:42:20,883 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 16:42:20,884 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-24 16:42:20,885 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-24 16:42:21,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 16:42:21,183 INFO L262 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-24 16:42:21,185 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 16:42:21,190 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-24 16:42:21,223 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-24 16:42:21,223 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 16:42:21,223 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 16:42:21,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1644936912] [2023-12-24 16:42:21,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1644936912] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 16:42:21,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 16:42:21,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-24 16:42:21,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880997446] [2023-12-24 16:42:21,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 16:42:21,224 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-24 16:42:21,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 16:42:21,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-24 16:42:21,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-24 16:42:21,225 INFO L87 Difference]: Start difference. First operand 349 states and 451 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-24 16:42:21,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 16:42:21,347 INFO L93 Difference]: Finished difference Result 677 states and 870 transitions. [2023-12-24 16:42:21,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-24 16:42:21,349 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-24 16:42:21,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 16:42:21,350 INFO L225 Difference]: With dead ends: 677 [2023-12-24 16:42:21,350 INFO L226 Difference]: Without dead ends: 377 [2023-12-24 16:42:21,352 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-24 16:42:21,353 INFO L413 NwaCegarLoop]: 191 mSDtfsCounter, 114 mSDsluCounter, 454 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 645 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-24 16:42:21,353 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 645 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-24 16:42:21,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2023-12-24 16:42:21,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 349. [2023-12-24 16:42:21,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 349 states, 257 states have (on average 1.1206225680933852) internal successors, (288), 258 states have internal predecessors, (288), 80 states have call successors, (80), 11 states have call predecessors, (80), 11 states have return successors, (80), 79 states have call predecessors, (80), 80 states have call successors, (80) [2023-12-24 16:42:21,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 448 transitions. [2023-12-24 16:42:21,374 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 448 transitions. Word has length 150 [2023-12-24 16:42:21,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 16:42:21,375 INFO L495 AbstractCegarLoop]: Abstraction has 349 states and 448 transitions. [2023-12-24 16:42:21,375 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-24 16:42:21,375 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 448 transitions. [2023-12-24 16:42:21,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2023-12-24 16:42:21,375 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 16:42:21,376 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-24 16:42:21,384 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 (23)] Ended with exit code 0 [2023-12-24 16:42:21,584 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-24 16:42:21,584 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 16:42:21,584 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 16:42:21,584 INFO L85 PathProgramCache]: Analyzing trace with hash -1065666565, now seen corresponding path program 1 times [2023-12-24 16:42:21,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 16:42:21,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [514153200] [2023-12-24 16:42:21,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 16:42:21,585 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-24 16:42:21,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 16:42:21,586 INFO L229 MonitoredProcess]: Starting monitored process 24 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-24 16:42:21,587 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 (24)] Waiting until timeout for monitored process [2023-12-24 16:42:21,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 16:42:21,912 INFO L262 TraceCheckSpWp]: Trace formula consists of 381 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-24 16:42:21,914 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 16:42:21,927 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-24 16:42:21,928 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 16:42:21,928 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 16:42:21,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [514153200] [2023-12-24 16:42:21,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [514153200] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 16:42:21,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 16:42:21,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-24 16:42:21,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853033189] [2023-12-24 16:42:21,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 16:42:21,929 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-24 16:42:21,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 16:42:21,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-24 16:42:21,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-24 16:42:21,929 INFO L87 Difference]: Start difference. First operand 349 states and 448 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-24 16:42:22,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 16:42:22,017 INFO L93 Difference]: Finished difference Result 674 states and 858 transitions. [2023-12-24 16:42:22,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-24 16:42:22,024 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-24 16:42:22,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 16:42:22,026 INFO L225 Difference]: With dead ends: 674 [2023-12-24 16:42:22,026 INFO L226 Difference]: Without dead ends: 374 [2023-12-24 16:42:22,027 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-24 16:42:22,027 INFO L413 NwaCegarLoop]: 112 mSDtfsCounter, 20 mSDsluCounter, 327 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 439 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-24 16:42:22,028 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 439 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-24 16:42:22,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2023-12-24 16:42:22,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 358. [2023-12-24 16:42:22,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 358 states, 266 states have (on average 1.1165413533834587) internal successors, (297), 267 states have internal predecessors, (297), 80 states have call successors, (80), 11 states have call predecessors, (80), 11 states have return successors, (80), 79 states have call predecessors, (80), 80 states have call successors, (80) [2023-12-24 16:42:22,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 457 transitions. [2023-12-24 16:42:22,067 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 457 transitions. Word has length 150 [2023-12-24 16:42:22,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 16:42:22,067 INFO L495 AbstractCegarLoop]: Abstraction has 358 states and 457 transitions. [2023-12-24 16:42:22,067 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-24 16:42:22,067 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 457 transitions. [2023-12-24 16:42:22,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2023-12-24 16:42:22,068 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 16:42:22,068 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-24 16:42:22,086 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Forceful destruction successful, exit code 0 [2023-12-24 16:42:22,276 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-24 16:42:22,276 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 16:42:22,277 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 16:42:22,277 INFO L85 PathProgramCache]: Analyzing trace with hash 1016720859, now seen corresponding path program 1 times [2023-12-24 16:42:22,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 16:42:22,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1824673958] [2023-12-24 16:42:22,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 16:42:22,277 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-24 16:42:22,277 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 16:42:22,278 INFO L229 MonitoredProcess]: Starting monitored process 25 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-24 16:42:22,279 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 (25)] Waiting until timeout for monitored process [2023-12-24 16:42:22,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 16:42:22,600 INFO L262 TraceCheckSpWp]: Trace formula consists of 391 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-24 16:42:22,607 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 16:42:22,613 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 18 treesize of output 14 [2023-12-24 16:42:22,653 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-24 16:42:22,655 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-24 16:42:22,667 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-24 16:42:22,667 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 16:42:22,667 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 16:42:22,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1824673958] [2023-12-24 16:42:22,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1824673958] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 16:42:22,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 16:42:22,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-24 16:42:22,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585357062] [2023-12-24 16:42:22,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 16:42:22,668 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-24 16:42:22,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 16:42:22,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-24 16:42:22,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-24 16:42:22,669 INFO L87 Difference]: Start difference. First operand 358 states and 457 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-24 16:42:23,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 16:42:23,053 INFO L93 Difference]: Finished difference Result 499 states and 636 transitions. [2023-12-24 16:42:23,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-24 16:42:23,055 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-24 16:42:23,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 16:42:23,056 INFO L225 Difference]: With dead ends: 499 [2023-12-24 16:42:23,056 INFO L226 Difference]: Without dead ends: 376 [2023-12-24 16:42:23,057 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 147 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-24 16:42:23,057 INFO L413 NwaCegarLoop]: 175 mSDtfsCounter, 105 mSDsluCounter, 417 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 592 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-24 16:42:23,057 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 592 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-24 16:42:23,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2023-12-24 16:42:23,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 264. [2023-12-24 16:42:23,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 195 states have (on average 1.1128205128205129) internal successors, (217), 196 states have internal predecessors, (217), 60 states have call successors, (60), 8 states have call predecessors, (60), 8 states have return successors, (60), 59 states have call predecessors, (60), 60 states have call successors, (60) [2023-12-24 16:42:23,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 337 transitions. [2023-12-24 16:42:23,075 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 337 transitions. Word has length 151 [2023-12-24 16:42:23,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 16:42:23,075 INFO L495 AbstractCegarLoop]: Abstraction has 264 states and 337 transitions. [2023-12-24 16:42:23,076 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-24 16:42:23,076 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 337 transitions. [2023-12-24 16:42:23,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2023-12-24 16:42:23,076 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 16:42:23,076 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-24 16:42:23,085 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 (25)] Forceful destruction successful, exit code 0 [2023-12-24 16:42:23,285 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-24 16:42:23,285 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 16:42:23,286 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 16:42:23,286 INFO L85 PathProgramCache]: Analyzing trace with hash -921420722, now seen corresponding path program 1 times [2023-12-24 16:42:23,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 16:42:23,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1233051691] [2023-12-24 16:42:23,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 16:42:23,287 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-24 16:42:23,287 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 16:42:23,288 INFO L229 MonitoredProcess]: Starting monitored process 26 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-24 16:42:23,321 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 (26)] Waiting until timeout for monitored process [2023-12-24 16:42:23,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 16:42:23,570 INFO L262 TraceCheckSpWp]: Trace formula consists of 381 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-24 16:42:23,572 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 16:42:23,585 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-24 16:42:23,589 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-24 16:42:23,966 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-24 16:42:23,966 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 16:42:23,966 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 16:42:23,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1233051691] [2023-12-24 16:42:23,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1233051691] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 16:42:23,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 16:42:23,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-24 16:42:23,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773864513] [2023-12-24 16:42:23,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 16:42:23,967 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-24 16:42:23,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 16:42:23,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-24 16:42:23,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-24 16:42:23,967 INFO L87 Difference]: Start difference. First operand 264 states and 337 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 3 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-24 16:42:24,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 16:42:24,181 INFO L93 Difference]: Finished difference Result 501 states and 625 transitions. [2023-12-24 16:42:24,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-24 16:42:24,181 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 3 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-24 16:42:24,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 16:42:24,183 INFO L225 Difference]: With dead ends: 501 [2023-12-24 16:42:24,183 INFO L226 Difference]: Without dead ends: 378 [2023-12-24 16:42:24,183 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 148 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-24 16:42:24,184 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 79 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-24 16:42:24,184 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 325 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-24 16:42:24,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2023-12-24 16:42:24,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 285. [2023-12-24 16:42:24,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 285 states, 216 states have (on average 1.1342592592592593) internal successors, (245), 216 states have internal predecessors, (245), 60 states have call successors, (60), 8 states have call predecessors, (60), 8 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2023-12-24 16:42:24,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 365 transitions. [2023-12-24 16:42:24,201 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 365 transitions. Word has length 151 [2023-12-24 16:42:24,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 16:42:24,201 INFO L495 AbstractCegarLoop]: Abstraction has 285 states and 365 transitions. [2023-12-24 16:42:24,202 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 3 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-24 16:42:24,202 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 365 transitions. [2023-12-24 16:42:24,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2023-12-24 16:42:24,202 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 16:42:24,202 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-24 16:42:24,211 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 (26)] Forceful destruction successful, exit code 0 [2023-12-24 16:42:24,409 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-24 16:42:24,410 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 16:42:24,410 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 16:42:24,410 INFO L85 PathProgramCache]: Analyzing trace with hash 2093682896, now seen corresponding path program 1 times [2023-12-24 16:42:24,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 16:42:24,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2530163] [2023-12-24 16:42:24,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 16:42:24,410 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 16:42:24,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 16:42:24,411 INFO L229 MonitoredProcess]: Starting monitored process 27 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-24 16:42:24,412 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 (27)] Waiting until timeout for monitored process [2023-12-24 16:42:24,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 16:42:24,746 INFO L262 TraceCheckSpWp]: Trace formula consists of 381 conjuncts, 27 conjunts are in the unsatisfiable core [2023-12-24 16:42:24,749 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 16:42:24,829 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-24 16:42:27,147 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 45 treesize of output 33 [2023-12-24 16:42:27,153 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 41 treesize of output 29 [2023-12-24 16:42:27,167 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 37 treesize of output 25 [2023-12-24 16:42:27,374 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 17 proven. 419 refuted. 0 times theorem prover too weak. 324 trivial. 0 not checked. [2023-12-24 16:42:27,374 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 16:42:27,890 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-24 16:42:27,890 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 16:42:27,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2530163] [2023-12-24 16:42:27,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2530163] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-24 16:42:27,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-24 16:42:27,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [21] total 26 [2023-12-24 16:42:27,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676549438] [2023-12-24 16:42:27,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 16:42:27,891 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-24 16:42:27,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 16:42:27,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-24 16:42:27,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=571, Unknown=0, NotChecked=0, Total=650 [2023-12-24 16:42:27,892 INFO L87 Difference]: Start difference. First operand 285 states and 365 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 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-24 16:42:28,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 16:42:28,182 INFO L93 Difference]: Finished difference Result 492 states and 618 transitions. [2023-12-24 16:42:28,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-24 16:42:28,183 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 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-24 16:42:28,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 16:42:28,184 INFO L225 Difference]: With dead ends: 492 [2023-12-24 16:42:28,184 INFO L226 Difference]: Without dead ends: 368 [2023-12-24 16:42:28,185 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 302 GetRequests, 276 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 200 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=93, Invalid=663, Unknown=0, NotChecked=0, Total=756 [2023-12-24 16:42:28,185 INFO L413 NwaCegarLoop]: 145 mSDtfsCounter, 149 mSDsluCounter, 351 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 496 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-24 16:42:28,185 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 496 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-24 16:42:28,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2023-12-24 16:42:28,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 301. [2023-12-24 16:42:28,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 232 states have (on average 1.1379310344827587) internal successors, (264), 232 states have internal predecessors, (264), 60 states have call successors, (60), 8 states have call predecessors, (60), 8 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2023-12-24 16:42:28,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 384 transitions. [2023-12-24 16:42:28,203 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 384 transitions. Word has length 151 [2023-12-24 16:42:28,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 16:42:28,203 INFO L495 AbstractCegarLoop]: Abstraction has 301 states and 384 transitions. [2023-12-24 16:42:28,203 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 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-24 16:42:28,203 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 384 transitions. [2023-12-24 16:42:28,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2023-12-24 16:42:28,204 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 16:42:28,204 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-24 16:42:28,214 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 (27)] Ended with exit code 0 [2023-12-24 16:42:28,410 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-24 16:42:28,411 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 16:42:28,411 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 16:42:28,411 INFO L85 PathProgramCache]: Analyzing trace with hash 1229082198, now seen corresponding path program 1 times [2023-12-24 16:42:28,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 16:42:28,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [114763287] [2023-12-24 16:42:28,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 16:42:28,412 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-24 16:42:28,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 16:42:28,413 INFO L229 MonitoredProcess]: Starting monitored process 28 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-24 16:42:28,416 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 (28)] Waiting until timeout for monitored process [2023-12-24 16:42:28,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 16:42:28,744 INFO L262 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 23 conjunts are in the unsatisfiable core [2023-12-24 16:42:28,747 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 16:42:33,131 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 43 treesize of output 35 [2023-12-24 16:42:33,138 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 39 treesize of output 31 [2023-12-24 16:42:33,152 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 35 treesize of output 27 [2023-12-24 16:42:33,156 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 40 treesize of output 28 [2023-12-24 16:42:34,442 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 520 refuted. 0 times theorem prover too weak. 240 trivial. 0 not checked. [2023-12-24 16:42:34,442 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 16:42:42,628 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-24 16:42:42,628 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 16:42:42,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [114763287] [2023-12-24 16:42:42,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [114763287] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-24 16:42:42,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-24 16:42:42,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [12] total 16 [2023-12-24 16:42:42,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361565886] [2023-12-24 16:42:42,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 16:42:42,629 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-24 16:42:42,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 16:42:42,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-24 16:42:42,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2023-12-24 16:42:42,630 INFO L87 Difference]: Start difference. First operand 301 states and 384 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 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-24 16:42:53,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 16:42:53,085 INFO L93 Difference]: Finished difference Result 634 states and 786 transitions. [2023-12-24 16:42:53,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-24 16:42:53,105 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 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 152 [2023-12-24 16:42:53,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 16:42:53,106 INFO L225 Difference]: With dead ends: 634 [2023-12-24 16:42:53,106 INFO L226 Difference]: Without dead ends: 403 [2023-12-24 16:42:53,107 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 288 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2023-12-24 16:42:53,107 INFO L413 NwaCegarLoop]: 105 mSDtfsCounter, 72 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.1s IncrementalHoareTripleChecker+Time [2023-12-24 16:42:53,107 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 388 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 9.1s Time] [2023-12-24 16:42:53,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2023-12-24 16:42:53,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 353. [2023-12-24 16:42:53,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 353 states, 283 states have (on average 1.127208480565371) internal successors, (319), 283 states have internal predecessors, (319), 60 states have call successors, (60), 9 states have call predecessors, (60), 9 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2023-12-24 16:42:53,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 439 transitions. [2023-12-24 16:42:53,127 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 439 transitions. Word has length 152 [2023-12-24 16:42:53,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 16:42:53,127 INFO L495 AbstractCegarLoop]: Abstraction has 353 states and 439 transitions. [2023-12-24 16:42:53,127 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 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-24 16:42:53,127 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 439 transitions. [2023-12-24 16:42:53,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2023-12-24 16:42:53,128 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 16:42:53,128 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-24 16:42:53,136 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 (28)] Forceful destruction successful, exit code 0 [2023-12-24 16:42:53,335 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-24 16:42:53,336 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 16:42:53,336 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 16:42:53,336 INFO L85 PathProgramCache]: Analyzing trace with hash 2034649172, now seen corresponding path program 1 times [2023-12-24 16:42:53,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 16:42:53,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1239939270] [2023-12-24 16:42:53,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 16:42:53,337 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-24 16:42:53,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 16:42:53,338 INFO L229 MonitoredProcess]: Starting monitored process 29 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-24 16:42:53,339 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 (29)] Waiting until timeout for monitored process [2023-12-24 16:42:53,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 16:42:53,619 INFO L262 TraceCheckSpWp]: Trace formula consists of 391 conjuncts, 12 conjunts are in the unsatisfiable core [2023-12-24 16:42:53,622 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 16:42:53,922 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-24 16:42:53,928 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-12-24 16:42:53,955 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-24 16:42:53,955 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 16:42:53,955 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 16:42:53,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1239939270] [2023-12-24 16:42:53,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1239939270] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 16:42:53,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 16:42:53,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-24 16:42:53,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204406506] [2023-12-24 16:42:53,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 16:42:53,956 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-24 16:42:53,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 16:42:53,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-24 16:42:53,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-24 16:42:53,957 INFO L87 Difference]: Start difference. First operand 353 states and 439 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 4 states have internal predecessors, (55), 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-24 16:42:54,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 16:42:54,546 INFO L93 Difference]: Finished difference Result 651 states and 805 transitions. [2023-12-24 16:42:54,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-24 16:42:54,547 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 4 states have internal predecessors, (55), 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 152 [2023-12-24 16:42:54,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 16:42:54,548 INFO L225 Difference]: With dead ends: 651 [2023-12-24 16:42:54,548 INFO L226 Difference]: Without dead ends: 466 [2023-12-24 16:42:54,549 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-12-24 16:42:54,549 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 58 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 367 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-24 16:42:54,549 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 367 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-24 16:42:54,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466 states. [2023-12-24 16:42:54,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 381. [2023-12-24 16:42:54,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 381 states, 311 states have (on average 1.1318327974276527) internal successors, (352), 311 states have internal predecessors, (352), 60 states have call successors, (60), 9 states have call predecessors, (60), 9 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2023-12-24 16:42:54,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 472 transitions. [2023-12-24 16:42:54,572 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 472 transitions. Word has length 152 [2023-12-24 16:42:54,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 16:42:54,572 INFO L495 AbstractCegarLoop]: Abstraction has 381 states and 472 transitions. [2023-12-24 16:42:54,572 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 4 states have internal predecessors, (55), 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-24 16:42:54,573 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 472 transitions. [2023-12-24 16:42:54,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2023-12-24 16:42:54,573 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 16:42:54,573 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-24 16:42:54,593 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 (29)] Forceful destruction successful, exit code 0 [2023-12-24 16:42:54,781 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-24 16:42:54,782 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 16:42:54,782 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 16:42:54,782 INFO L85 PathProgramCache]: Analyzing trace with hash 1234352778, now seen corresponding path program 1 times [2023-12-24 16:42:54,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 16:42:54,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1231978290] [2023-12-24 16:42:54,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 16:42:54,783 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-24 16:42:54,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 16:42:54,784 INFO L229 MonitoredProcess]: Starting monitored process 30 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-24 16:42:54,785 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 (30)] Waiting until timeout for monitored process [2023-12-24 16:42:55,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 16:42:55,027 INFO L262 TraceCheckSpWp]: Trace formula consists of 382 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-24 16:42:55,030 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 16:42:55,052 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-24 16:42:55,058 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-24 16:42:55,570 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-24 16:42:55,570 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 16:42:55,570 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 16:42:55,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1231978290] [2023-12-24 16:42:55,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1231978290] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 16:42:55,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 16:42:55,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-24 16:42:55,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875319889] [2023-12-24 16:42:55,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 16:42:55,571 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-24 16:42:55,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 16:42:55,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-24 16:42:55,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-24 16:42:55,572 INFO L87 Difference]: Start difference. First operand 381 states and 472 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 4 states have internal predecessors, (55), 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-24 16:42:55,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 16:42:55,914 INFO L93 Difference]: Finished difference Result 726 states and 879 transitions. [2023-12-24 16:42:55,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-24 16:42:55,915 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 4 states have internal predecessors, (55), 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 152 [2023-12-24 16:42:55,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 16:42:55,916 INFO L225 Difference]: With dead ends: 726 [2023-12-24 16:42:55,916 INFO L226 Difference]: Without dead ends: 511 [2023-12-24 16:42:55,917 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-12-24 16:42:55,921 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 114 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 395 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-24 16:42:55,921 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 395 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-24 16:42:55,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2023-12-24 16:42:55,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 381. [2023-12-24 16:42:55,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 381 states, 311 states have (on average 1.1286173633440515) internal successors, (351), 311 states have internal predecessors, (351), 60 states have call successors, (60), 9 states have call predecessors, (60), 9 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2023-12-24 16:42:55,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 471 transitions. [2023-12-24 16:42:55,943 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 471 transitions. Word has length 152 [2023-12-24 16:42:55,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 16:42:55,944 INFO L495 AbstractCegarLoop]: Abstraction has 381 states and 471 transitions. [2023-12-24 16:42:55,944 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 4 states have internal predecessors, (55), 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-24 16:42:55,944 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 471 transitions. [2023-12-24 16:42:55,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2023-12-24 16:42:55,944 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 16:42:55,944 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-24 16:42:55,953 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 (30)] Forceful destruction successful, exit code 0 [2023-12-24 16:42:56,151 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-24 16:42:56,151 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 16:42:56,152 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 16:42:56,152 INFO L85 PathProgramCache]: Analyzing trace with hash 724879688, now seen corresponding path program 1 times [2023-12-24 16:42:56,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 16:42:56,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1486555136] [2023-12-24 16:42:56,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 16:42:56,152 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-24 16:42:56,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 16:42:56,153 INFO L229 MonitoredProcess]: Starting monitored process 31 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-24 16:42:56,154 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 (31)] Waiting until timeout for monitored process [2023-12-24 16:42:56,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 16:42:56,410 INFO L262 TraceCheckSpWp]: Trace formula consists of 382 conjuncts, 14 conjunts are in the unsatisfiable core [2023-12-24 16:42:56,412 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 16:42:56,704 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 17 treesize of output 13 [2023-12-24 16:42:56,752 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-24 16:42:56,813 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 396 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2023-12-24 16:42:56,813 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 16:42:56,957 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-24 16:42:56,957 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 16:42:56,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1486555136] [2023-12-24 16:42:56,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1486555136] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-24 16:42:56,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-24 16:42:56,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [9] total 13 [2023-12-24 16:42:56,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619025659] [2023-12-24 16:42:56,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 16:42:56,959 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-24 16:42:56,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 16:42:56,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-24 16:42:56,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2023-12-24 16:42:56,959 INFO L87 Difference]: Start difference. First operand 381 states and 471 transitions. Second operand has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 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-24 16:42:57,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 16:42:57,851 INFO L93 Difference]: Finished difference Result 640 states and 783 transitions. [2023-12-24 16:42:57,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-24 16:42:57,851 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 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 152 [2023-12-24 16:42:57,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 16:42:57,852 INFO L225 Difference]: With dead ends: 640 [2023-12-24 16:42:57,852 INFO L226 Difference]: Without dead ends: 455 [2023-12-24 16:42:57,853 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 312 GetRequests, 291 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=113, Invalid=393, Unknown=0, NotChecked=0, Total=506 [2023-12-24 16:42:57,853 INFO L413 NwaCegarLoop]: 166 mSDtfsCounter, 150 mSDsluCounter, 780 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 946 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-24 16:42:57,854 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 946 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-24 16:42:57,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2023-12-24 16:42:57,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 371. [2023-12-24 16:42:57,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 371 states, 301 states have (on average 1.1262458471760797) internal successors, (339), 301 states have internal predecessors, (339), 60 states have call successors, (60), 9 states have call predecessors, (60), 9 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2023-12-24 16:42:57,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 459 transitions. [2023-12-24 16:42:57,875 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 459 transitions. Word has length 152 [2023-12-24 16:42:57,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 16:42:57,875 INFO L495 AbstractCegarLoop]: Abstraction has 371 states and 459 transitions. [2023-12-24 16:42:57,875 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 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-24 16:42:57,876 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 459 transitions. [2023-12-24 16:42:57,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2023-12-24 16:42:57,876 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 16:42:57,877 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, 1, 1] [2023-12-24 16:42:57,888 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 (31)] Forceful destruction successful, exit code 0 [2023-12-24 16:42:58,083 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-24 16:42:58,084 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 16:42:58,084 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 16:42:58,084 INFO L85 PathProgramCache]: Analyzing trace with hash 988748987, now seen corresponding path program 1 times [2023-12-24 16:42:58,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 16:42:58,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [861616306] [2023-12-24 16:42:58,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 16:42:58,084 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-24 16:42:58,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 16:42:58,085 INFO L229 MonitoredProcess]: Starting monitored process 32 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-24 16:42:58,086 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 (32)] Waiting until timeout for monitored process [2023-12-24 16:42:58,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 16:42:58,503 INFO L262 TraceCheckSpWp]: Trace formula consists of 398 conjuncts, 48 conjunts are in the unsatisfiable core [2023-12-24 16:42:58,507 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 16:43:03,070 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-24 16:43:03,345 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 35 treesize of output 31 [2023-12-24 16:43:03,909 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 48 treesize of output 36 [2023-12-24 16:43:03,915 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 37 treesize of output 29 [2023-12-24 16:43:04,036 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 55 treesize of output 39 [2023-12-24 16:43:04,193 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 99 treesize of output 79 [2023-12-24 16:43:04,433 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 8 proven. 332 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-12-24 16:43:04,433 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 16:43:05,248 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-24 16:43:05,249 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 16:43:05,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [861616306] [2023-12-24 16:43:05,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [861616306] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-24 16:43:05,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-24 16:43:05,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [33] total 40 [2023-12-24 16:43:05,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171719136] [2023-12-24 16:43:05,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 16:43:05,249 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-24 16:43:05,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 16:43:05,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-24 16:43:05,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=1441, Unknown=0, NotChecked=0, Total=1560 [2023-12-24 16:43:05,250 INFO L87 Difference]: Start difference. First operand 371 states and 459 transitions. Second operand has 10 states, 10 states have (on average 5.7) internal successors, (57), 10 states have internal predecessors, (57), 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-24 16:43:07,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 16:43:07,397 INFO L93 Difference]: Finished difference Result 890 states and 1077 transitions. [2023-12-24 16:43:07,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-12-24 16:43:07,398 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.7) internal successors, (57), 10 states have internal predecessors, (57), 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 154 [2023-12-24 16:43:07,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 16:43:07,400 INFO L225 Difference]: With dead ends: 890 [2023-12-24 16:43:07,400 INFO L226 Difference]: Without dead ends: 606 [2023-12-24 16:43:07,401 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 317 GetRequests, 268 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 690 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=205, Invalid=2345, Unknown=0, NotChecked=0, Total=2550 [2023-12-24 16:43:07,401 INFO L413 NwaCegarLoop]: 167 mSDtfsCounter, 133 mSDsluCounter, 1073 mSDsCounter, 0 mSdLazyCounter, 453 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 1240 SdHoareTripleChecker+Invalid, 455 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 453 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-12-24 16:43:07,401 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 1240 Invalid, 455 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 453 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2023-12-24 16:43:07,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2023-12-24 16:43:07,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 566. [2023-12-24 16:43:07,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 566 states, 464 states have (on average 1.1142241379310345) internal successors, (517), 466 states have internal predecessors, (517), 86 states have call successors, (86), 15 states have call predecessors, (86), 15 states have return successors, (86), 84 states have call predecessors, (86), 86 states have call successors, (86) [2023-12-24 16:43:07,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 566 states to 566 states and 689 transitions. [2023-12-24 16:43:07,434 INFO L78 Accepts]: Start accepts. Automaton has 566 states and 689 transitions. Word has length 154 [2023-12-24 16:43:07,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 16:43:07,434 INFO L495 AbstractCegarLoop]: Abstraction has 566 states and 689 transitions. [2023-12-24 16:43:07,434 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.7) internal successors, (57), 10 states have internal predecessors, (57), 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-24 16:43:07,434 INFO L276 IsEmpty]: Start isEmpty. Operand 566 states and 689 transitions. [2023-12-24 16:43:07,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2023-12-24 16:43:07,435 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 16:43:07,435 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, 1, 1] [2023-12-24 16:43:07,445 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 (32)] Forceful destruction successful, exit code 0 [2023-12-24 16:43:07,643 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-24 16:43:07,643 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 16:43:07,644 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 16:43:07,644 INFO L85 PathProgramCache]: Analyzing trace with hash 1246914425, now seen corresponding path program 1 times [2023-12-24 16:43:07,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 16:43:07,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1894425686] [2023-12-24 16:43:07,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 16:43:07,644 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-24 16:43:07,644 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 16:43:07,645 INFO L229 MonitoredProcess]: Starting monitored process 33 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-24 16:43:07,646 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 (33)] Waiting until timeout for monitored process [2023-12-24 16:43:07,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 16:43:07,986 INFO L262 TraceCheckSpWp]: Trace formula consists of 398 conjuncts, 22 conjunts are in the unsatisfiable core [2023-12-24 16:43:07,989 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 16:43:10,033 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 26 [2023-12-24 16:43:10,037 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2023-12-24 16:43:10,107 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 49 proven. 215 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2023-12-24 16:43:10,108 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 16:43:10,380 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-24 16:43:10,380 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 16:43:10,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1894425686] [2023-12-24 16:43:10,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1894425686] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-24 16:43:10,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-24 16:43:10,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [19] total 23 [2023-12-24 16:43:10,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009949945] [2023-12-24 16:43:10,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 16:43:10,381 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-24 16:43:10,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 16:43:10,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-24 16:43:10,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=440, Unknown=0, NotChecked=0, Total=506 [2023-12-24 16:43:10,382 INFO L87 Difference]: Start difference. First operand 566 states and 689 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 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-24 16:43:10,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 16:43:10,723 INFO L93 Difference]: Finished difference Result 1077 states and 1298 transitions. [2023-12-24 16:43:10,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-24 16:43:10,723 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 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 154 [2023-12-24 16:43:10,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 16:43:10,725 INFO L225 Difference]: With dead ends: 1077 [2023-12-24 16:43:10,725 INFO L226 Difference]: Without dead ends: 612 [2023-12-24 16:43:10,726 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 307 GetRequests, 285 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=71, Invalid=481, Unknown=0, NotChecked=0, Total=552 [2023-12-24 16:43:10,726 INFO L413 NwaCegarLoop]: 198 mSDtfsCounter, 135 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 498 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-24 16:43:10,726 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 498 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-24 16:43:10,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2023-12-24 16:43:10,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 566. [2023-12-24 16:43:10,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 566 states, 456 states have (on average 1.1030701754385965) internal successors, (503), 458 states have internal predecessors, (503), 92 states have call successors, (92), 17 states have call predecessors, (92), 17 states have return successors, (92), 90 states have call predecessors, (92), 92 states have call successors, (92) [2023-12-24 16:43:10,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 566 states to 566 states and 687 transitions. [2023-12-24 16:43:10,760 INFO L78 Accepts]: Start accepts. Automaton has 566 states and 687 transitions. Word has length 154 [2023-12-24 16:43:10,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 16:43:10,760 INFO L495 AbstractCegarLoop]: Abstraction has 566 states and 687 transitions. [2023-12-24 16:43:10,760 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 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-24 16:43:10,760 INFO L276 IsEmpty]: Start isEmpty. Operand 566 states and 687 transitions. [2023-12-24 16:43:10,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2023-12-24 16:43:10,761 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 16:43:10,761 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, 1, 1] [2023-12-24 16:43:10,779 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 (33)] Forceful destruction successful, exit code 0 [2023-12-24 16:43:10,969 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-24 16:43:10,969 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 16:43:10,969 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 16:43:10,970 INFO L85 PathProgramCache]: Analyzing trace with hash -1920014915, now seen corresponding path program 1 times [2023-12-24 16:43:10,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 16:43:10,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1692830431] [2023-12-24 16:43:10,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 16:43:10,970 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-24 16:43:10,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 16:43:10,971 INFO L229 MonitoredProcess]: Starting monitored process 34 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-24 16:43:10,972 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 (34)] Waiting until timeout for monitored process [2023-12-24 16:43:11,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 16:43:11,303 INFO L262 TraceCheckSpWp]: Trace formula consists of 398 conjuncts, 22 conjunts are in the unsatisfiable core [2023-12-24 16:43:11,305 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 16:43:13,345 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 34 treesize of output 22 [2023-12-24 16:43:13,348 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 30 treesize of output 18 [2023-12-24 16:43:13,412 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 49 proven. 215 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2023-12-24 16:43:13,412 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 16:43:13,663 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-24 16:43:13,663 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 16:43:13,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1692830431] [2023-12-24 16:43:13,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1692830431] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-24 16:43:13,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-24 16:43:13,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [19] total 23 [2023-12-24 16:43:13,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007959827] [2023-12-24 16:43:13,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 16:43:13,664 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-24 16:43:13,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 16:43:13,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-24 16:43:13,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=440, Unknown=0, NotChecked=0, Total=506 [2023-12-24 16:43:13,664 INFO L87 Difference]: Start difference. First operand 566 states and 687 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 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-24 16:43:13,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 16:43:13,972 INFO L93 Difference]: Finished difference Result 1155 states and 1395 transitions. [2023-12-24 16:43:13,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-24 16:43:13,973 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 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 154 [2023-12-24 16:43:13,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 16:43:13,975 INFO L225 Difference]: With dead ends: 1155 [2023-12-24 16:43:13,975 INFO L226 Difference]: Without dead ends: 690 [2023-12-24 16:43:13,976 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 307 GetRequests, 285 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=71, Invalid=481, Unknown=0, NotChecked=0, Total=552 [2023-12-24 16:43:13,976 INFO L413 NwaCegarLoop]: 150 mSDtfsCounter, 137 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-24 16:43:13,976 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 385 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-24 16:43:13,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 690 states. [2023-12-24 16:43:14,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 690 to 678. [2023-12-24 16:43:14,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 678 states, 529 states have (on average 1.0850661625708884) internal successors, (574), 533 states have internal predecessors, (574), 124 states have call successors, (124), 24 states have call predecessors, (124), 24 states have return successors, (124), 120 states have call predecessors, (124), 124 states have call successors, (124) [2023-12-24 16:43:14,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 678 states to 678 states and 822 transitions. [2023-12-24 16:43:14,021 INFO L78 Accepts]: Start accepts. Automaton has 678 states and 822 transitions. Word has length 154 [2023-12-24 16:43:14,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 16:43:14,021 INFO L495 AbstractCegarLoop]: Abstraction has 678 states and 822 transitions. [2023-12-24 16:43:14,021 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 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-24 16:43:14,021 INFO L276 IsEmpty]: Start isEmpty. Operand 678 states and 822 transitions. [2023-12-24 16:43:14,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2023-12-24 16:43:14,022 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 16:43:14,022 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, 1, 1] [2023-12-24 16:43:14,032 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 (34)] Forceful destruction successful, exit code 0 [2023-12-24 16:43:14,230 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-24 16:43:14,230 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 16:43:14,230 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 16:43:14,230 INFO L85 PathProgramCache]: Analyzing trace with hash -1661849477, now seen corresponding path program 1 times [2023-12-24 16:43:14,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 16:43:14,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [91251967] [2023-12-24 16:43:14,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 16:43:14,231 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-24 16:43:14,231 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 16:43:14,232 INFO L229 MonitoredProcess]: Starting monitored process 35 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-24 16:43:14,232 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 (35)] Waiting until timeout for monitored process [2023-12-24 16:43:14,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 16:43:14,702 INFO L262 TraceCheckSpWp]: Trace formula consists of 398 conjuncts, 35 conjunts are in the unsatisfiable core [2023-12-24 16:43:14,705 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 16:43:17,636 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 35 treesize of output 31 [2023-12-24 16:43:18,086 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 48 treesize of output 36 [2023-12-24 16:43:18,095 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 37 treesize of output 29 [2023-12-24 16:43:18,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 53 treesize of output 37 [2023-12-24 16:43:18,278 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 99 treesize of output 79 [2023-12-24 16:43:18,431 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 12 proven. 322 refuted. 0 times theorem prover too weak. 426 trivial. 0 not checked. [2023-12-24 16:43:18,431 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 16:43:19,058 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-24 16:43:19,058 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 16:43:19,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [91251967] [2023-12-24 16:43:19,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [91251967] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-24 16:43:19,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-24 16:43:19,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [24] total 31 [2023-12-24 16:43:19,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600963551] [2023-12-24 16:43:19,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 16:43:19,062 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-24 16:43:19,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 16:43:19,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-24 16:43:19,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=837, Unknown=0, NotChecked=0, Total=930 [2023-12-24 16:43:19,063 INFO L87 Difference]: Start difference. First operand 678 states and 822 transitions. Second operand has 10 states, 10 states have (on average 5.7) internal successors, (57), 10 states have internal predecessors, (57), 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-24 16:43:20,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 16:43:20,900 INFO L93 Difference]: Finished difference Result 1271 states and 1530 transitions. [2023-12-24 16:43:20,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-24 16:43:20,901 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.7) internal successors, (57), 10 states have internal predecessors, (57), 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 154 [2023-12-24 16:43:20,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 16:43:20,901 INFO L225 Difference]: With dead ends: 1271 [2023-12-24 16:43:20,901 INFO L226 Difference]: Without dead ends: 0 [2023-12-24 16:43:20,903 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 316 GetRequests, 277 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 413 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=171, Invalid=1469, Unknown=0, NotChecked=0, Total=1640 [2023-12-24 16:43:20,903 INFO L413 NwaCegarLoop]: 165 mSDtfsCounter, 101 mSDsluCounter, 1039 mSDsCounter, 0 mSdLazyCounter, 452 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 1204 SdHoareTripleChecker+Invalid, 454 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 452 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-12-24 16:43:20,904 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 1204 Invalid, 454 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 452 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-12-24 16:43:20,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-12-24 16:43:20,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-12-24 16:43:20,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 16:43:20,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-12-24 16:43:20,904 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 154 [2023-12-24 16:43:20,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 16:43:20,904 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-12-24 16:43:20,905 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.7) internal successors, (57), 10 states have internal predecessors, (57), 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-24 16:43:20,905 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-12-24 16:43:20,905 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-12-24 16:43:20,909 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-24 16:43:20,926 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 (35)] Forceful destruction successful, exit code 0 [2023-12-24 16:43:21,118 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-24 16:43:21,121 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-12-24 16:43:31,274 WARN L293 SmtUtils]: Spent 7.90s on a formula simplification. DAG size of input: 165 DAG size of output: 130 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2023-12-24 16:43:38,764 WARN L293 SmtUtils]: Spent 7.30s on a formula simplification. DAG size of input: 165 DAG size of output: 130 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2023-12-24 16:43:49,172 WARN L293 SmtUtils]: Spent 5.00s on a formula simplification. DAG size of input: 151 DAG size of output: 118 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2023-12-24 16:43:55,133 WARN L293 SmtUtils]: Spent 5.69s on a formula simplification. DAG size of input: 151 DAG size of output: 118 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2023-12-24 16:44:04,830 WARN L293 SmtUtils]: Spent 9.70s on a formula simplification. DAG size of input: 165 DAG size of output: 130 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2023-12-24 16:44:13,577 WARN L293 SmtUtils]: Spent 8.75s on a formula simplification. DAG size of input: 165 DAG size of output: 130 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2023-12-24 16:44:25,399 WARN L293 SmtUtils]: Spent 11.11s on a formula simplification. DAG size of input: 286 DAG size of output: 1 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2023-12-24 16:44:40,017 WARN L293 SmtUtils]: Spent 14.44s on a formula simplification. DAG size of input: 224 DAG size of output: 156 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2023-12-24 16:44:48,737 WARN L293 SmtUtils]: Spent 8.42s on a formula simplification. DAG size of input: 151 DAG size of output: 118 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2023-12-24 16:44:49,104 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(line 20) the Hoare annotation is: true [2023-12-24 16:44:49,104 INFO L899 garLoopResultBuilder]: For program point L20(line 20) no Hoare annotation was computed. [2023-12-24 16:44:49,104 INFO L899 garLoopResultBuilder]: For program point L20-2(line 20) no Hoare annotation was computed. [2023-12-24 16:44:49,104 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(line 20) no Hoare annotation was computed. [2023-12-24 16:44:49,104 INFO L899 garLoopResultBuilder]: For program point L117-20(line 117) no Hoare annotation was computed. [2023-12-24 16:44:49,104 INFO L899 garLoopResultBuilder]: For program point L117-22(line 117) no Hoare annotation was computed. [2023-12-24 16:44:49,104 INFO L895 garLoopResultBuilder]: At program point L93(line 93) the Hoare annotation is: (let ((.cse10 (select (select |#memory_int#4| ~var_1_8_Pointer~0.base) ~var_1_8_Pointer~0.offset))) (let ((.cse9 ((_ extract 7 0) .cse10))) (let ((.cse3 ((_ sign_extend 16) (_ bv25 16))) (.cse11 ((_ extract 7 0) (select (select |#memory_int#7| ~var_1_12_Pointer~0.base) ~var_1_12_Pointer~0.offset))) (.cse7 ((_ zero_extend 24) .cse9))) (let ((.cse5 (= (bvadd (_ bv4 32) (select (select |#memory_int#13| ~var_1_18_Pointer~0.base) ~var_1_18_Pointer~0.offset)) (_ bv0 32))) (.cse0 (not (bvsle ((_ zero_extend 24) .cse11) (bvmul (bvsdiv .cse7 ((_ zero_extend 24) ((_ extract 7 0) (select (select |#memory_int#9| ~var_1_14_Pointer~0.base) ~var_1_14_Pointer~0.offset)))) (bvsrem (_ bv2 32) ((_ zero_extend 24) ((_ extract 7 0) (select (select |#memory_int#10| ~var_1_15_Pointer~0.base) ~var_1_15_Pointer~0.offset)))))))) (.cse6 (= (select (select |#memory_int#15| ~var_1_20_Pointer~0.base) ~var_1_20_Pointer~0.offset) ((_ sign_extend 16) ((_ zero_extend 8) .cse11)))) (.cse2 (= .cse3 (select (select |#memory_int#8| ~var_1_13_Pointer~0.base) ~var_1_13_Pointer~0.offset))) (.cse4 (= ((_ sign_extend 24) (_ bv10 8)) .cse10)) (.cse8 (= ((_ sign_extend 16) ((_ zero_extend 8) .cse9)) (select (select |#memory_int#14| ~var_1_19_Pointer~0.base) ~var_1_19_Pointer~0.offset)))) (or (let ((.cse1 ((_ sign_extend 16) (_ bv65526 16)))) (and .cse0 (= .cse1 (select (select |#memory_int#15| |~#var_1_20~0.base|) |~#var_1_20~0.offset|)) .cse2 (= .cse3 (select (select |#memory_int#8| |~#var_1_13~0.base|) |~#var_1_13~0.offset|)) .cse4 (= ~last_1_var_1_13~0 ((_ extract 15 0) .cse3)) (= ~last_1_var_1_20~0 ((_ extract 15 0) .cse1)) (not (bvsgt ((_ zero_extend 16) ((_ extract 15 0) (select (select |#memory_int#11| ~var_1_16_Pointer~0.base) ~var_1_16_Pointer~0.offset))) ((_ zero_extend 16) ((_ extract 15 0) (select (select |#memory_int#12| ~var_1_17_Pointer~0.base) ~var_1_17_Pointer~0.offset))))))) (and .cse5 .cse6 (= (select (select |#memory_int#1| ~var_1_1_Pointer~0.base) ~var_1_1_Pointer~0.offset) ((_ sign_extend 16) ((_ extract 15 0) (bvadd (bvneg .cse7) .cse7)))) .cse8) (and .cse5 .cse0 .cse6 .cse2 .cse4 .cse8)))))) [2023-12-24 16:44:49,104 INFO L899 garLoopResultBuilder]: For program point L117-24(line 117) no Hoare annotation was computed. [2023-12-24 16:44:49,104 INFO L899 garLoopResultBuilder]: For program point L93-1(line 93) no Hoare annotation was computed. [2023-12-24 16:44:49,104 INFO L899 garLoopResultBuilder]: For program point L60(lines 60 68) no Hoare annotation was computed. [2023-12-24 16:44:49,104 INFO L899 garLoopResultBuilder]: For program point L117-26(line 117) no Hoare annotation was computed. [2023-12-24 16:44:49,104 INFO L899 garLoopResultBuilder]: For program point L117-27(line 117) no Hoare annotation was computed. [2023-12-24 16:44:49,105 INFO L899 garLoopResultBuilder]: For program point L117-29(line 117) no Hoare annotation was computed. [2023-12-24 16:44:49,105 INFO L899 garLoopResultBuilder]: For program point L117-30(line 117) no Hoare annotation was computed. [2023-12-24 16:44:49,105 INFO L899 garLoopResultBuilder]: For program point L117-32(line 117) no Hoare annotation was computed. [2023-12-24 16:44:49,105 INFO L899 garLoopResultBuilder]: For program point L117-33(line 117) no Hoare annotation was computed. [2023-12-24 16:44:49,105 INFO L899 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2023-12-24 16:44:49,105 INFO L899 garLoopResultBuilder]: For program point L117-35(line 117) no Hoare annotation was computed. [2023-12-24 16:44:49,105 INFO L899 garLoopResultBuilder]: For program point L19-1(line 19) no Hoare annotation was computed. [2023-12-24 16:44:49,105 INFO L899 garLoopResultBuilder]: For program point L19-3(line 19) no Hoare annotation was computed. [2023-12-24 16:44:49,105 INFO L895 garLoopResultBuilder]: At program point L110(line 110) the Hoare annotation is: (let ((.cse8 (select (select |#memory_int#4| ~var_1_8_Pointer~0.base) ~var_1_8_Pointer~0.offset))) (let ((.cse7 ((_ extract 7 0) .cse8)) (.cse2 ((_ sign_extend 16) (_ bv25 16)))) (let ((.cse1 (= .cse2 (select (select |#memory_int#8| ~var_1_13_Pointer~0.base) ~var_1_13_Pointer~0.offset))) (.cse3 (= ((_ sign_extend 24) (_ bv10 8)) .cse8)) (.cse4 (= (bvadd (_ bv4 32) (select (select |#memory_int#13| ~var_1_18_Pointer~0.base) ~var_1_18_Pointer~0.offset)) (_ bv0 32))) (.cse5 (= ((_ sign_extend 16) ((_ zero_extend 8) .cse7)) (select (select |#memory_int#14| ~var_1_19_Pointer~0.base) ~var_1_19_Pointer~0.offset)))) (or (let ((.cse0 ((_ sign_extend 16) (_ bv65526 16)))) (and (= .cse0 (select (select |#memory_int#15| |~#var_1_20~0.base|) |~#var_1_20~0.offset|)) .cse1 (= .cse2 (select (select |#memory_int#8| |~#var_1_13~0.base|) |~#var_1_13~0.offset|)) .cse3 (= ~last_1_var_1_13~0 ((_ extract 15 0) .cse2)) (= ~last_1_var_1_20~0 ((_ extract 15 0) .cse0)))) (and .cse4 .cse1 .cse3 .cse5) (and .cse4 (= (select (select |#memory_int#1| ~var_1_1_Pointer~0.base) ~var_1_1_Pointer~0.offset) ((_ sign_extend 16) ((_ extract 15 0) (let ((.cse6 ((_ zero_extend 24) .cse7))) (bvadd (bvneg .cse6) .cse6))))) .cse5))))) [2023-12-24 16:44:49,105 INFO L899 garLoopResultBuilder]: For program point L110-1(line 110) no Hoare annotation was computed. [2023-12-24 16:44:49,105 INFO L895 garLoopResultBuilder]: At program point L102(line 102) the Hoare annotation is: (let ((.cse8 (select (select |#memory_int#4| ~var_1_8_Pointer~0.base) ~var_1_8_Pointer~0.offset))) (let ((.cse7 ((_ extract 7 0) .cse8)) (.cse5 ((_ sign_extend 16) (_ bv25 16)))) (let ((.cse1 (= .cse5 (select (select |#memory_int#8| ~var_1_13_Pointer~0.base) ~var_1_13_Pointer~0.offset))) (.cse2 (= ((_ sign_extend 24) (_ bv10 8)) .cse8)) (.cse0 (= (bvadd (_ bv4 32) (select (select |#memory_int#13| ~var_1_18_Pointer~0.base) ~var_1_18_Pointer~0.offset)) (_ bv0 32))) (.cse3 (= ((_ sign_extend 16) ((_ zero_extend 8) .cse7)) (select (select |#memory_int#14| ~var_1_19_Pointer~0.base) ~var_1_19_Pointer~0.offset)))) (or (and .cse0 .cse1 .cse2 .cse3) (let ((.cse4 ((_ sign_extend 16) (_ bv65526 16)))) (and (= .cse4 (select (select |#memory_int#15| |~#var_1_20~0.base|) |~#var_1_20~0.offset|)) .cse1 (= .cse5 (select (select |#memory_int#8| |~#var_1_13~0.base|) |~#var_1_13~0.offset|)) .cse2 (= ~last_1_var_1_13~0 ((_ extract 15 0) .cse5)) (= ~last_1_var_1_20~0 ((_ extract 15 0) .cse4)) (not (bvsgt ((_ zero_extend 16) ((_ extract 15 0) (select (select |#memory_int#11| ~var_1_16_Pointer~0.base) ~var_1_16_Pointer~0.offset))) ((_ zero_extend 16) ((_ extract 15 0) (select (select |#memory_int#12| ~var_1_17_Pointer~0.base) ~var_1_17_Pointer~0.offset))))))) (and .cse0 (= (select (select |#memory_int#1| ~var_1_1_Pointer~0.base) ~var_1_1_Pointer~0.offset) ((_ sign_extend 16) ((_ extract 15 0) (let ((.cse6 ((_ zero_extend 24) .cse7))) (bvadd (bvneg .cse6) .cse6))))) .cse3))))) [2023-12-24 16:44:49,105 INFO L899 garLoopResultBuilder]: For program point L102-1(line 102) no Hoare annotation was computed. [2023-12-24 16:44:49,105 INFO L899 garLoopResultBuilder]: For program point L61(lines 61 65) no Hoare annotation was computed. [2023-12-24 16:44:49,106 INFO L895 garLoopResultBuilder]: At program point L86(line 86) the Hoare annotation is: (let ((.cse12 (select (select |#memory_int#4| ~var_1_8_Pointer~0.base) ~var_1_8_Pointer~0.offset))) (let ((.cse13 ((_ extract 7 0) .cse12)) (.cse14 ((_ extract 7 0) (select (select |#memory_int#7| ~var_1_12_Pointer~0.base) ~var_1_12_Pointer~0.offset)))) (let ((.cse11 ((_ sign_extend 16) (_ bv25 16))) (.cse8 ((_ zero_extend 24) .cse14)) (.cse7 ((_ zero_extend 24) .cse13))) (let ((.cse0 (= (bvadd (_ bv4 32) (select (select |#memory_int#13| ~var_1_18_Pointer~0.base) ~var_1_18_Pointer~0.offset)) (_ bv0 32))) (.cse2 (= (select (select |#memory_int#15| ~var_1_20_Pointer~0.base) ~var_1_20_Pointer~0.offset) ((_ sign_extend 16) ((_ zero_extend 8) .cse14)))) (.cse5 (= ((_ sign_extend 16) ((_ zero_extend 8) .cse13)) (select (select |#memory_int#14| ~var_1_19_Pointer~0.base) ~var_1_19_Pointer~0.offset))) (.cse1 (not (bvsle .cse8 (bvmul (bvsdiv .cse7 ((_ zero_extend 24) ((_ extract 7 0) (select (select |#memory_int#9| ~var_1_14_Pointer~0.base) ~var_1_14_Pointer~0.offset)))) (bvsrem (_ bv2 32) ((_ zero_extend 24) ((_ extract 7 0) (select (select |#memory_int#10| ~var_1_15_Pointer~0.base) ~var_1_15_Pointer~0.offset)))))))) (.cse3 (= .cse11 (select (select |#memory_int#8| ~var_1_13_Pointer~0.base) ~var_1_13_Pointer~0.offset))) (.cse4 (= ((_ sign_extend 24) (_ bv10 8)) .cse12)) (.cse6 (= ((_ extract 7 0) (select (select |#memory_int#5| ~var_1_9_Pointer~0.base) ~var_1_9_Pointer~0.offset)) (_ bv0 8)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 (let ((.cse9 (= (select (select |#memory_int#1| ~var_1_1_Pointer~0.base) ~var_1_1_Pointer~0.offset) ((_ sign_extend 16) ((_ extract 15 0) (bvadd (bvneg .cse7) .cse7)))))) (or (and (= .cse7 .cse8) .cse2 .cse9) (and .cse2 .cse9 .cse6))) .cse5) (let ((.cse10 ((_ sign_extend 16) (_ bv65526 16)))) (and .cse1 (= .cse10 (select (select |#memory_int#15| |~#var_1_20~0.base|) |~#var_1_20~0.offset|)) .cse3 (= .cse11 (select (select |#memory_int#8| |~#var_1_13~0.base|) |~#var_1_13~0.offset|)) .cse4 (= ~last_1_var_1_13~0 ((_ extract 15 0) .cse11)) .cse6 (= ~last_1_var_1_20~0 ((_ extract 15 0) .cse10)) (not (bvsgt ((_ zero_extend 16) ((_ extract 15 0) (select (select |#memory_int#11| ~var_1_16_Pointer~0.base) ~var_1_16_Pointer~0.offset))) ((_ zero_extend 16) ((_ extract 15 0) (select (select |#memory_int#12| ~var_1_17_Pointer~0.base) ~var_1_17_Pointer~0.offset)))))))))))) [2023-12-24 16:44:49,106 INFO L899 garLoopResultBuilder]: For program point L86-1(line 86) no Hoare annotation was computed. [2023-12-24 16:44:49,106 INFO L895 garLoopResultBuilder]: At program point L103(line 103) the Hoare annotation is: (let ((.cse8 (select (select |#memory_int#4| ~var_1_8_Pointer~0.base) ~var_1_8_Pointer~0.offset))) (let ((.cse7 ((_ extract 7 0) .cse8)) (.cse5 ((_ sign_extend 16) (_ bv25 16)))) (let ((.cse1 (= .cse5 (select (select |#memory_int#8| ~var_1_13_Pointer~0.base) ~var_1_13_Pointer~0.offset))) (.cse2 (= ((_ sign_extend 24) (_ bv10 8)) .cse8)) (.cse0 (= (bvadd (_ bv4 32) (select (select |#memory_int#13| ~var_1_18_Pointer~0.base) ~var_1_18_Pointer~0.offset)) (_ bv0 32))) (.cse3 (= ((_ sign_extend 16) ((_ zero_extend 8) .cse7)) (select (select |#memory_int#14| ~var_1_19_Pointer~0.base) ~var_1_19_Pointer~0.offset)))) (or (and .cse0 .cse1 .cse2 .cse3) (let ((.cse4 ((_ sign_extend 16) (_ bv65526 16)))) (and (= .cse4 (select (select |#memory_int#15| |~#var_1_20~0.base|) |~#var_1_20~0.offset|)) .cse1 (= .cse5 (select (select |#memory_int#8| |~#var_1_13~0.base|) |~#var_1_13~0.offset|)) .cse2 (= ~last_1_var_1_13~0 ((_ extract 15 0) .cse5)) (= ~last_1_var_1_20~0 ((_ extract 15 0) .cse4)) (not (bvsgt ((_ zero_extend 16) ((_ extract 15 0) (select (select |#memory_int#11| ~var_1_16_Pointer~0.base) ~var_1_16_Pointer~0.offset))) ((_ zero_extend 16) ((_ extract 15 0) (select (select |#memory_int#12| ~var_1_17_Pointer~0.base) ~var_1_17_Pointer~0.offset))))))) (and .cse0 (= (select (select |#memory_int#1| ~var_1_1_Pointer~0.base) ~var_1_1_Pointer~0.offset) ((_ sign_extend 16) ((_ extract 15 0) (let ((.cse6 ((_ zero_extend 24) .cse7))) (bvadd (bvneg .cse6) .cse6))))) .cse3))))) [2023-12-24 16:44:49,106 INFO L899 garLoopResultBuilder]: For program point L103-1(line 103) no Hoare annotation was computed. [2023-12-24 16:44:49,106 INFO L899 garLoopResultBuilder]: For program point L70(lines 70 72) no Hoare annotation was computed. [2023-12-24 16:44:49,106 INFO L899 garLoopResultBuilder]: For program point L70-2(lines 70 72) no Hoare annotation was computed. [2023-12-24 16:44:49,106 INFO L895 garLoopResultBuilder]: At program point L95(line 95) the Hoare annotation is: (let ((.cse8 (select (select |#memory_int#4| ~var_1_8_Pointer~0.base) ~var_1_8_Pointer~0.offset))) (let ((.cse7 ((_ extract 7 0) .cse8)) (.cse5 ((_ sign_extend 16) (_ bv25 16)))) (let ((.cse1 (= .cse5 (select (select |#memory_int#8| ~var_1_13_Pointer~0.base) ~var_1_13_Pointer~0.offset))) (.cse2 (= ((_ sign_extend 24) (_ bv10 8)) .cse8)) (.cse0 (= (bvadd (_ bv4 32) (select (select |#memory_int#13| ~var_1_18_Pointer~0.base) ~var_1_18_Pointer~0.offset)) (_ bv0 32))) (.cse3 (= ((_ sign_extend 16) ((_ zero_extend 8) .cse7)) (select (select |#memory_int#14| ~var_1_19_Pointer~0.base) ~var_1_19_Pointer~0.offset)))) (or (and .cse0 .cse1 .cse2 .cse3) (let ((.cse4 ((_ sign_extend 16) (_ bv65526 16)))) (and (= .cse4 (select (select |#memory_int#15| |~#var_1_20~0.base|) |~#var_1_20~0.offset|)) .cse1 (= .cse5 (select (select |#memory_int#8| |~#var_1_13~0.base|) |~#var_1_13~0.offset|)) .cse2 (= ~last_1_var_1_13~0 ((_ extract 15 0) .cse5)) (= ~last_1_var_1_20~0 ((_ extract 15 0) .cse4)) (not (bvsgt ((_ zero_extend 16) ((_ extract 15 0) (select (select |#memory_int#11| ~var_1_16_Pointer~0.base) ~var_1_16_Pointer~0.offset))) ((_ zero_extend 16) ((_ extract 15 0) (select (select |#memory_int#12| ~var_1_17_Pointer~0.base) ~var_1_17_Pointer~0.offset))))))) (and .cse0 (= (select (select |#memory_int#1| ~var_1_1_Pointer~0.base) ~var_1_1_Pointer~0.offset) ((_ sign_extend 16) ((_ extract 15 0) (let ((.cse6 ((_ zero_extend 24) .cse7))) (bvadd (bvneg .cse6) .cse6))))) .cse3))))) [2023-12-24 16:44:49,106 INFO L899 garLoopResultBuilder]: For program point L95-1(line 95) no Hoare annotation was computed. [2023-12-24 16:44:49,106 INFO L895 garLoopResultBuilder]: At program point L87(line 87) the Hoare annotation is: (let ((.cse12 (select (select |#memory_int#4| ~var_1_8_Pointer~0.base) ~var_1_8_Pointer~0.offset))) (let ((.cse13 ((_ extract 7 0) .cse12)) (.cse14 ((_ extract 7 0) (select (select |#memory_int#7| ~var_1_12_Pointer~0.base) ~var_1_12_Pointer~0.offset)))) (let ((.cse11 ((_ sign_extend 16) (_ bv25 16))) (.cse8 ((_ zero_extend 24) .cse14)) (.cse7 ((_ zero_extend 24) .cse13))) (let ((.cse0 (= (bvadd (_ bv4 32) (select (select |#memory_int#13| ~var_1_18_Pointer~0.base) ~var_1_18_Pointer~0.offset)) (_ bv0 32))) (.cse2 (= (select (select |#memory_int#15| ~var_1_20_Pointer~0.base) ~var_1_20_Pointer~0.offset) ((_ sign_extend 16) ((_ zero_extend 8) .cse14)))) (.cse5 (= ((_ sign_extend 16) ((_ zero_extend 8) .cse13)) (select (select |#memory_int#14| ~var_1_19_Pointer~0.base) ~var_1_19_Pointer~0.offset))) (.cse1 (not (bvsle .cse8 (bvmul (bvsdiv .cse7 ((_ zero_extend 24) ((_ extract 7 0) (select (select |#memory_int#9| ~var_1_14_Pointer~0.base) ~var_1_14_Pointer~0.offset)))) (bvsrem (_ bv2 32) ((_ zero_extend 24) ((_ extract 7 0) (select (select |#memory_int#10| ~var_1_15_Pointer~0.base) ~var_1_15_Pointer~0.offset)))))))) (.cse3 (= .cse11 (select (select |#memory_int#8| ~var_1_13_Pointer~0.base) ~var_1_13_Pointer~0.offset))) (.cse4 (= ((_ sign_extend 24) (_ bv10 8)) .cse12)) (.cse6 (= ((_ extract 7 0) (select (select |#memory_int#5| ~var_1_9_Pointer~0.base) ~var_1_9_Pointer~0.offset)) (_ bv0 8)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 (let ((.cse9 (= (select (select |#memory_int#1| ~var_1_1_Pointer~0.base) ~var_1_1_Pointer~0.offset) ((_ sign_extend 16) ((_ extract 15 0) (bvadd (bvneg .cse7) .cse7)))))) (or (and (= .cse7 .cse8) .cse2 .cse9) (and .cse2 .cse9 .cse6))) .cse5) (let ((.cse10 ((_ sign_extend 16) (_ bv65526 16)))) (and .cse1 (= .cse10 (select (select |#memory_int#15| |~#var_1_20~0.base|) |~#var_1_20~0.offset|)) .cse3 (= .cse11 (select (select |#memory_int#8| |~#var_1_13~0.base|) |~#var_1_13~0.offset|)) .cse4 (= ~last_1_var_1_13~0 ((_ extract 15 0) .cse11)) .cse6 (= ~last_1_var_1_20~0 ((_ extract 15 0) .cse10)) (not (bvsgt ((_ zero_extend 16) ((_ extract 15 0) (select (select |#memory_int#11| ~var_1_16_Pointer~0.base) ~var_1_16_Pointer~0.offset))) ((_ zero_extend 16) ((_ extract 15 0) (select (select |#memory_int#12| ~var_1_17_Pointer~0.base) ~var_1_17_Pointer~0.offset)))))))))))) [2023-12-24 16:44:49,106 INFO L899 garLoopResultBuilder]: For program point L87-1(line 87) no Hoare annotation was computed. [2023-12-24 16:44:49,106 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-12-24 16:44:49,107 INFO L895 garLoopResultBuilder]: At program point L104(line 104) the Hoare annotation is: (let ((.cse8 (select (select |#memory_int#4| ~var_1_8_Pointer~0.base) ~var_1_8_Pointer~0.offset))) (let ((.cse7 ((_ extract 7 0) .cse8)) (.cse5 ((_ sign_extend 16) (_ bv25 16)))) (let ((.cse1 (= .cse5 (select (select |#memory_int#8| ~var_1_13_Pointer~0.base) ~var_1_13_Pointer~0.offset))) (.cse2 (= ((_ sign_extend 24) (_ bv10 8)) .cse8)) (.cse0 (= (bvadd (_ bv4 32) (select (select |#memory_int#13| ~var_1_18_Pointer~0.base) ~var_1_18_Pointer~0.offset)) (_ bv0 32))) (.cse3 (= ((_ sign_extend 16) ((_ zero_extend 8) .cse7)) (select (select |#memory_int#14| ~var_1_19_Pointer~0.base) ~var_1_19_Pointer~0.offset)))) (or (and .cse0 .cse1 .cse2 .cse3) (let ((.cse4 ((_ sign_extend 16) (_ bv65526 16)))) (and (= .cse4 (select (select |#memory_int#15| |~#var_1_20~0.base|) |~#var_1_20~0.offset|)) .cse1 (= .cse5 (select (select |#memory_int#8| |~#var_1_13~0.base|) |~#var_1_13~0.offset|)) .cse2 (= ~last_1_var_1_13~0 ((_ extract 15 0) .cse5)) (= ~last_1_var_1_20~0 ((_ extract 15 0) .cse4)) (not (bvsgt ((_ zero_extend 16) ((_ extract 15 0) (select (select |#memory_int#11| ~var_1_16_Pointer~0.base) ~var_1_16_Pointer~0.offset))) ((_ zero_extend 16) ((_ extract 15 0) (select (select |#memory_int#12| ~var_1_17_Pointer~0.base) ~var_1_17_Pointer~0.offset))))))) (and .cse0 (= (select (select |#memory_int#1| ~var_1_1_Pointer~0.base) ~var_1_1_Pointer~0.offset) ((_ sign_extend 16) ((_ extract 15 0) (let ((.cse6 ((_ zero_extend 24) .cse7))) (bvadd (bvneg .cse6) .cse6))))) .cse3))))) [2023-12-24 16:44:49,107 INFO L899 garLoopResultBuilder]: For program point L104-1(line 104) no Hoare annotation was computed. [2023-12-24 16:44:49,107 INFO L899 garLoopResultBuilder]: For program point L71(line 71) no Hoare annotation was computed. [2023-12-24 16:44:49,107 INFO L899 garLoopResultBuilder]: For program point L71-2(line 71) no Hoare annotation was computed. [2023-12-24 16:44:49,107 INFO L895 garLoopResultBuilder]: At program point L96(line 96) the Hoare annotation is: (let ((.cse8 (select (select |#memory_int#4| ~var_1_8_Pointer~0.base) ~var_1_8_Pointer~0.offset))) (let ((.cse7 ((_ extract 7 0) .cse8)) (.cse5 ((_ sign_extend 16) (_ bv25 16)))) (let ((.cse1 (= .cse5 (select (select |#memory_int#8| ~var_1_13_Pointer~0.base) ~var_1_13_Pointer~0.offset))) (.cse2 (= ((_ sign_extend 24) (_ bv10 8)) .cse8)) (.cse0 (= (bvadd (_ bv4 32) (select (select |#memory_int#13| ~var_1_18_Pointer~0.base) ~var_1_18_Pointer~0.offset)) (_ bv0 32))) (.cse3 (= ((_ sign_extend 16) ((_ zero_extend 8) .cse7)) (select (select |#memory_int#14| ~var_1_19_Pointer~0.base) ~var_1_19_Pointer~0.offset)))) (or (and .cse0 .cse1 .cse2 .cse3) (let ((.cse4 ((_ sign_extend 16) (_ bv65526 16)))) (and (= .cse4 (select (select |#memory_int#15| |~#var_1_20~0.base|) |~#var_1_20~0.offset|)) .cse1 (= .cse5 (select (select |#memory_int#8| |~#var_1_13~0.base|) |~#var_1_13~0.offset|)) .cse2 (= ~last_1_var_1_13~0 ((_ extract 15 0) .cse5)) (= ~last_1_var_1_20~0 ((_ extract 15 0) .cse4)) (not (bvsgt ((_ zero_extend 16) ((_ extract 15 0) (select (select |#memory_int#11| ~var_1_16_Pointer~0.base) ~var_1_16_Pointer~0.offset))) ((_ zero_extend 16) ((_ extract 15 0) (select (select |#memory_int#12| ~var_1_17_Pointer~0.base) ~var_1_17_Pointer~0.offset))))))) (and .cse0 (= (select (select |#memory_int#1| ~var_1_1_Pointer~0.base) ~var_1_1_Pointer~0.offset) ((_ sign_extend 16) ((_ extract 15 0) (let ((.cse6 ((_ zero_extend 24) .cse7))) (bvadd (bvneg .cse6) .cse6))))) .cse3))))) [2023-12-24 16:44:49,107 INFO L899 garLoopResultBuilder]: For program point L96-1(line 96) no Hoare annotation was computed. [2023-12-24 16:44:49,107 INFO L895 garLoopResultBuilder]: At program point L89(line 89) the Hoare annotation is: (let ((.cse10 (select (select |#memory_int#4| ~var_1_8_Pointer~0.base) ~var_1_8_Pointer~0.offset))) (let ((.cse9 ((_ extract 7 0) .cse10))) (let ((.cse3 ((_ sign_extend 16) (_ bv25 16))) (.cse11 ((_ extract 7 0) (select (select |#memory_int#7| ~var_1_12_Pointer~0.base) ~var_1_12_Pointer~0.offset))) (.cse7 ((_ zero_extend 24) .cse9))) (let ((.cse5 (= (bvadd (_ bv4 32) (select (select |#memory_int#13| ~var_1_18_Pointer~0.base) ~var_1_18_Pointer~0.offset)) (_ bv0 32))) (.cse0 (not (bvsle ((_ zero_extend 24) .cse11) (bvmul (bvsdiv .cse7 ((_ zero_extend 24) ((_ extract 7 0) (select (select |#memory_int#9| ~var_1_14_Pointer~0.base) ~var_1_14_Pointer~0.offset)))) (bvsrem (_ bv2 32) ((_ zero_extend 24) ((_ extract 7 0) (select (select |#memory_int#10| ~var_1_15_Pointer~0.base) ~var_1_15_Pointer~0.offset)))))))) (.cse6 (= (select (select |#memory_int#15| ~var_1_20_Pointer~0.base) ~var_1_20_Pointer~0.offset) ((_ sign_extend 16) ((_ zero_extend 8) .cse11)))) (.cse2 (= .cse3 (select (select |#memory_int#8| ~var_1_13_Pointer~0.base) ~var_1_13_Pointer~0.offset))) (.cse4 (= ((_ sign_extend 24) (_ bv10 8)) .cse10)) (.cse8 (= ((_ sign_extend 16) ((_ zero_extend 8) .cse9)) (select (select |#memory_int#14| ~var_1_19_Pointer~0.base) ~var_1_19_Pointer~0.offset)))) (or (let ((.cse1 ((_ sign_extend 16) (_ bv65526 16)))) (and .cse0 (= .cse1 (select (select |#memory_int#15| |~#var_1_20~0.base|) |~#var_1_20~0.offset|)) .cse2 (= .cse3 (select (select |#memory_int#8| |~#var_1_13~0.base|) |~#var_1_13~0.offset|)) .cse4 (= ~last_1_var_1_13~0 ((_ extract 15 0) .cse3)) (= ~last_1_var_1_20~0 ((_ extract 15 0) .cse1)) (not (bvsgt ((_ zero_extend 16) ((_ extract 15 0) (select (select |#memory_int#11| ~var_1_16_Pointer~0.base) ~var_1_16_Pointer~0.offset))) ((_ zero_extend 16) ((_ extract 15 0) (select (select |#memory_int#12| ~var_1_17_Pointer~0.base) ~var_1_17_Pointer~0.offset))))))) (and .cse5 .cse6 (= (select (select |#memory_int#1| ~var_1_1_Pointer~0.base) ~var_1_1_Pointer~0.offset) ((_ sign_extend 16) ((_ extract 15 0) (bvadd (bvneg .cse7) .cse7)))) .cse8) (and .cse5 .cse0 .cse6 .cse2 .cse4 .cse8)))))) [2023-12-24 16:44:49,107 INFO L899 garLoopResultBuilder]: For program point L89-1(line 89) no Hoare annotation was computed. [2023-12-24 16:44:49,107 INFO L895 garLoopResultBuilder]: At program point L106(line 106) the Hoare annotation is: (let ((.cse8 (select (select |#memory_int#4| ~var_1_8_Pointer~0.base) ~var_1_8_Pointer~0.offset))) (let ((.cse7 ((_ extract 7 0) .cse8)) (.cse2 ((_ sign_extend 16) (_ bv25 16)))) (let ((.cse1 (= .cse2 (select (select |#memory_int#8| ~var_1_13_Pointer~0.base) ~var_1_13_Pointer~0.offset))) (.cse3 (= ((_ sign_extend 24) (_ bv10 8)) .cse8)) (.cse4 (= (bvadd (_ bv4 32) (select (select |#memory_int#13| ~var_1_18_Pointer~0.base) ~var_1_18_Pointer~0.offset)) (_ bv0 32))) (.cse5 (= ((_ sign_extend 16) ((_ zero_extend 8) .cse7)) (select (select |#memory_int#14| ~var_1_19_Pointer~0.base) ~var_1_19_Pointer~0.offset)))) (or (let ((.cse0 ((_ sign_extend 16) (_ bv65526 16)))) (and (= .cse0 (select (select |#memory_int#15| |~#var_1_20~0.base|) |~#var_1_20~0.offset|)) .cse1 (= .cse2 (select (select |#memory_int#8| |~#var_1_13~0.base|) |~#var_1_13~0.offset|)) .cse3 (= ~last_1_var_1_13~0 ((_ extract 15 0) .cse2)) (= ~last_1_var_1_20~0 ((_ extract 15 0) .cse0)))) (and .cse4 .cse1 .cse3 .cse5) (and .cse4 (= (select (select |#memory_int#1| ~var_1_1_Pointer~0.base) ~var_1_1_Pointer~0.offset) ((_ sign_extend 16) ((_ extract 15 0) (let ((.cse6 ((_ zero_extend 24) .cse7))) (bvadd (bvneg .cse6) .cse6))))) .cse5))))) [2023-12-24 16:44:49,107 INFO L899 garLoopResultBuilder]: For program point L106-1(line 106) no Hoare annotation was computed. [2023-12-24 16:44:49,108 INFO L895 garLoopResultBuilder]: At program point L98(line 98) the Hoare annotation is: (let ((.cse8 (select (select |#memory_int#4| ~var_1_8_Pointer~0.base) ~var_1_8_Pointer~0.offset))) (let ((.cse7 ((_ extract 7 0) .cse8)) (.cse5 ((_ sign_extend 16) (_ bv25 16)))) (let ((.cse1 (= .cse5 (select (select |#memory_int#8| ~var_1_13_Pointer~0.base) ~var_1_13_Pointer~0.offset))) (.cse2 (= ((_ sign_extend 24) (_ bv10 8)) .cse8)) (.cse0 (= (bvadd (_ bv4 32) (select (select |#memory_int#13| ~var_1_18_Pointer~0.base) ~var_1_18_Pointer~0.offset)) (_ bv0 32))) (.cse3 (= ((_ sign_extend 16) ((_ zero_extend 8) .cse7)) (select (select |#memory_int#14| ~var_1_19_Pointer~0.base) ~var_1_19_Pointer~0.offset)))) (or (and .cse0 .cse1 .cse2 .cse3) (let ((.cse4 ((_ sign_extend 16) (_ bv65526 16)))) (and (= .cse4 (select (select |#memory_int#15| |~#var_1_20~0.base|) |~#var_1_20~0.offset|)) .cse1 (= .cse5 (select (select |#memory_int#8| |~#var_1_13~0.base|) |~#var_1_13~0.offset|)) .cse2 (= ~last_1_var_1_13~0 ((_ extract 15 0) .cse5)) (= ~last_1_var_1_20~0 ((_ extract 15 0) .cse4)) (not (bvsgt ((_ zero_extend 16) ((_ extract 15 0) (select (select |#memory_int#11| ~var_1_16_Pointer~0.base) ~var_1_16_Pointer~0.offset))) ((_ zero_extend 16) ((_ extract 15 0) (select (select |#memory_int#12| ~var_1_17_Pointer~0.base) ~var_1_17_Pointer~0.offset))))))) (and .cse0 (= (select (select |#memory_int#1| ~var_1_1_Pointer~0.base) ~var_1_1_Pointer~0.offset) ((_ sign_extend 16) ((_ extract 15 0) (let ((.cse6 ((_ zero_extend 24) .cse7))) (bvadd (bvneg .cse6) .cse6))))) .cse3))))) [2023-12-24 16:44:49,108 INFO L899 garLoopResultBuilder]: For program point L98-1(line 98) no Hoare annotation was computed. [2023-12-24 16:44:49,108 INFO L895 garLoopResultBuilder]: At program point L90(line 90) the Hoare annotation is: (let ((.cse10 (select (select |#memory_int#4| ~var_1_8_Pointer~0.base) ~var_1_8_Pointer~0.offset))) (let ((.cse9 ((_ extract 7 0) .cse10))) (let ((.cse3 ((_ sign_extend 16) (_ bv25 16))) (.cse11 ((_ extract 7 0) (select (select |#memory_int#7| ~var_1_12_Pointer~0.base) ~var_1_12_Pointer~0.offset))) (.cse7 ((_ zero_extend 24) .cse9))) (let ((.cse5 (= (bvadd (_ bv4 32) (select (select |#memory_int#13| ~var_1_18_Pointer~0.base) ~var_1_18_Pointer~0.offset)) (_ bv0 32))) (.cse0 (not (bvsle ((_ zero_extend 24) .cse11) (bvmul (bvsdiv .cse7 ((_ zero_extend 24) ((_ extract 7 0) (select (select |#memory_int#9| ~var_1_14_Pointer~0.base) ~var_1_14_Pointer~0.offset)))) (bvsrem (_ bv2 32) ((_ zero_extend 24) ((_ extract 7 0) (select (select |#memory_int#10| ~var_1_15_Pointer~0.base) ~var_1_15_Pointer~0.offset)))))))) (.cse6 (= (select (select |#memory_int#15| ~var_1_20_Pointer~0.base) ~var_1_20_Pointer~0.offset) ((_ sign_extend 16) ((_ zero_extend 8) .cse11)))) (.cse2 (= .cse3 (select (select |#memory_int#8| ~var_1_13_Pointer~0.base) ~var_1_13_Pointer~0.offset))) (.cse4 (= ((_ sign_extend 24) (_ bv10 8)) .cse10)) (.cse8 (= ((_ sign_extend 16) ((_ zero_extend 8) .cse9)) (select (select |#memory_int#14| ~var_1_19_Pointer~0.base) ~var_1_19_Pointer~0.offset)))) (or (let ((.cse1 ((_ sign_extend 16) (_ bv65526 16)))) (and .cse0 (= .cse1 (select (select |#memory_int#15| |~#var_1_20~0.base|) |~#var_1_20~0.offset|)) .cse2 (= .cse3 (select (select |#memory_int#8| |~#var_1_13~0.base|) |~#var_1_13~0.offset|)) .cse4 (= ~last_1_var_1_13~0 ((_ extract 15 0) .cse3)) (= ~last_1_var_1_20~0 ((_ extract 15 0) .cse1)) (not (bvsgt ((_ zero_extend 16) ((_ extract 15 0) (select (select |#memory_int#11| ~var_1_16_Pointer~0.base) ~var_1_16_Pointer~0.offset))) ((_ zero_extend 16) ((_ extract 15 0) (select (select |#memory_int#12| ~var_1_17_Pointer~0.base) ~var_1_17_Pointer~0.offset))))))) (and .cse5 .cse6 (= (select (select |#memory_int#1| ~var_1_1_Pointer~0.base) ~var_1_1_Pointer~0.offset) ((_ sign_extend 16) ((_ extract 15 0) (bvadd (bvneg .cse7) .cse7)))) .cse8) (and .cse5 .cse0 .cse6 .cse2 .cse4 .cse8)))))) [2023-12-24 16:44:49,108 INFO L899 garLoopResultBuilder]: For program point L90-1(line 90) no Hoare annotation was computed. [2023-12-24 16:44:49,108 INFO L895 garLoopResultBuilder]: At program point L123-2(lines 123 129) the Hoare annotation is: (let ((.cse14 (select (select |#memory_int#4| ~var_1_8_Pointer~0.base) ~var_1_8_Pointer~0.offset))) (let ((.cse12 ((_ extract 7 0) .cse14)) (.cse13 ((_ extract 7 0) (select (select |#memory_int#7| ~var_1_12_Pointer~0.base) ~var_1_12_Pointer~0.offset)))) (let ((.cse3 ((_ sign_extend 16) (_ bv25 16))) (.cse10 ((_ zero_extend 24) .cse13)) (.cse9 ((_ zero_extend 24) .cse12))) (let ((.cse0 (not (bvsle .cse10 (bvmul (bvsdiv .cse9 ((_ zero_extend 24) ((_ extract 7 0) (select (select |#memory_int#9| ~var_1_14_Pointer~0.base) ~var_1_14_Pointer~0.offset)))) (bvsrem (_ bv2 32) ((_ zero_extend 24) ((_ extract 7 0) (select (select |#memory_int#10| ~var_1_15_Pointer~0.base) ~var_1_15_Pointer~0.offset)))))))) (.cse2 (= .cse3 (select (select |#memory_int#8| ~var_1_13_Pointer~0.base) ~var_1_13_Pointer~0.offset))) (.cse4 (= ((_ sign_extend 24) (_ bv10 8)) .cse14)) (.cse6 (= (bvadd (_ bv4 32) (select (select |#memory_int#13| ~var_1_18_Pointer~0.base) ~var_1_18_Pointer~0.offset)) (_ bv0 32))) (.cse7 (= (select (select |#memory_int#15| ~var_1_20_Pointer~0.base) ~var_1_20_Pointer~0.offset) ((_ sign_extend 16) ((_ zero_extend 8) .cse13)))) (.cse5 (= ((_ extract 7 0) (select (select |#memory_int#5| ~var_1_9_Pointer~0.base) ~var_1_9_Pointer~0.offset)) (_ bv0 8))) (.cse8 (= ((_ sign_extend 16) ((_ zero_extend 8) .cse12)) (select (select |#memory_int#14| ~var_1_19_Pointer~0.base) ~var_1_19_Pointer~0.offset)))) (or (let ((.cse1 ((_ sign_extend 16) (_ bv65526 16)))) (and .cse0 (not (bvsgt ((_ sign_extend 16) ((_ extract 15 0) (select (select |#memory_int#3| ~var_1_7_Pointer~0.base) ~var_1_7_Pointer~0.offset))) (bvadd ((_ sign_extend 16) ((_ extract 15 0) (select (select |#memory_int#2| ~var_1_6_Pointer~0.base) ~var_1_6_Pointer~0.offset))) (bvneg ((_ sign_extend 16) ((_ extract 15 0) (select (select |#memory_int#6| ~var_1_10_Pointer~0.base) ~var_1_10_Pointer~0.offset)))) ((_ zero_extend 16) ~last_1_var_1_13~0)))) (= .cse1 (select (select |#memory_int#15| |~#var_1_20~0.base|) |~#var_1_20~0.offset|)) .cse2 (= .cse3 (select (select |#memory_int#8| |~#var_1_13~0.base|) |~#var_1_13~0.offset|)) .cse4 (= ~last_1_var_1_13~0 ((_ extract 15 0) .cse3)) .cse5 (= ~last_1_var_1_20~0 ((_ extract 15 0) .cse1)) (not (bvsgt ((_ zero_extend 16) ((_ extract 15 0) (select (select |#memory_int#11| ~var_1_16_Pointer~0.base) ~var_1_16_Pointer~0.offset))) ((_ zero_extend 16) ((_ extract 15 0) (select (select |#memory_int#12| ~var_1_17_Pointer~0.base) ~var_1_17_Pointer~0.offset))))))) (and .cse6 .cse0 .cse7 .cse2 .cse4 .cse8 .cse5) (and .cse6 (let ((.cse11 (= (select (select |#memory_int#1| ~var_1_1_Pointer~0.base) ~var_1_1_Pointer~0.offset) ((_ sign_extend 16) ((_ extract 15 0) (bvadd (bvneg .cse9) .cse9)))))) (or (and (= .cse9 .cse10) .cse7 .cse11) (and .cse7 .cse11 .cse5))) .cse8)))))) [2023-12-24 16:44:49,108 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2023-12-24 16:44:49,108 INFO L899 garLoopResultBuilder]: For program point L123-3(lines 123 129) no Hoare annotation was computed. [2023-12-24 16:44:49,108 INFO L895 garLoopResultBuilder]: At program point L107(line 107) the Hoare annotation is: (let ((.cse8 (select (select |#memory_int#4| ~var_1_8_Pointer~0.base) ~var_1_8_Pointer~0.offset))) (let ((.cse7 ((_ extract 7 0) .cse8)) (.cse2 ((_ sign_extend 16) (_ bv25 16)))) (let ((.cse1 (= .cse2 (select (select |#memory_int#8| ~var_1_13_Pointer~0.base) ~var_1_13_Pointer~0.offset))) (.cse3 (= ((_ sign_extend 24) (_ bv10 8)) .cse8)) (.cse4 (= (bvadd (_ bv4 32) (select (select |#memory_int#13| ~var_1_18_Pointer~0.base) ~var_1_18_Pointer~0.offset)) (_ bv0 32))) (.cse5 (= ((_ sign_extend 16) ((_ zero_extend 8) .cse7)) (select (select |#memory_int#14| ~var_1_19_Pointer~0.base) ~var_1_19_Pointer~0.offset)))) (or (let ((.cse0 ((_ sign_extend 16) (_ bv65526 16)))) (and (= .cse0 (select (select |#memory_int#15| |~#var_1_20~0.base|) |~#var_1_20~0.offset|)) .cse1 (= .cse2 (select (select |#memory_int#8| |~#var_1_13~0.base|) |~#var_1_13~0.offset|)) .cse3 (= ~last_1_var_1_13~0 ((_ extract 15 0) .cse2)) (= ~last_1_var_1_20~0 ((_ extract 15 0) .cse0)))) (and .cse4 .cse1 .cse3 .cse5) (and .cse4 (= (select (select |#memory_int#1| ~var_1_1_Pointer~0.base) ~var_1_1_Pointer~0.offset) ((_ sign_extend 16) ((_ extract 15 0) (let ((.cse6 ((_ zero_extend 24) .cse7))) (bvadd (bvneg .cse6) .cse6))))) .cse5))))) [2023-12-24 16:44:49,108 INFO L899 garLoopResultBuilder]: For program point L107-1(line 107) no Hoare annotation was computed. [2023-12-24 16:44:49,109 INFO L899 garLoopResultBuilder]: For program point L74(lines 74 76) no Hoare annotation was computed. [2023-12-24 16:44:49,109 INFO L899 garLoopResultBuilder]: For program point L74-2(lines 74 76) no Hoare annotation was computed. [2023-12-24 16:44:49,109 INFO L895 garLoopResultBuilder]: At program point L99(line 99) the Hoare annotation is: (let ((.cse8 (select (select |#memory_int#4| ~var_1_8_Pointer~0.base) ~var_1_8_Pointer~0.offset))) (let ((.cse7 ((_ extract 7 0) .cse8)) (.cse5 ((_ sign_extend 16) (_ bv25 16)))) (let ((.cse1 (= .cse5 (select (select |#memory_int#8| ~var_1_13_Pointer~0.base) ~var_1_13_Pointer~0.offset))) (.cse2 (= ((_ sign_extend 24) (_ bv10 8)) .cse8)) (.cse0 (= (bvadd (_ bv4 32) (select (select |#memory_int#13| ~var_1_18_Pointer~0.base) ~var_1_18_Pointer~0.offset)) (_ bv0 32))) (.cse3 (= ((_ sign_extend 16) ((_ zero_extend 8) .cse7)) (select (select |#memory_int#14| ~var_1_19_Pointer~0.base) ~var_1_19_Pointer~0.offset)))) (or (and .cse0 .cse1 .cse2 .cse3) (let ((.cse4 ((_ sign_extend 16) (_ bv65526 16)))) (and (= .cse4 (select (select |#memory_int#15| |~#var_1_20~0.base|) |~#var_1_20~0.offset|)) .cse1 (= .cse5 (select (select |#memory_int#8| |~#var_1_13~0.base|) |~#var_1_13~0.offset|)) .cse2 (= ~last_1_var_1_13~0 ((_ extract 15 0) .cse5)) (= ~last_1_var_1_20~0 ((_ extract 15 0) .cse4)) (not (bvsgt ((_ zero_extend 16) ((_ extract 15 0) (select (select |#memory_int#11| ~var_1_16_Pointer~0.base) ~var_1_16_Pointer~0.offset))) ((_ zero_extend 16) ((_ extract 15 0) (select (select |#memory_int#12| ~var_1_17_Pointer~0.base) ~var_1_17_Pointer~0.offset))))))) (and .cse0 (= (select (select |#memory_int#1| ~var_1_1_Pointer~0.base) ~var_1_1_Pointer~0.offset) ((_ sign_extend 16) ((_ extract 15 0) (let ((.cse6 ((_ zero_extend 24) .cse7))) (bvadd (bvneg .cse6) .cse6))))) .cse3))))) [2023-12-24 16:44:49,109 INFO L899 garLoopResultBuilder]: For program point L99-1(line 99) no Hoare annotation was computed. [2023-12-24 16:44:49,109 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-12-24 16:44:49,109 INFO L895 garLoopResultBuilder]: At program point L83(line 83) the Hoare annotation is: (let ((.cse12 (select (select |#memory_int#4| ~var_1_8_Pointer~0.base) ~var_1_8_Pointer~0.offset))) (let ((.cse13 ((_ extract 7 0) .cse12)) (.cse14 ((_ extract 7 0) (select (select |#memory_int#7| ~var_1_12_Pointer~0.base) ~var_1_12_Pointer~0.offset)))) (let ((.cse11 ((_ sign_extend 16) (_ bv25 16))) (.cse8 ((_ zero_extend 24) .cse14)) (.cse7 ((_ zero_extend 24) .cse13))) (let ((.cse0 (= (bvadd (_ bv4 32) (select (select |#memory_int#13| ~var_1_18_Pointer~0.base) ~var_1_18_Pointer~0.offset)) (_ bv0 32))) (.cse2 (= (select (select |#memory_int#15| ~var_1_20_Pointer~0.base) ~var_1_20_Pointer~0.offset) ((_ sign_extend 16) ((_ zero_extend 8) .cse14)))) (.cse5 (= ((_ sign_extend 16) ((_ zero_extend 8) .cse13)) (select (select |#memory_int#14| ~var_1_19_Pointer~0.base) ~var_1_19_Pointer~0.offset))) (.cse1 (not (bvsle .cse8 (bvmul (bvsdiv .cse7 ((_ zero_extend 24) ((_ extract 7 0) (select (select |#memory_int#9| ~var_1_14_Pointer~0.base) ~var_1_14_Pointer~0.offset)))) (bvsrem (_ bv2 32) ((_ zero_extend 24) ((_ extract 7 0) (select (select |#memory_int#10| ~var_1_15_Pointer~0.base) ~var_1_15_Pointer~0.offset)))))))) (.cse3 (= .cse11 (select (select |#memory_int#8| ~var_1_13_Pointer~0.base) ~var_1_13_Pointer~0.offset))) (.cse4 (= ((_ sign_extend 24) (_ bv10 8)) .cse12)) (.cse6 (= ((_ extract 7 0) (select (select |#memory_int#5| ~var_1_9_Pointer~0.base) ~var_1_9_Pointer~0.offset)) (_ bv0 8)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 (let ((.cse9 (= (select (select |#memory_int#1| ~var_1_1_Pointer~0.base) ~var_1_1_Pointer~0.offset) ((_ sign_extend 16) ((_ extract 15 0) (bvadd (bvneg .cse7) .cse7)))))) (or (and (= .cse7 .cse8) .cse2 .cse9) (and .cse2 .cse9 .cse6))) .cse5) (let ((.cse10 ((_ sign_extend 16) (_ bv65526 16)))) (and .cse1 (= .cse10 (select (select |#memory_int#15| |~#var_1_20~0.base|) |~#var_1_20~0.offset|)) .cse3 (= .cse11 (select (select |#memory_int#8| |~#var_1_13~0.base|) |~#var_1_13~0.offset|)) .cse4 (= ~last_1_var_1_13~0 ((_ extract 15 0) .cse11)) .cse6 (= ~last_1_var_1_20~0 ((_ extract 15 0) .cse10)) (not (bvsgt ((_ zero_extend 16) ((_ extract 15 0) (select (select |#memory_int#11| ~var_1_16_Pointer~0.base) ~var_1_16_Pointer~0.offset))) ((_ zero_extend 16) ((_ extract 15 0) (select (select |#memory_int#12| ~var_1_17_Pointer~0.base) ~var_1_17_Pointer~0.offset)))))))))))) [2023-12-24 16:44:49,109 INFO L899 garLoopResultBuilder]: For program point L83-1(line 83) no Hoare annotation was computed. [2023-12-24 16:44:49,109 INFO L899 garLoopResultBuilder]: For program point L75(line 75) no Hoare annotation was computed. [2023-12-24 16:44:49,109 INFO L899 garLoopResultBuilder]: For program point L75-2(line 75) no Hoare annotation was computed. [2023-12-24 16:44:49,109 INFO L895 garLoopResultBuilder]: At program point L100(line 100) the Hoare annotation is: (let ((.cse8 (select (select |#memory_int#4| ~var_1_8_Pointer~0.base) ~var_1_8_Pointer~0.offset))) (let ((.cse7 ((_ extract 7 0) .cse8)) (.cse5 ((_ sign_extend 16) (_ bv25 16)))) (let ((.cse1 (= .cse5 (select (select |#memory_int#8| ~var_1_13_Pointer~0.base) ~var_1_13_Pointer~0.offset))) (.cse2 (= ((_ sign_extend 24) (_ bv10 8)) .cse8)) (.cse0 (= (bvadd (_ bv4 32) (select (select |#memory_int#13| ~var_1_18_Pointer~0.base) ~var_1_18_Pointer~0.offset)) (_ bv0 32))) (.cse3 (= ((_ sign_extend 16) ((_ zero_extend 8) .cse7)) (select (select |#memory_int#14| ~var_1_19_Pointer~0.base) ~var_1_19_Pointer~0.offset)))) (or (and .cse0 .cse1 .cse2 .cse3) (let ((.cse4 ((_ sign_extend 16) (_ bv65526 16)))) (and (= .cse4 (select (select |#memory_int#15| |~#var_1_20~0.base|) |~#var_1_20~0.offset|)) .cse1 (= .cse5 (select (select |#memory_int#8| |~#var_1_13~0.base|) |~#var_1_13~0.offset|)) .cse2 (= ~last_1_var_1_13~0 ((_ extract 15 0) .cse5)) (= ~last_1_var_1_20~0 ((_ extract 15 0) .cse4)) (not (bvsgt ((_ zero_extend 16) ((_ extract 15 0) (select (select |#memory_int#11| ~var_1_16_Pointer~0.base) ~var_1_16_Pointer~0.offset))) ((_ zero_extend 16) ((_ extract 15 0) (select (select |#memory_int#12| ~var_1_17_Pointer~0.base) ~var_1_17_Pointer~0.offset))))))) (and .cse0 (= (select (select |#memory_int#1| ~var_1_1_Pointer~0.base) ~var_1_1_Pointer~0.offset) ((_ sign_extend 16) ((_ extract 15 0) (let ((.cse6 ((_ zero_extend 24) .cse7))) (bvadd (bvneg .cse6) .cse6))))) .cse3))))) [2023-12-24 16:44:49,109 INFO L899 garLoopResultBuilder]: For program point L100-1(line 100) no Hoare annotation was computed. [2023-12-24 16:44:49,110 INFO L895 garLoopResultBuilder]: At program point L92(line 92) the Hoare annotation is: (let ((.cse10 (select (select |#memory_int#4| ~var_1_8_Pointer~0.base) ~var_1_8_Pointer~0.offset))) (let ((.cse9 ((_ extract 7 0) .cse10))) (let ((.cse3 ((_ sign_extend 16) (_ bv25 16))) (.cse11 ((_ extract 7 0) (select (select |#memory_int#7| ~var_1_12_Pointer~0.base) ~var_1_12_Pointer~0.offset))) (.cse7 ((_ zero_extend 24) .cse9))) (let ((.cse5 (= (bvadd (_ bv4 32) (select (select |#memory_int#13| ~var_1_18_Pointer~0.base) ~var_1_18_Pointer~0.offset)) (_ bv0 32))) (.cse0 (not (bvsle ((_ zero_extend 24) .cse11) (bvmul (bvsdiv .cse7 ((_ zero_extend 24) ((_ extract 7 0) (select (select |#memory_int#9| ~var_1_14_Pointer~0.base) ~var_1_14_Pointer~0.offset)))) (bvsrem (_ bv2 32) ((_ zero_extend 24) ((_ extract 7 0) (select (select |#memory_int#10| ~var_1_15_Pointer~0.base) ~var_1_15_Pointer~0.offset)))))))) (.cse6 (= (select (select |#memory_int#15| ~var_1_20_Pointer~0.base) ~var_1_20_Pointer~0.offset) ((_ sign_extend 16) ((_ zero_extend 8) .cse11)))) (.cse2 (= .cse3 (select (select |#memory_int#8| ~var_1_13_Pointer~0.base) ~var_1_13_Pointer~0.offset))) (.cse4 (= ((_ sign_extend 24) (_ bv10 8)) .cse10)) (.cse8 (= ((_ sign_extend 16) ((_ zero_extend 8) .cse9)) (select (select |#memory_int#14| ~var_1_19_Pointer~0.base) ~var_1_19_Pointer~0.offset)))) (or (let ((.cse1 ((_ sign_extend 16) (_ bv65526 16)))) (and .cse0 (= .cse1 (select (select |#memory_int#15| |~#var_1_20~0.base|) |~#var_1_20~0.offset|)) .cse2 (= .cse3 (select (select |#memory_int#8| |~#var_1_13~0.base|) |~#var_1_13~0.offset|)) .cse4 (= ~last_1_var_1_13~0 ((_ extract 15 0) .cse3)) (= ~last_1_var_1_20~0 ((_ extract 15 0) .cse1)) (not (bvsgt ((_ zero_extend 16) ((_ extract 15 0) (select (select |#memory_int#11| ~var_1_16_Pointer~0.base) ~var_1_16_Pointer~0.offset))) ((_ zero_extend 16) ((_ extract 15 0) (select (select |#memory_int#12| ~var_1_17_Pointer~0.base) ~var_1_17_Pointer~0.offset))))))) (and .cse5 .cse6 (= (select (select |#memory_int#1| ~var_1_1_Pointer~0.base) ~var_1_1_Pointer~0.offset) ((_ sign_extend 16) ((_ extract 15 0) (bvadd (bvneg .cse7) .cse7)))) .cse8) (and .cse5 .cse0 .cse6 .cse2 .cse4 .cse8)))))) [2023-12-24 16:44:49,110 INFO L899 garLoopResultBuilder]: For program point L92-1(line 92) no Hoare annotation was computed. [2023-12-24 16:44:49,110 INFO L899 garLoopResultBuilder]: For program point L59(lines 59 69) no Hoare annotation was computed. [2023-12-24 16:44:49,110 INFO L899 garLoopResultBuilder]: For program point L59-1(lines 59 69) no Hoare annotation was computed. [2023-12-24 16:44:49,110 INFO L899 garLoopResultBuilder]: For program point L117(line 117) no Hoare annotation was computed. [2023-12-24 16:44:49,110 INFO L895 garLoopResultBuilder]: At program point L84(line 84) the Hoare annotation is: (let ((.cse12 (select (select |#memory_int#4| ~var_1_8_Pointer~0.base) ~var_1_8_Pointer~0.offset))) (let ((.cse13 ((_ extract 7 0) .cse12)) (.cse14 ((_ extract 7 0) (select (select |#memory_int#7| ~var_1_12_Pointer~0.base) ~var_1_12_Pointer~0.offset)))) (let ((.cse11 ((_ sign_extend 16) (_ bv25 16))) (.cse8 ((_ zero_extend 24) .cse14)) (.cse7 ((_ zero_extend 24) .cse13))) (let ((.cse0 (= (bvadd (_ bv4 32) (select (select |#memory_int#13| ~var_1_18_Pointer~0.base) ~var_1_18_Pointer~0.offset)) (_ bv0 32))) (.cse2 (= (select (select |#memory_int#15| ~var_1_20_Pointer~0.base) ~var_1_20_Pointer~0.offset) ((_ sign_extend 16) ((_ zero_extend 8) .cse14)))) (.cse5 (= ((_ sign_extend 16) ((_ zero_extend 8) .cse13)) (select (select |#memory_int#14| ~var_1_19_Pointer~0.base) ~var_1_19_Pointer~0.offset))) (.cse1 (not (bvsle .cse8 (bvmul (bvsdiv .cse7 ((_ zero_extend 24) ((_ extract 7 0) (select (select |#memory_int#9| ~var_1_14_Pointer~0.base) ~var_1_14_Pointer~0.offset)))) (bvsrem (_ bv2 32) ((_ zero_extend 24) ((_ extract 7 0) (select (select |#memory_int#10| ~var_1_15_Pointer~0.base) ~var_1_15_Pointer~0.offset)))))))) (.cse3 (= .cse11 (select (select |#memory_int#8| ~var_1_13_Pointer~0.base) ~var_1_13_Pointer~0.offset))) (.cse4 (= ((_ sign_extend 24) (_ bv10 8)) .cse12)) (.cse6 (= ((_ extract 7 0) (select (select |#memory_int#5| ~var_1_9_Pointer~0.base) ~var_1_9_Pointer~0.offset)) (_ bv0 8)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 (let ((.cse9 (= (select (select |#memory_int#1| ~var_1_1_Pointer~0.base) ~var_1_1_Pointer~0.offset) ((_ sign_extend 16) ((_ extract 15 0) (bvadd (bvneg .cse7) .cse7)))))) (or (and (= .cse7 .cse8) .cse2 .cse9) (and .cse2 .cse9 .cse6))) .cse5) (let ((.cse10 ((_ sign_extend 16) (_ bv65526 16)))) (and .cse1 (= .cse10 (select (select |#memory_int#15| |~#var_1_20~0.base|) |~#var_1_20~0.offset|)) .cse3 (= .cse11 (select (select |#memory_int#8| |~#var_1_13~0.base|) |~#var_1_13~0.offset|)) .cse4 (= ~last_1_var_1_13~0 ((_ extract 15 0) .cse11)) .cse6 (= ~last_1_var_1_20~0 ((_ extract 15 0) .cse10)) (not (bvsgt ((_ zero_extend 16) ((_ extract 15 0) (select (select |#memory_int#11| ~var_1_16_Pointer~0.base) ~var_1_16_Pointer~0.offset))) ((_ zero_extend 16) ((_ extract 15 0) (select (select |#memory_int#12| ~var_1_17_Pointer~0.base) ~var_1_17_Pointer~0.offset)))))))))))) [2023-12-24 16:44:49,110 INFO L899 garLoopResultBuilder]: For program point L117-1(line 117) no Hoare annotation was computed. [2023-12-24 16:44:49,110 INFO L899 garLoopResultBuilder]: For program point L84-1(line 84) no Hoare annotation was computed. [2023-12-24 16:44:49,110 INFO L899 garLoopResultBuilder]: For program point L117-3(line 117) no Hoare annotation was computed. [2023-12-24 16:44:49,110 INFO L899 garLoopResultBuilder]: For program point L117-5(line 117) no Hoare annotation was computed. [2023-12-24 16:44:49,110 INFO L899 garLoopResultBuilder]: For program point L117-6(line 117) no Hoare annotation was computed. [2023-12-24 16:44:49,110 INFO L899 garLoopResultBuilder]: For program point L117-7(line 117) no Hoare annotation was computed. [2023-12-24 16:44:49,110 INFO L895 garLoopResultBuilder]: At program point L109(line 109) the Hoare annotation is: (let ((.cse8 (select (select |#memory_int#4| ~var_1_8_Pointer~0.base) ~var_1_8_Pointer~0.offset))) (let ((.cse7 ((_ extract 7 0) .cse8)) (.cse2 ((_ sign_extend 16) (_ bv25 16)))) (let ((.cse1 (= .cse2 (select (select |#memory_int#8| ~var_1_13_Pointer~0.base) ~var_1_13_Pointer~0.offset))) (.cse3 (= ((_ sign_extend 24) (_ bv10 8)) .cse8)) (.cse4 (= (bvadd (_ bv4 32) (select (select |#memory_int#13| ~var_1_18_Pointer~0.base) ~var_1_18_Pointer~0.offset)) (_ bv0 32))) (.cse5 (= ((_ sign_extend 16) ((_ zero_extend 8) .cse7)) (select (select |#memory_int#14| ~var_1_19_Pointer~0.base) ~var_1_19_Pointer~0.offset)))) (or (let ((.cse0 ((_ sign_extend 16) (_ bv65526 16)))) (and (= .cse0 (select (select |#memory_int#15| |~#var_1_20~0.base|) |~#var_1_20~0.offset|)) .cse1 (= .cse2 (select (select |#memory_int#8| |~#var_1_13~0.base|) |~#var_1_13~0.offset|)) .cse3 (= ~last_1_var_1_13~0 ((_ extract 15 0) .cse2)) (= ~last_1_var_1_20~0 ((_ extract 15 0) .cse0)))) (and .cse4 .cse1 .cse3 .cse5) (and .cse4 (= (select (select |#memory_int#1| ~var_1_1_Pointer~0.base) ~var_1_1_Pointer~0.offset) ((_ sign_extend 16) ((_ extract 15 0) (let ((.cse6 ((_ zero_extend 24) .cse7))) (bvadd (bvneg .cse6) .cse6))))) .cse5))))) [2023-12-24 16:44:49,110 INFO L899 garLoopResultBuilder]: For program point L117-8(line 117) no Hoare annotation was computed. [2023-12-24 16:44:49,110 INFO L899 garLoopResultBuilder]: For program point L109-1(line 109) no Hoare annotation was computed. [2023-12-24 16:44:49,111 INFO L899 garLoopResultBuilder]: For program point L117-9(line 117) no Hoare annotation was computed. [2023-12-24 16:44:49,111 INFO L899 garLoopResultBuilder]: For program point L117-11(line 117) no Hoare annotation was computed. [2023-12-24 16:44:49,111 INFO L899 garLoopResultBuilder]: For program point L117-13(line 117) no Hoare annotation was computed. [2023-12-24 16:44:49,111 INFO L899 garLoopResultBuilder]: For program point L117-15(line 117) no Hoare annotation was computed. [2023-12-24 16:44:49,111 INFO L899 garLoopResultBuilder]: For program point L117-17(line 117) no Hoare annotation was computed. [2023-12-24 16:44:49,111 INFO L899 garLoopResultBuilder]: For program point L117-18(line 117) no Hoare annotation was computed. [2023-12-24 16:44:49,111 INFO L899 garLoopResultBuilder]: For program point L117-19(line 117) no Hoare annotation was computed. [2023-12-24 16:44:49,113 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 16:44:49,115 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-24 16:44:49,133 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#7[~var_1_12_Pointer~0!base][~var_1_12_Pointer~0!offset] could not be translated [2023-12-24 16:44:49,135 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#4[~var_1_8_Pointer~0!base][~var_1_8_Pointer~0!offset] could not be translated [2023-12-24 16:44:49,136 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#9[~var_1_14_Pointer~0!base][~var_1_14_Pointer~0!offset] could not be translated [2023-12-24 16:44:49,136 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#10[~var_1_15_Pointer~0!base][~var_1_15_Pointer~0!offset] could not be translated [2023-12-24 16:44:49,136 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~var_1_7_Pointer~0!base][~var_1_7_Pointer~0!offset] could not be translated [2023-12-24 16:44:49,136 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~var_1_6_Pointer~0!base][~var_1_6_Pointer~0!offset] could not be translated [2023-12-24 16:44:49,136 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#6[~var_1_10_Pointer~0!base][~var_1_10_Pointer~0!offset] could not be translated [2023-12-24 16:44:49,137 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#15[~#var_1_20~0!base][~#var_1_20~0!offset] could not be translated [2023-12-24 16:44:49,137 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#8[~var_1_13_Pointer~0!base][~var_1_13_Pointer~0!offset] could not be translated [2023-12-24 16:44:49,137 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#8[~#var_1_13~0!base][~#var_1_13~0!offset] could not be translated [2023-12-24 16:44:49,137 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#4[~var_1_8_Pointer~0!base][~var_1_8_Pointer~0!offset] could not be translated [2023-12-24 16:44:49,137 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#5[~var_1_9_Pointer~0!base][~var_1_9_Pointer~0!offset] could not be translated [2023-12-24 16:44:49,138 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#11[~var_1_16_Pointer~0!base][~var_1_16_Pointer~0!offset] could not be translated [2023-12-24 16:44:49,138 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#12[~var_1_17_Pointer~0!base][~var_1_17_Pointer~0!offset] could not be translated [2023-12-24 16:44:49,138 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#13[~var_1_18_Pointer~0!base][~var_1_18_Pointer~0!offset] could not be translated [2023-12-24 16:44:49,138 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#7[~var_1_12_Pointer~0!base][~var_1_12_Pointer~0!offset] could not be translated [2023-12-24 16:44:49,138 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#4[~var_1_8_Pointer~0!base][~var_1_8_Pointer~0!offset] could not be translated [2023-12-24 16:44:49,138 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#9[~var_1_14_Pointer~0!base][~var_1_14_Pointer~0!offset] could not be translated [2023-12-24 16:44:49,138 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#10[~var_1_15_Pointer~0!base][~var_1_15_Pointer~0!offset] could not be translated [2023-12-24 16:44:49,138 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#15[~var_1_20_Pointer~0!base][~var_1_20_Pointer~0!offset] could not be translated [2023-12-24 16:44:49,138 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#7[~var_1_12_Pointer~0!base][~var_1_12_Pointer~0!offset] could not be translated [2023-12-24 16:44:49,139 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#8[~var_1_13_Pointer~0!base][~var_1_13_Pointer~0!offset] could not be translated [2023-12-24 16:44:49,139 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#4[~var_1_8_Pointer~0!base][~var_1_8_Pointer~0!offset] could not be translated [2023-12-24 16:44:49,139 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#4[~var_1_8_Pointer~0!base][~var_1_8_Pointer~0!offset] could not be translated [2023-12-24 16:44:49,139 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#14[~var_1_19_Pointer~0!base][~var_1_19_Pointer~0!offset] could not be translated [2023-12-24 16:44:49,139 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#5[~var_1_9_Pointer~0!base][~var_1_9_Pointer~0!offset] could not be translated [2023-12-24 16:44:49,139 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#13[~var_1_18_Pointer~0!base][~var_1_18_Pointer~0!offset] could not be translated [2023-12-24 16:44:49,139 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#4[~var_1_8_Pointer~0!base][~var_1_8_Pointer~0!offset] could not be translated [2023-12-24 16:44:49,139 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#7[~var_1_12_Pointer~0!base][~var_1_12_Pointer~0!offset] could not be translated [2023-12-24 16:44:49,139 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#15[~var_1_20_Pointer~0!base][~var_1_20_Pointer~0!offset] could not be translated [2023-12-24 16:44:49,139 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#7[~var_1_12_Pointer~0!base][~var_1_12_Pointer~0!offset] could not be translated [2023-12-24 16:44:49,139 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~var_1_1_Pointer~0!base][~var_1_1_Pointer~0!offset] could not be translated [2023-12-24 16:44:49,139 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#4[~var_1_8_Pointer~0!base][~var_1_8_Pointer~0!offset] could not be translated [2023-12-24 16:44:49,139 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#4[~var_1_8_Pointer~0!base][~var_1_8_Pointer~0!offset] could not be translated [2023-12-24 16:44:49,140 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#15[~var_1_20_Pointer~0!base][~var_1_20_Pointer~0!offset] could not be translated [2023-12-24 16:44:49,140 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#7[~var_1_12_Pointer~0!base][~var_1_12_Pointer~0!offset] could not be translated [2023-12-24 16:44:49,140 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~var_1_1_Pointer~0!base][~var_1_1_Pointer~0!offset] could not be translated [2023-12-24 16:44:49,140 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#4[~var_1_8_Pointer~0!base][~var_1_8_Pointer~0!offset] could not be translated [2023-12-24 16:44:49,140 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#4[~var_1_8_Pointer~0!base][~var_1_8_Pointer~0!offset] could not be translated [2023-12-24 16:44:49,140 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#5[~var_1_9_Pointer~0!base][~var_1_9_Pointer~0!offset] could not be translated [2023-12-24 16:44:49,140 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#4[~var_1_8_Pointer~0!base][~var_1_8_Pointer~0!offset] could not be translated [2023-12-24 16:44:49,140 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#14[~var_1_19_Pointer~0!base][~var_1_19_Pointer~0!offset] could not be translated [2023-12-24 16:44:49,145 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.12 04:44:49 BoogieIcfgContainer [2023-12-24 16:44:49,145 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-24 16:44:49,147 INFO L158 Benchmark]: Toolchain (without parser) took 170521.34ms. Allocated memory was 199.2MB in the beginning and 496.0MB in the end (delta: 296.7MB). Free memory was 151.0MB in the beginning and 264.2MB in the end (delta: -113.2MB). Peak memory consumption was 294.2MB. Max. memory is 8.0GB. [2023-12-24 16:44:49,150 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 199.2MB. Free memory is still 147.6MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-24 16:44:49,150 INFO L158 Benchmark]: CACSL2BoogieTranslator took 226.90ms. Allocated memory is still 199.2MB. Free memory was 150.7MB in the beginning and 135.6MB in the end (delta: 15.0MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2023-12-24 16:44:49,150 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.05ms. Allocated memory is still 199.2MB. Free memory was 135.6MB in the beginning and 132.5MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-24 16:44:49,150 INFO L158 Benchmark]: Boogie Preprocessor took 86.69ms. Allocated memory is still 199.2MB. Free memory was 132.5MB in the beginning and 126.5MB in the end (delta: 5.9MB). Peak memory consumption was 6.3MB. Max. memory is 8.0GB. [2023-12-24 16:44:49,150 INFO L158 Benchmark]: RCFGBuilder took 833.06ms. Allocated memory was 199.2MB in the beginning and 290.5MB in the end (delta: 91.2MB). Free memory was 126.5MB in the beginning and 224.1MB in the end (delta: -97.6MB). Peak memory consumption was 28.1MB. Max. memory is 8.0GB. [2023-12-24 16:44:49,150 INFO L158 Benchmark]: TraceAbstraction took 169322.73ms. Allocated memory was 290.5MB in the beginning and 496.0MB in the end (delta: 205.5MB). Free memory was 223.6MB in the beginning and 264.2MB in the end (delta: -40.6MB). Peak memory consumption was 274.5MB. Max. memory is 8.0GB. [2023-12-24 16:44:49,151 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 199.2MB. Free memory is still 147.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 226.90ms. Allocated memory is still 199.2MB. Free memory was 150.7MB in the beginning and 135.6MB in the end (delta: 15.0MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 44.05ms. Allocated memory is still 199.2MB. Free memory was 135.6MB in the beginning and 132.5MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 86.69ms. Allocated memory is still 199.2MB. Free memory was 132.5MB in the beginning and 126.5MB in the end (delta: 5.9MB). Peak memory consumption was 6.3MB. Max. memory is 8.0GB. * RCFGBuilder took 833.06ms. Allocated memory was 199.2MB in the beginning and 290.5MB in the end (delta: 91.2MB). Free memory was 126.5MB in the beginning and 224.1MB in the end (delta: -97.6MB). Peak memory consumption was 28.1MB. Max. memory is 8.0GB. * TraceAbstraction took 169322.73ms. Allocated memory was 290.5MB in the beginning and 496.0MB in the end (delta: 205.5MB). Free memory was 223.6MB in the beginning and 264.2MB in the end (delta: -40.6MB). Peak memory consumption was 274.5MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#7[~var_1_12_Pointer~0!base][~var_1_12_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#4[~var_1_8_Pointer~0!base][~var_1_8_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#9[~var_1_14_Pointer~0!base][~var_1_14_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#10[~var_1_15_Pointer~0!base][~var_1_15_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~var_1_7_Pointer~0!base][~var_1_7_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~var_1_6_Pointer~0!base][~var_1_6_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#6[~var_1_10_Pointer~0!base][~var_1_10_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#15[~#var_1_20~0!base][~#var_1_20~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#8[~var_1_13_Pointer~0!base][~var_1_13_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#8[~#var_1_13~0!base][~#var_1_13~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#4[~var_1_8_Pointer~0!base][~var_1_8_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#5[~var_1_9_Pointer~0!base][~var_1_9_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#11[~var_1_16_Pointer~0!base][~var_1_16_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#12[~var_1_17_Pointer~0!base][~var_1_17_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#13[~var_1_18_Pointer~0!base][~var_1_18_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#7[~var_1_12_Pointer~0!base][~var_1_12_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#4[~var_1_8_Pointer~0!base][~var_1_8_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#9[~var_1_14_Pointer~0!base][~var_1_14_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#10[~var_1_15_Pointer~0!base][~var_1_15_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#15[~var_1_20_Pointer~0!base][~var_1_20_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#7[~var_1_12_Pointer~0!base][~var_1_12_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#8[~var_1_13_Pointer~0!base][~var_1_13_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#4[~var_1_8_Pointer~0!base][~var_1_8_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#4[~var_1_8_Pointer~0!base][~var_1_8_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#14[~var_1_19_Pointer~0!base][~var_1_19_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#5[~var_1_9_Pointer~0!base][~var_1_9_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#13[~var_1_18_Pointer~0!base][~var_1_18_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#4[~var_1_8_Pointer~0!base][~var_1_8_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#7[~var_1_12_Pointer~0!base][~var_1_12_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#15[~var_1_20_Pointer~0!base][~var_1_20_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#7[~var_1_12_Pointer~0!base][~var_1_12_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~var_1_1_Pointer~0!base][~var_1_1_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#4[~var_1_8_Pointer~0!base][~var_1_8_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#4[~var_1_8_Pointer~0!base][~var_1_8_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#15[~var_1_20_Pointer~0!base][~var_1_20_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#7[~var_1_12_Pointer~0!base][~var_1_12_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~var_1_1_Pointer~0!base][~var_1_1_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#4[~var_1_8_Pointer~0!base][~var_1_8_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#4[~var_1_8_Pointer~0!base][~var_1_8_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#5[~var_1_9_Pointer~0!base][~var_1_9_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#4[~var_1_8_Pointer~0!base][~var_1_8_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#14[~var_1_19_Pointer~0!base][~var_1_19_Pointer~0!offset] could not be translated * 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 - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 88 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 169.2s, OverallIterations: 34, TraceHistogramMax: 20, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 24.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 88.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3129 SdHoareTripleChecker+Valid, 19.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3129 mSDsluCounter, 18182 SdHoareTripleChecker+Invalid, 17.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 13457 mSDsCounter, 207 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3688 IncrementalHoareTripleChecker+Invalid, 3895 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 207 mSolverCounterUnsat, 4725 mSDtfsCounter, 3688 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 6632 GetRequests, 6272 SyntacticMatches, 0 SemanticMatches, 360 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1852 ImplicationChecksByTransitivity, 18.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=678occurred in iteration=33, InterpolantAutomatonStates: 245, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 34 MinimizatonAttempts, 1927 StatesRemovedByMinimization, 31 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 22 LocationsWithAnnotation, 1771 PreInvPairs, 1902 NumberOfFragments, 4336 HoareAnnotationTreeSize, 1771 FormulaSimplifications, 160993 FormulaSimplificationTreeSizeReduction, 2.0s HoareSimplificationTime, 22 FormulaSimplificationsInter, 116572 FormulaSimplificationTreeSizeReductionInter, 85.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 1.1s SsaConstructionTime, 4.9s SatisfiabilityAnalysisTime, 39.3s InterpolantComputationTime, 5054 NumberOfCodeBlocks, 5054 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 6527 ConstructedInterpolants, 30 QuantifiedInterpolants, 45644 SizeOfPredicates, 387 NumberOfNonLiveVariables, 12947 ConjunctsInSsa, 407 ConjunctsInUnsatCore, 44 InterpolantComputations, 34 PerfectInterpolantSequences, 29941/33440 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 123]: Loop Invariant Derived loop invariant: (((((((!(((null & 127) <= (((null & 127) / (null & 127)) * (2 % (null & 127))))) && !(((null & 32767) > (((null & 32767) + -((null & 32767))) % 4294967296)))) && (last_1_var_1_13 == (25 & 32767))) && ((null & 127) == 0)) && (last_1_var_1_20 == (-10 & 32767))) && !(((null & 32767) > (null & 32767)))) || (!(((null & 127) <= (((null & 127) / (null & 127)) * (2 % (null & 127))))) && ((null & 127) == 0))) || (((null & 127) == (null & 127)) || ((null & 127) == 0))) RESULT: Ultimate proved your program to be correct! [2023-12-24 16:44:49,191 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 0 Received shutdown request...