/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-a_file-21.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-24 13:01:04,144 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-24 13:01:04,232 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 13:01:04,237 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-24 13:01:04,238 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-24 13:01:04,266 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-24 13:01:04,267 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-24 13:01:04,267 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-24 13:01:04,268 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-24 13:01:04,271 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-24 13:01:04,272 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-24 13:01:04,272 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-24 13:01:04,273 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-24 13:01:04,274 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-24 13:01:04,274 INFO L153 SettingsManager]: * Use SBE=true [2023-12-24 13:01:04,275 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-24 13:01:04,275 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-24 13:01:04,275 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-24 13:01:04,275 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-24 13:01:04,276 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-24 13:01:04,276 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-24 13:01:04,276 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-24 13:01:04,276 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-24 13:01:04,277 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-24 13:01:04,277 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-24 13:01:04,277 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-24 13:01:04,277 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-24 13:01:04,277 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-24 13:01:04,278 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-24 13:01:04,278 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-24 13:01:04,279 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-24 13:01:04,279 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-24 13:01:04,279 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-24 13:01:04,279 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-24 13:01:04,279 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-24 13:01:04,280 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-24 13:01:04,280 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-24 13:01:04,280 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-24 13:01:04,280 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-24 13:01:04,280 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-24 13:01:04,280 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-24 13:01:04,281 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-24 13:01:04,281 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-24 13:01:04,281 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-24 13:01:04,281 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-24 13:01:04,281 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-24 13:01:04,282 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 13:01:04,519 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-24 13:01:04,542 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-24 13:01:04,545 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-24 13:01:04,546 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-24 13:01:04,546 INFO L274 PluginConnector]: CDTParser initialized [2023-12-24 13:01:04,548 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-21.i [2023-12-24 13:01:05,690 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-24 13:01:05,901 INFO L384 CDTParser]: Found 1 translation units. [2023-12-24 13:01:05,901 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-21.i [2023-12-24 13:01:05,908 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9a2c07fa3/2ff23f3721f3451db03f128900eaf009/FLAGfd728fbe0 [2023-12-24 13:01:05,938 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9a2c07fa3/2ff23f3721f3451db03f128900eaf009 [2023-12-24 13:01:05,940 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-24 13:01:05,942 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-24 13:01:05,944 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-24 13:01:05,944 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-24 13:01:05,949 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-24 13:01:05,949 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.12 01:01:05" (1/1) ... [2023-12-24 13:01:05,950 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33d242f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 01:01:05, skipping insertion in model container [2023-12-24 13:01:05,950 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.12 01:01:05" (1/1) ... [2023-12-24 13:01:05,981 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-24 13:01:06,136 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-a_file-21.i[916,929] [2023-12-24 13:01:06,190 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-24 13:01:06,204 INFO L202 MainTranslator]: Completed pre-run [2023-12-24 13:01:06,215 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-a_file-21.i[916,929] [2023-12-24 13:01:06,246 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-24 13:01:06,265 INFO L206 MainTranslator]: Completed translation [2023-12-24 13:01:06,265 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 01:01:06 WrapperNode [2023-12-24 13:01:06,265 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-24 13:01:06,266 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-24 13:01:06,266 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-24 13:01:06,266 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-24 13:01:06,271 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 01:01:06" (1/1) ... [2023-12-24 13:01:06,286 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 01:01:06" (1/1) ... [2023-12-24 13:01:06,317 INFO L138 Inliner]: procedures = 36, calls = 114, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 403 [2023-12-24 13:01:06,318 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-24 13:01:06,318 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-24 13:01:06,319 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-24 13:01:06,319 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-24 13:01:06,328 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 01:01:06" (1/1) ... [2023-12-24 13:01:06,328 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 01:01:06" (1/1) ... [2023-12-24 13:01:06,343 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 01:01:06" (1/1) ... [2023-12-24 13:01:06,362 INFO L175 MemorySlicer]: Split 91 memory accesses to 6 slices as follows [2, 14, 34, 16, 6, 19]. 37 percent of accesses are in the largest equivalence class. The 11 initializations are split as follows [2, 2, 3, 2, 1, 1]. The 12 writes are split as follows [0, 3, 3, 2, 2, 2]. [2023-12-24 13:01:06,362 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 01:01:06" (1/1) ... [2023-12-24 13:01:06,363 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 01:01:06" (1/1) ... [2023-12-24 13:01:06,383 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 01:01:06" (1/1) ... [2023-12-24 13:01:06,388 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 01:01:06" (1/1) ... [2023-12-24 13:01:06,393 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 01:01:06" (1/1) ... [2023-12-24 13:01:06,395 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 01:01:06" (1/1) ... [2023-12-24 13:01:06,402 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-24 13:01:06,403 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-24 13:01:06,403 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-24 13:01:06,403 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-24 13:01:06,404 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 01:01:06" (1/1) ... [2023-12-24 13:01:06,417 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-24 13:01:06,432 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-24 13:01:06,449 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 13:01:06,474 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 13:01:06,482 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-24 13:01:06,482 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2023-12-24 13:01:06,482 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2023-12-24 13:01:06,483 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#2 [2023-12-24 13:01:06,484 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#3 [2023-12-24 13:01:06,484 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#4 [2023-12-24 13:01:06,484 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#5 [2023-12-24 13:01:06,485 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2023-12-24 13:01:06,485 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2023-12-24 13:01:06,485 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#2 [2023-12-24 13:01:06,485 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#3 [2023-12-24 13:01:06,485 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#4 [2023-12-24 13:01:06,485 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#5 [2023-12-24 13:01:06,485 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2023-12-24 13:01:06,485 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2023-12-24 13:01:06,485 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2023-12-24 13:01:06,486 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2023-12-24 13:01:06,486 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2023-12-24 13:01:06,486 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2023-12-24 13:01:06,486 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2023-12-24 13:01:06,486 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2023-12-24 13:01:06,486 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2023-12-24 13:01:06,487 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2023-12-24 13:01:06,487 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#4 [2023-12-24 13:01:06,487 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#5 [2023-12-24 13:01:06,489 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-24 13:01:06,489 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-12-24 13:01:06,489 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2023-12-24 13:01:06,489 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2023-12-24 13:01:06,489 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2023-12-24 13:01:06,490 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2023-12-24 13:01:06,490 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2023-12-24 13:01:06,490 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2023-12-24 13:01:06,490 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2023-12-24 13:01:06,490 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2023-12-24 13:01:06,490 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#4 [2023-12-24 13:01:06,490 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#5 [2023-12-24 13:01:06,490 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2023-12-24 13:01:06,490 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2023-12-24 13:01:06,491 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#2 [2023-12-24 13:01:06,491 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#3 [2023-12-24 13:01:06,491 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#4 [2023-12-24 13:01:06,491 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#5 [2023-12-24 13:01:06,491 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2023-12-24 13:01:06,491 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2023-12-24 13:01:06,492 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#2 [2023-12-24 13:01:06,492 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#3 [2023-12-24 13:01:06,492 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#4 [2023-12-24 13:01:06,492 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#5 [2023-12-24 13:01:06,492 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2023-12-24 13:01:06,492 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2023-12-24 13:01:06,492 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2023-12-24 13:01:06,492 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3 [2023-12-24 13:01:06,492 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#4 [2023-12-24 13:01:06,493 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#5 [2023-12-24 13:01:06,493 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2023-12-24 13:01:06,493 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2023-12-24 13:01:06,493 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2 [2023-12-24 13:01:06,493 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#3 [2023-12-24 13:01:06,493 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#4 [2023-12-24 13:01:06,493 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#5 [2023-12-24 13:01:06,493 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-24 13:01:06,493 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-24 13:01:06,493 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-24 13:01:06,494 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-24 13:01:06,494 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2023-12-24 13:01:06,494 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2023-12-24 13:01:06,494 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2023-12-24 13:01:06,494 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2023-12-24 13:01:06,494 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2023-12-24 13:01:06,494 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2023-12-24 13:01:06,494 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2023-12-24 13:01:06,494 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2023-12-24 13:01:06,495 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#2 [2023-12-24 13:01:06,495 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#3 [2023-12-24 13:01:06,496 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#4 [2023-12-24 13:01:06,496 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#5 [2023-12-24 13:01:06,673 INFO L241 CfgBuilder]: Building ICFG [2023-12-24 13:01:06,674 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-24 13:01:16,321 INFO L282 CfgBuilder]: Performing block encoding [2023-12-24 13:01:16,375 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-24 13:01:16,376 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-24 13:01:16,376 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.12 01:01:16 BoogieIcfgContainer [2023-12-24 13:01:16,376 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-24 13:01:16,378 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-24 13:01:16,379 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-24 13:01:16,381 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-24 13:01:16,382 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.12 01:01:05" (1/3) ... [2023-12-24 13:01:16,382 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3997c523 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.12 01:01:16, skipping insertion in model container [2023-12-24 13:01:16,382 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 01:01:06" (2/3) ... [2023-12-24 13:01:16,383 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3997c523 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.12 01:01:16, skipping insertion in model container [2023-12-24 13:01:16,383 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.12 01:01:16" (3/3) ... [2023-12-24 13:01:16,384 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-21.i [2023-12-24 13:01:16,400 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-24 13:01:16,400 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-24 13:01:16,451 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-24 13:01:16,457 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;@24775b66, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-24 13:01:16,458 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-24 13:01:16,462 INFO L276 IsEmpty]: Start isEmpty. Operand has 89 states, 79 states have (on average 1.5316455696202531) internal successors, (121), 80 states have internal predecessors, (121), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-12-24 13:01:16,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2023-12-24 13:01:16,478 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 13:01:16,479 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:01:16,480 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 13:01:16,485 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 13:01:16,486 INFO L85 PathProgramCache]: Analyzing trace with hash -1813158106, now seen corresponding path program 1 times [2023-12-24 13:01:16,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 13:01:16,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1328726144] [2023-12-24 13:01:16,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 13:01:16,499 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 13:01:16,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 13:01:16,501 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 13:01:16,519 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 13:01:16,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 13:01:16,809 INFO L262 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-24 13:01:16,816 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 13:01:16,842 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2023-12-24 13:01:16,842 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 13:01:16,843 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 13:01:16,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1328726144] [2023-12-24 13:01:16,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1328726144] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 13:01:16,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 13:01:16,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-24 13:01:16,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200339514] [2023-12-24 13:01:16,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 13:01:16,849 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-24 13:01:16,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 13:01:16,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-24 13:01:16,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-24 13:01:16,878 INFO L87 Difference]: Start difference. First operand has 89 states, 79 states have (on average 1.5316455696202531) internal successors, (121), 80 states have internal predecessors, (121), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) [2023-12-24 13:01:16,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 13:01:16,949 INFO L93 Difference]: Finished difference Result 175 states and 275 transitions. [2023-12-24 13:01:16,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-24 13:01:16,952 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) Word has length 75 [2023-12-24 13:01:16,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 13:01:16,960 INFO L225 Difference]: With dead ends: 175 [2023-12-24 13:01:16,961 INFO L226 Difference]: Without dead ends: 87 [2023-12-24 13:01:16,964 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 74 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 13:01:16,969 INFO L413 NwaCegarLoop]: 126 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-24 13:01:16,970 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 126 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-24 13:01:16,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2023-12-24 13:01:17,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2023-12-24 13:01:17,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 78 states have (on average 1.4871794871794872) internal successors, (116), 78 states have internal predecessors, (116), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-12-24 13:01:17,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 130 transitions. [2023-12-24 13:01:17,018 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 130 transitions. Word has length 75 [2023-12-24 13:01:17,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 13:01:17,019 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 130 transitions. [2023-12-24 13:01:17,019 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) [2023-12-24 13:01:17,020 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 130 transitions. [2023-12-24 13:01:17,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2023-12-24 13:01:17,025 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 13:01:17,026 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:01:17,036 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 13:01:17,235 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 13:01:17,236 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 13:01:17,237 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 13:01:17,237 INFO L85 PathProgramCache]: Analyzing trace with hash -944939288, now seen corresponding path program 1 times [2023-12-24 13:01:17,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 13:01:17,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [177458031] [2023-12-24 13:01:17,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 13:01:17,238 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 13:01:17,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 13:01:17,241 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 13:01:17,242 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 13:01:17,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 13:01:17,547 INFO L262 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-24 13:01:17,551 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 13:01:17,599 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2023-12-24 13:01:17,600 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 13:01:17,600 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 13:01:17,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [177458031] [2023-12-24 13:01:17,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [177458031] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 13:01:17,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 13:01:17,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-24 13:01:17,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394253310] [2023-12-24 13:01:17,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 13:01:17,604 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-24 13:01:17,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 13:01:17,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-24 13:01:17,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-24 13:01:17,605 INFO L87 Difference]: Start difference. First operand 87 states and 130 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-12-24 13:01:17,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 13:01:17,724 INFO L93 Difference]: Finished difference Result 179 states and 268 transitions. [2023-12-24 13:01:17,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-24 13:01:17,728 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 75 [2023-12-24 13:01:17,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 13:01:17,730 INFO L225 Difference]: With dead ends: 179 [2023-12-24 13:01:17,730 INFO L226 Difference]: Without dead ends: 93 [2023-12-24 13:01:17,730 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 72 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 13:01:17,731 INFO L413 NwaCegarLoop]: 127 mSDtfsCounter, 10 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 370 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-24 13:01:17,732 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 370 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-24 13:01:17,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2023-12-24 13:01:17,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 89. [2023-12-24 13:01:17,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 80 states have (on average 1.475) internal successors, (118), 80 states have internal predecessors, (118), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-12-24 13:01:17,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 132 transitions. [2023-12-24 13:01:17,748 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 132 transitions. Word has length 75 [2023-12-24 13:01:17,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 13:01:17,748 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 132 transitions. [2023-12-24 13:01:17,749 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-12-24 13:01:17,749 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 132 transitions. [2023-12-24 13:01:17,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2023-12-24 13:01:17,752 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 13:01:17,753 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:01:17,761 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 13:01:17,960 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 13:01:17,961 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 13:01:17,961 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 13:01:17,961 INFO L85 PathProgramCache]: Analyzing trace with hash 1388453350, now seen corresponding path program 1 times [2023-12-24 13:01:17,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 13:01:17,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1076416937] [2023-12-24 13:01:17,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 13:01:17,962 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 13:01:17,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 13:01:17,964 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 13:01:17,966 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 13:01:18,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 13:01:18,247 INFO L262 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-24 13:01:18,251 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 13:01:18,303 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 13:01:18,560 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2023-12-24 13:01:18,560 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 13:01:18,561 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 13:01:18,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1076416937] [2023-12-24 13:01:18,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1076416937] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 13:01:18,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 13:01:18,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-24 13:01:18,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578654697] [2023-12-24 13:01:18,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 13:01:18,562 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-24 13:01:18,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 13:01:18,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-24 13:01:18,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-24 13:01:18,563 INFO L87 Difference]: Start difference. First operand 89 states and 132 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-12-24 13:01:21,556 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.91s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 13:01:23,348 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.66s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 13:01:26,918 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.57s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 13:01:29,752 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.81s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 13:01:32,612 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.86s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 13:01:32,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 13:01:32,813 INFO L93 Difference]: Finished difference Result 295 states and 437 transitions. [2023-12-24 13:01:32,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-24 13:01:32,814 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 75 [2023-12-24 13:01:32,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 13:01:32,816 INFO L225 Difference]: With dead ends: 295 [2023-12-24 13:01:32,816 INFO L226 Difference]: Without dead ends: 207 [2023-12-24 13:01:32,817 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 72 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 13:01:32,818 INFO L413 NwaCegarLoop]: 118 mSDtfsCounter, 229 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.2s IncrementalHoareTripleChecker+Time [2023-12-24 13:01:32,818 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [229 Valid, 352 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 14.2s Time] [2023-12-24 13:01:32,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2023-12-24 13:01:32,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 181. [2023-12-24 13:01:32,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 164 states have (on average 1.451219512195122) internal successors, (238), 164 states have internal predecessors, (238), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2023-12-24 13:01:32,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 266 transitions. [2023-12-24 13:01:32,843 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 266 transitions. Word has length 75 [2023-12-24 13:01:32,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 13:01:32,843 INFO L495 AbstractCegarLoop]: Abstraction has 181 states and 266 transitions. [2023-12-24 13:01:32,843 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-12-24 13:01:32,844 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 266 transitions. [2023-12-24 13:01:32,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2023-12-24 13:01:32,845 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 13:01:32,845 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:01:32,855 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2023-12-24 13:01:33,052 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 13:01:33,053 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 13:01:33,053 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 13:01:33,053 INFO L85 PathProgramCache]: Analyzing trace with hash 722911461, now seen corresponding path program 1 times [2023-12-24 13:01:33,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 13:01:33,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [873846035] [2023-12-24 13:01:33,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 13:01:33,054 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 13:01:33,055 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 13:01:33,058 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 13:01:33,064 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 13:01:33,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 13:01:33,340 INFO L262 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-24 13:01:33,343 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 13:01:34,063 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 13:01:34,132 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 14 proven. 30 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2023-12-24 13:01:34,132 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 13:01:34,627 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2023-12-24 13:01:34,628 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 13:01:34,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [873846035] [2023-12-24 13:01:34,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [873846035] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 13:01:34,628 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 13:01:34,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 16 [2023-12-24 13:01:34,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946557105] [2023-12-24 13:01:34,628 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 13:01:34,629 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-24 13:01:34,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 13:01:34,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-24 13:01:34,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2023-12-24 13:01:34,630 INFO L87 Difference]: Start difference. First operand 181 states and 266 transitions. Second operand has 16 states, 12 states have (on average 7.083333333333333) internal successors, (85), 16 states have internal predecessors, (85), 6 states have call successors, (14), 3 states have call predecessors, (14), 5 states have return successors, (14), 2 states have call predecessors, (14), 6 states have call successors, (14) [2023-12-24 13:01:35,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 13:01:35,319 INFO L93 Difference]: Finished difference Result 347 states and 499 transitions. [2023-12-24 13:01:35,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-24 13:01:35,320 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 12 states have (on average 7.083333333333333) internal successors, (85), 16 states have internal predecessors, (85), 6 states have call successors, (14), 3 states have call predecessors, (14), 5 states have return successors, (14), 2 states have call predecessors, (14), 6 states have call successors, (14) Word has length 78 [2023-12-24 13:01:35,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 13:01:35,321 INFO L225 Difference]: With dead ends: 347 [2023-12-24 13:01:35,322 INFO L226 Difference]: Without dead ends: 167 [2023-12-24 13:01:35,323 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 139 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=131, Invalid=375, Unknown=0, NotChecked=0, Total=506 [2023-12-24 13:01:35,324 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 424 mSDsluCounter, 638 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 426 SdHoareTripleChecker+Valid, 751 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-24 13:01:35,324 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [426 Valid, 751 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-24 13:01:35,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2023-12-24 13:01:35,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 167. [2023-12-24 13:01:35,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 146 states have (on average 1.3972602739726028) internal successors, (204), 146 states have internal predecessors, (204), 14 states have call successors, (14), 6 states have call predecessors, (14), 6 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2023-12-24 13:01:35,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 232 transitions. [2023-12-24 13:01:35,337 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 232 transitions. Word has length 78 [2023-12-24 13:01:35,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 13:01:35,337 INFO L495 AbstractCegarLoop]: Abstraction has 167 states and 232 transitions. [2023-12-24 13:01:35,337 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 12 states have (on average 7.083333333333333) internal successors, (85), 16 states have internal predecessors, (85), 6 states have call successors, (14), 3 states have call predecessors, (14), 5 states have return successors, (14), 2 states have call predecessors, (14), 6 states have call successors, (14) [2023-12-24 13:01:35,338 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 232 transitions. [2023-12-24 13:01:35,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2023-12-24 13:01:35,338 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 13:01:35,338 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:01:35,355 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 13:01:35,550 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 13:01:35,550 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 13:01:35,551 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 13:01:35,551 INFO L85 PathProgramCache]: Analyzing trace with hash -17391293, now seen corresponding path program 1 times [2023-12-24 13:01:35,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 13:01:35,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [675132913] [2023-12-24 13:01:35,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 13:01:35,552 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 13:01:35,552 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 13:01:35,553 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 13:01:35,553 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 13:01:35,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 13:01:35,911 INFO L262 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-24 13:01:35,913 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 13:01:35,968 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2023-12-24 13:01:35,968 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 13:01:35,969 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 13:01:35,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [675132913] [2023-12-24 13:01:35,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [675132913] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 13:01:35,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 13:01:35,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-24 13:01:35,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348172791] [2023-12-24 13:01:35,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 13:01:35,969 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-24 13:01:35,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 13:01:35,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-24 13:01:35,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-24 13:01:35,970 INFO L87 Difference]: Start difference. First operand 167 states and 232 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-12-24 13:01:36,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 13:01:36,206 INFO L93 Difference]: Finished difference Result 282 states and 396 transitions. [2023-12-24 13:01:36,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-24 13:01:36,207 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 79 [2023-12-24 13:01:36,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 13:01:36,208 INFO L225 Difference]: With dead ends: 282 [2023-12-24 13:01:36,208 INFO L226 Difference]: Without dead ends: 186 [2023-12-24 13:01:36,209 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-12-24 13:01:36,209 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 72 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 472 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-24 13:01:36,210 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 472 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-24 13:01:36,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2023-12-24 13:01:36,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 170. [2023-12-24 13:01:36,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 149 states have (on average 1.389261744966443) internal successors, (207), 149 states have internal predecessors, (207), 14 states have call successors, (14), 6 states have call predecessors, (14), 6 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2023-12-24 13:01:36,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 235 transitions. [2023-12-24 13:01:36,222 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 235 transitions. Word has length 79 [2023-12-24 13:01:36,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 13:01:36,222 INFO L495 AbstractCegarLoop]: Abstraction has 170 states and 235 transitions. [2023-12-24 13:01:36,223 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-12-24 13:01:36,223 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 235 transitions. [2023-12-24 13:01:36,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2023-12-24 13:01:36,228 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 13:01:36,229 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:01:36,247 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-12-24 13:01:36,444 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 13:01:36,444 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 13:01:36,445 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 13:01:36,445 INFO L85 PathProgramCache]: Analyzing trace with hash -1893251846, now seen corresponding path program 1 times [2023-12-24 13:01:36,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 13:01:36,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [438201999] [2023-12-24 13:01:36,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 13:01:36,446 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 13:01:36,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 13:01:36,447 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 13:01:36,449 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 13:01:36,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 13:01:36,872 INFO L262 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-24 13:01:36,875 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 13:01:37,042 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 77 treesize of output 41 [2023-12-24 13:01:37,077 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2023-12-24 13:01:37,077 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 13:01:37,077 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 13:01:37,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [438201999] [2023-12-24 13:01:37,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [438201999] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 13:01:37,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 13:01:37,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-24 13:01:37,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460323223] [2023-12-24 13:01:37,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 13:01:37,078 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-24 13:01:37,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 13:01:37,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-24 13:01:37,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-24 13:01:37,079 INFO L87 Difference]: Start difference. First operand 170 states and 235 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 5 states have internal predecessors, (54), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-12-24 13:01:40,063 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.55s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 13:01:42,090 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.94s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 13:01:43,933 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.71s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 13:01:45,955 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.93s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 13:01:46,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 13:01:46,065 INFO L93 Difference]: Finished difference Result 310 states and 431 transitions. [2023-12-24 13:01:46,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-24 13:01:46,096 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 5 states have internal predecessors, (54), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 83 [2023-12-24 13:01:46,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 13:01:46,097 INFO L225 Difference]: With dead ends: 310 [2023-12-24 13:01:46,097 INFO L226 Difference]: Without dead ends: 182 [2023-12-24 13:01:46,098 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2023-12-24 13:01:46,098 INFO L413 NwaCegarLoop]: 102 mSDtfsCounter, 112 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.9s IncrementalHoareTripleChecker+Time [2023-12-24 13:01:46,099 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 377 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 8.9s Time] [2023-12-24 13:01:46,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2023-12-24 13:01:46,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 170. [2023-12-24 13:01:46,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 149 states have (on average 1.3758389261744965) internal successors, (205), 149 states have internal predecessors, (205), 14 states have call successors, (14), 6 states have call predecessors, (14), 6 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2023-12-24 13:01:46,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 233 transitions. [2023-12-24 13:01:46,110 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 233 transitions. Word has length 83 [2023-12-24 13:01:46,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 13:01:46,110 INFO L495 AbstractCegarLoop]: Abstraction has 170 states and 233 transitions. [2023-12-24 13:01:46,110 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 5 states have internal predecessors, (54), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-12-24 13:01:46,110 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 233 transitions. [2023-12-24 13:01:46,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2023-12-24 13:01:46,111 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 13:01:46,111 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:01:46,123 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 13:01:46,316 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 13:01:46,316 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 13:01:46,317 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 13:01:46,317 INFO L85 PathProgramCache]: Analyzing trace with hash -754838604, now seen corresponding path program 1 times [2023-12-24 13:01:46,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 13:01:46,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [889021465] [2023-12-24 13:01:46,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 13:01:46,318 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 13:01:46,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 13:01:46,320 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 13:01:46,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 (8)] Waiting until timeout for monitored process [2023-12-24 13:01:46,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 13:01:46,726 INFO L262 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-24 13:01:46,728 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 13:01:46,954 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 95 treesize of output 41 [2023-12-24 13:01:46,986 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-12-24 13:01:46,986 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 13:01:46,986 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 13:01:46,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [889021465] [2023-12-24 13:01:46,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [889021465] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 13:01:46,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 13:01:46,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-24 13:01:46,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862036044] [2023-12-24 13:01:46,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 13:01:46,987 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-24 13:01:46,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 13:01:46,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-24 13:01:46,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-24 13:01:46,988 INFO L87 Difference]: Start difference. First operand 170 states and 233 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 5 states have internal predecessors, (56), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-12-24 13:01:49,049 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.66s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 13:01:51,078 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.94s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 13:01:54,681 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.47s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 13:01:56,943 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.17s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 13:01:57,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 13:01:57,037 INFO L93 Difference]: Finished difference Result 303 states and 417 transitions. [2023-12-24 13:01:57,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-24 13:01:57,064 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 5 states have internal predecessors, (56), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 85 [2023-12-24 13:01:57,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 13:01:57,065 INFO L225 Difference]: With dead ends: 303 [2023-12-24 13:01:57,065 INFO L226 Difference]: Without dead ends: 182 [2023-12-24 13:01:57,066 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2023-12-24 13:01:57,066 INFO L413 NwaCegarLoop]: 101 mSDtfsCounter, 105 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 375 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.0s IncrementalHoareTripleChecker+Time [2023-12-24 13:01:57,066 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 375 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 10.0s Time] [2023-12-24 13:01:57,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2023-12-24 13:01:57,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 170. [2023-12-24 13:01:57,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 149 states have (on average 1.3624161073825503) internal successors, (203), 149 states have internal predecessors, (203), 14 states have call successors, (14), 6 states have call predecessors, (14), 6 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2023-12-24 13:01:57,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 231 transitions. [2023-12-24 13:01:57,076 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 231 transitions. Word has length 85 [2023-12-24 13:01:57,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 13:01:57,076 INFO L495 AbstractCegarLoop]: Abstraction has 170 states and 231 transitions. [2023-12-24 13:01:57,077 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 5 states have internal predecessors, (56), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-12-24 13:01:57,077 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 231 transitions. [2023-12-24 13:01:57,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2023-12-24 13:01:57,077 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 13:01:57,078 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:01:57,091 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2023-12-24 13:01:57,291 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 13:01:57,292 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 13:01:57,292 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 13:01:57,292 INFO L85 PathProgramCache]: Analyzing trace with hash 510867642, now seen corresponding path program 1 times [2023-12-24 13:01:57,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 13:01:57,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [39917036] [2023-12-24 13:01:57,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 13:01:57,293 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 13:01:57,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 13:01:57,293 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 13:01:57,294 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 13:01:57,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 13:01:57,770 INFO L262 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 19 conjunts are in the unsatisfiable core [2023-12-24 13:01:57,773 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 13:01:57,787 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-24 13:01:58,492 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 29 [2023-12-24 13:01:58,694 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 13:01:58,694 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 78 treesize of output 40 [2023-12-24 13:01:58,796 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 14 proven. 30 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2023-12-24 13:01:58,797 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 13:01:59,027 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2023-12-24 13:01:59,027 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 13:01:59,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [39917036] [2023-12-24 13:01:59,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [39917036] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-24 13:01:59,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-24 13:01:59,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [14] total 16 [2023-12-24 13:01:59,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440987815] [2023-12-24 13:01:59,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 13:01:59,029 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-24 13:01:59,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 13:01:59,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-24 13:01:59,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2023-12-24 13:01:59,029 INFO L87 Difference]: Start difference. First operand 170 states and 231 transitions. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-12-24 13:01:59,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 13:01:59,324 INFO L93 Difference]: Finished difference Result 314 states and 429 transitions. [2023-12-24 13:01:59,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-24 13:01:59,324 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 87 [2023-12-24 13:01:59,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 13:01:59,326 INFO L225 Difference]: With dead ends: 314 [2023-12-24 13:01:59,326 INFO L226 Difference]: Without dead ends: 215 [2023-12-24 13:01:59,326 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=62, Invalid=318, Unknown=0, NotChecked=0, Total=380 [2023-12-24 13:01:59,327 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 105 mSDsluCounter, 469 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 588 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-24 13:01:59,327 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 588 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-24 13:01:59,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2023-12-24 13:01:59,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 190. [2023-12-24 13:01:59,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 169 states have (on average 1.3550295857988166) internal successors, (229), 169 states have internal predecessors, (229), 14 states have call successors, (14), 6 states have call predecessors, (14), 6 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2023-12-24 13:01:59,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 257 transitions. [2023-12-24 13:01:59,335 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 257 transitions. Word has length 87 [2023-12-24 13:01:59,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 13:01:59,336 INFO L495 AbstractCegarLoop]: Abstraction has 190 states and 257 transitions. [2023-12-24 13:01:59,336 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-12-24 13:01:59,336 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 257 transitions. [2023-12-24 13:01:59,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2023-12-24 13:01:59,337 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 13:01:59,337 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:01:59,355 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 13:01:59,550 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 13:01:59,551 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 13:01:59,551 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 13:01:59,551 INFO L85 PathProgramCache]: Analyzing trace with hash 620042959, now seen corresponding path program 1 times [2023-12-24 13:01:59,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 13:01:59,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [996404656] [2023-12-24 13:01:59,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 13:01:59,552 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 13:01:59,552 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 13:01:59,553 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 13:01:59,554 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-12-24 13:01:59,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 13:01:59,926 INFO L262 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 19 conjunts are in the unsatisfiable core [2023-12-24 13:01:59,930 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 13:02:00,550 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 29 [2023-12-24 13:02:01,020 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 13:02:01,020 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 20 [2023-12-24 13:02:01,077 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 14 proven. 30 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2023-12-24 13:02:01,077 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 13:02:01,943 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2023-12-24 13:02:01,943 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 13:02:01,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [996404656] [2023-12-24 13:02:01,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [996404656] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 13:02:01,944 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 13:02:01,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12] total 24 [2023-12-24 13:02:01,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439395355] [2023-12-24 13:02:01,944 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 13:02:01,944 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-12-24 13:02:01,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 13:02:01,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-12-24 13:02:01,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=412, Unknown=0, NotChecked=0, Total=552 [2023-12-24 13:02:01,946 INFO L87 Difference]: Start difference. First operand 190 states and 257 transitions. Second operand has 24 states, 20 states have (on average 5.9) internal successors, (118), 24 states have internal predecessors, (118), 6 states have call successors, (14), 3 states have call predecessors, (14), 5 states have return successors, (14), 2 states have call predecessors, (14), 6 states have call successors, (14) [2023-12-24 13:02:03,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 13:02:03,439 INFO L93 Difference]: Finished difference Result 338 states and 458 transitions. [2023-12-24 13:02:03,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-12-24 13:02:03,440 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 20 states have (on average 5.9) internal successors, (118), 24 states have internal predecessors, (118), 6 states have call successors, (14), 3 states have call predecessors, (14), 5 states have return successors, (14), 2 states have call predecessors, (14), 6 states have call successors, (14) Word has length 89 [2023-12-24 13:02:03,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 13:02:03,442 INFO L225 Difference]: With dead ends: 338 [2023-12-24 13:02:03,443 INFO L226 Difference]: Without dead ends: 222 [2023-12-24 13:02:03,443 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 153 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 361 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=370, Invalid=1190, Unknown=0, NotChecked=0, Total=1560 [2023-12-24 13:02:03,446 INFO L413 NwaCegarLoop]: 114 mSDtfsCounter, 361 mSDsluCounter, 952 mSDsCounter, 0 mSdLazyCounter, 350 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 363 SdHoareTripleChecker+Valid, 1066 SdHoareTripleChecker+Invalid, 361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 350 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-12-24 13:02:03,446 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [363 Valid, 1066 Invalid, 361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 350 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-12-24 13:02:03,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2023-12-24 13:02:03,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 190. [2023-12-24 13:02:03,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 169 states have (on average 1.349112426035503) internal successors, (228), 169 states have internal predecessors, (228), 14 states have call successors, (14), 6 states have call predecessors, (14), 6 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2023-12-24 13:02:03,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 256 transitions. [2023-12-24 13:02:03,456 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 256 transitions. Word has length 89 [2023-12-24 13:02:03,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 13:02:03,457 INFO L495 AbstractCegarLoop]: Abstraction has 190 states and 256 transitions. [2023-12-24 13:02:03,457 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 20 states have (on average 5.9) internal successors, (118), 24 states have internal predecessors, (118), 6 states have call successors, (14), 3 states have call predecessors, (14), 5 states have return successors, (14), 2 states have call predecessors, (14), 6 states have call successors, (14) [2023-12-24 13:02:03,457 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 256 transitions. [2023-12-24 13:02:03,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2023-12-24 13:02:03,460 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 13:02:03,460 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:02:03,474 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 13:02:03,674 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 13:02:03,674 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 13:02:03,675 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 13:02:03,675 INFO L85 PathProgramCache]: Analyzing trace with hash 1638783780, now seen corresponding path program 1 times [2023-12-24 13:02:03,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 13:02:03,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [269334862] [2023-12-24 13:02:03,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 13:02:03,676 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 13:02:03,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 13:02:03,677 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 13:02:03,678 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 13:02:04,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 13:02:04,098 INFO L262 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-24 13:02:04,100 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 13:02:04,119 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2023-12-24 13:02:04,301 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2023-12-24 13:02:04,301 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 13:02:04,301 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 13:02:04,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [269334862] [2023-12-24 13:02:04,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [269334862] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 13:02:04,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 13:02:04,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-24 13:02:04,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25361417] [2023-12-24 13:02:04,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 13:02:04,302 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-24 13:02:04,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 13:02:04,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-24 13:02:04,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-24 13:02:04,303 INFO L87 Difference]: Start difference. First operand 190 states and 256 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-12-24 13:02:04,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 13:02:04,732 INFO L93 Difference]: Finished difference Result 477 states and 647 transitions. [2023-12-24 13:02:04,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-24 13:02:04,733 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 89 [2023-12-24 13:02:04,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 13:02:04,735 INFO L225 Difference]: With dead ends: 477 [2023-12-24 13:02:04,735 INFO L226 Difference]: Without dead ends: 357 [2023-12-24 13:02:04,735 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-12-24 13:02:04,736 INFO L413 NwaCegarLoop]: 144 mSDtfsCounter, 223 mSDsluCounter, 406 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 550 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-24 13:02:04,736 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [223 Valid, 550 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-24 13:02:04,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2023-12-24 13:02:04,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 288. [2023-12-24 13:02:04,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 257 states have (on average 1.3463035019455254) internal successors, (346), 257 states have internal predecessors, (346), 21 states have call successors, (21), 9 states have call predecessors, (21), 9 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2023-12-24 13:02:04,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 388 transitions. [2023-12-24 13:02:04,750 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 388 transitions. Word has length 89 [2023-12-24 13:02:04,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 13:02:04,750 INFO L495 AbstractCegarLoop]: Abstraction has 288 states and 388 transitions. [2023-12-24 13:02:04,750 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-12-24 13:02:04,750 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 388 transitions. [2023-12-24 13:02:04,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2023-12-24 13:02:04,751 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 13:02:04,751 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:02:04,768 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 13:02:04,967 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 13:02:04,968 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 13:02:04,968 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 13:02:04,968 INFO L85 PathProgramCache]: Analyzing trace with hash 617715426, now seen corresponding path program 1 times [2023-12-24 13:02:04,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 13:02:04,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [308344303] [2023-12-24 13:02:04,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 13:02:04,969 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 13:02:04,969 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 13:02:04,970 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 13:02:04,971 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 13:02:05,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 13:02:05,404 INFO L262 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 18 conjunts are in the unsatisfiable core [2023-12-24 13:02:05,407 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 13:02:07,496 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 13:02:07,496 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 365 treesize of output 113 [2023-12-24 13:02:07,741 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2023-12-24 13:02:07,741 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 13:02:09,023 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2023-12-24 13:02:09,023 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 13:02:09,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [308344303] [2023-12-24 13:02:09,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [308344303] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-24 13:02:09,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-24 13:02:09,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [12] total 18 [2023-12-24 13:02:09,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002465517] [2023-12-24 13:02:09,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 13:02:09,024 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-24 13:02:09,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 13:02:09,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-24 13:02:09,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2023-12-24 13:02:09,025 INFO L87 Difference]: Start difference. First operand 288 states and 388 transitions. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-12-24 13:02:11,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 13:02:11,059 INFO L93 Difference]: Finished difference Result 704 states and 940 transitions. [2023-12-24 13:02:11,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-24 13:02:11,062 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 89 [2023-12-24 13:02:11,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 13:02:11,069 INFO L225 Difference]: With dead ends: 704 [2023-12-24 13:02:11,069 INFO L226 Difference]: Without dead ends: 490 [2023-12-24 13:02:11,070 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=87, Invalid=375, Unknown=0, NotChecked=0, Total=462 [2023-12-24 13:02:11,070 INFO L413 NwaCegarLoop]: 164 mSDtfsCounter, 98 mSDsluCounter, 585 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 749 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2023-12-24 13:02:11,071 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 749 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2023-12-24 13:02:11,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states. [2023-12-24 13:02:11,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 420. [2023-12-24 13:02:11,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 420 states, 376 states have (on average 1.3297872340425532) internal successors, (500), 378 states have internal predecessors, (500), 27 states have call successors, (27), 16 states have call predecessors, (27), 16 states have return successors, (27), 25 states have call predecessors, (27), 27 states have call successors, (27) [2023-12-24 13:02:11,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 554 transitions. [2023-12-24 13:02:11,089 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 554 transitions. Word has length 89 [2023-12-24 13:02:11,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 13:02:11,090 INFO L495 AbstractCegarLoop]: Abstraction has 420 states and 554 transitions. [2023-12-24 13:02:11,090 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-12-24 13:02:11,090 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 554 transitions. [2023-12-24 13:02:11,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2023-12-24 13:02:11,091 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 13:02:11,091 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:02:11,102 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 13:02:11,296 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 13:02:11,296 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 13:02:11,297 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 13:02:11,297 INFO L85 PathProgramCache]: Analyzing trace with hash 1297773796, now seen corresponding path program 1 times [2023-12-24 13:02:11,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 13:02:11,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1163662858] [2023-12-24 13:02:11,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 13:02:11,297 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 13:02:11,297 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 13:02:11,298 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 13:02:11,299 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 13:02:11,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 13:02:11,718 INFO L262 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 15 conjunts are in the unsatisfiable core [2023-12-24 13:02:11,720 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 13:02:13,035 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 13:02:13,036 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 345 treesize of output 105 [2023-12-24 13:02:13,205 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2023-12-24 13:02:13,206 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 13:02:14,824 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2023-12-24 13:02:14,825 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 13:02:14,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1163662858] [2023-12-24 13:02:14,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1163662858] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-24 13:02:14,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-24 13:02:14,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [10] total 16 [2023-12-24 13:02:14,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536471765] [2023-12-24 13:02:14,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 13:02:14,826 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-24 13:02:14,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 13:02:14,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-24 13:02:14,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2023-12-24 13:02:14,826 INFO L87 Difference]: Start difference. First operand 420 states and 554 transitions. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-12-24 13:02:17,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 13:02:17,055 INFO L93 Difference]: Finished difference Result 806 states and 1069 transitions. [2023-12-24 13:02:17,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-24 13:02:17,058 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 89 [2023-12-24 13:02:17,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 13:02:17,060 INFO L225 Difference]: With dead ends: 806 [2023-12-24 13:02:17,060 INFO L226 Difference]: Without dead ends: 471 [2023-12-24 13:02:17,061 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=78, Invalid=264, Unknown=0, NotChecked=0, Total=342 [2023-12-24 13:02:17,061 INFO L413 NwaCegarLoop]: 157 mSDtfsCounter, 182 mSDsluCounter, 436 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 593 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2023-12-24 13:02:17,062 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 593 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2023-12-24 13:02:17,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states. [2023-12-24 13:02:17,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 416. [2023-12-24 13:02:17,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 416 states, 372 states have (on average 1.3225806451612903) internal successors, (492), 374 states have internal predecessors, (492), 27 states have call successors, (27), 16 states have call predecessors, (27), 16 states have return successors, (27), 25 states have call predecessors, (27), 27 states have call successors, (27) [2023-12-24 13:02:17,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 546 transitions. [2023-12-24 13:02:17,081 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 546 transitions. Word has length 89 [2023-12-24 13:02:17,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 13:02:17,082 INFO L495 AbstractCegarLoop]: Abstraction has 416 states and 546 transitions. [2023-12-24 13:02:17,082 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-12-24 13:02:17,082 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 546 transitions. [2023-12-24 13:02:17,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2023-12-24 13:02:17,083 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 13:02:17,083 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:02:17,096 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 13:02:17,296 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 13:02:17,296 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 13:02:17,296 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 13:02:17,296 INFO L85 PathProgramCache]: Analyzing trace with hash -199933024, now seen corresponding path program 1 times [2023-12-24 13:02:17,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 13:02:17,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [746578719] [2023-12-24 13:02:17,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 13:02:17,297 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 13:02:17,297 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 13:02:17,298 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 13:02:17,299 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 13:02:17,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 13:02:17,753 INFO L262 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 15 conjunts are in the unsatisfiable core [2023-12-24 13:02:17,755 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 13:02:19,076 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 13:02:19,076 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 340 treesize of output 106 [2023-12-24 13:02:19,278 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2023-12-24 13:02:19,278 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 13:02:20,668 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2023-12-24 13:02:20,668 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 13:02:20,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [746578719] [2023-12-24 13:02:20,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [746578719] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-24 13:02:20,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-24 13:02:20,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [10] total 16 [2023-12-24 13:02:20,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361441809] [2023-12-24 13:02:20,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 13:02:20,669 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-24 13:02:20,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 13:02:20,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-24 13:02:20,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2023-12-24 13:02:20,670 INFO L87 Difference]: Start difference. First operand 416 states and 546 transitions. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-12-24 13:02:22,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 13:02:22,972 INFO L93 Difference]: Finished difference Result 813 states and 1069 transitions. [2023-12-24 13:02:22,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-24 13:02:22,974 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 89 [2023-12-24 13:02:22,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 13:02:22,978 INFO L225 Difference]: With dead ends: 813 [2023-12-24 13:02:22,978 INFO L226 Difference]: Without dead ends: 482 [2023-12-24 13:02:22,979 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=78, Invalid=264, Unknown=0, NotChecked=0, Total=342 [2023-12-24 13:02:22,980 INFO L413 NwaCegarLoop]: 169 mSDtfsCounter, 185 mSDsluCounter, 483 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 652 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2023-12-24 13:02:22,980 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [185 Valid, 652 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2023-12-24 13:02:22,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2023-12-24 13:02:22,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 416. [2023-12-24 13:02:23,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 416 states, 372 states have (on average 1.3172043010752688) internal successors, (490), 374 states have internal predecessors, (490), 27 states have call successors, (27), 16 states have call predecessors, (27), 16 states have return successors, (27), 25 states have call predecessors, (27), 27 states have call successors, (27) [2023-12-24 13:02:23,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 544 transitions. [2023-12-24 13:02:23,002 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 544 transitions. Word has length 89 [2023-12-24 13:02:23,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 13:02:23,003 INFO L495 AbstractCegarLoop]: Abstraction has 416 states and 544 transitions. [2023-12-24 13:02:23,003 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-12-24 13:02:23,003 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 544 transitions. [2023-12-24 13:02:23,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2023-12-24 13:02:23,004 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 13:02:23,004 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:02:23,018 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 13:02:23,218 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 13:02:23,218 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 13:02:23,218 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 13:02:23,218 INFO L85 PathProgramCache]: Analyzing trace with hash 480125346, now seen corresponding path program 1 times [2023-12-24 13:02:23,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 13:02:23,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [797603432] [2023-12-24 13:02:23,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 13:02:23,220 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 13:02:23,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 13:02:23,221 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 13:02:23,254 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 13:02:23,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 13:02:23,647 INFO L262 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 16 conjunts are in the unsatisfiable core [2023-12-24 13:02:23,649 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 13:02:24,971 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 13:02:24,971 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 302 treesize of output 98 [2023-12-24 13:02:25,123 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2023-12-24 13:02:25,123 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 13:02:26,321 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2023-12-24 13:02:26,322 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 13:02:26,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [797603432] [2023-12-24 13:02:26,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [797603432] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-24 13:02:26,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-24 13:02:26,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [11] total 17 [2023-12-24 13:02:26,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879869980] [2023-12-24 13:02:26,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 13:02:26,322 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-24 13:02:26,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 13:02:26,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-24 13:02:26,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2023-12-24 13:02:26,323 INFO L87 Difference]: Start difference. First operand 416 states and 544 transitions. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-12-24 13:02:27,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 13:02:27,888 INFO L93 Difference]: Finished difference Result 822 states and 1077 transitions. [2023-12-24 13:02:27,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-24 13:02:27,890 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 89 [2023-12-24 13:02:27,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 13:02:27,894 INFO L225 Difference]: With dead ends: 822 [2023-12-24 13:02:27,894 INFO L226 Difference]: Without dead ends: 491 [2023-12-24 13:02:27,895 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=76, Invalid=304, Unknown=0, NotChecked=0, Total=380 [2023-12-24 13:02:27,895 INFO L413 NwaCegarLoop]: 167 mSDtfsCounter, 91 mSDsluCounter, 593 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 760 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-12-24 13:02:27,895 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 760 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-12-24 13:02:27,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 491 states. [2023-12-24 13:02:27,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 491 to 416. [2023-12-24 13:02:27,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 416 states, 372 states have (on average 1.3118279569892473) internal successors, (488), 374 states have internal predecessors, (488), 27 states have call successors, (27), 16 states have call predecessors, (27), 16 states have return successors, (27), 25 states have call predecessors, (27), 27 states have call successors, (27) [2023-12-24 13:02:27,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 542 transitions. [2023-12-24 13:02:27,918 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 542 transitions. Word has length 89 [2023-12-24 13:02:27,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 13:02:27,919 INFO L495 AbstractCegarLoop]: Abstraction has 416 states and 542 transitions. [2023-12-24 13:02:27,919 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-12-24 13:02:27,919 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 542 transitions. [2023-12-24 13:02:27,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2023-12-24 13:02:27,920 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 13:02:27,921 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:02:27,936 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2023-12-24 13:02:28,133 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 13:02:28,133 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 13:02:28,134 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 13:02:28,134 INFO L85 PathProgramCache]: Analyzing trace with hash -1150361374, now seen corresponding path program 1 times [2023-12-24 13:02:28,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 13:02:28,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [46101378] [2023-12-24 13:02:28,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 13:02:28,134 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 13:02:28,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 13:02:28,135 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 13:02:28,144 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 13:02:28,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 13:02:28,482 INFO L262 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-24 13:02:28,500 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 13:02:28,519 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2023-12-24 13:02:28,677 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2023-12-24 13:02:28,677 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 13:02:28,678 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 13:02:28,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [46101378] [2023-12-24 13:02:28,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [46101378] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 13:02:28,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 13:02:28,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-24 13:02:28,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368622571] [2023-12-24 13:02:28,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 13:02:28,678 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-24 13:02:28,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 13:02:28,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-24 13:02:28,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-24 13:02:28,679 INFO L87 Difference]: Start difference. First operand 416 states and 542 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-12-24 13:02:28,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 13:02:28,942 INFO L93 Difference]: Finished difference Result 921 states and 1206 transitions. [2023-12-24 13:02:28,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-24 13:02:28,943 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 90 [2023-12-24 13:02:28,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 13:02:28,945 INFO L225 Difference]: With dead ends: 921 [2023-12-24 13:02:28,945 INFO L226 Difference]: Without dead ends: 590 [2023-12-24 13:02:28,946 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-12-24 13:02:28,946 INFO L413 NwaCegarLoop]: 174 mSDtfsCounter, 226 mSDsluCounter, 476 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 650 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-24 13:02:28,947 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [226 Valid, 650 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-24 13:02:28,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states. [2023-12-24 13:02:28,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 465. [2023-12-24 13:02:28,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 465 states, 421 states have (on average 1.3087885985748218) internal successors, (551), 423 states have internal predecessors, (551), 27 states have call successors, (27), 16 states have call predecessors, (27), 16 states have return successors, (27), 25 states have call predecessors, (27), 27 states have call successors, (27) [2023-12-24 13:02:28,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 605 transitions. [2023-12-24 13:02:28,966 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 605 transitions. Word has length 90 [2023-12-24 13:02:28,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 13:02:28,966 INFO L495 AbstractCegarLoop]: Abstraction has 465 states and 605 transitions. [2023-12-24 13:02:28,966 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-12-24 13:02:28,966 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 605 transitions. [2023-12-24 13:02:28,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2023-12-24 13:02:28,967 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 13:02:28,967 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:02:28,986 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 13:02:29,181 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 13:02:29,181 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 13:02:29,182 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 13:02:29,182 INFO L85 PathProgramCache]: Analyzing trace with hash -1279649630, now seen corresponding path program 1 times [2023-12-24 13:02:29,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 13:02:29,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [55923786] [2023-12-24 13:02:29,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 13:02:29,182 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 13:02:29,182 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 13:02:29,183 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 13:02:29,184 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 13:02:29,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 13:02:29,540 INFO L262 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-24 13:02:29,542 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 13:02:29,572 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2023-12-24 13:02:29,572 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 13:02:29,572 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 13:02:29,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [55923786] [2023-12-24 13:02:29,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [55923786] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 13:02:29,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 13:02:29,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-24 13:02:29,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543960030] [2023-12-24 13:02:29,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 13:02:29,573 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-24 13:02:29,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 13:02:29,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-24 13:02:29,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-24 13:02:29,573 INFO L87 Difference]: Start difference. First operand 465 states and 605 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-12-24 13:02:29,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 13:02:29,679 INFO L93 Difference]: Finished difference Result 889 states and 1160 transitions. [2023-12-24 13:02:29,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-24 13:02:29,680 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 90 [2023-12-24 13:02:29,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 13:02:29,682 INFO L225 Difference]: With dead ends: 889 [2023-12-24 13:02:29,682 INFO L226 Difference]: Without dead ends: 509 [2023-12-24 13:02:29,682 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-12-24 13:02:29,683 INFO L413 NwaCegarLoop]: 129 mSDtfsCounter, 51 mSDsluCounter, 451 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 580 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-24 13:02:29,683 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 580 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-24 13:02:29,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 509 states. [2023-12-24 13:02:29,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 509 to 478. [2023-12-24 13:02:29,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 478 states, 434 states have (on average 1.2995391705069124) internal successors, (564), 436 states have internal predecessors, (564), 27 states have call successors, (27), 16 states have call predecessors, (27), 16 states have return successors, (27), 25 states have call predecessors, (27), 27 states have call successors, (27) [2023-12-24 13:02:29,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 478 states to 478 states and 618 transitions. [2023-12-24 13:02:29,706 INFO L78 Accepts]: Start accepts. Automaton has 478 states and 618 transitions. Word has length 90 [2023-12-24 13:02:29,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 13:02:29,706 INFO L495 AbstractCegarLoop]: Abstraction has 478 states and 618 transitions. [2023-12-24 13:02:29,706 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-12-24 13:02:29,706 INFO L276 IsEmpty]: Start isEmpty. Operand 478 states and 618 transitions. [2023-12-24 13:02:29,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2023-12-24 13:02:29,707 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 13:02:29,707 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:02:29,724 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2023-12-24 13:02:29,920 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 13:02:29,920 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 13:02:29,921 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 13:02:29,921 INFO L85 PathProgramCache]: Analyzing trace with hash 1627999009, now seen corresponding path program 1 times [2023-12-24 13:02:29,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 13:02:29,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [594839313] [2023-12-24 13:02:29,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 13:02:29,921 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 13:02:29,922 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 13:02:29,922 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 13:02:29,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 (18)] Waiting until timeout for monitored process [2023-12-24 13:02:30,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 13:02:30,410 INFO L262 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 13 conjunts are in the unsatisfiable core [2023-12-24 13:02:30,413 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 13:02:30,616 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 13:02:30,802 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 13:02:30,807 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 33 [2023-12-24 13:02:30,878 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2023-12-24 13:02:30,878 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 13:02:30,879 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 13:02:30,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [594839313] [2023-12-24 13:02:30,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [594839313] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 13:02:30,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 13:02:30,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-24 13:02:30,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77897641] [2023-12-24 13:02:30,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 13:02:30,879 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-24 13:02:30,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 13:02:30,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-24 13:02:30,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-12-24 13:02:30,880 INFO L87 Difference]: Start difference. First operand 478 states and 618 transitions. Second operand has 8 states, 8 states have (on average 7.375) internal successors, (59), 7 states have internal predecessors, (59), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-12-24 13:02:32,460 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.48s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 13:02:35,248 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.65s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 13:02:36,929 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.50s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 13:02:38,442 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.42s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 13:02:41,044 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.46s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 13:02:42,344 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 13:02:44,750 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.27s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 13:02:45,778 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 13:02:47,520 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.71s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 13:02:48,940 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 13:02:51,585 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.31s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 13:02:54,525 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.94s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 13:02:54,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 13:02:54,581 INFO L93 Difference]: Finished difference Result 1305 states and 1689 transitions. [2023-12-24 13:02:54,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-24 13:02:54,581 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.375) internal successors, (59), 7 states have internal predecessors, (59), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 91 [2023-12-24 13:02:54,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 13:02:54,585 INFO L225 Difference]: With dead ends: 1305 [2023-12-24 13:02:54,585 INFO L226 Difference]: Without dead ends: 1303 [2023-12-24 13:02:54,585 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2023-12-24 13:02:54,586 INFO L413 NwaCegarLoop]: 183 mSDtfsCounter, 240 mSDsluCounter, 922 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 23.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 240 SdHoareTripleChecker+Valid, 1105 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 23.6s IncrementalHoareTripleChecker+Time [2023-12-24 13:02:54,586 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [240 Valid, 1105 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 23.6s Time] [2023-12-24 13:02:54,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1303 states. [2023-12-24 13:02:54,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1303 to 1093. [2023-12-24 13:02:54,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1093 states, 1017 states have (on average 1.3018682399213373) internal successors, (1324), 1021 states have internal predecessors, (1324), 47 states have call successors, (47), 28 states have call predecessors, (47), 28 states have return successors, (47), 43 states have call predecessors, (47), 47 states have call successors, (47) [2023-12-24 13:02:54,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1093 states to 1093 states and 1418 transitions. [2023-12-24 13:02:54,631 INFO L78 Accepts]: Start accepts. Automaton has 1093 states and 1418 transitions. Word has length 91 [2023-12-24 13:02:54,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 13:02:54,632 INFO L495 AbstractCegarLoop]: Abstraction has 1093 states and 1418 transitions. [2023-12-24 13:02:54,632 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.375) internal successors, (59), 7 states have internal predecessors, (59), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-12-24 13:02:54,632 INFO L276 IsEmpty]: Start isEmpty. Operand 1093 states and 1418 transitions. [2023-12-24 13:02:54,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2023-12-24 13:02:54,633 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 13:02:54,633 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:02:54,650 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 13:02:54,848 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 13:02:54,848 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 13:02:54,849 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 13:02:54,849 INFO L85 PathProgramCache]: Analyzing trace with hash 1032851814, now seen corresponding path program 1 times [2023-12-24 13:02:54,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 13:02:54,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1006478735] [2023-12-24 13:02:54,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 13:02:54,850 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 13:02:54,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 13:02:54,850 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 13:02:54,851 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 13:02:55,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 13:02:55,329 INFO L262 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-24 13:02:55,331 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 13:02:55,503 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 13:02:55,517 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2023-12-24 13:02:55,517 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 13:02:55,517 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 13:02:55,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1006478735] [2023-12-24 13:02:55,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1006478735] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 13:02:55,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 13:02:55,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-24 13:02:55,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939645976] [2023-12-24 13:02:55,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 13:02:55,518 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-24 13:02:55,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 13:02:55,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-24 13:02:55,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-24 13:02:55,519 INFO L87 Difference]: Start difference. First operand 1093 states and 1418 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-12-24 13:02:57,961 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.42s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 13:03:01,952 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.93s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 13:03:04,961 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.39s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 13:03:08,238 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.25s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 13:03:10,428 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 13:03:12,440 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.97s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 13:03:13,849 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 13:03:16,767 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.92s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 13:03:16,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 13:03:16,818 INFO L93 Difference]: Finished difference Result 2104 states and 2732 transitions. [2023-12-24 13:03:16,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-24 13:03:16,819 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 93 [2023-12-24 13:03:16,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 13:03:16,822 INFO L225 Difference]: With dead ends: 2104 [2023-12-24 13:03:16,822 INFO L226 Difference]: Without dead ends: 1095 [2023-12-24 13:03:16,823 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-24 13:03:16,824 INFO L413 NwaCegarLoop]: 120 mSDtfsCounter, 75 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 21.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 21.2s IncrementalHoareTripleChecker+Time [2023-12-24 13:03:16,824 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 345 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 21.2s Time] [2023-12-24 13:03:16,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1095 states. [2023-12-24 13:03:16,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1095 to 1093. [2023-12-24 13:03:16,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1093 states, 1017 states have (on average 1.2989183874139627) internal successors, (1321), 1021 states have internal predecessors, (1321), 47 states have call successors, (47), 28 states have call predecessors, (47), 28 states have return successors, (47), 43 states have call predecessors, (47), 47 states have call successors, (47) [2023-12-24 13:03:16,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1093 states to 1093 states and 1415 transitions. [2023-12-24 13:03:16,865 INFO L78 Accepts]: Start accepts. Automaton has 1093 states and 1415 transitions. Word has length 93 [2023-12-24 13:03:16,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 13:03:16,865 INFO L495 AbstractCegarLoop]: Abstraction has 1093 states and 1415 transitions. [2023-12-24 13:03:16,865 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-12-24 13:03:16,865 INFO L276 IsEmpty]: Start isEmpty. Operand 1093 states and 1415 transitions. [2023-12-24 13:03:16,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2023-12-24 13:03:16,866 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 13:03:16,866 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:03:16,884 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 13:03:17,084 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 13:03:17,084 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 13:03:17,084 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 13:03:17,085 INFO L85 PathProgramCache]: Analyzing trace with hash 1173400424, now seen corresponding path program 1 times [2023-12-24 13:03:17,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 13:03:17,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [923901794] [2023-12-24 13:03:17,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 13:03:17,085 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 13:03:17,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 13:03:17,086 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 13:03:17,095 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 13:03:17,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 13:03:17,562 INFO L262 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 15 conjunts are in the unsatisfiable core [2023-12-24 13:03:17,564 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 13:03:17,741 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 19 treesize of output 15 [2023-12-24 13:03:17,863 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 56 treesize of output 44 [2023-12-24 13:03:17,866 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 57 treesize of output 37 [2023-12-24 13:03:17,913 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2023-12-24 13:03:17,913 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 13:03:17,914 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 13:03:17,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [923901794] [2023-12-24 13:03:17,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [923901794] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 13:03:17,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 13:03:17,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-24 13:03:17,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324876527] [2023-12-24 13:03:17,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 13:03:17,914 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-24 13:03:17,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 13:03:17,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-24 13:03:17,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-12-24 13:03:17,915 INFO L87 Difference]: Start difference. First operand 1093 states and 1415 transitions. Second operand has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 8 states have internal predecessors, (61), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-12-24 13:03:19,941 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.94s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 13:03:23,594 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.49s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 13:03:26,433 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.63s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 13:03:28,890 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.33s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 13:03:30,484 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.59s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 13:03:33,391 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.54s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 13:03:35,103 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.71s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 13:03:37,298 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.13s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 13:03:39,252 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.81s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 13:03:41,964 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.35s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 13:03:44,745 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.72s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 13:03:44,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 13:03:44,844 INFO L93 Difference]: Finished difference Result 1117 states and 1441 transitions. [2023-12-24 13:03:44,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-24 13:03:44,844 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 8 states have internal predecessors, (61), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 93 [2023-12-24 13:03:44,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 13:03:44,848 INFO L225 Difference]: With dead ends: 1117 [2023-12-24 13:03:44,848 INFO L226 Difference]: Without dead ends: 1115 [2023-12-24 13:03:44,848 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2023-12-24 13:03:44,849 INFO L413 NwaCegarLoop]: 181 mSDtfsCounter, 146 mSDsluCounter, 1061 mSDsCounter, 0 mSdLazyCounter, 248 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 26.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 1242 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 26.8s IncrementalHoareTripleChecker+Time [2023-12-24 13:03:44,849 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 1242 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 248 Invalid, 0 Unknown, 0 Unchecked, 26.8s Time] [2023-12-24 13:03:44,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1115 states. [2023-12-24 13:03:44,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1115 to 885. [2023-12-24 13:03:44,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 885 states, 809 states have (on average 1.2954264524103831) internal successors, (1048), 813 states have internal predecessors, (1048), 47 states have call successors, (47), 28 states have call predecessors, (47), 28 states have return successors, (47), 43 states have call predecessors, (47), 47 states have call successors, (47) [2023-12-24 13:03:44,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 885 states to 885 states and 1142 transitions. [2023-12-24 13:03:44,889 INFO L78 Accepts]: Start accepts. Automaton has 885 states and 1142 transitions. Word has length 93 [2023-12-24 13:03:44,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 13:03:44,889 INFO L495 AbstractCegarLoop]: Abstraction has 885 states and 1142 transitions. [2023-12-24 13:03:44,889 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 8 states have internal predecessors, (61), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-12-24 13:03:44,890 INFO L276 IsEmpty]: Start isEmpty. Operand 885 states and 1142 transitions. [2023-12-24 13:03:44,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2023-12-24 13:03:44,890 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 13:03:44,890 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:03:44,910 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 13:03:45,108 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 13:03:45,108 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 13:03:45,108 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 13:03:45,108 INFO L85 PathProgramCache]: Analyzing trace with hash 1333574248, now seen corresponding path program 1 times [2023-12-24 13:03:45,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 13:03:45,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [880091452] [2023-12-24 13:03:45,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 13:03:45,109 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 13:03:45,109 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 13:03:45,110 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 13:03:45,111 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 13:03:45,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 13:03:45,592 INFO L262 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 14 conjunts are in the unsatisfiable core [2023-12-24 13:03:45,595 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 13:03:45,750 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 13:03:45,868 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2023-12-24 13:03:45,887 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 28 treesize of output 16 [2023-12-24 13:03:45,958 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2023-12-24 13:03:45,958 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 13:03:45,958 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 13:03:45,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [880091452] [2023-12-24 13:03:45,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [880091452] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 13:03:45,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 13:03:45,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-24 13:03:45,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429223407] [2023-12-24 13:03:45,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 13:03:45,959 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-24 13:03:45,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 13:03:45,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-24 13:03:45,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2023-12-24 13:03:45,960 INFO L87 Difference]: Start difference. First operand 885 states and 1142 transitions. Second operand has 10 states, 10 states have (on average 6.1) internal successors, (61), 9 states have internal predecessors, (61), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-12-24 13:03:48,169 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 13:03:50,042 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.68s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 13:03:54,109 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.89s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 13:03:58,342 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 13:04:00,734 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.48s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 13:04:03,910 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.14s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 13:04:06,727 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.43s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 13:04:08,841 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 13:04:11,027 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 13:04:13,284 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 13:04:15,962 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.92s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 13:04:18,451 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.49s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 13:04:18,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 13:04:18,516 INFO L93 Difference]: Finished difference Result 1329 states and 1708 transitions. [2023-12-24 13:04:18,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-24 13:04:18,516 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.1) internal successors, (61), 9 states have internal predecessors, (61), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 93 [2023-12-24 13:04:18,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 13:04:18,519 INFO L225 Difference]: With dead ends: 1329 [2023-12-24 13:04:18,519 INFO L226 Difference]: Without dead ends: 1327 [2023-12-24 13:04:18,520 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2023-12-24 13:04:18,520 INFO L413 NwaCegarLoop]: 183 mSDtfsCounter, 212 mSDsluCounter, 1254 mSDsCounter, 0 mSdLazyCounter, 285 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 31.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 1437 SdHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 285 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 32.3s IncrementalHoareTripleChecker+Time [2023-12-24 13:04:18,520 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [212 Valid, 1437 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 285 Invalid, 1 Unknown, 0 Unchecked, 32.3s Time] [2023-12-24 13:04:18,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1327 states. [2023-12-24 13:04:18,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1327 to 1101. [2023-12-24 13:04:18,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1101 states, 1025 states have (on average 1.3004878048780488) internal successors, (1333), 1029 states have internal predecessors, (1333), 47 states have call successors, (47), 28 states have call predecessors, (47), 28 states have return successors, (47), 43 states have call predecessors, (47), 47 states have call successors, (47) [2023-12-24 13:04:18,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1101 states to 1101 states and 1427 transitions. [2023-12-24 13:04:18,564 INFO L78 Accepts]: Start accepts. Automaton has 1101 states and 1427 transitions. Word has length 93 [2023-12-24 13:04:18,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 13:04:18,564 INFO L495 AbstractCegarLoop]: Abstraction has 1101 states and 1427 transitions. [2023-12-24 13:04:18,564 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.1) internal successors, (61), 9 states have internal predecessors, (61), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-12-24 13:04:18,565 INFO L276 IsEmpty]: Start isEmpty. Operand 1101 states and 1427 transitions. [2023-12-24 13:04:18,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2023-12-24 13:04:18,565 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 13:04:18,566 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:04:18,583 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Forceful destruction successful, exit code 0 [2023-12-24 13:04:18,780 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 13:04:18,781 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 13:04:18,781 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 13:04:18,781 INFO L85 PathProgramCache]: Analyzing trace with hash -1743969041, now seen corresponding path program 1 times [2023-12-24 13:04:18,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 13:04:18,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1239637391] [2023-12-24 13:04:18,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 13:04:18,782 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 13:04:18,782 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 13:04:18,783 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 13:04:18,783 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 13:04:19,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 13:04:19,280 INFO L262 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 16 conjunts are in the unsatisfiable core [2023-12-24 13:04:19,283 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 13:04:19,530 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 19 treesize of output 15 [2023-12-24 13:04:19,688 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 24 treesize of output 16 [2023-12-24 13:04:19,711 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 13:04:19,784 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2023-12-24 13:04:19,784 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 13:04:19,784 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 13:04:19,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1239637391] [2023-12-24 13:04:19,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1239637391] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 13:04:19,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 13:04:19,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-12-24 13:04:19,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150744968] [2023-12-24 13:04:19,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 13:04:19,785 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-24 13:04:19,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 13:04:19,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-24 13:04:19,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2023-12-24 13:04:19,786 INFO L87 Difference]: Start difference. First operand 1101 states and 1427 transitions. Second operand has 11 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 10 states have internal predecessors, (63), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-12-24 13:04:21,835 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.94s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 13:04:24,357 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.29s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 13:04:28,263 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.62s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 13:04:29,941 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.48s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 13:04:32,766 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.23s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 13:04:34,362 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.59s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 13:04:38,447 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 13:04:39,903 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.46s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 13:04:42,279 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.18s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 13:04:45,548 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.90s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 13:04:48,563 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.98s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 13:04:48,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 13:04:48,635 INFO L93 Difference]: Finished difference Result 1129 states and 1457 transitions. [2023-12-24 13:04:48,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-24 13:04:48,636 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 10 states have internal predecessors, (63), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 95 [2023-12-24 13:04:48,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 13:04:48,638 INFO L225 Difference]: With dead ends: 1129 [2023-12-24 13:04:48,638 INFO L226 Difference]: Without dead ends: 1127 [2023-12-24 13:04:48,639 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=96, Invalid=284, Unknown=0, NotChecked=0, Total=380 [2023-12-24 13:04:48,639 INFO L413 NwaCegarLoop]: 182 mSDtfsCounter, 188 mSDsluCounter, 1336 mSDsCounter, 0 mSdLazyCounter, 325 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 28.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 1518 SdHoareTripleChecker+Invalid, 331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 325 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 28.5s IncrementalHoareTripleChecker+Time [2023-12-24 13:04:48,640 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 1518 Invalid, 331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 325 Invalid, 1 Unknown, 0 Unchecked, 28.5s Time] [2023-12-24 13:04:48,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1127 states. [2023-12-24 13:04:48,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1127 to 877. [2023-12-24 13:04:48,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 877 states, 801 states have (on average 1.2983770287141074) internal successors, (1040), 805 states have internal predecessors, (1040), 47 states have call successors, (47), 28 states have call predecessors, (47), 28 states have return successors, (47), 43 states have call predecessors, (47), 47 states have call successors, (47) [2023-12-24 13:04:48,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 877 states to 877 states and 1134 transitions. [2023-12-24 13:04:48,680 INFO L78 Accepts]: Start accepts. Automaton has 877 states and 1134 transitions. Word has length 95 [2023-12-24 13:04:48,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 13:04:48,680 INFO L495 AbstractCegarLoop]: Abstraction has 877 states and 1134 transitions. [2023-12-24 13:04:48,680 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 10 states have internal predecessors, (63), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-12-24 13:04:48,680 INFO L276 IsEmpty]: Start isEmpty. Operand 877 states and 1134 transitions. [2023-12-24 13:04:48,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2023-12-24 13:04:48,682 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 13:04:48,682 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 13:04:48,701 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 13:04:48,901 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 13:04:48,901 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 13:04:48,902 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 13:04:48,902 INFO L85 PathProgramCache]: Analyzing trace with hash 9764138, now seen corresponding path program 1 times [2023-12-24 13:04:48,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 13:04:48,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [475142467] [2023-12-24 13:04:48,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 13:04:48,903 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 13:04:48,903 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 13:04:48,904 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 13:04:48,912 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 13:04:49,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 13:04:49,662 INFO L262 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-24 13:04:49,665 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 13:04:49,833 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 26 treesize of output 18 [2023-12-24 13:04:49,852 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 14 treesize of output 10 [2023-12-24 13:04:49,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 19 treesize of output 11 [2023-12-24 13:04:50,032 INFO L134 CoverageAnalysis]: Checked inductivity of 414 backedges. 15 proven. 231 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2023-12-24 13:04:50,032 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 13:04:57,254 INFO L134 CoverageAnalysis]: Checked inductivity of 414 backedges. 15 proven. 35 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2023-12-24 13:04:57,255 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 13:04:57,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [475142467] [2023-12-24 13:04:57,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [475142467] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 13:04:57,255 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 13:04:57,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 8 [2023-12-24 13:04:57,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33817531] [2023-12-24 13:04:57,255 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 13:04:57,256 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-24 13:04:57,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 13:04:57,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-24 13:04:57,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-12-24 13:04:57,257 INFO L87 Difference]: Start difference. First operand 877 states and 1134 transitions. Second operand has 8 states, 8 states have (on average 24.125) internal successors, (193), 8 states have internal predecessors, (193), 4 states have call successors, (28), 3 states have call predecessors, (28), 3 states have return successors, (28), 4 states have call predecessors, (28), 4 states have call successors, (28) [2023-12-24 13:05:02,000 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.91s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 13:05:03,168 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 13:05:06,111 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.35s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 13:05:08,781 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.64s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 13:05:11,029 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 13:05:13,802 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.70s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 13:05:15,685 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.88s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 13:05:17,090 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 13:05:19,729 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.64s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 13:05:24,182 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 13:05:26,883 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.70s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 13:05:29,389 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.48s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 13:05:31,041 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.62s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 13:05:33,748 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.71s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 13:05:38,299 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.92s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 13:05:40,375 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 13:05:43,597 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.22s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 13:05:45,903 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.27s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 13:05:48,007 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.89s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 13:05:49,564 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.48s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 13:05:54,977 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.07s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 13:05:57,350 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.18s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 13:05:59,220 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.48s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 13:06:01,607 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.39s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 13:06:04,615 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.01s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 13:06:07,745 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.33s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 13:06:09,181 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.40s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 13:06:14,729 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.93s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 13:06:17,331 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.60s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 13:06:21,065 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.90s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 13:06:23,254 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.19s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 13:06:23,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 13:06:23,437 INFO L93 Difference]: Finished difference Result 3434 states and 4446 transitions. [2023-12-24 13:06:23,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-24 13:06:23,444 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 24.125) internal successors, (193), 8 states have internal predecessors, (193), 4 states have call successors, (28), 3 states have call predecessors, (28), 3 states have return successors, (28), 4 states have call predecessors, (28), 4 states have call successors, (28) Word has length 170 [2023-12-24 13:06:23,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 13:06:23,452 INFO L225 Difference]: With dead ends: 3434 [2023-12-24 13:06:23,452 INFO L226 Difference]: Without dead ends: 2642 [2023-12-24 13:06:23,453 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 348 GetRequests, 335 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2023-12-24 13:06:23,454 INFO L413 NwaCegarLoop]: 196 mSDtfsCounter, 878 mSDsluCounter, 855 mSDsCounter, 0 mSdLazyCounter, 318 mSolverCounterSat, 80 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 83.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 878 SdHoareTripleChecker+Valid, 1051 SdHoareTripleChecker+Invalid, 399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 318 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 84.7s IncrementalHoareTripleChecker+Time [2023-12-24 13:06:23,454 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [878 Valid, 1051 Invalid, 399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 318 Invalid, 1 Unknown, 0 Unchecked, 84.7s Time] [2023-12-24 13:06:23,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2642 states. [2023-12-24 13:06:23,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2642 to 2155. [2023-12-24 13:06:23,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2155 states, 1983 states have (on average 1.2798789712556733) internal successors, (2538), 1994 states have internal predecessors, (2538), 107 states have call successors, (107), 64 states have call predecessors, (107), 64 states have return successors, (107), 96 states have call predecessors, (107), 107 states have call successors, (107) [2023-12-24 13:06:23,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2155 states to 2155 states and 2752 transitions. [2023-12-24 13:06:23,577 INFO L78 Accepts]: Start accepts. Automaton has 2155 states and 2752 transitions. Word has length 170 [2023-12-24 13:06:23,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 13:06:23,577 INFO L495 AbstractCegarLoop]: Abstraction has 2155 states and 2752 transitions. [2023-12-24 13:06:23,577 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 24.125) internal successors, (193), 8 states have internal predecessors, (193), 4 states have call successors, (28), 3 states have call predecessors, (28), 3 states have return successors, (28), 4 states have call predecessors, (28), 4 states have call successors, (28) [2023-12-24 13:06:23,577 INFO L276 IsEmpty]: Start isEmpty. Operand 2155 states and 2752 transitions. [2023-12-24 13:06:23,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2023-12-24 13:06:23,580 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 13:06:23,580 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 13:06:23,614 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Forceful destruction successful, exit code 0 [2023-12-24 13:06:23,796 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 13:06:23,796 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 13:06:23,797 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 13:06:23,797 INFO L85 PathProgramCache]: Analyzing trace with hash 1568857603, now seen corresponding path program 1 times [2023-12-24 13:06:23,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 13:06:23,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [970262188] [2023-12-24 13:06:23,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 13:06:23,797 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 13:06:23,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 13:06:23,798 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 13:06:23,800 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 13:06:24,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 13:06:24,556 INFO L262 TraceCheckSpWp]: Trace formula consists of 411 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-24 13:06:24,559 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 13:06:24,817 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 13:06:24,849 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 16 treesize of output 12 [2023-12-24 13:06:24,984 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2023-12-24 13:06:25,166 INFO L134 CoverageAnalysis]: Checked inductivity of 414 backedges. 15 proven. 231 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2023-12-24 13:06:25,166 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 13:06:32,610 INFO L134 CoverageAnalysis]: Checked inductivity of 414 backedges. 15 proven. 35 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2023-12-24 13:06:32,610 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 13:06:32,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [970262188] [2023-12-24 13:06:32,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [970262188] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 13:06:32,610 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 13:06:32,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 10 [2023-12-24 13:06:32,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208103612] [2023-12-24 13:06:32,610 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 13:06:32,611 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-24 13:06:32,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 13:06:32,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-24 13:06:32,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2023-12-24 13:06:32,612 INFO L87 Difference]: Start difference. First operand 2155 states and 2752 transitions. Second operand has 10 states, 10 states have (on average 19.7) internal successors, (197), 10 states have internal predecessors, (197), 4 states have call successors, (28), 3 states have call predecessors, (28), 3 states have return successors, (28), 4 states have call predecessors, (28), 4 states have call successors, (28) [2023-12-24 13:06:36,425 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.66s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 13:06:39,535 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.06s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 13:06:41,223 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.65s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 13:06:43,657 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.39s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 13:06:48,125 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.47s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 13:06:50,500 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 13:06:52,638 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 13:06:54,830 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.41s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 13:06:56,967 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 13:07:00,922 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.75s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 13:07:02,503 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.58s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 13:07:05,477 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.97s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 13:07:05,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 13:07:05,821 INFO L93 Difference]: Finished difference Result 3141 states and 3960 transitions. [2023-12-24 13:07:05,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-24 13:07:05,822 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 19.7) internal successors, (197), 10 states have internal predecessors, (197), 4 states have call successors, (28), 3 states have call predecessors, (28), 3 states have return successors, (28), 4 states have call predecessors, (28), 4 states have call successors, (28) Word has length 172 [2023-12-24 13:07:05,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 13:07:05,825 INFO L225 Difference]: With dead ends: 3141 [2023-12-24 13:07:05,825 INFO L226 Difference]: Without dead ends: 1044 [2023-12-24 13:07:05,827 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 349 GetRequests, 336 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2023-12-24 13:07:05,828 INFO L413 NwaCegarLoop]: 189 mSDtfsCounter, 416 mSDsluCounter, 314 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 31.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 416 SdHoareTripleChecker+Valid, 503 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 32.2s IncrementalHoareTripleChecker+Time [2023-12-24 13:07:05,828 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [416 Valid, 503 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 32.2s Time] [2023-12-24 13:07:05,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1044 states. [2023-12-24 13:07:05,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1044 to 417. [2023-12-24 13:07:05,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 417 states, 373 states have (on average 1.227882037533512) internal successors, (458), 376 states have internal predecessors, (458), 27 states have call successors, (27), 16 states have call predecessors, (27), 16 states have return successors, (27), 24 states have call predecessors, (27), 27 states have call successors, (27) [2023-12-24 13:07:05,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 512 transitions. [2023-12-24 13:07:05,859 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 512 transitions. Word has length 172 [2023-12-24 13:07:05,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 13:07:05,860 INFO L495 AbstractCegarLoop]: Abstraction has 417 states and 512 transitions. [2023-12-24 13:07:05,860 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 19.7) internal successors, (197), 10 states have internal predecessors, (197), 4 states have call successors, (28), 3 states have call predecessors, (28), 3 states have return successors, (28), 4 states have call predecessors, (28), 4 states have call successors, (28) [2023-12-24 13:07:05,860 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 512 transitions. [2023-12-24 13:07:05,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2023-12-24 13:07:05,862 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 13:07:05,862 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 13:07:05,894 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 13:07:06,084 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 13:07:06,084 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 13:07:06,085 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 13:07:06,085 INFO L85 PathProgramCache]: Analyzing trace with hash -395602426, now seen corresponding path program 1 times [2023-12-24 13:07:06,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 13:07:06,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [665336377] [2023-12-24 13:07:06,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 13:07:06,086 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 13:07:06,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 13:07:06,087 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 13:07:06,089 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 13:07:06,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 13:07:07,003 INFO L262 TraceCheckSpWp]: Trace formula consists of 422 conjuncts, 18 conjunts are in the unsatisfiable core [2023-12-24 13:07:07,007 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 13:07:09,242 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 13:07:09,242 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 366 treesize of output 114 [2023-12-24 13:07:09,512 INFO L134 CoverageAnalysis]: Checked inductivity of 421 backedges. 6 proven. 168 refuted. 0 times theorem prover too weak. 247 trivial. 0 not checked. [2023-12-24 13:07:09,512 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 13:07:10,924 INFO L134 CoverageAnalysis]: Checked inductivity of 421 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 405 trivial. 0 not checked. [2023-12-24 13:07:10,924 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 13:07:10,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [665336377] [2023-12-24 13:07:10,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [665336377] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-24 13:07:10,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-24 13:07:10,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [12] total 18 [2023-12-24 13:07:10,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155947466] [2023-12-24 13:07:10,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 13:07:10,925 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-24 13:07:10,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 13:07:10,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-24 13:07:10,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2023-12-24 13:07:10,925 INFO L87 Difference]: Start difference. First operand 417 states and 512 transitions. Second operand has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-12-24 13:07:13,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 13:07:13,128 INFO L93 Difference]: Finished difference Result 879 states and 1073 transitions. [2023-12-24 13:07:13,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-24 13:07:13,130 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 180 [2023-12-24 13:07:13,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 13:07:13,132 INFO L225 Difference]: With dead ends: 879 [2023-12-24 13:07:13,132 INFO L226 Difference]: Without dead ends: 520 [2023-12-24 13:07:13,137 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 364 GetRequests, 344 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=87, Invalid=375, Unknown=0, NotChecked=0, Total=462 [2023-12-24 13:07:13,138 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 186 mSDsluCounter, 380 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 497 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2023-12-24 13:07:13,140 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 497 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2023-12-24 13:07:13,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 520 states. [2023-12-24 13:07:13,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 520 to 438. [2023-12-24 13:07:13,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 438 states, 394 states have (on average 1.2258883248730965) internal successors, (483), 397 states have internal predecessors, (483), 27 states have call successors, (27), 16 states have call predecessors, (27), 16 states have return successors, (27), 24 states have call predecessors, (27), 27 states have call successors, (27) [2023-12-24 13:07:13,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 537 transitions. [2023-12-24 13:07:13,180 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 537 transitions. Word has length 180 [2023-12-24 13:07:13,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 13:07:13,180 INFO L495 AbstractCegarLoop]: Abstraction has 438 states and 537 transitions. [2023-12-24 13:07:13,180 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-12-24 13:07:13,180 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 537 transitions. [2023-12-24 13:07:13,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2023-12-24 13:07:13,182 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 13:07:13,182 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 13:07:13,217 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 13:07:13,408 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 13:07:13,408 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 13:07:13,409 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 13:07:13,409 INFO L85 PathProgramCache]: Analyzing trace with hash -137436988, now seen corresponding path program 1 times [2023-12-24 13:07:13,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 13:07:13,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [663909701] [2023-12-24 13:07:13,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 13:07:13,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 13:07:13,410 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 13:07:13,411 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 13:07:13,448 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 13:07:14,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 13:07:14,373 INFO L262 TraceCheckSpWp]: Trace formula consists of 422 conjuncts, 17 conjunts are in the unsatisfiable core [2023-12-24 13:07:14,376 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 13:07:15,664 INFO L134 CoverageAnalysis]: Checked inductivity of 421 backedges. 7 proven. 166 refuted. 0 times theorem prover too weak. 248 trivial. 0 not checked. [2023-12-24 13:07:15,664 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 13:07:17,183 INFO L134 CoverageAnalysis]: Checked inductivity of 421 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 404 trivial. 0 not checked. [2023-12-24 13:07:17,183 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 13:07:17,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [663909701] [2023-12-24 13:07:17,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [663909701] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-24 13:07:17,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-24 13:07:17,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 14 [2023-12-24 13:07:17,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811085822] [2023-12-24 13:07:17,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 13:07:17,184 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-24 13:07:17,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 13:07:17,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-24 13:07:17,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2023-12-24 13:07:17,185 INFO L87 Difference]: Start difference. First operand 438 states and 537 transitions. Second operand has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-12-24 13:07:20,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 13:07:20,693 INFO L93 Difference]: Finished difference Result 883 states and 1079 transitions. [2023-12-24 13:07:20,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-24 13:07:20,697 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 180 [2023-12-24 13:07:20,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 13:07:20,698 INFO L225 Difference]: With dead ends: 883 [2023-12-24 13:07:20,698 INFO L226 Difference]: Without dead ends: 503 [2023-12-24 13:07:20,699 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 367 GetRequests, 350 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=72, Invalid=270, Unknown=0, NotChecked=0, Total=342 [2023-12-24 13:07:20,699 INFO L413 NwaCegarLoop]: 130 mSDtfsCounter, 198 mSDsluCounter, 404 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 534 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2023-12-24 13:07:20,699 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 534 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2023-12-24 13:07:20,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 503 states. [2023-12-24 13:07:20,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 503 to 426. [2023-12-24 13:07:20,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 426 states, 382 states have (on average 1.225130890052356) internal successors, (468), 385 states have internal predecessors, (468), 27 states have call successors, (27), 16 states have call predecessors, (27), 16 states have return successors, (27), 24 states have call predecessors, (27), 27 states have call successors, (27) [2023-12-24 13:07:20,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 522 transitions. [2023-12-24 13:07:20,729 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 522 transitions. Word has length 180 [2023-12-24 13:07:20,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 13:07:20,730 INFO L495 AbstractCegarLoop]: Abstraction has 426 states and 522 transitions. [2023-12-24 13:07:20,730 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-12-24 13:07:20,730 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 522 transitions. [2023-12-24 13:07:20,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2023-12-24 13:07:20,732 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 13:07:20,732 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 13:07:20,762 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 13:07:20,948 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 13:07:20,948 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 13:07:20,949 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 13:07:20,949 INFO L85 PathProgramCache]: Analyzing trace with hash 27099400, now seen corresponding path program 1 times [2023-12-24 13:07:20,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 13:07:20,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [199015428] [2023-12-24 13:07:20,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 13:07:20,949 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 13:07:20,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 13:07:20,950 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 13:07:20,951 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 13:07:21,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 13:07:21,806 INFO L262 TraceCheckSpWp]: Trace formula consists of 422 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-24 13:07:21,809 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 13:07:22,000 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 13:07:22,001 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 191 treesize of output 59 [2023-12-24 13:07:22,519 INFO L134 CoverageAnalysis]: Checked inductivity of 421 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 404 trivial. 0 not checked. [2023-12-24 13:07:22,519 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 13:07:22,520 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 13:07:22,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [199015428] [2023-12-24 13:07:22,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [199015428] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 13:07:22,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 13:07:22,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-24 13:07:22,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504548673] [2023-12-24 13:07:22,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 13:07:22,520 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-24 13:07:22,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 13:07:22,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-24 13:07:22,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-24 13:07:22,521 INFO L87 Difference]: Start difference. First operand 426 states and 522 transitions. Second operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-12-24 13:07:27,278 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-24 13:07:27,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 13:07:27,419 INFO L93 Difference]: Finished difference Result 796 states and 971 transitions. [2023-12-24 13:07:27,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-24 13:07:27,421 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 180 [2023-12-24 13:07:27,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 13:07:27,422 INFO L225 Difference]: With dead ends: 796 [2023-12-24 13:07:27,423 INFO L226 Difference]: Without dead ends: 428 [2023-12-24 13:07:27,423 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-12-24 13:07:27,423 INFO L413 NwaCegarLoop]: 131 mSDtfsCounter, 65 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 438 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2023-12-24 13:07:27,424 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 438 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 89 Invalid, 1 Unknown, 0 Unchecked, 4.7s Time] [2023-12-24 13:07:27,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2023-12-24 13:07:27,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 426. [2023-12-24 13:07:27,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 426 states, 382 states have (on average 1.219895287958115) internal successors, (466), 385 states have internal predecessors, (466), 27 states have call successors, (27), 16 states have call predecessors, (27), 16 states have return successors, (27), 24 states have call predecessors, (27), 27 states have call successors, (27) [2023-12-24 13:07:27,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 520 transitions. [2023-12-24 13:07:27,452 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 520 transitions. Word has length 180 [2023-12-24 13:07:27,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 13:07:27,452 INFO L495 AbstractCegarLoop]: Abstraction has 426 states and 520 transitions. [2023-12-24 13:07:27,452 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-12-24 13:07:27,453 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 520 transitions. [2023-12-24 13:07:27,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2023-12-24 13:07:27,455 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 13:07:27,455 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 13:07:27,491 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 (27)] Forceful destruction successful, exit code 0 [2023-12-24 13:07:27,680 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 13:07:27,680 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 13:07:27,681 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 13:07:27,681 INFO L85 PathProgramCache]: Analyzing trace with hash 285264838, now seen corresponding path program 1 times [2023-12-24 13:07:27,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 13:07:27,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [445956062] [2023-12-24 13:07:27,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 13:07:27,681 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 13:07:27,681 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 13:07:27,682 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 13:07:27,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 (28)] Waiting until timeout for monitored process [2023-12-24 13:07:28,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 13:07:28,552 INFO L262 TraceCheckSpWp]: Trace formula consists of 422 conjuncts, 16 conjunts are in the unsatisfiable core [2023-12-24 13:07:28,556 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 13:07:30,412 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 13:07:30,412 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 303 treesize of output 99 [2023-12-24 13:07:30,582 INFO L134 CoverageAnalysis]: Checked inductivity of 421 backedges. 6 proven. 168 refuted. 0 times theorem prover too weak. 247 trivial. 0 not checked. [2023-12-24 13:07:30,582 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 13:07:31,872 INFO L134 CoverageAnalysis]: Checked inductivity of 421 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 405 trivial. 0 not checked. [2023-12-24 13:07:31,872 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 13:07:31,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [445956062] [2023-12-24 13:07:31,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [445956062] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-24 13:07:31,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-24 13:07:31,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [11] total 17 [2023-12-24 13:07:31,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574899317] [2023-12-24 13:07:31,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 13:07:31,873 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-24 13:07:31,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 13:07:31,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-24 13:07:31,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2023-12-24 13:07:31,873 INFO L87 Difference]: Start difference. First operand 426 states and 520 transitions. Second operand has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-12-24 13:07:33,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 13:07:33,706 INFO L93 Difference]: Finished difference Result 828 states and 1004 transitions. [2023-12-24 13:07:33,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-24 13:07:33,709 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 180 [2023-12-24 13:07:33,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 13:07:33,711 INFO L225 Difference]: With dead ends: 828 [2023-12-24 13:07:33,711 INFO L226 Difference]: Without dead ends: 460 [2023-12-24 13:07:33,711 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 362 GetRequests, 344 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=76, Invalid=304, Unknown=0, NotChecked=0, Total=380 [2023-12-24 13:07:33,711 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 51 mSDsluCounter, 476 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 612 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-12-24 13:07:33,712 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 612 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2023-12-24 13:07:33,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2023-12-24 13:07:33,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 416. [2023-12-24 13:07:33,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 416 states, 372 states have (on average 1.2204301075268817) internal successors, (454), 375 states have internal predecessors, (454), 27 states have call successors, (27), 16 states have call predecessors, (27), 16 states have return successors, (27), 24 states have call predecessors, (27), 27 states have call successors, (27) [2023-12-24 13:07:33,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 508 transitions. [2023-12-24 13:07:33,732 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 508 transitions. Word has length 180 [2023-12-24 13:07:33,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 13:07:33,732 INFO L495 AbstractCegarLoop]: Abstraction has 416 states and 508 transitions. [2023-12-24 13:07:33,732 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-12-24 13:07:33,732 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 508 transitions. [2023-12-24 13:07:33,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2023-12-24 13:07:33,733 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 13:07:33,733 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 13:07:33,764 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 13:07:33,946 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 13:07:33,947 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 13:07:33,947 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 13:07:33,947 INFO L85 PathProgramCache]: Analyzing trace with hash -1144918562, now seen corresponding path program 1 times [2023-12-24 13:07:33,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 13:07:33,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1534492613] [2023-12-24 13:07:33,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 13:07:33,948 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 13:07:33,948 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 13:07:33,949 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 13:07:33,949 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (29)] Waiting until timeout for monitored process [2023-12-24 13:07:34,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 13:07:34,721 INFO L262 TraceCheckSpWp]: Trace formula consists of 422 conjuncts, 14 conjunts are in the unsatisfiable core [2023-12-24 13:07:34,724 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 13:07:35,282 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 29 [2023-12-24 13:07:35,589 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 13:07:35,589 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 20 [2023-12-24 13:07:36,415 INFO L134 CoverageAnalysis]: Checked inductivity of 421 backedges. 36 proven. 261 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2023-12-24 13:07:36,415 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 13:07:37,168 INFO L134 CoverageAnalysis]: Checked inductivity of 421 backedges. 15 proven. 114 refuted. 0 times theorem prover too weak. 292 trivial. 0 not checked. [2023-12-24 13:07:37,168 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 13:07:37,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1534492613] [2023-12-24 13:07:37,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1534492613] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 13:07:37,169 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 13:07:37,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10] total 19 [2023-12-24 13:07:37,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99165874] [2023-12-24 13:07:37,169 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 13:07:37,169 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-12-24 13:07:37,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 13:07:37,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-12-24 13:07:37,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=268, Unknown=0, NotChecked=0, Total=342 [2023-12-24 13:07:37,170 INFO L87 Difference]: Start difference. First operand 416 states and 508 transitions. Second operand has 19 states, 15 states have (on average 14.733333333333333) internal successors, (221), 19 states have internal predecessors, (221), 8 states have call successors, (28), 4 states have call predecessors, (28), 6 states have return successors, (28), 4 states have call predecessors, (28), 8 states have call successors, (28) [2023-12-24 13:07:38,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 13:07:38,905 INFO L93 Difference]: Finished difference Result 808 states and 977 transitions. [2023-12-24 13:07:38,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2023-12-24 13:07:38,906 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 15 states have (on average 14.733333333333333) internal successors, (221), 19 states have internal predecessors, (221), 8 states have call successors, (28), 4 states have call predecessors, (28), 6 states have return successors, (28), 4 states have call predecessors, (28), 8 states have call successors, (28) Word has length 182 [2023-12-24 13:07:38,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 13:07:38,907 INFO L225 Difference]: With dead ends: 808 [2023-12-24 13:07:38,907 INFO L226 Difference]: Without dead ends: 450 [2023-12-24 13:07:38,908 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 385 GetRequests, 345 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 318 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=364, Invalid=1276, Unknown=0, NotChecked=0, Total=1640 [2023-12-24 13:07:38,908 INFO L413 NwaCegarLoop]: 190 mSDtfsCounter, 301 mSDsluCounter, 1252 mSDsCounter, 0 mSdLazyCounter, 416 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 303 SdHoareTripleChecker+Valid, 1442 SdHoareTripleChecker+Invalid, 435 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 416 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-12-24 13:07:38,908 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [303 Valid, 1442 Invalid, 435 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 416 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-12-24 13:07:38,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2023-12-24 13:07:38,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 376. [2023-12-24 13:07:38,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 376 states, 332 states have (on average 1.2108433734939759) internal successors, (402), 335 states have internal predecessors, (402), 27 states have call successors, (27), 16 states have call predecessors, (27), 16 states have return successors, (27), 24 states have call predecessors, (27), 27 states have call successors, (27) [2023-12-24 13:07:38,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 456 transitions. [2023-12-24 13:07:38,934 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 456 transitions. Word has length 182 [2023-12-24 13:07:38,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 13:07:38,934 INFO L495 AbstractCegarLoop]: Abstraction has 376 states and 456 transitions. [2023-12-24 13:07:38,934 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 15 states have (on average 14.733333333333333) internal successors, (221), 19 states have internal predecessors, (221), 8 states have call successors, (28), 4 states have call predecessors, (28), 6 states have return successors, (28), 4 states have call predecessors, (28), 8 states have call successors, (28) [2023-12-24 13:07:38,934 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 456 transitions. [2023-12-24 13:07:38,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2023-12-24 13:07:38,935 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 13:07:38,936 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 13:07:38,961 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 13:07:39,148 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 13:07:39,148 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 13:07:39,149 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 13:07:39,149 INFO L85 PathProgramCache]: Analyzing trace with hash 1361673630, now seen corresponding path program 1 times [2023-12-24 13:07:39,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 13:07:39,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1443435045] [2023-12-24 13:07:39,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 13:07:39,149 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 13:07:39,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 13:07:39,150 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 13:07:39,152 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 13:07:39,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 13:07:39,956 INFO L262 TraceCheckSpWp]: Trace formula consists of 428 conjuncts, 9 conjunts are in the unsatisfiable core [2023-12-24 13:07:39,959 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 13:07:39,968 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 14 treesize of output 10 [2023-12-24 13:07:40,028 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 25 [2023-12-24 13:07:40,084 INFO L134 CoverageAnalysis]: Checked inductivity of 421 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 407 trivial. 0 not checked. [2023-12-24 13:07:40,085 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 13:07:40,085 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 13:07:40,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1443435045] [2023-12-24 13:07:40,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1443435045] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 13:07:40,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 13:07:40,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-24 13:07:40,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880997180] [2023-12-24 13:07:40,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 13:07:40,086 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-24 13:07:40,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 13:07:40,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-24 13:07:40,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-24 13:07:40,086 INFO L87 Difference]: Start difference. First operand 376 states and 456 transitions. Second operand has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-12-24 13:07:40,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 13:07:40,342 INFO L93 Difference]: Finished difference Result 688 states and 831 transitions. [2023-12-24 13:07:40,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-24 13:07:40,343 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 182 [2023-12-24 13:07:40,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 13:07:40,343 INFO L225 Difference]: With dead ends: 688 [2023-12-24 13:07:40,343 INFO L226 Difference]: Without dead ends: 0 [2023-12-24 13:07:40,344 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 179 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2023-12-24 13:07:40,344 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 146 mSDsluCounter, 512 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 634 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-24 13:07:40,345 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 634 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-24 13:07:40,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-12-24 13:07:40,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-12-24 13:07:40,345 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 13:07:40,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-12-24 13:07:40,345 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 182 [2023-12-24 13:07:40,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 13:07:40,345 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-12-24 13:07:40,345 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-12-24 13:07:40,345 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-12-24 13:07:40,345 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-12-24 13:07:40,347 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-24 13:07:40,408 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 (30)] Ended with exit code 0 [2023-12-24 13:07:40,548 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 13:07:40,550 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-12-24 13:07:59,035 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(line 20) the Hoare annotation is: true [2023-12-24 13:07:59,035 INFO L899 garLoopResultBuilder]: For program point L20(line 20) no Hoare annotation was computed. [2023-12-24 13:07:59,035 INFO L899 garLoopResultBuilder]: For program point L20-2(line 20) no Hoare annotation was computed. [2023-12-24 13:07:59,035 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(line 20) no Hoare annotation was computed. [2023-12-24 13:07:59,035 INFO L899 garLoopResultBuilder]: For program point L52(lines 52 56) no Hoare annotation was computed. [2023-12-24 13:07:59,035 INFO L899 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2023-12-24 13:07:59,035 INFO L899 garLoopResultBuilder]: For program point L19-1(line 19) no Hoare annotation was computed. [2023-12-24 13:07:59,036 INFO L899 garLoopResultBuilder]: For program point L19-3(line 19) no Hoare annotation was computed. [2023-12-24 13:07:59,036 INFO L895 garLoopResultBuilder]: At program point L69(line 69) the Hoare annotation is: (let ((.cse25 (select |#memory_int#2| |~#double_Array_0~0.base|)) (.cse22 ((_ sign_extend 16) (_ bv32 16))) (.cse28 (select |#memory_int#1| |~#BOOL_unsigned_char_Array_0~0.base|))) (let ((.cse11 (select .cse28 (bvadd |~#BOOL_unsigned_char_Array_0~0.offset| (_ bv1 32)))) (.cse17 ((_ sign_extend 24) (_ bv0 8))) (.cse18 ((_ extract 15 0) .cse22)) (.cse5 (select (select |#memory_int#4| |~#signed_short_int_Array_0~0.base|) |~#signed_short_int_Array_0~0.offset|)) (.cse16 (select (select |#memory_int#5| |~#unsigned_short_int_Array_0~0.base|) |~#unsigned_short_int_Array_0~0.offset|)) (.cse19 ((_ extract 7 0) (select .cse28 |~#BOOL_unsigned_char_Array_0~0.offset|))) (.cse21 (let ((.cse27 (concat (select .cse25 (bvadd |~#double_Array_0~0.offset| (_ bv20 32))) (select .cse25 (bvadd |~#double_Array_0~0.offset| (_ bv16 32)))))) (fp ((_ extract 63 63) .cse27) ((_ extract 62 52) .cse27) ((_ extract 51 0) .cse27)))) (.cse23 (let ((.cse26 (concat (select .cse25 (bvadd |~#double_Array_0~0.offset| (_ bv12 32))) (select .cse25 (bvadd |~#double_Array_0~0.offset| (_ bv8 32)))))) (fp ((_ extract 63 63) .cse26) ((_ extract 62 52) .cse26) ((_ extract 51 0) .cse26)))) (.cse20 (let ((.cse24 (concat (select .cse25 (bvadd |~#double_Array_0~0.offset| (_ bv4 32))) (select .cse25 |~#double_Array_0~0.offset|)))) (fp ((_ extract 63 63) .cse24) ((_ extract 62 52) .cse24) ((_ extract 51 0) .cse24))))) (let ((.cse8 (fp.lt .cse23 .cse20)) (.cse6 (fp.leq .cse23 .cse21)) (.cse0 (= .cse19 |ULTIMATE.start_updateVariables_#t~mem28#1|)) (.cse1 (= .cse22 .cse16)) (.cse2 (fp.leq .cse20 .cse21)) (.cse3 (bvsge ((_ zero_extend 24) .cse19) (_ bv1 32))) (.cse12 (= ((_ sign_extend 16) .cse18) .cse5)) (.cse7 (= ((_ extract 7 0) .cse17) ~last_1_BOOL_unsigned_char_Array_0_1_~0)) (.cse13 (= ~last_1_signed_short_int_Array_0_0_~0 ((_ extract 15 0) ((_ sign_extend 16) ((_ extract 15 0) ((_ zero_extend 16) .cse18)))))) (.cse9 (= currentRoundingMode roundNearestTiesToEven)) (.cse10 (= .cse17 .cse11))) (or (let ((.cse4 ((_ sign_extend 16) (_ bv256 16)))) (and .cse0 .cse1 .cse2 .cse3 (= .cse4 .cse5) .cse6 .cse7 (= ~last_1_signed_short_int_Array_0_0_~0 ((_ extract 15 0) .cse4)) (not .cse8) .cse9 .cse10)) (and .cse0 .cse1 .cse3 (not (= ((_ extract 7 0) .cse11) (_ bv0 8))) .cse12 .cse13 (exists ((v_arrayElimCell_59 (_ BitVec 32))) (let ((.cse14 ((_ extract 7 0) v_arrayElimCell_59))) (let ((.cse15 ((_ zero_extend 24) .cse14))) (and (= ((_ extract 7 0) ((_ sign_extend 24) .cse14)) ~last_1_BOOL_unsigned_char_Array_0_1_~0) (bvsle .cse15 (_ bv1 32)) (bvsge .cse15 (_ bv1 32)))))) .cse9) (and .cse0 .cse1 .cse3 (= ((_ sign_extend 16) ((_ extract 15 0) ((_ zero_extend 16) ((_ extract 15 0) .cse16)))) .cse5) .cse8 .cse6 .cse7 .cse13 .cse9 .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse12 .cse7 .cse13 .cse9 .cse10))))) [2023-12-24 13:07:59,036 INFO L899 garLoopResultBuilder]: For program point L69-1(line 69) no Hoare annotation was computed. [2023-12-24 13:07:59,036 INFO L899 garLoopResultBuilder]: For program point L86(line 86) no Hoare annotation was computed. [2023-12-24 13:07:59,036 INFO L899 garLoopResultBuilder]: For program point L53(line 53) no Hoare annotation was computed. [2023-12-24 13:07:59,036 INFO L899 garLoopResultBuilder]: For program point L86-1(line 86) no Hoare annotation was computed. [2023-12-24 13:07:59,036 INFO L899 garLoopResultBuilder]: For program point L86-2(line 86) no Hoare annotation was computed. [2023-12-24 13:07:59,036 INFO L899 garLoopResultBuilder]: For program point L53-2(line 53) no Hoare annotation was computed. [2023-12-24 13:07:59,036 INFO L899 garLoopResultBuilder]: For program point L86-4(line 86) no Hoare annotation was computed. [2023-12-24 13:07:59,037 INFO L899 garLoopResultBuilder]: For program point L86-6(line 86) no Hoare annotation was computed. [2023-12-24 13:07:59,037 INFO L899 garLoopResultBuilder]: For program point L86-8(line 86) no Hoare annotation was computed. [2023-12-24 13:07:59,037 INFO L899 garLoopResultBuilder]: For program point L86-9(line 86) no Hoare annotation was computed. [2023-12-24 13:07:59,037 INFO L899 garLoopResultBuilder]: For program point L86-10(line 86) no Hoare annotation was computed. [2023-12-24 13:07:59,037 INFO L899 garLoopResultBuilder]: For program point L86-12(line 86) no Hoare annotation was computed. [2023-12-24 13:07:59,037 INFO L899 garLoopResultBuilder]: For program point L86-13(line 86) no Hoare annotation was computed. [2023-12-24 13:07:59,037 INFO L899 garLoopResultBuilder]: For program point L86-14(line 86) no Hoare annotation was computed. [2023-12-24 13:07:59,037 INFO L899 garLoopResultBuilder]: For program point L86-16(line 86) no Hoare annotation was computed. [2023-12-24 13:07:59,037 INFO L899 garLoopResultBuilder]: For program point L86-18(line 86) no Hoare annotation was computed. [2023-12-24 13:07:59,037 INFO L899 garLoopResultBuilder]: For program point L86-20(line 86) no Hoare annotation was computed. [2023-12-24 13:07:59,037 INFO L899 garLoopResultBuilder]: For program point L86-22(line 86) no Hoare annotation was computed. [2023-12-24 13:07:59,037 INFO L899 garLoopResultBuilder]: For program point L86-23(line 86) no Hoare annotation was computed. [2023-12-24 13:07:59,037 INFO L899 garLoopResultBuilder]: For program point L86-24(line 86) no Hoare annotation was computed. [2023-12-24 13:07:59,037 INFO L899 garLoopResultBuilder]: For program point L86-25(line 86) no Hoare annotation was computed. [2023-12-24 13:07:59,037 INFO L899 garLoopResultBuilder]: For program point L86-26(line 86) no Hoare annotation was computed. [2023-12-24 13:07:59,037 INFO L899 garLoopResultBuilder]: For program point L86-28(line 86) no Hoare annotation was computed. [2023-12-24 13:07:59,037 INFO L899 garLoopResultBuilder]: For program point L86-30(line 86) no Hoare annotation was computed. [2023-12-24 13:07:59,037 INFO L899 garLoopResultBuilder]: For program point L86-32(line 86) no Hoare annotation was computed. [2023-12-24 13:07:59,037 INFO L899 garLoopResultBuilder]: For program point L86-34(line 86) no Hoare annotation was computed. [2023-12-24 13:07:59,038 INFO L899 garLoopResultBuilder]: For program point L71(line 71) no Hoare annotation was computed. [2023-12-24 13:07:59,038 INFO L899 garLoopResultBuilder]: For program point L71-2(line 71) no Hoare annotation was computed. [2023-12-24 13:07:59,038 INFO L899 garLoopResultBuilder]: For program point L71-3(line 71) no Hoare annotation was computed. [2023-12-24 13:07:59,038 INFO L899 garLoopResultBuilder]: For program point L71-5(line 71) no Hoare annotation was computed. [2023-12-24 13:07:59,038 INFO L899 garLoopResultBuilder]: For program point L71-7(line 71) no Hoare annotation was computed. [2023-12-24 13:07:59,038 INFO L895 garLoopResultBuilder]: At program point L71-8(line 71) the Hoare annotation is: (let ((.cse19 ((_ sign_extend 16) (_ bv32 16))) (.cse20 (select |#memory_int#1| |~#BOOL_unsigned_char_Array_0~0.base|))) (let ((.cse2 (select .cse20 (bvadd |~#BOOL_unsigned_char_Array_0~0.offset| (_ bv1 32)))) (.cse16 ((_ sign_extend 24) (_ bv0 8))) (.cse17 ((_ extract 15 0) .cse19)) (.cse10 (select (select |#memory_int#4| |~#signed_short_int_Array_0~0.base|) |~#signed_short_int_Array_0~0.offset|)) (.cse18 ((_ zero_extend 24) ((_ extract 7 0) (select .cse20 |~#BOOL_unsigned_char_Array_0~0.offset|))))) (let ((.cse0 (= .cse19 (select (select |#memory_int#5| |~#unsigned_short_int_Array_0~0.base|) |~#unsigned_short_int_Array_0~0.offset|))) (.cse1 (bvsge .cse18 (_ bv1 32))) (.cse3 (bvsle .cse18 (_ bv1 32))) (.cse4 (= ((_ sign_extend 16) .cse17) .cse10)) (.cse14 (= ((_ extract 7 0) .cse16) ~last_1_BOOL_unsigned_char_Array_0_1_~0)) (.cse5 (= ~last_1_signed_short_int_Array_0_0_~0 ((_ extract 15 0) ((_ sign_extend 16) ((_ extract 15 0) ((_ zero_extend 16) .cse17)))))) (.cse8 (= currentRoundingMode roundNearestTiesToEven)) (.cse15 (= .cse16 .cse2))) (or (and .cse0 .cse1 (not (= ((_ extract 7 0) .cse2) (_ bv0 8))) .cse3 .cse4 .cse5 (exists ((v_arrayElimCell_59 (_ BitVec 32))) (let ((.cse6 ((_ extract 7 0) v_arrayElimCell_59))) (let ((.cse7 ((_ zero_extend 24) .cse6))) (and (= ((_ extract 7 0) ((_ sign_extend 24) .cse6)) ~last_1_BOOL_unsigned_char_Array_0_1_~0) (bvsle .cse7 (_ bv1 32)) (bvsge .cse7 (_ bv1 32)))))) .cse8) (let ((.cse9 ((_ sign_extend 16) (_ bv256 16)))) (and .cse0 .cse1 (= .cse9 .cse10) (let ((.cse12 (select |#memory_int#2| |~#double_Array_0~0.base|))) (fp.leq (let ((.cse11 (concat (select .cse12 (bvadd |~#double_Array_0~0.offset| (_ bv12 32))) (select .cse12 (bvadd |~#double_Array_0~0.offset| (_ bv8 32)))))) (fp ((_ extract 63 63) .cse11) ((_ extract 62 52) .cse11) ((_ extract 51 0) .cse11))) (let ((.cse13 (concat (select .cse12 (bvadd |~#double_Array_0~0.offset| (_ bv20 32))) (select .cse12 (bvadd |~#double_Array_0~0.offset| (_ bv16 32)))))) (fp ((_ extract 63 63) .cse13) ((_ extract 62 52) .cse13) ((_ extract 51 0) .cse13))))) .cse3 .cse14 (= ~last_1_signed_short_int_Array_0_0_~0 ((_ extract 15 0) .cse9)) .cse8 .cse15)) (and .cse0 .cse1 .cse3 .cse4 .cse14 .cse5 .cse8 .cse15))))) [2023-12-24 13:07:59,038 INFO L899 garLoopResultBuilder]: For program point L71-9(line 71) no Hoare annotation was computed. [2023-12-24 13:07:59,038 INFO L899 garLoopResultBuilder]: For program point L73(line 73) no Hoare annotation was computed. [2023-12-24 13:07:59,038 INFO L899 garLoopResultBuilder]: For program point L73-2(line 73) no Hoare annotation was computed. [2023-12-24 13:07:59,038 INFO L899 garLoopResultBuilder]: For program point L73-3(line 73) no Hoare annotation was computed. [2023-12-24 13:07:59,038 INFO L899 garLoopResultBuilder]: For program point L73-5(line 73) no Hoare annotation was computed. [2023-12-24 13:07:59,038 INFO L899 garLoopResultBuilder]: For program point L73-7(line 73) no Hoare annotation was computed. [2023-12-24 13:07:59,038 INFO L895 garLoopResultBuilder]: At program point L73-8(line 73) the Hoare annotation is: (let ((.cse16 ((_ sign_extend 16) (_ bv32 16))) (.cse17 (select |#memory_int#1| |~#BOOL_unsigned_char_Array_0~0.base|))) (let ((.cse2 (select .cse17 (bvadd |~#BOOL_unsigned_char_Array_0~0.offset| (_ bv1 32)))) (.cse13 ((_ sign_extend 24) (_ bv0 8))) (.cse14 ((_ extract 15 0) .cse16)) (.cse10 (select (select |#memory_int#4| |~#signed_short_int_Array_0~0.base|) |~#signed_short_int_Array_0~0.offset|)) (.cse15 ((_ zero_extend 24) ((_ extract 7 0) (select .cse17 |~#BOOL_unsigned_char_Array_0~0.offset|))))) (let ((.cse0 (= .cse16 (select (select |#memory_int#5| |~#unsigned_short_int_Array_0~0.base|) |~#unsigned_short_int_Array_0~0.offset|))) (.cse1 (bvsge .cse15 (_ bv1 32))) (.cse3 (bvsle .cse15 (_ bv1 32))) (.cse4 (= ((_ sign_extend 16) .cse14) .cse10)) (.cse11 (= ((_ extract 7 0) .cse13) ~last_1_BOOL_unsigned_char_Array_0_1_~0)) (.cse5 (= ~last_1_signed_short_int_Array_0_0_~0 ((_ extract 15 0) ((_ sign_extend 16) ((_ extract 15 0) ((_ zero_extend 16) .cse14)))))) (.cse8 (= currentRoundingMode roundNearestTiesToEven)) (.cse12 (= .cse13 .cse2))) (or (and .cse0 .cse1 (not (= ((_ extract 7 0) .cse2) (_ bv0 8))) .cse3 .cse4 .cse5 (exists ((v_arrayElimCell_59 (_ BitVec 32))) (let ((.cse6 ((_ extract 7 0) v_arrayElimCell_59))) (let ((.cse7 ((_ zero_extend 24) .cse6))) (and (= ((_ extract 7 0) ((_ sign_extend 24) .cse6)) ~last_1_BOOL_unsigned_char_Array_0_1_~0) (bvsle .cse7 (_ bv1 32)) (bvsge .cse7 (_ bv1 32)))))) .cse8) (let ((.cse9 ((_ sign_extend 16) (_ bv256 16)))) (and .cse0 .cse1 (= .cse9 .cse10) .cse3 .cse11 (= ~last_1_signed_short_int_Array_0_0_~0 ((_ extract 15 0) .cse9)) .cse8 .cse12)) (and .cse0 .cse1 .cse3 .cse4 .cse11 .cse5 .cse8 .cse12))))) [2023-12-24 13:07:59,038 INFO L899 garLoopResultBuilder]: For program point L73-9(line 73) no Hoare annotation was computed. [2023-12-24 13:07:59,038 INFO L899 garLoopResultBuilder]: For program point L41(lines 41 65) no Hoare annotation was computed. [2023-12-24 13:07:59,038 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-12-24 13:07:59,038 INFO L899 garLoopResultBuilder]: For program point L58(line 58) no Hoare annotation was computed. [2023-12-24 13:07:59,039 INFO L899 garLoopResultBuilder]: For program point L58-2(line 58) no Hoare annotation was computed. [2023-12-24 13:07:59,039 INFO L899 garLoopResultBuilder]: For program point L58-3(lines 58 64) no Hoare annotation was computed. [2023-12-24 13:07:59,039 INFO L899 garLoopResultBuilder]: For program point L75(line 75) no Hoare annotation was computed. [2023-12-24 13:07:59,039 INFO L899 garLoopResultBuilder]: For program point L42(lines 42 50) no Hoare annotation was computed. [2023-12-24 13:07:59,039 INFO L899 garLoopResultBuilder]: For program point L75-2(line 75) no Hoare annotation was computed. [2023-12-24 13:07:59,039 INFO L899 garLoopResultBuilder]: For program point L42-1(lines 42 50) no Hoare annotation was computed. [2023-12-24 13:07:59,039 INFO L899 garLoopResultBuilder]: For program point L75-3(line 75) no Hoare annotation was computed. [2023-12-24 13:07:59,039 INFO L899 garLoopResultBuilder]: For program point L75-5(line 75) no Hoare annotation was computed. [2023-12-24 13:07:59,039 INFO L899 garLoopResultBuilder]: For program point L75-7(line 75) no Hoare annotation was computed. [2023-12-24 13:07:59,039 INFO L895 garLoopResultBuilder]: At program point L75-8(line 75) the Hoare annotation is: (let ((.cse16 ((_ sign_extend 16) (_ bv32 16))) (.cse17 (select |#memory_int#1| |~#BOOL_unsigned_char_Array_0~0.base|))) (let ((.cse2 (select .cse17 (bvadd |~#BOOL_unsigned_char_Array_0~0.offset| (_ bv1 32)))) (.cse13 ((_ sign_extend 24) (_ bv0 8))) (.cse14 ((_ extract 15 0) .cse16)) (.cse10 (select (select |#memory_int#4| |~#signed_short_int_Array_0~0.base|) |~#signed_short_int_Array_0~0.offset|)) (.cse15 ((_ zero_extend 24) ((_ extract 7 0) (select .cse17 |~#BOOL_unsigned_char_Array_0~0.offset|))))) (let ((.cse0 (= .cse16 (select (select |#memory_int#5| |~#unsigned_short_int_Array_0~0.base|) |~#unsigned_short_int_Array_0~0.offset|))) (.cse1 (bvsge .cse15 (_ bv1 32))) (.cse3 (bvsle .cse15 (_ bv1 32))) (.cse4 (= ((_ sign_extend 16) .cse14) .cse10)) (.cse11 (= ((_ extract 7 0) .cse13) ~last_1_BOOL_unsigned_char_Array_0_1_~0)) (.cse5 (= ~last_1_signed_short_int_Array_0_0_~0 ((_ extract 15 0) ((_ sign_extend 16) ((_ extract 15 0) ((_ zero_extend 16) .cse14)))))) (.cse8 (= currentRoundingMode roundNearestTiesToEven)) (.cse12 (= .cse13 .cse2))) (or (and .cse0 .cse1 (not (= ((_ extract 7 0) .cse2) (_ bv0 8))) .cse3 .cse4 .cse5 (exists ((v_arrayElimCell_59 (_ BitVec 32))) (let ((.cse6 ((_ extract 7 0) v_arrayElimCell_59))) (let ((.cse7 ((_ zero_extend 24) .cse6))) (and (= ((_ extract 7 0) ((_ sign_extend 24) .cse6)) ~last_1_BOOL_unsigned_char_Array_0_1_~0) (bvsle .cse7 (_ bv1 32)) (bvsge .cse7 (_ bv1 32)))))) .cse8) (let ((.cse9 ((_ sign_extend 16) (_ bv256 16)))) (and .cse0 .cse1 (= .cse9 .cse10) .cse3 .cse11 (= ~last_1_signed_short_int_Array_0_0_~0 ((_ extract 15 0) .cse9)) .cse8 .cse12)) (and .cse0 .cse1 .cse3 .cse4 .cse11 .cse5 .cse8 .cse12))))) [2023-12-24 13:07:59,039 INFO L899 garLoopResultBuilder]: For program point L75-9(line 75) no Hoare annotation was computed. [2023-12-24 13:07:59,039 INFO L899 garLoopResultBuilder]: For program point L59(line 59) no Hoare annotation was computed. [2023-12-24 13:07:59,039 INFO L895 garLoopResultBuilder]: At program point L92-2(lines 92 98) the Hoare annotation is: (let ((.cse27 (select |#memory_int#1| |~#BOOL_unsigned_char_Array_0~0.base|)) (.cse26 (select |#memory_int#2| |~#double_Array_0~0.base|))) (let ((.cse17 (let ((.cse29 (concat (select .cse26 (bvadd |~#double_Array_0~0.offset| (_ bv12 32))) (select .cse26 (bvadd |~#double_Array_0~0.offset| (_ bv8 32)))))) (fp ((_ extract 63 63) .cse29) ((_ extract 62 52) .cse29) ((_ extract 51 0) .cse29)))) (.cse24 (let ((.cse28 (concat (select .cse26 (bvadd |~#double_Array_0~0.offset| (_ bv4 32))) (select .cse26 |~#double_Array_0~0.offset|)))) (fp ((_ extract 63 63) .cse28) ((_ extract 62 52) .cse28) ((_ extract 51 0) .cse28)))) (.cse21 ((_ extract 7 0) (select .cse27 |~#BOOL_unsigned_char_Array_0~0.offset|)))) (let ((.cse16 ((_ sign_extend 16) (_ bv32 16))) (.cse19 (select (select |#memory_int#5| |~#unsigned_short_int_Array_0~0.base|) |~#unsigned_short_int_Array_0~0.offset|)) (.cse10 (select (select |#memory_int#4| |~#signed_short_int_Array_0~0.base|) |~#signed_short_int_Array_0~0.offset|)) (.cse23 ((_ zero_extend 24) .cse21)) (.cse12 ((_ sign_extend 24) (_ bv0 8))) (.cse22 (select .cse27 (bvadd |~#BOOL_unsigned_char_Array_0~0.offset| (_ bv1 32)))) (.cse18 (let ((.cse25 (concat (select .cse26 (bvadd |~#double_Array_0~0.offset| (_ bv20 32))) (select .cse26 (bvadd |~#double_Array_0~0.offset| (_ bv16 32)))))) (fp ((_ extract 63 63) .cse25) ((_ extract 62 52) .cse25) ((_ extract 51 0) .cse25)))) (.cse14 (fp.lt .cse17 .cse24))) (let ((.cse6 (not .cse14)) (.cse8 (fp.leq .cse24 .cse18)) (.cse13 (= .cse12 .cse22)) (.cse1 (bvsge .cse23 (_ bv1 32))) (.cse4 (bvsle .cse23 (_ bv1 32))) (.cse5 (= ((_ sign_extend 24) .cse21) .cse22)) (.cse2 (= ((_ sign_extend 16) ((_ extract 15 0) ((_ zero_extend 16) ((_ extract 15 0) .cse19)))) .cse10)) (.cse3 (let ((.cse20 ((_ sign_extend 16) ~last_1_signed_short_int_Array_0_0_~0))) (bvslt (bvmul (_ bv2 32) .cse20) (bvmul .cse20 .cse20)))) (.cse0 (= .cse16 .cse19)) (.cse11 (fp.leq .cse17 .cse18)) (.cse7 (= currentRoundingMode roundNearestTiesToEven))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (let ((.cse9 ((_ sign_extend 16) (_ bv256 16)))) (and .cse0 .cse8 .cse1 (= .cse9 .cse10) .cse11 .cse4 (= ((_ extract 7 0) .cse12) ~last_1_BOOL_unsigned_char_Array_0_1_~0) (= ~last_1_signed_short_int_Array_0_0_~0 ((_ extract 15 0) .cse9)) .cse6 .cse7 .cse13)) (and .cse0 .cse8 .cse1 .cse2 .cse3 .cse4 .cse7 .cse13) (and .cse0 .cse1 .cse2 .cse14 .cse11 .cse3 .cse4 .cse7 .cse13) (and .cse1 .cse4 .cse5 (or (and .cse0 .cse2 .cse3 .cse7 (not .cse11)) (let ((.cse15 ((_ extract 15 0) .cse16))) (and .cse0 .cse14 .cse11 (= ((_ sign_extend 16) .cse15) .cse10) (= ~last_1_signed_short_int_Array_0_0_~0 ((_ extract 15 0) ((_ sign_extend 16) ((_ extract 15 0) ((_ zero_extend 16) .cse15))))) .cse7))))))))) [2023-12-24 13:07:59,040 INFO L899 garLoopResultBuilder]: For program point L59-2(lines 59 61) no Hoare annotation was computed. [2023-12-24 13:07:59,040 INFO L899 garLoopResultBuilder]: For program point L92-3(lines 92 98) no Hoare annotation was computed. [2023-12-24 13:07:59,040 INFO L899 garLoopResultBuilder]: For program point L43(lines 43 47) no Hoare annotation was computed. [2023-12-24 13:07:59,040 INFO L899 garLoopResultBuilder]: For program point L77(line 77) no Hoare annotation was computed. [2023-12-24 13:07:59,040 INFO L899 garLoopResultBuilder]: For program point L44(lines 44 46) no Hoare annotation was computed. [2023-12-24 13:07:59,040 INFO L899 garLoopResultBuilder]: For program point L77-2(line 77) no Hoare annotation was computed. [2023-12-24 13:07:59,040 INFO L899 garLoopResultBuilder]: For program point L77-3(line 77) no Hoare annotation was computed. [2023-12-24 13:07:59,040 INFO L899 garLoopResultBuilder]: For program point L77-5(line 77) no Hoare annotation was computed. [2023-12-24 13:07:59,040 INFO L899 garLoopResultBuilder]: For program point L77-7(line 77) no Hoare annotation was computed. [2023-12-24 13:07:59,040 INFO L895 garLoopResultBuilder]: At program point L77-8(line 77) the Hoare annotation is: (let ((.cse18 (select |#memory_int#1| |~#BOOL_unsigned_char_Array_0~0.base|))) (let ((.cse3 (select (select |#memory_int#4| |~#signed_short_int_Array_0~0.base|) |~#signed_short_int_Array_0~0.offset|)) (.cse15 ((_ zero_extend 24) ((_ extract 7 0) (select .cse18 |~#BOOL_unsigned_char_Array_0~0.offset|)))) (.cse14 ((_ sign_extend 16) (_ bv32 16))) (.cse16 (select (select |#memory_int#5| |~#unsigned_short_int_Array_0~0.base|) |~#unsigned_short_int_Array_0~0.offset|)) (.cse11 (select .cse18 (bvadd |~#BOOL_unsigned_char_Array_0~0.offset| (_ bv1 32)))) (.cse17 ((_ sign_extend 24) (_ bv0 8)))) (let ((.cse6 (= ((_ extract 7 0) .cse17) ~last_1_BOOL_unsigned_char_Array_0_1_~0)) (.cse8 (= .cse17 .cse11)) (.cse0 (= .cse14 .cse16)) (.cse1 (bvsge .cse15 (_ bv1 32))) (.cse4 (not |ULTIMATE.start_updateVariables_#t~short56#1|)) (.cse9 (= ((_ sign_extend 16) ((_ extract 15 0) ((_ zero_extend 16) ((_ extract 15 0) .cse16)))) .cse3)) (.cse5 (bvsle .cse15 (_ bv1 32))) (.cse10 (= ~last_1_signed_short_int_Array_0_0_~0 ((_ extract 15 0) ((_ sign_extend 16) ((_ extract 15 0) ((_ zero_extend 16) ((_ extract 15 0) .cse14))))))) (.cse7 (= currentRoundingMode roundNearestTiesToEven))) (or (let ((.cse2 ((_ sign_extend 16) (_ bv256 16)))) (and .cse0 .cse1 (= .cse2 .cse3) .cse4 .cse5 .cse6 (= ~last_1_signed_short_int_Array_0_0_~0 ((_ extract 15 0) .cse2)) .cse7 .cse8)) (and .cse0 .cse1 .cse4 .cse9 .cse5 .cse6 .cse10 .cse7 .cse8) (and .cse0 .cse1 .cse4 (not (= ((_ extract 7 0) .cse11) (_ bv0 8))) .cse9 .cse5 .cse10 (exists ((v_arrayElimCell_59 (_ BitVec 32))) (let ((.cse12 ((_ extract 7 0) v_arrayElimCell_59))) (let ((.cse13 ((_ zero_extend 24) .cse12))) (and (= ((_ extract 7 0) ((_ sign_extend 24) .cse12)) ~last_1_BOOL_unsigned_char_Array_0_1_~0) (bvsle .cse13 (_ bv1 32)) (bvsge .cse13 (_ bv1 32)))))) .cse7))))) [2023-12-24 13:07:59,040 INFO L899 garLoopResultBuilder]: For program point L77-9(line 77) no Hoare annotation was computed. [2023-12-24 13:07:59,040 INFO L899 garLoopResultBuilder]: For program point L79(line 79) no Hoare annotation was computed. [2023-12-24 13:07:59,041 INFO L899 garLoopResultBuilder]: For program point L79-2(line 79) no Hoare annotation was computed. [2023-12-24 13:07:59,041 INFO L899 garLoopResultBuilder]: For program point L79-3(line 79) no Hoare annotation was computed. [2023-12-24 13:07:59,041 INFO L899 garLoopResultBuilder]: For program point L79-5(line 79) no Hoare annotation was computed. [2023-12-24 13:07:59,041 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-12-24 13:07:59,041 INFO L899 garLoopResultBuilder]: For program point L79-7(line 79) no Hoare annotation was computed. [2023-12-24 13:07:59,041 INFO L895 garLoopResultBuilder]: At program point L79-8(line 79) the Hoare annotation is: (let ((.cse18 (select |#memory_int#1| |~#BOOL_unsigned_char_Array_0~0.base|))) (let ((.cse9 (select .cse18 (bvadd |~#BOOL_unsigned_char_Array_0~0.offset| (_ bv1 32)))) (.cse14 ((_ sign_extend 24) (_ bv0 8))) (.cse3 (select (select |#memory_int#4| |~#signed_short_int_Array_0~0.base|) |~#signed_short_int_Array_0~0.offset|)) (.cse16 ((_ zero_extend 24) ((_ extract 7 0) (select .cse18 |~#BOOL_unsigned_char_Array_0~0.offset|)))) (.cse15 ((_ sign_extend 16) (_ bv32 16))) (.cse17 (select (select |#memory_int#5| |~#unsigned_short_int_Array_0~0.base|) |~#unsigned_short_int_Array_0~0.offset|))) (let ((.cse0 (= .cse15 .cse17)) (.cse1 (bvsge .cse16 (_ bv1 32))) (.cse10 (= ((_ sign_extend 16) ((_ extract 15 0) ((_ zero_extend 16) ((_ extract 15 0) .cse17)))) .cse3)) (.cse4 (bvsle .cse16 (_ bv1 32))) (.cse5 (not |ULTIMATE.start_updateVariables_#t~short64#1|)) (.cse6 (= ((_ extract 7 0) .cse14) ~last_1_BOOL_unsigned_char_Array_0_1_~0)) (.cse11 (= ~last_1_signed_short_int_Array_0_0_~0 ((_ extract 15 0) ((_ sign_extend 16) ((_ extract 15 0) ((_ zero_extend 16) ((_ extract 15 0) .cse15))))))) (.cse7 (= currentRoundingMode roundNearestTiesToEven)) (.cse8 (= .cse14 .cse9))) (or (let ((.cse2 ((_ sign_extend 16) (_ bv256 16)))) (and .cse0 .cse1 (= .cse2 .cse3) .cse4 .cse5 .cse6 (= ~last_1_signed_short_int_Array_0_0_~0 ((_ extract 15 0) .cse2)) .cse7 .cse8)) (and .cse0 .cse1 (not (= ((_ extract 7 0) .cse9) (_ bv0 8))) .cse10 .cse4 .cse5 .cse11 (exists ((v_arrayElimCell_59 (_ BitVec 32))) (let ((.cse12 ((_ extract 7 0) v_arrayElimCell_59))) (let ((.cse13 ((_ zero_extend 24) .cse12))) (and (= ((_ extract 7 0) ((_ sign_extend 24) .cse12)) ~last_1_BOOL_unsigned_char_Array_0_1_~0) (bvsle .cse13 (_ bv1 32)) (bvsge .cse13 (_ bv1 32)))))) .cse7) (and .cse0 .cse1 .cse10 .cse4 .cse5 .cse6 .cse11 .cse7 .cse8))))) [2023-12-24 13:07:59,041 INFO L899 garLoopResultBuilder]: For program point L79-9(line 79) no Hoare annotation was computed. [2023-12-24 13:07:59,041 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2023-12-24 13:07:59,041 INFO L899 garLoopResultBuilder]: For program point L51(lines 51 57) no Hoare annotation was computed. [2023-12-24 13:07:59,041 INFO L899 garLoopResultBuilder]: For program point L51-1(lines 51 57) no Hoare annotation was computed. [2023-12-24 13:07:59,041 INFO L895 garLoopResultBuilder]: At program point L68(line 68) the Hoare annotation is: (let ((.cse24 (select |#memory_int#2| |~#double_Array_0~0.base|)) (.cse21 ((_ sign_extend 16) (_ bv32 16))) (.cse17 (select |#memory_int#1| |~#BOOL_unsigned_char_Array_0~0.base|))) (let ((.cse1 (select .cse17 (bvadd |~#BOOL_unsigned_char_Array_0~0.offset| (_ bv1 32)))) (.cse16 ((_ sign_extend 24) (_ bv0 8))) (.cse18 ((_ extract 15 0) .cse21)) (.cse9 (select (select |#memory_int#4| |~#signed_short_int_Array_0~0.base|) |~#signed_short_int_Array_0~0.offset|)) (.cse8 (select (select |#memory_int#5| |~#unsigned_short_int_Array_0~0.base|) |~#unsigned_short_int_Array_0~0.offset|)) (.cse19 (let ((.cse26 (concat (select .cse24 (bvadd |~#double_Array_0~0.offset| (_ bv4 32))) (select .cse24 |~#double_Array_0~0.offset|)))) (fp ((_ extract 63 63) .cse26) ((_ extract 62 52) .cse26) ((_ extract 51 0) .cse26)))) (.cse22 (let ((.cse25 (concat (select .cse24 (bvadd |~#double_Array_0~0.offset| (_ bv12 32))) (select .cse24 (bvadd |~#double_Array_0~0.offset| (_ bv8 32)))))) (fp ((_ extract 63 63) .cse25) ((_ extract 62 52) .cse25) ((_ extract 51 0) .cse25)))) (.cse20 (let ((.cse23 (concat (select .cse24 (bvadd |~#double_Array_0~0.offset| (_ bv20 32))) (select .cse24 (bvadd |~#double_Array_0~0.offset| (_ bv16 32)))))) (fp ((_ extract 63 63) .cse23) ((_ extract 62 52) .cse23) ((_ extract 51 0) .cse23))))) (let ((.cse11 (fp.leq .cse22 .cse20)) (.cse10 (fp.lt .cse22 .cse19)) (.cse0 (= .cse21 .cse8)) (.cse14 (fp.leq .cse19 .cse20)) (.cse2 (= ((_ sign_extend 16) .cse18) .cse9)) (.cse12 (= ((_ extract 7 0) .cse16) ~last_1_BOOL_unsigned_char_Array_0_1_~0)) (.cse3 (= ~last_1_signed_short_int_Array_0_0_~0 ((_ extract 15 0) ((_ sign_extend 16) ((_ extract 15 0) ((_ zero_extend 16) .cse18)))))) (.cse6 (= ((_ extract 7 0) (select .cse17 |~#BOOL_unsigned_char_Array_0~0.offset|)) |ULTIMATE.start_updateVariables_#t~mem27#1|)) (.cse7 (= currentRoundingMode roundNearestTiesToEven)) (.cse13 (= .cse16 .cse1))) (or (and .cse0 (not (= ((_ extract 7 0) .cse1) (_ bv0 8))) .cse2 .cse3 (exists ((v_arrayElimCell_59 (_ BitVec 32))) (let ((.cse4 ((_ extract 7 0) v_arrayElimCell_59))) (let ((.cse5 ((_ zero_extend 24) .cse4))) (and (= ((_ extract 7 0) ((_ sign_extend 24) .cse4)) ~last_1_BOOL_unsigned_char_Array_0_1_~0) (bvsle .cse5 (_ bv1 32)) (bvsge .cse5 (_ bv1 32)))))) .cse6 .cse7) (and .cse0 (= ((_ sign_extend 16) ((_ extract 15 0) ((_ zero_extend 16) ((_ extract 15 0) .cse8)))) .cse9) .cse10 .cse11 .cse12 .cse3 .cse6 .cse7 .cse13) (let ((.cse15 ((_ sign_extend 16) (_ bv256 16)))) (and .cse0 .cse14 (= .cse15 .cse9) .cse11 .cse12 (= ~last_1_signed_short_int_Array_0_0_~0 ((_ extract 15 0) .cse15)) .cse6 (not .cse10) .cse7 .cse13)) (and .cse0 .cse14 .cse2 .cse12 .cse3 .cse6 .cse7 .cse13))))) [2023-12-24 13:07:59,041 INFO L899 garLoopResultBuilder]: For program point L68-1(line 68) no Hoare annotation was computed. [2023-12-24 13:07:59,043 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] [2023-12-24 13:07:59,045 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-24 13:07:59,061 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#5[~#unsigned_short_int_Array_0~0!base][~#unsigned_short_int_Array_0~0!offset] could not be translated [2023-12-24 13:07:59,062 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#BOOL_unsigned_char_Array_0~0!base][~#BOOL_unsigned_char_Array_0~0!offset] could not be translated [2023-12-24 13:07:59,062 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#5[~#unsigned_short_int_Array_0~0!base][~#unsigned_short_int_Array_0~0!offset] could not be translated [2023-12-24 13:07:59,062 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#4[~#signed_short_int_Array_0~0!base][~#signed_short_int_Array_0~0!offset] could not be translated [2023-12-24 13:07:59,063 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#BOOL_unsigned_char_Array_0~0!base][~#BOOL_unsigned_char_Array_0~0!offset] could not be translated [2023-12-24 13:07:59,063 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#BOOL_unsigned_char_Array_0~0!base][~#BOOL_unsigned_char_Array_0~0!offset] could not be translated [2023-12-24 13:07:59,063 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#BOOL_unsigned_char_Array_0~0!base][~bvadd~32(~#BOOL_unsigned_char_Array_0~0!offset, 1bv32)] could not be translated [2023-12-24 13:07:59,064 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#double_Array_0~0!base][~bvadd~32(~#double_Array_0~0!offset, 12bv32)] could not be translated [2023-12-24 13:07:59,064 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#double_Array_0~0!base][~bvadd~32(~#double_Array_0~0!offset, 8bv32)] could not be translated [2023-12-24 13:07:59,064 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#double_Array_0~0!base][~bvadd~32(~#double_Array_0~0!offset, 12bv32)] could not be translated [2023-12-24 13:07:59,064 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#double_Array_0~0!base][~bvadd~32(~#double_Array_0~0!offset, 8bv32)] could not be translated [2023-12-24 13:07:59,064 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#double_Array_0~0!base][~bvadd~32(~#double_Array_0~0!offset, 12bv32)] could not be translated [2023-12-24 13:07:59,064 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#double_Array_0~0!base][~bvadd~32(~#double_Array_0~0!offset, 8bv32)] could not be translated [2023-12-24 13:07:59,065 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: fp can only be backtranslated, if the arguments are literals: FunctionApplication[~fp~64,[BitVectorAccessExpression[BinaryExpression[BITVECCONCAT,ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#double_Array_0~0!base,GLOBAL]]],[FunctionApplication[~bvadd~32,[IdentifierExpression[~#double_Array_0~0!offset,GLOBAL],BitvecLiteral[12,32]]]]],ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#double_Array_0~0!base,GLOBAL]]],[FunctionApplication[~bvadd~32,[IdentifierExpression[~#double_Array_0~0!offset,GLOBAL],BitvecLiteral[8,32]]]]]],63,63],BitVectorAccessExpression[BinaryExpression[BITVECCONCAT,ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#double_Array_0~0!base,GLOBAL]]],[FunctionApplication[~bvadd~32,[IdentifierExpression[~#double_Array_0~0!offset,GLOBAL],BitvecLiteral[12,32]]]]],ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#double_Array_0~0!base,GLOBAL]]],[FunctionApplication[~bvadd~32,[IdentifierExpression[~#double_Array_0~0!offset,GLOBAL],BitvecLiteral[8,32]]]]]],62,52],BitVectorAccessExpression[BinaryExpression[BITVECCONCAT,ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#double_Array_0~0!base,GLOBAL]]],[FunctionApplication[~bvadd~32,[IdentifierExpression[~#double_Array_0~0!offset,GLOBAL],BitvecLiteral[12,32]]]]],ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#double_Array_0~0!base,GLOBAL]]],[FunctionApplication[~bvadd~32,[IdentifierExpression[~#double_Array_0~0!offset,GLOBAL],BitvecLiteral[8,32]]]]]],51,0]]] [2023-12-24 13:07:59,065 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated [2023-12-24 13:07:59,065 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#5[~#unsigned_short_int_Array_0~0!base][~#unsigned_short_int_Array_0~0!offset] could not be translated [2023-12-24 13:07:59,065 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#double_Array_0~0!base][~bvadd~32(~#double_Array_0~0!offset, 4bv32)] could not be translated [2023-12-24 13:07:59,065 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#double_Array_0~0!base][~#double_Array_0~0!offset] could not be translated [2023-12-24 13:07:59,065 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#double_Array_0~0!base][~bvadd~32(~#double_Array_0~0!offset, 4bv32)] could not be translated [2023-12-24 13:07:59,065 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#double_Array_0~0!base][~#double_Array_0~0!offset] could not be translated [2023-12-24 13:07:59,065 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#double_Array_0~0!base][~bvadd~32(~#double_Array_0~0!offset, 4bv32)] could not be translated [2023-12-24 13:07:59,065 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#double_Array_0~0!base][~#double_Array_0~0!offset] could not be translated [2023-12-24 13:07:59,066 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: fp can only be backtranslated, if the arguments are literals: FunctionApplication[~fp~64,[BitVectorAccessExpression[BinaryExpression[BITVECCONCAT,ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#double_Array_0~0!base,GLOBAL]]],[FunctionApplication[~bvadd~32,[IdentifierExpression[~#double_Array_0~0!offset,GLOBAL],BitvecLiteral[4,32]]]]],ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#double_Array_0~0!base,GLOBAL]]],[IdentifierExpression[~#double_Array_0~0!offset,GLOBAL]]]],63,63],BitVectorAccessExpression[BinaryExpression[BITVECCONCAT,ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#double_Array_0~0!base,GLOBAL]]],[FunctionApplication[~bvadd~32,[IdentifierExpression[~#double_Array_0~0!offset,GLOBAL],BitvecLiteral[4,32]]]]],ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#double_Array_0~0!base,GLOBAL]]],[IdentifierExpression[~#double_Array_0~0!offset,GLOBAL]]]],62,52],BitVectorAccessExpression[BinaryExpression[BITVECCONCAT,ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#double_Array_0~0!base,GLOBAL]]],[FunctionApplication[~bvadd~32,[IdentifierExpression[~#double_Array_0~0!offset,GLOBAL],BitvecLiteral[4,32]]]]],ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#double_Array_0~0!base,GLOBAL]]],[IdentifierExpression[~#double_Array_0~0!offset,GLOBAL]]]],51,0]]] [2023-12-24 13:07:59,066 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#BOOL_unsigned_char_Array_0~0!base][~#BOOL_unsigned_char_Array_0~0!offset] could not be translated [2023-12-24 13:07:59,066 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#4[~#signed_short_int_Array_0~0!base][~#signed_short_int_Array_0~0!offset] could not be translated [2023-12-24 13:07:59,066 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#double_Array_0~0!base][~bvadd~32(~#double_Array_0~0!offset, 12bv32)] could not be translated [2023-12-24 13:07:59,066 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#double_Array_0~0!base][~bvadd~32(~#double_Array_0~0!offset, 8bv32)] could not be translated [2023-12-24 13:07:59,066 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#double_Array_0~0!base][~bvadd~32(~#double_Array_0~0!offset, 12bv32)] could not be translated [2023-12-24 13:07:59,066 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#double_Array_0~0!base][~bvadd~32(~#double_Array_0~0!offset, 8bv32)] could not be translated [2023-12-24 13:07:59,066 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#double_Array_0~0!base][~bvadd~32(~#double_Array_0~0!offset, 12bv32)] could not be translated [2023-12-24 13:07:59,067 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#double_Array_0~0!base][~bvadd~32(~#double_Array_0~0!offset, 8bv32)] could not be translated [2023-12-24 13:07:59,067 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: fp can only be backtranslated, if the arguments are literals: FunctionApplication[~fp~64,[BitVectorAccessExpression[BinaryExpression[BITVECCONCAT,ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#double_Array_0~0!base,GLOBAL]]],[FunctionApplication[~bvadd~32,[IdentifierExpression[~#double_Array_0~0!offset,GLOBAL],BitvecLiteral[12,32]]]]],ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#double_Array_0~0!base,GLOBAL]]],[FunctionApplication[~bvadd~32,[IdentifierExpression[~#double_Array_0~0!offset,GLOBAL],BitvecLiteral[8,32]]]]]],63,63],BitVectorAccessExpression[BinaryExpression[BITVECCONCAT,ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#double_Array_0~0!base,GLOBAL]]],[FunctionApplication[~bvadd~32,[IdentifierExpression[~#double_Array_0~0!offset,GLOBAL],BitvecLiteral[12,32]]]]],ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#double_Array_0~0!base,GLOBAL]]],[FunctionApplication[~bvadd~32,[IdentifierExpression[~#double_Array_0~0!offset,GLOBAL],BitvecLiteral[8,32]]]]]],62,52],BitVectorAccessExpression[BinaryExpression[BITVECCONCAT,ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#double_Array_0~0!base,GLOBAL]]],[FunctionApplication[~bvadd~32,[IdentifierExpression[~#double_Array_0~0!offset,GLOBAL],BitvecLiteral[12,32]]]]],ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#double_Array_0~0!base,GLOBAL]]],[FunctionApplication[~bvadd~32,[IdentifierExpression[~#double_Array_0~0!offset,GLOBAL],BitvecLiteral[8,32]]]]]],51,0]]] [2023-12-24 13:07:59,067 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#BOOL_unsigned_char_Array_0~0!base][~#BOOL_unsigned_char_Array_0~0!offset] could not be translated [2023-12-24 13:07:59,067 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#double_Array_0~0!base][~bvadd~32(~#double_Array_0~0!offset, 12bv32)] could not be translated [2023-12-24 13:07:59,067 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#double_Array_0~0!base][~bvadd~32(~#double_Array_0~0!offset, 8bv32)] could not be translated [2023-12-24 13:07:59,067 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#double_Array_0~0!base][~bvadd~32(~#double_Array_0~0!offset, 12bv32)] could not be translated [2023-12-24 13:07:59,067 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#double_Array_0~0!base][~bvadd~32(~#double_Array_0~0!offset, 8bv32)] could not be translated [2023-12-24 13:07:59,067 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#double_Array_0~0!base][~bvadd~32(~#double_Array_0~0!offset, 12bv32)] could not be translated [2023-12-24 13:07:59,068 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#double_Array_0~0!base][~bvadd~32(~#double_Array_0~0!offset, 8bv32)] could not be translated [2023-12-24 13:07:59,068 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: fp can only be backtranslated, if the arguments are literals: FunctionApplication[~fp~64,[BitVectorAccessExpression[BinaryExpression[BITVECCONCAT,ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#double_Array_0~0!base,GLOBAL]]],[FunctionApplication[~bvadd~32,[IdentifierExpression[~#double_Array_0~0!offset,GLOBAL],BitvecLiteral[12,32]]]]],ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#double_Array_0~0!base,GLOBAL]]],[FunctionApplication[~bvadd~32,[IdentifierExpression[~#double_Array_0~0!offset,GLOBAL],BitvecLiteral[8,32]]]]]],63,63],BitVectorAccessExpression[BinaryExpression[BITVECCONCAT,ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#double_Array_0~0!base,GLOBAL]]],[FunctionApplication[~bvadd~32,[IdentifierExpression[~#double_Array_0~0!offset,GLOBAL],BitvecLiteral[12,32]]]]],ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#double_Array_0~0!base,GLOBAL]]],[FunctionApplication[~bvadd~32,[IdentifierExpression[~#double_Array_0~0!offset,GLOBAL],BitvecLiteral[8,32]]]]]],62,52],BitVectorAccessExpression[BinaryExpression[BITVECCONCAT,ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#double_Array_0~0!base,GLOBAL]]],[FunctionApplication[~bvadd~32,[IdentifierExpression[~#double_Array_0~0!offset,GLOBAL],BitvecLiteral[12,32]]]]],ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#double_Array_0~0!base,GLOBAL]]],[FunctionApplication[~bvadd~32,[IdentifierExpression[~#double_Array_0~0!offset,GLOBAL],BitvecLiteral[8,32]]]]]],51,0]]] [2023-12-24 13:07:59,068 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated [2023-12-24 13:07:59,068 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#BOOL_unsigned_char_Array_0~0!base][~bvadd~32(~#BOOL_unsigned_char_Array_0~0!offset, 1bv32)] could not be translated [2023-12-24 13:07:59,068 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#5[~#unsigned_short_int_Array_0~0!base][~#unsigned_short_int_Array_0~0!offset] could not be translated [2023-12-24 13:07:59,068 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#double_Array_0~0!base][~bvadd~32(~#double_Array_0~0!offset, 4bv32)] could not be translated [2023-12-24 13:07:59,068 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#double_Array_0~0!base][~#double_Array_0~0!offset] could not be translated [2023-12-24 13:07:59,068 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#double_Array_0~0!base][~bvadd~32(~#double_Array_0~0!offset, 4bv32)] could not be translated [2023-12-24 13:07:59,069 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#double_Array_0~0!base][~#double_Array_0~0!offset] could not be translated [2023-12-24 13:07:59,069 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#double_Array_0~0!base][~bvadd~32(~#double_Array_0~0!offset, 4bv32)] could not be translated [2023-12-24 13:07:59,069 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#double_Array_0~0!base][~#double_Array_0~0!offset] could not be translated [2023-12-24 13:07:59,069 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: fp can only be backtranslated, if the arguments are literals: FunctionApplication[~fp~64,[BitVectorAccessExpression[BinaryExpression[BITVECCONCAT,ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#double_Array_0~0!base,GLOBAL]]],[FunctionApplication[~bvadd~32,[IdentifierExpression[~#double_Array_0~0!offset,GLOBAL],BitvecLiteral[4,32]]]]],ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#double_Array_0~0!base,GLOBAL]]],[IdentifierExpression[~#double_Array_0~0!offset,GLOBAL]]]],63,63],BitVectorAccessExpression[BinaryExpression[BITVECCONCAT,ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#double_Array_0~0!base,GLOBAL]]],[FunctionApplication[~bvadd~32,[IdentifierExpression[~#double_Array_0~0!offset,GLOBAL],BitvecLiteral[4,32]]]]],ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#double_Array_0~0!base,GLOBAL]]],[IdentifierExpression[~#double_Array_0~0!offset,GLOBAL]]]],62,52],BitVectorAccessExpression[BinaryExpression[BITVECCONCAT,ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#double_Array_0~0!base,GLOBAL]]],[FunctionApplication[~bvadd~32,[IdentifierExpression[~#double_Array_0~0!offset,GLOBAL],BitvecLiteral[4,32]]]]],ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#double_Array_0~0!base,GLOBAL]]],[IdentifierExpression[~#double_Array_0~0!offset,GLOBAL]]]],51,0]]] [2023-12-24 13:07:59,069 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#BOOL_unsigned_char_Array_0~0!base][~#BOOL_unsigned_char_Array_0~0!offset] could not be translated [2023-12-24 13:07:59,069 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#5[~#unsigned_short_int_Array_0~0!base][~#unsigned_short_int_Array_0~0!offset] could not be translated [2023-12-24 13:07:59,069 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#4[~#signed_short_int_Array_0~0!base][~#signed_short_int_Array_0~0!offset] could not be translated [2023-12-24 13:07:59,069 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#BOOL_unsigned_char_Array_0~0!base][~#BOOL_unsigned_char_Array_0~0!offset] could not be translated [2023-12-24 13:07:59,069 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated [2023-12-24 13:07:59,070 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#BOOL_unsigned_char_Array_0~0!base][~bvadd~32(~#BOOL_unsigned_char_Array_0~0!offset, 1bv32)] could not be translated [2023-12-24 13:07:59,070 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#5[~#unsigned_short_int_Array_0~0!base][~#unsigned_short_int_Array_0~0!offset] could not be translated [2023-12-24 13:07:59,070 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#BOOL_unsigned_char_Array_0~0!base][~#BOOL_unsigned_char_Array_0~0!offset] could not be translated [2023-12-24 13:07:59,070 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#5[~#unsigned_short_int_Array_0~0!base][~#unsigned_short_int_Array_0~0!offset] could not be translated [2023-12-24 13:07:59,070 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#4[~#signed_short_int_Array_0~0!base][~#signed_short_int_Array_0~0!offset] could not be translated [2023-12-24 13:07:59,070 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#double_Array_0~0!base][~bvadd~32(~#double_Array_0~0!offset, 12bv32)] could not be translated [2023-12-24 13:07:59,070 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#double_Array_0~0!base][~bvadd~32(~#double_Array_0~0!offset, 8bv32)] could not be translated [2023-12-24 13:07:59,070 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#double_Array_0~0!base][~bvadd~32(~#double_Array_0~0!offset, 12bv32)] could not be translated [2023-12-24 13:07:59,070 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#double_Array_0~0!base][~bvadd~32(~#double_Array_0~0!offset, 8bv32)] could not be translated [2023-12-24 13:07:59,071 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#double_Array_0~0!base][~bvadd~32(~#double_Array_0~0!offset, 12bv32)] could not be translated [2023-12-24 13:07:59,071 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#double_Array_0~0!base][~bvadd~32(~#double_Array_0~0!offset, 8bv32)] could not be translated [2023-12-24 13:07:59,071 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: fp can only be backtranslated, if the arguments are literals: FunctionApplication[~fp~64,[BitVectorAccessExpression[BinaryExpression[BITVECCONCAT,ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#double_Array_0~0!base,GLOBAL]]],[FunctionApplication[~bvadd~32,[IdentifierExpression[~#double_Array_0~0!offset,GLOBAL],BitvecLiteral[12,32]]]]],ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#double_Array_0~0!base,GLOBAL]]],[FunctionApplication[~bvadd~32,[IdentifierExpression[~#double_Array_0~0!offset,GLOBAL],BitvecLiteral[8,32]]]]]],63,63],BitVectorAccessExpression[BinaryExpression[BITVECCONCAT,ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#double_Array_0~0!base,GLOBAL]]],[FunctionApplication[~bvadd~32,[IdentifierExpression[~#double_Array_0~0!offset,GLOBAL],BitvecLiteral[12,32]]]]],ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#double_Array_0~0!base,GLOBAL]]],[FunctionApplication[~bvadd~32,[IdentifierExpression[~#double_Array_0~0!offset,GLOBAL],BitvecLiteral[8,32]]]]]],62,52],BitVectorAccessExpression[BinaryExpression[BITVECCONCAT,ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#double_Array_0~0!base,GLOBAL]]],[FunctionApplication[~bvadd~32,[IdentifierExpression[~#double_Array_0~0!offset,GLOBAL],BitvecLiteral[12,32]]]]],ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#double_Array_0~0!base,GLOBAL]]],[FunctionApplication[~bvadd~32,[IdentifierExpression[~#double_Array_0~0!offset,GLOBAL],BitvecLiteral[8,32]]]]]],51,0]]] [2023-12-24 13:07:59,071 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#double_Array_0~0!base][~bvadd~32(~#double_Array_0~0!offset, 12bv32)] could not be translated [2023-12-24 13:07:59,071 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#double_Array_0~0!base][~bvadd~32(~#double_Array_0~0!offset, 8bv32)] could not be translated [2023-12-24 13:07:59,071 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#double_Array_0~0!base][~bvadd~32(~#double_Array_0~0!offset, 12bv32)] could not be translated [2023-12-24 13:07:59,071 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#double_Array_0~0!base][~bvadd~32(~#double_Array_0~0!offset, 8bv32)] could not be translated [2023-12-24 13:07:59,071 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#double_Array_0~0!base][~bvadd~32(~#double_Array_0~0!offset, 12bv32)] could not be translated [2023-12-24 13:07:59,071 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#double_Array_0~0!base][~bvadd~32(~#double_Array_0~0!offset, 8bv32)] could not be translated [2023-12-24 13:07:59,072 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: fp can only be backtranslated, if the arguments are literals: FunctionApplication[~fp~64,[BitVectorAccessExpression[BinaryExpression[BITVECCONCAT,ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#double_Array_0~0!base,GLOBAL]]],[FunctionApplication[~bvadd~32,[IdentifierExpression[~#double_Array_0~0!offset,GLOBAL],BitvecLiteral[12,32]]]]],ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#double_Array_0~0!base,GLOBAL]]],[FunctionApplication[~bvadd~32,[IdentifierExpression[~#double_Array_0~0!offset,GLOBAL],BitvecLiteral[8,32]]]]]],63,63],BitVectorAccessExpression[BinaryExpression[BITVECCONCAT,ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#double_Array_0~0!base,GLOBAL]]],[FunctionApplication[~bvadd~32,[IdentifierExpression[~#double_Array_0~0!offset,GLOBAL],BitvecLiteral[12,32]]]]],ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#double_Array_0~0!base,GLOBAL]]],[FunctionApplication[~bvadd~32,[IdentifierExpression[~#double_Array_0~0!offset,GLOBAL],BitvecLiteral[8,32]]]]]],62,52],BitVectorAccessExpression[BinaryExpression[BITVECCONCAT,ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#double_Array_0~0!base,GLOBAL]]],[FunctionApplication[~bvadd~32,[IdentifierExpression[~#double_Array_0~0!offset,GLOBAL],BitvecLiteral[12,32]]]]],ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#double_Array_0~0!base,GLOBAL]]],[FunctionApplication[~bvadd~32,[IdentifierExpression[~#double_Array_0~0!offset,GLOBAL],BitvecLiteral[8,32]]]]]],51,0]]] [2023-12-24 13:07:59,072 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#BOOL_unsigned_char_Array_0~0!base][~#BOOL_unsigned_char_Array_0~0!offset] could not be translated [2023-12-24 13:07:59,072 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated [2023-12-24 13:07:59,072 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#BOOL_unsigned_char_Array_0~0!base][~bvadd~32(~#BOOL_unsigned_char_Array_0~0!offset, 1bv32)] could not be translated [2023-12-24 13:07:59,072 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#BOOL_unsigned_char_Array_0~0!base][~#BOOL_unsigned_char_Array_0~0!offset] could not be translated [2023-12-24 13:07:59,072 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#BOOL_unsigned_char_Array_0~0!base][~#BOOL_unsigned_char_Array_0~0!offset] could not be translated [2023-12-24 13:07:59,072 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#BOOL_unsigned_char_Array_0~0!base][~#BOOL_unsigned_char_Array_0~0!offset] could not be translated [2023-12-24 13:07:59,072 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#BOOL_unsigned_char_Array_0~0!base][~bvadd~32(~#BOOL_unsigned_char_Array_0~0!offset, 1bv32)] could not be translated [2023-12-24 13:07:59,072 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#5[~#unsigned_short_int_Array_0~0!base][~#unsigned_short_int_Array_0~0!offset] could not be translated [2023-12-24 13:07:59,073 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#5[~#unsigned_short_int_Array_0~0!base][~#unsigned_short_int_Array_0~0!offset] could not be translated [2023-12-24 13:07:59,073 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#4[~#signed_short_int_Array_0~0!base][~#signed_short_int_Array_0~0!offset] could not be translated [2023-12-24 13:07:59,073 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated [2023-12-24 13:07:59,073 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#double_Array_0~0!base][~bvadd~32(~#double_Array_0~0!offset, 12bv32)] could not be translated [2023-12-24 13:07:59,073 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#double_Array_0~0!base][~bvadd~32(~#double_Array_0~0!offset, 8bv32)] could not be translated [2023-12-24 13:07:59,073 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#double_Array_0~0!base][~bvadd~32(~#double_Array_0~0!offset, 12bv32)] could not be translated [2023-12-24 13:07:59,073 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#double_Array_0~0!base][~bvadd~32(~#double_Array_0~0!offset, 8bv32)] could not be translated [2023-12-24 13:07:59,073 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#double_Array_0~0!base][~bvadd~32(~#double_Array_0~0!offset, 12bv32)] could not be translated [2023-12-24 13:07:59,073 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#double_Array_0~0!base][~bvadd~32(~#double_Array_0~0!offset, 8bv32)] could not be translated [2023-12-24 13:07:59,074 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: fp can only be backtranslated, if the arguments are literals: FunctionApplication[~fp~64,[BitVectorAccessExpression[BinaryExpression[BITVECCONCAT,ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#double_Array_0~0!base,GLOBAL]]],[FunctionApplication[~bvadd~32,[IdentifierExpression[~#double_Array_0~0!offset,GLOBAL],BitvecLiteral[12,32]]]]],ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#double_Array_0~0!base,GLOBAL]]],[FunctionApplication[~bvadd~32,[IdentifierExpression[~#double_Array_0~0!offset,GLOBAL],BitvecLiteral[8,32]]]]]],63,63],BitVectorAccessExpression[BinaryExpression[BITVECCONCAT,ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#double_Array_0~0!base,GLOBAL]]],[FunctionApplication[~bvadd~32,[IdentifierExpression[~#double_Array_0~0!offset,GLOBAL],BitvecLiteral[12,32]]]]],ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#double_Array_0~0!base,GLOBAL]]],[FunctionApplication[~bvadd~32,[IdentifierExpression[~#double_Array_0~0!offset,GLOBAL],BitvecLiteral[8,32]]]]]],62,52],BitVectorAccessExpression[BinaryExpression[BITVECCONCAT,ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#double_Array_0~0!base,GLOBAL]]],[FunctionApplication[~bvadd~32,[IdentifierExpression[~#double_Array_0~0!offset,GLOBAL],BitvecLiteral[12,32]]]]],ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#double_Array_0~0!base,GLOBAL]]],[FunctionApplication[~bvadd~32,[IdentifierExpression[~#double_Array_0~0!offset,GLOBAL],BitvecLiteral[8,32]]]]]],51,0]]] [2023-12-24 13:07:59,074 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#5[~#unsigned_short_int_Array_0~0!base][~#unsigned_short_int_Array_0~0!offset] could not be translated [2023-12-24 13:07:59,074 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#double_Array_0~0!base][~bvadd~32(~#double_Array_0~0!offset, 12bv32)] could not be translated [2023-12-24 13:07:59,074 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#double_Array_0~0!base][~bvadd~32(~#double_Array_0~0!offset, 8bv32)] could not be translated [2023-12-24 13:07:59,074 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#double_Array_0~0!base][~bvadd~32(~#double_Array_0~0!offset, 12bv32)] could not be translated [2023-12-24 13:07:59,074 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#double_Array_0~0!base][~bvadd~32(~#double_Array_0~0!offset, 8bv32)] could not be translated [2023-12-24 13:07:59,074 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#double_Array_0~0!base][~bvadd~32(~#double_Array_0~0!offset, 12bv32)] could not be translated [2023-12-24 13:07:59,075 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#double_Array_0~0!base][~bvadd~32(~#double_Array_0~0!offset, 8bv32)] could not be translated [2023-12-24 13:07:59,075 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: fp can only be backtranslated, if the arguments are literals: FunctionApplication[~fp~64,[BitVectorAccessExpression[BinaryExpression[BITVECCONCAT,ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#double_Array_0~0!base,GLOBAL]]],[FunctionApplication[~bvadd~32,[IdentifierExpression[~#double_Array_0~0!offset,GLOBAL],BitvecLiteral[12,32]]]]],ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#double_Array_0~0!base,GLOBAL]]],[FunctionApplication[~bvadd~32,[IdentifierExpression[~#double_Array_0~0!offset,GLOBAL],BitvecLiteral[8,32]]]]]],63,63],BitVectorAccessExpression[BinaryExpression[BITVECCONCAT,ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#double_Array_0~0!base,GLOBAL]]],[FunctionApplication[~bvadd~32,[IdentifierExpression[~#double_Array_0~0!offset,GLOBAL],BitvecLiteral[12,32]]]]],ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#double_Array_0~0!base,GLOBAL]]],[FunctionApplication[~bvadd~32,[IdentifierExpression[~#double_Array_0~0!offset,GLOBAL],BitvecLiteral[8,32]]]]]],62,52],BitVectorAccessExpression[BinaryExpression[BITVECCONCAT,ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#double_Array_0~0!base,GLOBAL]]],[FunctionApplication[~bvadd~32,[IdentifierExpression[~#double_Array_0~0!offset,GLOBAL],BitvecLiteral[12,32]]]]],ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#double_Array_0~0!base,GLOBAL]]],[FunctionApplication[~bvadd~32,[IdentifierExpression[~#double_Array_0~0!offset,GLOBAL],BitvecLiteral[8,32]]]]]],51,0]]] [2023-12-24 13:07:59,075 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#double_Array_0~0!base][~bvadd~32(~#double_Array_0~0!offset, 12bv32)] could not be translated [2023-12-24 13:07:59,075 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#double_Array_0~0!base][~bvadd~32(~#double_Array_0~0!offset, 8bv32)] could not be translated [2023-12-24 13:07:59,075 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#double_Array_0~0!base][~bvadd~32(~#double_Array_0~0!offset, 12bv32)] could not be translated [2023-12-24 13:07:59,075 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#double_Array_0~0!base][~bvadd~32(~#double_Array_0~0!offset, 8bv32)] could not be translated [2023-12-24 13:07:59,075 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#double_Array_0~0!base][~bvadd~32(~#double_Array_0~0!offset, 12bv32)] could not be translated [2023-12-24 13:07:59,075 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#double_Array_0~0!base][~bvadd~32(~#double_Array_0~0!offset, 8bv32)] could not be translated [2023-12-24 13:07:59,075 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: fp can only be backtranslated, if the arguments are literals: FunctionApplication[~fp~64,[BitVectorAccessExpression[BinaryExpression[BITVECCONCAT,ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#double_Array_0~0!base,GLOBAL]]],[FunctionApplication[~bvadd~32,[IdentifierExpression[~#double_Array_0~0!offset,GLOBAL],BitvecLiteral[12,32]]]]],ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#double_Array_0~0!base,GLOBAL]]],[FunctionApplication[~bvadd~32,[IdentifierExpression[~#double_Array_0~0!offset,GLOBAL],BitvecLiteral[8,32]]]]]],63,63],BitVectorAccessExpression[BinaryExpression[BITVECCONCAT,ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#double_Array_0~0!base,GLOBAL]]],[FunctionApplication[~bvadd~32,[IdentifierExpression[~#double_Array_0~0!offset,GLOBAL],BitvecLiteral[12,32]]]]],ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#double_Array_0~0!base,GLOBAL]]],[FunctionApplication[~bvadd~32,[IdentifierExpression[~#double_Array_0~0!offset,GLOBAL],BitvecLiteral[8,32]]]]]],62,52],BitVectorAccessExpression[BinaryExpression[BITVECCONCAT,ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#double_Array_0~0!base,GLOBAL]]],[FunctionApplication[~bvadd~32,[IdentifierExpression[~#double_Array_0~0!offset,GLOBAL],BitvecLiteral[12,32]]]]],ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#double_Array_0~0!base,GLOBAL]]],[FunctionApplication[~bvadd~32,[IdentifierExpression[~#double_Array_0~0!offset,GLOBAL],BitvecLiteral[8,32]]]]]],51,0]]] [2023-12-24 13:07:59,076 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#4[~#signed_short_int_Array_0~0!base][~#signed_short_int_Array_0~0!offset] could not be translated [2023-12-24 13:07:59,076 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated [2023-12-24 13:07:59,076 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.12 01:07:59 BoogieIcfgContainer [2023-12-24 13:07:59,076 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-24 13:07:59,077 INFO L158 Benchmark]: Toolchain (without parser) took 413135.39ms. Allocated memory was 187.7MB in the beginning and 580.9MB in the end (delta: 393.2MB). Free memory was 132.6MB in the beginning and 390.3MB in the end (delta: -257.7MB). Peak memory consumption was 338.1MB. Max. memory is 8.0GB. [2023-12-24 13:07:59,077 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 187.7MB. Free memory is still 133.9MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-24 13:07:59,077 INFO L158 Benchmark]: CACSL2BoogieTranslator took 321.54ms. Allocated memory is still 187.7MB. Free memory was 132.6MB in the beginning and 117.3MB in the end (delta: 15.3MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. [2023-12-24 13:07:59,077 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.65ms. Allocated memory is still 187.7MB. Free memory was 117.3MB in the beginning and 113.9MB in the end (delta: 3.4MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-24 13:07:59,077 INFO L158 Benchmark]: Boogie Preprocessor took 83.97ms. Allocated memory is still 187.7MB. Free memory was 113.9MB in the beginning and 108.2MB in the end (delta: 5.7MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. [2023-12-24 13:07:59,077 INFO L158 Benchmark]: RCFGBuilder took 9973.38ms. Allocated memory was 187.7MB in the beginning and 278.9MB in the end (delta: 91.2MB). Free memory was 108.2MB in the beginning and 218.1MB in the end (delta: -109.9MB). Peak memory consumption was 29.9MB. Max. memory is 8.0GB. [2023-12-24 13:07:59,077 INFO L158 Benchmark]: TraceAbstraction took 402698.11ms. Allocated memory was 278.9MB in the beginning and 580.9MB in the end (delta: 302.0MB). Free memory was 217.6MB in the beginning and 390.3MB in the end (delta: -172.7MB). Peak memory consumption was 331.2MB. Max. memory is 8.0GB. [2023-12-24 13:07:59,078 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.23ms. Allocated memory is still 187.7MB. Free memory is still 133.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 321.54ms. Allocated memory is still 187.7MB. Free memory was 132.6MB in the beginning and 117.3MB in the end (delta: 15.3MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 51.65ms. Allocated memory is still 187.7MB. Free memory was 117.3MB in the beginning and 113.9MB in the end (delta: 3.4MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 83.97ms. Allocated memory is still 187.7MB. Free memory was 113.9MB in the beginning and 108.2MB in the end (delta: 5.7MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. * RCFGBuilder took 9973.38ms. Allocated memory was 187.7MB in the beginning and 278.9MB in the end (delta: 91.2MB). Free memory was 108.2MB in the beginning and 218.1MB in the end (delta: -109.9MB). Peak memory consumption was 29.9MB. Max. memory is 8.0GB. * TraceAbstraction took 402698.11ms. Allocated memory was 278.9MB in the beginning and 580.9MB in the end (delta: 302.0MB). Free memory was 217.6MB in the beginning and 390.3MB in the end (delta: -172.7MB). Peak memory consumption was 331.2MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#5[~#unsigned_short_int_Array_0~0!base][~#unsigned_short_int_Array_0~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#BOOL_unsigned_char_Array_0~0!base][~#BOOL_unsigned_char_Array_0~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#5[~#unsigned_short_int_Array_0~0!base][~#unsigned_short_int_Array_0~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#4[~#signed_short_int_Array_0~0!base][~#signed_short_int_Array_0~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#BOOL_unsigned_char_Array_0~0!base][~#BOOL_unsigned_char_Array_0~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#BOOL_unsigned_char_Array_0~0!base][~#BOOL_unsigned_char_Array_0~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#BOOL_unsigned_char_Array_0~0!base][~bvadd~32(~#BOOL_unsigned_char_Array_0~0!offset, 1bv32)] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#double_Array_0~0!base][~bvadd~32(~#double_Array_0~0!offset, 12bv32)] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#double_Array_0~0!base][~bvadd~32(~#double_Array_0~0!offset, 8bv32)] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#double_Array_0~0!base][~bvadd~32(~#double_Array_0~0!offset, 12bv32)] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#double_Array_0~0!base][~bvadd~32(~#double_Array_0~0!offset, 8bv32)] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#double_Array_0~0!base][~bvadd~32(~#double_Array_0~0!offset, 12bv32)] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#double_Array_0~0!base][~bvadd~32(~#double_Array_0~0!offset, 8bv32)] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: fp can only be backtranslated, if the arguments are literals: FunctionApplication[~fp~64,[BitVectorAccessExpression[BinaryExpression[BITVECCONCAT,ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#double_Array_0~0!base,GLOBAL]]],[FunctionApplication[~bvadd~32,[IdentifierExpression[~#double_Array_0~0!offset,GLOBAL],BitvecLiteral[12,32]]]]],ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#double_Array_0~0!base,GLOBAL]]],[FunctionApplication[~bvadd~32,[IdentifierExpression[~#double_Array_0~0!offset,GLOBAL],BitvecLiteral[8,32]]]]]],63,63],BitVectorAccessExpression[BinaryExpression[BITVECCONCAT,ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#double_Array_0~0!base,GLOBAL]]],[FunctionApplication[~bvadd~32,[IdentifierExpression[~#double_Array_0~0!offset,GLOBAL],BitvecLiteral[12,32]]]]],ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#double_Array_0~0!base,GLOBAL]]],[FunctionApplication[~bvadd~32,[IdentifierExpression[~#double_Array_0~0!offset,GLOBAL],BitvecLiteral[8,32]]]]]],62,52],BitVectorAccessExpression[BinaryExpression[BITVECCONCAT,ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#double_Array_0~0!base,GLOBAL]]],[FunctionApplication[~bvadd~32,[IdentifierExpression[~#double_Array_0~0!offset,GLOBAL],BitvecLiteral[12,32]]]]],ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#double_Array_0~0!base,GLOBAL]]],[FunctionApplication[~bvadd~32,[IdentifierExpression[~#double_Array_0~0!offset,GLOBAL],BitvecLiteral[8,32]]]]]],51,0]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#5[~#unsigned_short_int_Array_0~0!base][~#unsigned_short_int_Array_0~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#double_Array_0~0!base][~bvadd~32(~#double_Array_0~0!offset, 4bv32)] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#double_Array_0~0!base][~#double_Array_0~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#double_Array_0~0!base][~bvadd~32(~#double_Array_0~0!offset, 4bv32)] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#double_Array_0~0!base][~#double_Array_0~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#double_Array_0~0!base][~bvadd~32(~#double_Array_0~0!offset, 4bv32)] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#double_Array_0~0!base][~#double_Array_0~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: fp can only be backtranslated, if the arguments are literals: FunctionApplication[~fp~64,[BitVectorAccessExpression[BinaryExpression[BITVECCONCAT,ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#double_Array_0~0!base,GLOBAL]]],[FunctionApplication[~bvadd~32,[IdentifierExpression[~#double_Array_0~0!offset,GLOBAL],BitvecLiteral[4,32]]]]],ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#double_Array_0~0!base,GLOBAL]]],[IdentifierExpression[~#double_Array_0~0!offset,GLOBAL]]]],63,63],BitVectorAccessExpression[BinaryExpression[BITVECCONCAT,ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#double_Array_0~0!base,GLOBAL]]],[FunctionApplication[~bvadd~32,[IdentifierExpression[~#double_Array_0~0!offset,GLOBAL],BitvecLiteral[4,32]]]]],ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#double_Array_0~0!base,GLOBAL]]],[IdentifierExpression[~#double_Array_0~0!offset,GLOBAL]]]],62,52],BitVectorAccessExpression[BinaryExpression[BITVECCONCAT,ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#double_Array_0~0!base,GLOBAL]]],[FunctionApplication[~bvadd~32,[IdentifierExpression[~#double_Array_0~0!offset,GLOBAL],BitvecLiteral[4,32]]]]],ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#double_Array_0~0!base,GLOBAL]]],[IdentifierExpression[~#double_Array_0~0!offset,GLOBAL]]]],51,0]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#BOOL_unsigned_char_Array_0~0!base][~#BOOL_unsigned_char_Array_0~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#4[~#signed_short_int_Array_0~0!base][~#signed_short_int_Array_0~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#double_Array_0~0!base][~bvadd~32(~#double_Array_0~0!offset, 12bv32)] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#double_Array_0~0!base][~bvadd~32(~#double_Array_0~0!offset, 8bv32)] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#double_Array_0~0!base][~bvadd~32(~#double_Array_0~0!offset, 12bv32)] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#double_Array_0~0!base][~bvadd~32(~#double_Array_0~0!offset, 8bv32)] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#double_Array_0~0!base][~bvadd~32(~#double_Array_0~0!offset, 12bv32)] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#double_Array_0~0!base][~bvadd~32(~#double_Array_0~0!offset, 8bv32)] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: fp can only be backtranslated, if the arguments are literals: FunctionApplication[~fp~64,[BitVectorAccessExpression[BinaryExpression[BITVECCONCAT,ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#double_Array_0~0!base,GLOBAL]]],[FunctionApplication[~bvadd~32,[IdentifierExpression[~#double_Array_0~0!offset,GLOBAL],BitvecLiteral[12,32]]]]],ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#double_Array_0~0!base,GLOBAL]]],[FunctionApplication[~bvadd~32,[IdentifierExpression[~#double_Array_0~0!offset,GLOBAL],BitvecLiteral[8,32]]]]]],63,63],BitVectorAccessExpression[BinaryExpression[BITVECCONCAT,ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#double_Array_0~0!base,GLOBAL]]],[FunctionApplication[~bvadd~32,[IdentifierExpression[~#double_Array_0~0!offset,GLOBAL],BitvecLiteral[12,32]]]]],ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#double_Array_0~0!base,GLOBAL]]],[FunctionApplication[~bvadd~32,[IdentifierExpression[~#double_Array_0~0!offset,GLOBAL],BitvecLiteral[8,32]]]]]],62,52],BitVectorAccessExpression[BinaryExpression[BITVECCONCAT,ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#double_Array_0~0!base,GLOBAL]]],[FunctionApplication[~bvadd~32,[IdentifierExpression[~#double_Array_0~0!offset,GLOBAL],BitvecLiteral[12,32]]]]],ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#double_Array_0~0!base,GLOBAL]]],[FunctionApplication[~bvadd~32,[IdentifierExpression[~#double_Array_0~0!offset,GLOBAL],BitvecLiteral[8,32]]]]]],51,0]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#BOOL_unsigned_char_Array_0~0!base][~#BOOL_unsigned_char_Array_0~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#double_Array_0~0!base][~bvadd~32(~#double_Array_0~0!offset, 12bv32)] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#double_Array_0~0!base][~bvadd~32(~#double_Array_0~0!offset, 8bv32)] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#double_Array_0~0!base][~bvadd~32(~#double_Array_0~0!offset, 12bv32)] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#double_Array_0~0!base][~bvadd~32(~#double_Array_0~0!offset, 8bv32)] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#double_Array_0~0!base][~bvadd~32(~#double_Array_0~0!offset, 12bv32)] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#double_Array_0~0!base][~bvadd~32(~#double_Array_0~0!offset, 8bv32)] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: fp can only be backtranslated, if the arguments are literals: FunctionApplication[~fp~64,[BitVectorAccessExpression[BinaryExpression[BITVECCONCAT,ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#double_Array_0~0!base,GLOBAL]]],[FunctionApplication[~bvadd~32,[IdentifierExpression[~#double_Array_0~0!offset,GLOBAL],BitvecLiteral[12,32]]]]],ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#double_Array_0~0!base,GLOBAL]]],[FunctionApplication[~bvadd~32,[IdentifierExpression[~#double_Array_0~0!offset,GLOBAL],BitvecLiteral[8,32]]]]]],63,63],BitVectorAccessExpression[BinaryExpression[BITVECCONCAT,ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#double_Array_0~0!base,GLOBAL]]],[FunctionApplication[~bvadd~32,[IdentifierExpression[~#double_Array_0~0!offset,GLOBAL],BitvecLiteral[12,32]]]]],ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#double_Array_0~0!base,GLOBAL]]],[FunctionApplication[~bvadd~32,[IdentifierExpression[~#double_Array_0~0!offset,GLOBAL],BitvecLiteral[8,32]]]]]],62,52],BitVectorAccessExpression[BinaryExpression[BITVECCONCAT,ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#double_Array_0~0!base,GLOBAL]]],[FunctionApplication[~bvadd~32,[IdentifierExpression[~#double_Array_0~0!offset,GLOBAL],BitvecLiteral[12,32]]]]],ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#double_Array_0~0!base,GLOBAL]]],[FunctionApplication[~bvadd~32,[IdentifierExpression[~#double_Array_0~0!offset,GLOBAL],BitvecLiteral[8,32]]]]]],51,0]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#BOOL_unsigned_char_Array_0~0!base][~bvadd~32(~#BOOL_unsigned_char_Array_0~0!offset, 1bv32)] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#5[~#unsigned_short_int_Array_0~0!base][~#unsigned_short_int_Array_0~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#double_Array_0~0!base][~bvadd~32(~#double_Array_0~0!offset, 4bv32)] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#double_Array_0~0!base][~#double_Array_0~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#double_Array_0~0!base][~bvadd~32(~#double_Array_0~0!offset, 4bv32)] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#double_Array_0~0!base][~#double_Array_0~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#double_Array_0~0!base][~bvadd~32(~#double_Array_0~0!offset, 4bv32)] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#double_Array_0~0!base][~#double_Array_0~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: fp can only be backtranslated, if the arguments are literals: FunctionApplication[~fp~64,[BitVectorAccessExpression[BinaryExpression[BITVECCONCAT,ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#double_Array_0~0!base,GLOBAL]]],[FunctionApplication[~bvadd~32,[IdentifierExpression[~#double_Array_0~0!offset,GLOBAL],BitvecLiteral[4,32]]]]],ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#double_Array_0~0!base,GLOBAL]]],[IdentifierExpression[~#double_Array_0~0!offset,GLOBAL]]]],63,63],BitVectorAccessExpression[BinaryExpression[BITVECCONCAT,ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#double_Array_0~0!base,GLOBAL]]],[FunctionApplication[~bvadd~32,[IdentifierExpression[~#double_Array_0~0!offset,GLOBAL],BitvecLiteral[4,32]]]]],ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#double_Array_0~0!base,GLOBAL]]],[IdentifierExpression[~#double_Array_0~0!offset,GLOBAL]]]],62,52],BitVectorAccessExpression[BinaryExpression[BITVECCONCAT,ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#double_Array_0~0!base,GLOBAL]]],[FunctionApplication[~bvadd~32,[IdentifierExpression[~#double_Array_0~0!offset,GLOBAL],BitvecLiteral[4,32]]]]],ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#double_Array_0~0!base,GLOBAL]]],[IdentifierExpression[~#double_Array_0~0!offset,GLOBAL]]]],51,0]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#BOOL_unsigned_char_Array_0~0!base][~#BOOL_unsigned_char_Array_0~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#5[~#unsigned_short_int_Array_0~0!base][~#unsigned_short_int_Array_0~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#4[~#signed_short_int_Array_0~0!base][~#signed_short_int_Array_0~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#BOOL_unsigned_char_Array_0~0!base][~#BOOL_unsigned_char_Array_0~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#BOOL_unsigned_char_Array_0~0!base][~bvadd~32(~#BOOL_unsigned_char_Array_0~0!offset, 1bv32)] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#5[~#unsigned_short_int_Array_0~0!base][~#unsigned_short_int_Array_0~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#BOOL_unsigned_char_Array_0~0!base][~#BOOL_unsigned_char_Array_0~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#5[~#unsigned_short_int_Array_0~0!base][~#unsigned_short_int_Array_0~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#4[~#signed_short_int_Array_0~0!base][~#signed_short_int_Array_0~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#double_Array_0~0!base][~bvadd~32(~#double_Array_0~0!offset, 12bv32)] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#double_Array_0~0!base][~bvadd~32(~#double_Array_0~0!offset, 8bv32)] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#double_Array_0~0!base][~bvadd~32(~#double_Array_0~0!offset, 12bv32)] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#double_Array_0~0!base][~bvadd~32(~#double_Array_0~0!offset, 8bv32)] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#double_Array_0~0!base][~bvadd~32(~#double_Array_0~0!offset, 12bv32)] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#double_Array_0~0!base][~bvadd~32(~#double_Array_0~0!offset, 8bv32)] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: fp can only be backtranslated, if the arguments are literals: FunctionApplication[~fp~64,[BitVectorAccessExpression[BinaryExpression[BITVECCONCAT,ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#double_Array_0~0!base,GLOBAL]]],[FunctionApplication[~bvadd~32,[IdentifierExpression[~#double_Array_0~0!offset,GLOBAL],BitvecLiteral[12,32]]]]],ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#double_Array_0~0!base,GLOBAL]]],[FunctionApplication[~bvadd~32,[IdentifierExpression[~#double_Array_0~0!offset,GLOBAL],BitvecLiteral[8,32]]]]]],63,63],BitVectorAccessExpression[BinaryExpression[BITVECCONCAT,ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#double_Array_0~0!base,GLOBAL]]],[FunctionApplication[~bvadd~32,[IdentifierExpression[~#double_Array_0~0!offset,GLOBAL],BitvecLiteral[12,32]]]]],ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#double_Array_0~0!base,GLOBAL]]],[FunctionApplication[~bvadd~32,[IdentifierExpression[~#double_Array_0~0!offset,GLOBAL],BitvecLiteral[8,32]]]]]],62,52],BitVectorAccessExpression[BinaryExpression[BITVECCONCAT,ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#double_Array_0~0!base,GLOBAL]]],[FunctionApplication[~bvadd~32,[IdentifierExpression[~#double_Array_0~0!offset,GLOBAL],BitvecLiteral[12,32]]]]],ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#double_Array_0~0!base,GLOBAL]]],[FunctionApplication[~bvadd~32,[IdentifierExpression[~#double_Array_0~0!offset,GLOBAL],BitvecLiteral[8,32]]]]]],51,0]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#double_Array_0~0!base][~bvadd~32(~#double_Array_0~0!offset, 12bv32)] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#double_Array_0~0!base][~bvadd~32(~#double_Array_0~0!offset, 8bv32)] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#double_Array_0~0!base][~bvadd~32(~#double_Array_0~0!offset, 12bv32)] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#double_Array_0~0!base][~bvadd~32(~#double_Array_0~0!offset, 8bv32)] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#double_Array_0~0!base][~bvadd~32(~#double_Array_0~0!offset, 12bv32)] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#double_Array_0~0!base][~bvadd~32(~#double_Array_0~0!offset, 8bv32)] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: fp can only be backtranslated, if the arguments are literals: FunctionApplication[~fp~64,[BitVectorAccessExpression[BinaryExpression[BITVECCONCAT,ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#double_Array_0~0!base,GLOBAL]]],[FunctionApplication[~bvadd~32,[IdentifierExpression[~#double_Array_0~0!offset,GLOBAL],BitvecLiteral[12,32]]]]],ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#double_Array_0~0!base,GLOBAL]]],[FunctionApplication[~bvadd~32,[IdentifierExpression[~#double_Array_0~0!offset,GLOBAL],BitvecLiteral[8,32]]]]]],63,63],BitVectorAccessExpression[BinaryExpression[BITVECCONCAT,ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#double_Array_0~0!base,GLOBAL]]],[FunctionApplication[~bvadd~32,[IdentifierExpression[~#double_Array_0~0!offset,GLOBAL],BitvecLiteral[12,32]]]]],ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#double_Array_0~0!base,GLOBAL]]],[FunctionApplication[~bvadd~32,[IdentifierExpression[~#double_Array_0~0!offset,GLOBAL],BitvecLiteral[8,32]]]]]],62,52],BitVectorAccessExpression[BinaryExpression[BITVECCONCAT,ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#double_Array_0~0!base,GLOBAL]]],[FunctionApplication[~bvadd~32,[IdentifierExpression[~#double_Array_0~0!offset,GLOBAL],BitvecLiteral[12,32]]]]],ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#double_Array_0~0!base,GLOBAL]]],[FunctionApplication[~bvadd~32,[IdentifierExpression[~#double_Array_0~0!offset,GLOBAL],BitvecLiteral[8,32]]]]]],51,0]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#BOOL_unsigned_char_Array_0~0!base][~#BOOL_unsigned_char_Array_0~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#BOOL_unsigned_char_Array_0~0!base][~bvadd~32(~#BOOL_unsigned_char_Array_0~0!offset, 1bv32)] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#BOOL_unsigned_char_Array_0~0!base][~#BOOL_unsigned_char_Array_0~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#BOOL_unsigned_char_Array_0~0!base][~#BOOL_unsigned_char_Array_0~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#BOOL_unsigned_char_Array_0~0!base][~#BOOL_unsigned_char_Array_0~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#BOOL_unsigned_char_Array_0~0!base][~bvadd~32(~#BOOL_unsigned_char_Array_0~0!offset, 1bv32)] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#5[~#unsigned_short_int_Array_0~0!base][~#unsigned_short_int_Array_0~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#5[~#unsigned_short_int_Array_0~0!base][~#unsigned_short_int_Array_0~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#4[~#signed_short_int_Array_0~0!base][~#signed_short_int_Array_0~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#double_Array_0~0!base][~bvadd~32(~#double_Array_0~0!offset, 12bv32)] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#double_Array_0~0!base][~bvadd~32(~#double_Array_0~0!offset, 8bv32)] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#double_Array_0~0!base][~bvadd~32(~#double_Array_0~0!offset, 12bv32)] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#double_Array_0~0!base][~bvadd~32(~#double_Array_0~0!offset, 8bv32)] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#double_Array_0~0!base][~bvadd~32(~#double_Array_0~0!offset, 12bv32)] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#double_Array_0~0!base][~bvadd~32(~#double_Array_0~0!offset, 8bv32)] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: fp can only be backtranslated, if the arguments are literals: FunctionApplication[~fp~64,[BitVectorAccessExpression[BinaryExpression[BITVECCONCAT,ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#double_Array_0~0!base,GLOBAL]]],[FunctionApplication[~bvadd~32,[IdentifierExpression[~#double_Array_0~0!offset,GLOBAL],BitvecLiteral[12,32]]]]],ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#double_Array_0~0!base,GLOBAL]]],[FunctionApplication[~bvadd~32,[IdentifierExpression[~#double_Array_0~0!offset,GLOBAL],BitvecLiteral[8,32]]]]]],63,63],BitVectorAccessExpression[BinaryExpression[BITVECCONCAT,ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#double_Array_0~0!base,GLOBAL]]],[FunctionApplication[~bvadd~32,[IdentifierExpression[~#double_Array_0~0!offset,GLOBAL],BitvecLiteral[12,32]]]]],ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#double_Array_0~0!base,GLOBAL]]],[FunctionApplication[~bvadd~32,[IdentifierExpression[~#double_Array_0~0!offset,GLOBAL],BitvecLiteral[8,32]]]]]],62,52],BitVectorAccessExpression[BinaryExpression[BITVECCONCAT,ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#double_Array_0~0!base,GLOBAL]]],[FunctionApplication[~bvadd~32,[IdentifierExpression[~#double_Array_0~0!offset,GLOBAL],BitvecLiteral[12,32]]]]],ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#double_Array_0~0!base,GLOBAL]]],[FunctionApplication[~bvadd~32,[IdentifierExpression[~#double_Array_0~0!offset,GLOBAL],BitvecLiteral[8,32]]]]]],51,0]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#5[~#unsigned_short_int_Array_0~0!base][~#unsigned_short_int_Array_0~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#double_Array_0~0!base][~bvadd~32(~#double_Array_0~0!offset, 12bv32)] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#double_Array_0~0!base][~bvadd~32(~#double_Array_0~0!offset, 8bv32)] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#double_Array_0~0!base][~bvadd~32(~#double_Array_0~0!offset, 12bv32)] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#double_Array_0~0!base][~bvadd~32(~#double_Array_0~0!offset, 8bv32)] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#double_Array_0~0!base][~bvadd~32(~#double_Array_0~0!offset, 12bv32)] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#double_Array_0~0!base][~bvadd~32(~#double_Array_0~0!offset, 8bv32)] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: fp can only be backtranslated, if the arguments are literals: FunctionApplication[~fp~64,[BitVectorAccessExpression[BinaryExpression[BITVECCONCAT,ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#double_Array_0~0!base,GLOBAL]]],[FunctionApplication[~bvadd~32,[IdentifierExpression[~#double_Array_0~0!offset,GLOBAL],BitvecLiteral[12,32]]]]],ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#double_Array_0~0!base,GLOBAL]]],[FunctionApplication[~bvadd~32,[IdentifierExpression[~#double_Array_0~0!offset,GLOBAL],BitvecLiteral[8,32]]]]]],63,63],BitVectorAccessExpression[BinaryExpression[BITVECCONCAT,ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#double_Array_0~0!base,GLOBAL]]],[FunctionApplication[~bvadd~32,[IdentifierExpression[~#double_Array_0~0!offset,GLOBAL],BitvecLiteral[12,32]]]]],ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#double_Array_0~0!base,GLOBAL]]],[FunctionApplication[~bvadd~32,[IdentifierExpression[~#double_Array_0~0!offset,GLOBAL],BitvecLiteral[8,32]]]]]],62,52],BitVectorAccessExpression[BinaryExpression[BITVECCONCAT,ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#double_Array_0~0!base,GLOBAL]]],[FunctionApplication[~bvadd~32,[IdentifierExpression[~#double_Array_0~0!offset,GLOBAL],BitvecLiteral[12,32]]]]],ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#double_Array_0~0!base,GLOBAL]]],[FunctionApplication[~bvadd~32,[IdentifierExpression[~#double_Array_0~0!offset,GLOBAL],BitvecLiteral[8,32]]]]]],51,0]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#double_Array_0~0!base][~bvadd~32(~#double_Array_0~0!offset, 12bv32)] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#double_Array_0~0!base][~bvadd~32(~#double_Array_0~0!offset, 8bv32)] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#double_Array_0~0!base][~bvadd~32(~#double_Array_0~0!offset, 12bv32)] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#double_Array_0~0!base][~bvadd~32(~#double_Array_0~0!offset, 8bv32)] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#double_Array_0~0!base][~bvadd~32(~#double_Array_0~0!offset, 12bv32)] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#double_Array_0~0!base][~bvadd~32(~#double_Array_0~0!offset, 8bv32)] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: fp can only be backtranslated, if the arguments are literals: FunctionApplication[~fp~64,[BitVectorAccessExpression[BinaryExpression[BITVECCONCAT,ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#double_Array_0~0!base,GLOBAL]]],[FunctionApplication[~bvadd~32,[IdentifierExpression[~#double_Array_0~0!offset,GLOBAL],BitvecLiteral[12,32]]]]],ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#double_Array_0~0!base,GLOBAL]]],[FunctionApplication[~bvadd~32,[IdentifierExpression[~#double_Array_0~0!offset,GLOBAL],BitvecLiteral[8,32]]]]]],63,63],BitVectorAccessExpression[BinaryExpression[BITVECCONCAT,ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#double_Array_0~0!base,GLOBAL]]],[FunctionApplication[~bvadd~32,[IdentifierExpression[~#double_Array_0~0!offset,GLOBAL],BitvecLiteral[12,32]]]]],ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#double_Array_0~0!base,GLOBAL]]],[FunctionApplication[~bvadd~32,[IdentifierExpression[~#double_Array_0~0!offset,GLOBAL],BitvecLiteral[8,32]]]]]],62,52],BitVectorAccessExpression[BinaryExpression[BITVECCONCAT,ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#double_Array_0~0!base,GLOBAL]]],[FunctionApplication[~bvadd~32,[IdentifierExpression[~#double_Array_0~0!offset,GLOBAL],BitvecLiteral[12,32]]]]],ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#double_Array_0~0!base,GLOBAL]]],[FunctionApplication[~bvadd~32,[IdentifierExpression[~#double_Array_0~0!offset,GLOBAL],BitvecLiteral[8,32]]]]]],51,0]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#4[~#signed_short_int_Array_0~0!base][~#signed_short_int_Array_0~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven 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, 89 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 402.6s, OverallIterations: 29, TraceHistogramMax: 14, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 312.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 18.5s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 4 mSolverCounterUnknown, 5583 SdHoareTripleChecker+Valid, 300.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5576 mSDsluCounter, 20369 SdHoareTripleChecker+Invalid, 295.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 16163 mSDsCounter, 311 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4271 IncrementalHoareTripleChecker+Invalid, 4586 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 311 mSolverCounterUnsat, 4206 mSDtfsCounter, 4271 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 5034 GetRequests, 4641 SyntacticMatches, 3 SemanticMatches, 390 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1371 ImplicationChecksByTransitivity, 29.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2155occurred in iteration=22, InterpolantAutomatonStates: 287, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 29 MinimizatonAttempts, 2929 StatesRemovedByMinimization, 26 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 529 PreInvPairs, 561 NumberOfFragments, 4094 HoareAnnotationTreeSize, 529 FormulaSimplifications, 895830 FormulaSimplificationTreeSizeReduction, 3.6s HoareSimplificationTime, 9 FormulaSimplificationsInter, 89202 FormulaSimplificationTreeSizeReductionInter, 14.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 1.0s SsaConstructionTime, 11.3s SatisfiabilityAnalysisTime, 49.7s InterpolantComputationTime, 3242 NumberOfCodeBlocks, 3242 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 4874 ConstructedInterpolants, 101 QuantifiedInterpolants, 77816 SizeOfPredicates, 244 NumberOfNonLiveVariables, 8055 ConjunctsInSsa, 306 ConjunctsInUnsatCore, 42 InterpolantComputations, 24 PerfectInterpolantSequences, 6467/8218 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: 92]: Loop Invariant Derived loop invariant: ((((((((null & 127) >= 1) && ((2 * last_1_signed_short_int_Array_0_0_) < (last_1_signed_short_int_Array_0_0_ * last_1_signed_short_int_Array_0_0_))) && ((null & 127) <= 1)) || (((((null & 127) >= 1) && ((null & 127) <= 1)) && ((0 & 127) == last_1_BOOL_unsigned_char_Array_0_1_)) && (last_1_signed_short_int_Array_0_0_ == (256 & 32767)))) || ((((null & 127) >= 1) && ((2 * last_1_signed_short_int_Array_0_0_) < (last_1_signed_short_int_Array_0_0_ * last_1_signed_short_int_Array_0_0_))) && ((null & 127) <= 1))) || ((((null & 127) >= 1) && ((2 * last_1_signed_short_int_Array_0_0_) < (last_1_signed_short_int_Array_0_0_ * last_1_signed_short_int_Array_0_0_))) && ((null & 127) <= 1))) || ((((null & 127) >= 1) && ((null & 127) <= 1)) && (((2 * last_1_signed_short_int_Array_0_0_) < (last_1_signed_short_int_Array_0_0_ * last_1_signed_short_int_Array_0_0_)) || (last_1_signed_short_int_Array_0_0_ == (((32 & 32767) & 32767) & 32767))))) RESULT: Ultimate proved your program to be correct! [2023-12-24 13:07:59,210 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...