/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-53.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-24 16:44:25,940 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-24 16:44:26,012 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-12-24 16:44:26,016 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-24 16:44:26,017 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-24 16:44:26,041 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-24 16:44:26,042 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-24 16:44:26,042 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-24 16:44:26,043 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-24 16:44:26,045 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-24 16:44:26,046 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-24 16:44:26,046 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-24 16:44:26,047 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-24 16:44:26,047 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-24 16:44:26,048 INFO L153 SettingsManager]: * Use SBE=true [2023-12-24 16:44:26,048 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-24 16:44:26,048 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-24 16:44:26,048 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-24 16:44:26,049 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-24 16:44:26,049 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-24 16:44:26,049 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-24 16:44:26,049 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-24 16:44:26,050 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-24 16:44:26,050 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-24 16:44:26,050 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-24 16:44:26,050 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-24 16:44:26,050 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-24 16:44:26,050 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-24 16:44:26,050 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-24 16:44:26,051 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-24 16:44:26,051 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-24 16:44:26,052 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-24 16:44:26,052 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-24 16:44:26,052 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-24 16:44:26,052 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-24 16:44:26,052 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-24 16:44:26,052 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-24 16:44:26,052 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-24 16:44:26,053 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-24 16:44:26,053 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-24 16:44:26,053 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-24 16:44:26,053 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-24 16:44:26,053 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-24 16:44:26,053 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-24 16:44:26,054 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-24 16:44:26,054 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-24 16:44:26,054 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2023-12-24 16:44:26,256 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-24 16:44:26,276 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-24 16:44:26,278 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-24 16:44:26,280 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-24 16:44:26,280 INFO L274 PluginConnector]: CDTParser initialized [2023-12-24 16:44:26,281 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-53.i [2023-12-24 16:44:27,378 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-24 16:44:27,555 INFO L384 CDTParser]: Found 1 translation units. [2023-12-24 16:44:27,556 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-53.i [2023-12-24 16:44:27,563 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dcdcef0ed/78f85cb7b0454fbe9453029ee0c9c181/FLAG2264e63ad [2023-12-24 16:44:27,573 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dcdcef0ed/78f85cb7b0454fbe9453029ee0c9c181 [2023-12-24 16:44:27,575 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-24 16:44:27,576 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-24 16:44:27,577 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-24 16:44:27,577 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-24 16:44:27,580 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-24 16:44:27,580 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.12 04:44:27" (1/1) ... [2023-12-24 16:44:27,581 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@46b9f2cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 04:44:27, skipping insertion in model container [2023-12-24 16:44:27,581 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.12 04:44:27" (1/1) ... [2023-12-24 16:44:27,613 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-24 16:44:27,714 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-53.i[916,929] [2023-12-24 16:44:27,759 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-24 16:44:27,772 INFO L202 MainTranslator]: Completed pre-run [2023-12-24 16:44:27,781 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-53.i[916,929] [2023-12-24 16:44:27,805 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-24 16:44:27,835 INFO L206 MainTranslator]: Completed translation [2023-12-24 16:44:27,836 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 04:44:27 WrapperNode [2023-12-24 16:44:27,836 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-24 16:44:27,837 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-24 16:44:27,837 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-24 16:44:27,837 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-24 16:44:27,841 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 04:44:27" (1/1) ... [2023-12-24 16:44:27,868 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 04:44:27" (1/1) ... [2023-12-24 16:44:27,891 INFO L138 Inliner]: procedures = 36, calls = 177, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 528 [2023-12-24 16:44:27,892 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-24 16:44:27,892 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-24 16:44:27,892 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-24 16:44:27,892 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-24 16:44:27,901 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 04:44:27" (1/1) ... [2023-12-24 16:44:27,901 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 04:44:27" (1/1) ... [2023-12-24 16:44:27,920 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 04:44:27" (1/1) ... [2023-12-24 16:44:27,952 INFO L175 MemorySlicer]: Split 133 memory accesses to 16 slices as follows [2, 3, 12, 12, 6, 5, 10, 7, 10, 10, 12, 17, 6, 10, 5, 6]. 13 percent of accesses are in the largest equivalence class. The 17 initializations are split as follows [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]. The 18 writes are split as follows [0, 1, 1, 1, 1, 1, 1, 3, 1, 1, 1, 1, 1, 1, 2, 1]. [2023-12-24 16:44:27,953 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 04:44:27" (1/1) ... [2023-12-24 16:44:27,953 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 04:44:27" (1/1) ... [2023-12-24 16:44:27,974 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 04:44:27" (1/1) ... [2023-12-24 16:44:27,978 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 04:44:27" (1/1) ... [2023-12-24 16:44:27,984 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 04:44:27" (1/1) ... [2023-12-24 16:44:27,988 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 04:44:27" (1/1) ... [2023-12-24 16:44:27,996 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-24 16:44:27,997 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-24 16:44:27,997 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-24 16:44:27,997 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-24 16:44:27,998 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 04:44:27" (1/1) ... [2023-12-24 16:44:28,001 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-24 16:44:28,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-24 16:44:28,034 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-12-24 16:44:28,053 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-12-24 16:44:28,062 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-24 16:44:28,062 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2023-12-24 16:44:28,062 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2023-12-24 16:44:28,062 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#2 [2023-12-24 16:44:28,062 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#3 [2023-12-24 16:44:28,062 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#4 [2023-12-24 16:44:28,062 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#5 [2023-12-24 16:44:28,062 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#6 [2023-12-24 16:44:28,062 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#7 [2023-12-24 16:44:28,063 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#8 [2023-12-24 16:44:28,063 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#9 [2023-12-24 16:44:28,063 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#10 [2023-12-24 16:44:28,063 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#11 [2023-12-24 16:44:28,063 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#12 [2023-12-24 16:44:28,063 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#13 [2023-12-24 16:44:28,063 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#14 [2023-12-24 16:44:28,063 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#15 [2023-12-24 16:44:28,063 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2023-12-24 16:44:28,063 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2023-12-24 16:44:28,063 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#2 [2023-12-24 16:44:28,063 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#3 [2023-12-24 16:44:28,064 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#4 [2023-12-24 16:44:28,064 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#5 [2023-12-24 16:44:28,064 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#6 [2023-12-24 16:44:28,064 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#7 [2023-12-24 16:44:28,064 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#8 [2023-12-24 16:44:28,064 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#9 [2023-12-24 16:44:28,064 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#10 [2023-12-24 16:44:28,064 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#11 [2023-12-24 16:44:28,064 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#12 [2023-12-24 16:44:28,064 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#13 [2023-12-24 16:44:28,064 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#14 [2023-12-24 16:44:28,064 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#15 [2023-12-24 16:44:28,064 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2023-12-24 16:44:28,065 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2023-12-24 16:44:28,065 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2023-12-24 16:44:28,065 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2023-12-24 16:44:28,065 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2023-12-24 16:44:28,065 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2023-12-24 16:44:28,065 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#6 [2023-12-24 16:44:28,065 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#7 [2023-12-24 16:44:28,065 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#8 [2023-12-24 16:44:28,065 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#9 [2023-12-24 16:44:28,065 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#10 [2023-12-24 16:44:28,065 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#11 [2023-12-24 16:44:28,066 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#12 [2023-12-24 16:44:28,066 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#13 [2023-12-24 16:44:28,066 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#14 [2023-12-24 16:44:28,066 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#15 [2023-12-24 16:44:28,066 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2023-12-24 16:44:28,066 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2023-12-24 16:44:28,066 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2023-12-24 16:44:28,066 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2023-12-24 16:44:28,066 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#4 [2023-12-24 16:44:28,066 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#5 [2023-12-24 16:44:28,066 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#6 [2023-12-24 16:44:28,066 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#7 [2023-12-24 16:44:28,066 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#8 [2023-12-24 16:44:28,067 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#9 [2023-12-24 16:44:28,067 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#10 [2023-12-24 16:44:28,067 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#11 [2023-12-24 16:44:28,067 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#12 [2023-12-24 16:44:28,067 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#13 [2023-12-24 16:44:28,067 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#14 [2023-12-24 16:44:28,067 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#15 [2023-12-24 16:44:28,067 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-24 16:44:28,067 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-12-24 16:44:28,067 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2023-12-24 16:44:28,067 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2023-12-24 16:44:28,067 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2023-12-24 16:44:28,067 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2023-12-24 16:44:28,068 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#6 [2023-12-24 16:44:28,068 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#7 [2023-12-24 16:44:28,068 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#8 [2023-12-24 16:44:28,068 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#9 [2023-12-24 16:44:28,068 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#10 [2023-12-24 16:44:28,068 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#11 [2023-12-24 16:44:28,068 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#12 [2023-12-24 16:44:28,068 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#13 [2023-12-24 16:44:28,068 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#14 [2023-12-24 16:44:28,068 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#15 [2023-12-24 16:44:28,068 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2023-12-24 16:44:28,068 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2023-12-24 16:44:28,069 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2023-12-24 16:44:28,069 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2023-12-24 16:44:28,069 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2023-12-24 16:44:28,069 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#5 [2023-12-24 16:44:28,069 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#6 [2023-12-24 16:44:28,069 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#7 [2023-12-24 16:44:28,069 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#8 [2023-12-24 16:44:28,069 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#9 [2023-12-24 16:44:28,069 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#10 [2023-12-24 16:44:28,069 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#11 [2023-12-24 16:44:28,069 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#12 [2023-12-24 16:44:28,069 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#13 [2023-12-24 16:44:28,069 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#14 [2023-12-24 16:44:28,070 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#15 [2023-12-24 16:44:28,070 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2023-12-24 16:44:28,070 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2023-12-24 16:44:28,070 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#2 [2023-12-24 16:44:28,070 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#3 [2023-12-24 16:44:28,070 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#4 [2023-12-24 16:44:28,070 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#5 [2023-12-24 16:44:28,070 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#6 [2023-12-24 16:44:28,070 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#7 [2023-12-24 16:44:28,070 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#8 [2023-12-24 16:44:28,070 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#9 [2023-12-24 16:44:28,070 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#10 [2023-12-24 16:44:28,070 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#11 [2023-12-24 16:44:28,071 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#12 [2023-12-24 16:44:28,071 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#13 [2023-12-24 16:44:28,071 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#14 [2023-12-24 16:44:28,071 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#15 [2023-12-24 16:44:28,071 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2023-12-24 16:44:28,071 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2023-12-24 16:44:28,071 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2023-12-24 16:44:28,071 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2023-12-24 16:44:28,071 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2023-12-24 16:44:28,071 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#5 [2023-12-24 16:44:28,071 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#6 [2023-12-24 16:44:28,071 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#7 [2023-12-24 16:44:28,072 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#8 [2023-12-24 16:44:28,072 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#9 [2023-12-24 16:44:28,072 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#10 [2023-12-24 16:44:28,073 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#11 [2023-12-24 16:44:28,073 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#12 [2023-12-24 16:44:28,073 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#13 [2023-12-24 16:44:28,073 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#14 [2023-12-24 16:44:28,074 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#15 [2023-12-24 16:44:28,074 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2023-12-24 16:44:28,074 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2023-12-24 16:44:28,075 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#2 [2023-12-24 16:44:28,075 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#3 [2023-12-24 16:44:28,076 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#4 [2023-12-24 16:44:28,076 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#5 [2023-12-24 16:44:28,076 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#6 [2023-12-24 16:44:28,076 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#7 [2023-12-24 16:44:28,076 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#8 [2023-12-24 16:44:28,076 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#9 [2023-12-24 16:44:28,076 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#10 [2023-12-24 16:44:28,076 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#11 [2023-12-24 16:44:28,076 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#12 [2023-12-24 16:44:28,076 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#13 [2023-12-24 16:44:28,077 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#14 [2023-12-24 16:44:28,077 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#15 [2023-12-24 16:44:28,077 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-24 16:44:28,077 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-24 16:44:28,077 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-24 16:44:28,077 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-24 16:44:28,077 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2023-12-24 16:44:28,078 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2023-12-24 16:44:28,079 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2023-12-24 16:44:28,081 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2023-12-24 16:44:28,085 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2023-12-24 16:44:28,085 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2023-12-24 16:44:28,086 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#6 [2023-12-24 16:44:28,086 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#7 [2023-12-24 16:44:28,086 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#8 [2023-12-24 16:44:28,086 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#9 [2023-12-24 16:44:28,086 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#10 [2023-12-24 16:44:28,086 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#11 [2023-12-24 16:44:28,086 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#12 [2023-12-24 16:44:28,086 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#13 [2023-12-24 16:44:28,086 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#14 [2023-12-24 16:44:28,086 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#15 [2023-12-24 16:44:28,086 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2023-12-24 16:44:28,087 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2023-12-24 16:44:28,087 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#2 [2023-12-24 16:44:28,087 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#3 [2023-12-24 16:44:28,087 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#4 [2023-12-24 16:44:28,087 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#5 [2023-12-24 16:44:28,087 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#6 [2023-12-24 16:44:28,087 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#7 [2023-12-24 16:44:28,087 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#8 [2023-12-24 16:44:28,087 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#9 [2023-12-24 16:44:28,087 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#10 [2023-12-24 16:44:28,087 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#11 [2023-12-24 16:44:28,087 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#12 [2023-12-24 16:44:28,087 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#13 [2023-12-24 16:44:28,087 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#14 [2023-12-24 16:44:28,087 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#15 [2023-12-24 16:44:28,087 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2023-12-24 16:44:28,087 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2023-12-24 16:44:28,087 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2023-12-24 16:44:28,088 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2023-12-24 16:44:28,088 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2023-12-24 16:44:28,088 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#5 [2023-12-24 16:44:28,088 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#6 [2023-12-24 16:44:28,088 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#7 [2023-12-24 16:44:28,088 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#8 [2023-12-24 16:44:28,088 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#9 [2023-12-24 16:44:28,088 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#10 [2023-12-24 16:44:28,088 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#11 [2023-12-24 16:44:28,088 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#12 [2023-12-24 16:44:28,088 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#13 [2023-12-24 16:44:28,088 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#14 [2023-12-24 16:44:28,088 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#15 [2023-12-24 16:44:28,324 INFO L241 CfgBuilder]: Building ICFG [2023-12-24 16:44:28,326 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-24 16:44:29,498 INFO L282 CfgBuilder]: Performing block encoding [2023-12-24 16:44:29,546 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-24 16:44:29,546 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-24 16:44:29,547 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.12 04:44:29 BoogieIcfgContainer [2023-12-24 16:44:29,547 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-24 16:44:29,548 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-24 16:44:29,548 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-24 16:44:29,550 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-24 16:44:29,550 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.12 04:44:27" (1/3) ... [2023-12-24 16:44:29,551 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d9f163b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.12 04:44:29, skipping insertion in model container [2023-12-24 16:44:29,551 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 04:44:27" (2/3) ... [2023-12-24 16:44:29,551 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d9f163b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.12 04:44:29, skipping insertion in model container [2023-12-24 16:44:29,551 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.12 04:44:29" (3/3) ... [2023-12-24 16:44:29,552 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-53.i [2023-12-24 16:44:29,564 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-24 16:44:29,564 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-24 16:44:29,606 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-24 16:44:29,611 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;@11bc3e09, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-24 16:44:29,611 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-24 16:44:29,621 INFO L276 IsEmpty]: Start isEmpty. Operand has 105 states, 84 states have (on average 1.4404761904761905) internal successors, (121), 85 states have internal predecessors, (121), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-12-24 16:44:29,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2023-12-24 16:44:29,637 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 16:44:29,637 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 16:44:29,637 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 16:44:29,642 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 16:44:29,643 INFO L85 PathProgramCache]: Analyzing trace with hash -1079870598, now seen corresponding path program 1 times [2023-12-24 16:44:29,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 16:44:29,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [888358607] [2023-12-24 16:44:29,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 16:44:29,655 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 16:44:29,656 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 16:44:29,658 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 16:44:29,696 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-12-24 16:44:30,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 16:44:30,086 INFO L262 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-24 16:44:30,092 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 16:44:30,135 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 314 proven. 0 refuted. 0 times theorem prover too weak. 298 trivial. 0 not checked. [2023-12-24 16:44:30,136 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 16:44:30,136 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 16:44:30,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [888358607] [2023-12-24 16:44:30,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [888358607] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 16:44:30,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 16:44:30,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-24 16:44:30,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313819665] [2023-12-24 16:44:30,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 16:44:30,141 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-24 16:44:30,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 16:44:30,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-24 16:44:30,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-24 16:44:30,167 INFO L87 Difference]: Start difference. First operand has 105 states, 84 states have (on average 1.4404761904761905) internal successors, (121), 85 states have internal predecessors, (121), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2023-12-24 16:44:30,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 16:44:30,221 INFO L93 Difference]: Finished difference Result 207 states and 330 transitions. [2023-12-24 16:44:30,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-24 16:44:30,223 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 135 [2023-12-24 16:44:30,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 16:44:30,231 INFO L225 Difference]: With dead ends: 207 [2023-12-24 16:44:30,231 INFO L226 Difference]: Without dead ends: 103 [2023-12-24 16:44:30,234 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-24 16:44:30,236 INFO L413 NwaCegarLoop]: 146 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, 146 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 16:44:30,237 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 146 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-24 16:44:30,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2023-12-24 16:44:30,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2023-12-24 16:44:30,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 83 states have (on average 1.3734939759036144) internal successors, (114), 83 states have internal predecessors, (114), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-12-24 16:44:30,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 150 transitions. [2023-12-24 16:44:30,287 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 150 transitions. Word has length 135 [2023-12-24 16:44:30,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 16:44:30,287 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 150 transitions. [2023-12-24 16:44:30,288 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2023-12-24 16:44:30,288 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 150 transitions. [2023-12-24 16:44:30,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2023-12-24 16:44:30,298 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 16:44:30,299 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 16:44:30,310 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2023-12-24 16:44:30,508 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 16:44:30,508 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 16:44:30,508 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 16:44:30,509 INFO L85 PathProgramCache]: Analyzing trace with hash -148898342, now seen corresponding path program 1 times [2023-12-24 16:44:30,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 16:44:30,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1986110108] [2023-12-24 16:44:30,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 16:44:30,509 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 16:44:30,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 16:44:30,512 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 16:44:30,530 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-12-24 16:44:30,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 16:44:30,901 INFO L262 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-24 16:44:30,907 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 16:44:31,133 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-12-24 16:44:31,145 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-12-24 16:44:31,145 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 16:44:31,145 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 16:44:31,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1986110108] [2023-12-24 16:44:31,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1986110108] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 16:44:31,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 16:44:31,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-24 16:44:31,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046152471] [2023-12-24 16:44:31,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 16:44:31,147 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-24 16:44:31,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 16:44:31,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-24 16:44:31,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-24 16:44:31,148 INFO L87 Difference]: Start difference. First operand 103 states and 150 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-12-24 16:44:31,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 16:44:31,241 INFO L93 Difference]: Finished difference Result 307 states and 448 transitions. [2023-12-24 16:44:31,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-24 16:44:31,242 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 135 [2023-12-24 16:44:31,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 16:44:31,243 INFO L225 Difference]: With dead ends: 307 [2023-12-24 16:44:31,243 INFO L226 Difference]: Without dead ends: 205 [2023-12-24 16:44:31,244 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-24 16:44:31,245 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 81 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 405 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-24 16:44:31,245 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 405 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-24 16:44:31,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2023-12-24 16:44:31,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 201. [2023-12-24 16:44:31,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 162 states have (on average 1.376543209876543) internal successors, (223), 162 states have internal predecessors, (223), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2023-12-24 16:44:31,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 295 transitions. [2023-12-24 16:44:31,261 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 295 transitions. Word has length 135 [2023-12-24 16:44:31,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 16:44:31,262 INFO L495 AbstractCegarLoop]: Abstraction has 201 states and 295 transitions. [2023-12-24 16:44:31,262 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-12-24 16:44:31,262 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 295 transitions. [2023-12-24 16:44:31,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2023-12-24 16:44:31,263 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 16:44:31,263 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 16:44:31,275 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-12-24 16:44:31,471 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 16:44:31,472 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 16:44:31,472 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 16:44:31,472 INFO L85 PathProgramCache]: Analyzing trace with hash -1428762020, now seen corresponding path program 1 times [2023-12-24 16:44:31,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 16:44:31,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1951944593] [2023-12-24 16:44:31,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 16:44:31,473 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 16:44:31,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 16:44:31,477 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 16:44:31,480 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-12-24 16:44:31,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 16:44:31,829 INFO L262 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 15 conjunts are in the unsatisfiable core [2023-12-24 16:44:31,834 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 16:44:32,490 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 10 [2023-12-24 16:44:32,520 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 20 proven. 222 refuted. 0 times theorem prover too weak. 370 trivial. 0 not checked. [2023-12-24 16:44:32,521 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 16:44:32,634 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 16:44:32,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1951944593] [2023-12-24 16:44:32,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1951944593] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-24 16:44:32,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [301127028] [2023-12-24 16:44:32,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 16:44:32,634 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-24 16:44:32,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-24 16:44:32,681 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-24 16:44:32,682 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (5)] Waiting until timeout for monitored process [2023-12-24 16:44:33,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 16:44:33,484 INFO L262 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 16 conjunts are in the unsatisfiable core [2023-12-24 16:44:33,489 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 16:44:33,632 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 16:44:34,372 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-12-24 16:44:34,405 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 15 proven. 173 refuted. 0 times theorem prover too weak. 424 trivial. 0 not checked. [2023-12-24 16:44:34,405 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 16:44:34,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [301127028] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-24 16:44:34,467 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 16:44:34,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10] total 23 [2023-12-24 16:44:34,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424071165] [2023-12-24 16:44:34,467 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 16:44:34,467 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-12-24 16:44:34,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 16:44:34,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-12-24 16:44:34,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=659, Unknown=0, NotChecked=0, Total=756 [2023-12-24 16:44:34,469 INFO L87 Difference]: Start difference. First operand 201 states and 295 transitions. Second operand has 24 states, 21 states have (on average 4.761904761904762) internal successors, (100), 20 states have internal predecessors, (100), 7 states have call successors, (36), 6 states have call predecessors, (36), 7 states have return successors, (36), 5 states have call predecessors, (36), 7 states have call successors, (36) [2023-12-24 16:44:35,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 16:44:35,724 INFO L93 Difference]: Finished difference Result 423 states and 609 transitions. [2023-12-24 16:44:35,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-12-24 16:44:35,725 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 21 states have (on average 4.761904761904762) internal successors, (100), 20 states have internal predecessors, (100), 7 states have call successors, (36), 6 states have call predecessors, (36), 7 states have return successors, (36), 5 states have call predecessors, (36), 7 states have call successors, (36) Word has length 135 [2023-12-24 16:44:35,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 16:44:35,727 INFO L225 Difference]: With dead ends: 423 [2023-12-24 16:44:35,727 INFO L226 Difference]: Without dead ends: 223 [2023-12-24 16:44:35,728 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 326 GetRequests, 283 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 428 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=317, Invalid=1575, Unknown=0, NotChecked=0, Total=1892 [2023-12-24 16:44:35,729 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 620 mSDsluCounter, 1360 mSDsCounter, 0 mSdLazyCounter, 731 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 620 SdHoareTripleChecker+Valid, 1476 SdHoareTripleChecker+Invalid, 855 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 731 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-12-24 16:44:35,729 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [620 Valid, 1476 Invalid, 855 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 731 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-12-24 16:44:35,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2023-12-24 16:44:35,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 219. [2023-12-24 16:44:35,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 176 states have (on average 1.3465909090909092) internal successors, (237), 176 states have internal predecessors, (237), 36 states have call successors, (36), 6 states have call predecessors, (36), 6 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2023-12-24 16:44:35,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 309 transitions. [2023-12-24 16:44:35,747 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 309 transitions. Word has length 135 [2023-12-24 16:44:35,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 16:44:35,747 INFO L495 AbstractCegarLoop]: Abstraction has 219 states and 309 transitions. [2023-12-24 16:44:35,747 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 21 states have (on average 4.761904761904762) internal successors, (100), 20 states have internal predecessors, (100), 7 states have call successors, (36), 6 states have call predecessors, (36), 7 states have return successors, (36), 5 states have call predecessors, (36), 7 states have call successors, (36) [2023-12-24 16:44:35,747 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 309 transitions. [2023-12-24 16:44:35,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2023-12-24 16:44:35,748 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 16:44:35,753 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 16:44:35,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 (4)] Forceful destruction successful, exit code 0 [2023-12-24 16:44:35,973 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (5)] Forceful destruction successful, exit code 0 [2023-12-24 16:44:36,165 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,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2023-12-24 16:44:36,165 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 16:44:36,166 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 16:44:36,166 INFO L85 PathProgramCache]: Analyzing trace with hash -2015568034, now seen corresponding path program 1 times [2023-12-24 16:44:36,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 16:44:36,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1221740243] [2023-12-24 16:44:36,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 16:44:36,167 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 16:44:36,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 16:44:36,169 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 16:44:36,188 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-12-24 16:44:36,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 16:44:36,564 INFO L262 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 15 conjunts are in the unsatisfiable core [2023-12-24 16:44:36,568 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 16:44:37,286 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 10 [2023-12-24 16:44:37,311 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 16 proven. 116 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-12-24 16:44:37,311 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 16:44:37,409 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 16:44:37,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1221740243] [2023-12-24 16:44:37,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1221740243] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-24 16:44:37,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1836498519] [2023-12-24 16:44:37,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 16:44:37,410 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-24 16:44:37,410 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-24 16:44:37,411 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-24 16:44:37,413 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Waiting until timeout for monitored process [2023-12-24 16:44:38,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 16:44:38,162 INFO L262 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 16 conjunts are in the unsatisfiable core [2023-12-24 16:44:38,166 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 16:44:38,207 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 16:44:39,007 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-12-24 16:44:39,037 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 17 proven. 51 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2023-12-24 16:44:39,038 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 16:44:39,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1836498519] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-24 16:44:39,082 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 16:44:39,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10] total 23 [2023-12-24 16:44:39,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216630089] [2023-12-24 16:44:39,082 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 16:44:39,082 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-12-24 16:44:39,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 16:44:39,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-12-24 16:44:39,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=659, Unknown=0, NotChecked=0, Total=756 [2023-12-24 16:44:39,084 INFO L87 Difference]: Start difference. First operand 219 states and 309 transitions. Second operand has 24 states, 21 states have (on average 4.476190476190476) internal successors, (94), 20 states have internal predecessors, (94), 5 states have call successors, (36), 5 states have call predecessors, (36), 5 states have return successors, (36), 3 states have call predecessors, (36), 5 states have call successors, (36) [2023-12-24 16:44:40,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 16:44:40,175 INFO L93 Difference]: Finished difference Result 457 states and 633 transitions. [2023-12-24 16:44:40,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-12-24 16:44:40,179 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 21 states have (on average 4.476190476190476) internal successors, (94), 20 states have internal predecessors, (94), 5 states have call successors, (36), 5 states have call predecessors, (36), 5 states have return successors, (36), 3 states have call predecessors, (36), 5 states have call successors, (36) Word has length 135 [2023-12-24 16:44:40,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 16:44:40,181 INFO L225 Difference]: With dead ends: 457 [2023-12-24 16:44:40,181 INFO L226 Difference]: Without dead ends: 239 [2023-12-24 16:44:40,183 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 326 GetRequests, 283 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 418 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=317, Invalid=1575, Unknown=0, NotChecked=0, Total=1892 [2023-12-24 16:44:40,187 INFO L413 NwaCegarLoop]: 121 mSDtfsCounter, 463 mSDsluCounter, 1395 mSDsCounter, 0 mSdLazyCounter, 737 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 463 SdHoareTripleChecker+Valid, 1516 SdHoareTripleChecker+Invalid, 828 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 737 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-24 16:44:40,188 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [463 Valid, 1516 Invalid, 828 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 737 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-24 16:44:40,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2023-12-24 16:44:40,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 233. [2023-12-24 16:44:40,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 186 states have (on average 1.3172043010752688) internal successors, (245), 186 states have internal predecessors, (245), 36 states have call successors, (36), 10 states have call predecessors, (36), 10 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2023-12-24 16:44:40,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 317 transitions. [2023-12-24 16:44:40,227 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 317 transitions. Word has length 135 [2023-12-24 16:44:40,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 16:44:40,227 INFO L495 AbstractCegarLoop]: Abstraction has 233 states and 317 transitions. [2023-12-24 16:44:40,227 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 21 states have (on average 4.476190476190476) internal successors, (94), 20 states have internal predecessors, (94), 5 states have call successors, (36), 5 states have call predecessors, (36), 5 states have return successors, (36), 3 states have call predecessors, (36), 5 states have call successors, (36) [2023-12-24 16:44:40,227 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 317 transitions. [2023-12-24 16:44:40,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2023-12-24 16:44:40,228 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 16:44:40,228 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 16:44:40,239 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Forceful destruction successful, exit code 0 [2023-12-24 16:44:40,448 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-12-24 16:44:40,637 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 16:44:40,637 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 16:44:40,638 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 16:44:40,638 INFO L85 PathProgramCache]: Analyzing trace with hash 1582434536, now seen corresponding path program 1 times [2023-12-24 16:44:40,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 16:44:40,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [612246663] [2023-12-24 16:44:40,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 16:44:40,638 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 16:44:40,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 16:44:40,645 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 16:44:40,647 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-12-24 16:44:40,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 16:44:40,990 INFO L262 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 13 conjunts are in the unsatisfiable core [2023-12-24 16:44:40,993 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 16:44:41,256 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2023-12-24 16:44:41,324 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 51 treesize of output 39 [2023-12-24 16:44:41,332 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 51 treesize of output 31 [2023-12-24 16:44:41,353 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 10 proven. 338 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-24 16:44:41,353 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 16:44:41,458 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-12-24 16:44:41,458 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 16:44:41,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [612246663] [2023-12-24 16:44:41,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [612246663] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-24 16:44:41,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-24 16:44:41,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 11 [2023-12-24 16:44:41,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562964252] [2023-12-24 16:44:41,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 16:44:41,459 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-24 16:44:41,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 16:44:41,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-24 16:44:41,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2023-12-24 16:44:41,460 INFO L87 Difference]: Start difference. First operand 233 states and 317 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-12-24 16:44:41,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 16:44:41,576 INFO L93 Difference]: Finished difference Result 529 states and 721 transitions. [2023-12-24 16:44:41,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-24 16:44:41,577 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 136 [2023-12-24 16:44:41,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 16:44:41,578 INFO L225 Difference]: With dead ends: 529 [2023-12-24 16:44:41,578 INFO L226 Difference]: Without dead ends: 297 [2023-12-24 16:44:41,579 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 261 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2023-12-24 16:44:41,579 INFO L413 NwaCegarLoop]: 152 mSDtfsCounter, 185 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 470 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 16:44:41,580 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [185 Valid, 470 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-24 16:44:41,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2023-12-24 16:44:41,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 245. [2023-12-24 16:44:41,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 196 states have (on average 1.3010204081632653) internal successors, (255), 196 states have internal predecessors, (255), 36 states have call successors, (36), 12 states have call predecessors, (36), 12 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2023-12-24 16:44:41,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 327 transitions. [2023-12-24 16:44:41,596 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 327 transitions. Word has length 136 [2023-12-24 16:44:41,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 16:44:41,597 INFO L495 AbstractCegarLoop]: Abstraction has 245 states and 327 transitions. [2023-12-24 16:44:41,597 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-12-24 16:44:41,597 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 327 transitions. [2023-12-24 16:44:41,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2023-12-24 16:44:41,598 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 16:44:41,598 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 16:44:41,606 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2023-12-24 16:44:41,806 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 16:44:41,807 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 16:44:41,807 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 16:44:41,807 INFO L85 PathProgramCache]: Analyzing trace with hash 1189407526, now seen corresponding path program 1 times [2023-12-24 16:44:41,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 16:44:41,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1172178092] [2023-12-24 16:44:41,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 16:44:41,808 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 16:44:41,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 16:44:41,809 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 16:44:41,812 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-12-24 16:44:42,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 16:44:42,332 INFO L262 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 29 conjunts are in the unsatisfiable core [2023-12-24 16:44:42,336 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 16:44:44,324 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 10 [2023-12-24 16:44:44,329 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-12-24 16:44:44,333 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-12-24 16:44:44,374 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 18 proven. 488 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2023-12-24 16:44:44,374 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 16:44:44,819 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 16:44:44,819 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 27 treesize of output 30 [2023-12-24 16:44:45,035 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 16:44:45,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1172178092] [2023-12-24 16:44:45,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1172178092] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-24 16:44:45,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [983824158] [2023-12-24 16:44:45,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 16:44:45,036 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-24 16:44:45,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-24 16:44:45,037 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-24 16:44:45,038 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (10)] Waiting until timeout for monitored process [2023-12-24 16:44:46,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 16:44:46,089 INFO L262 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 52 conjunts are in the unsatisfiable core [2023-12-24 16:44:46,094 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 16:44:46,290 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 16:44:47,326 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 16:44:48,866 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 16:44:51,601 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 16:44:53,573 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-12-24 16:44:53,589 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-12-24 16:44:53,689 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 16 proven. 496 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2023-12-24 16:44:53,689 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 16:44:54,596 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 50 treesize of output 46 [2023-12-24 16:44:54,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [983824158] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-24 16:44:54,863 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 16:44:54,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 27] total 48 [2023-12-24 16:44:54,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537718467] [2023-12-24 16:44:54,864 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 16:44:54,870 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2023-12-24 16:44:54,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 16:44:54,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2023-12-24 16:44:54,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=3581, Unknown=0, NotChecked=0, Total=3906 [2023-12-24 16:44:54,877 INFO L87 Difference]: Start difference. First operand 245 states and 327 transitions. Second operand has 49 states, 40 states have (on average 3.1) internal successors, (124), 38 states have internal predecessors, (124), 17 states have call successors, (36), 16 states have call predecessors, (36), 17 states have return successors, (36), 11 states have call predecessors, (36), 17 states have call successors, (36) [2023-12-24 16:44:59,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 16:44:59,402 INFO L93 Difference]: Finished difference Result 461 states and 601 transitions. [2023-12-24 16:44:59,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2023-12-24 16:44:59,403 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 40 states have (on average 3.1) internal successors, (124), 38 states have internal predecessors, (124), 17 states have call successors, (36), 16 states have call predecessors, (36), 17 states have return successors, (36), 11 states have call predecessors, (36), 17 states have call successors, (36) Word has length 136 [2023-12-24 16:44:59,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 16:44:59,404 INFO L225 Difference]: With dead ends: 461 [2023-12-24 16:44:59,404 INFO L226 Difference]: Without dead ends: 217 [2023-12-24 16:44:59,406 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 418 GetRequests, 325 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2506 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=1245, Invalid=7685, Unknown=0, NotChecked=0, Total=8930 [2023-12-24 16:44:59,406 INFO L413 NwaCegarLoop]: 114 mSDtfsCounter, 702 mSDsluCounter, 2087 mSDsCounter, 0 mSdLazyCounter, 1432 mSolverCounterSat, 187 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 702 SdHoareTripleChecker+Valid, 2201 SdHoareTripleChecker+Invalid, 1619 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 187 IncrementalHoareTripleChecker+Valid, 1432 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-12-24 16:44:59,407 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [702 Valid, 2201 Invalid, 1619 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [187 Valid, 1432 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2023-12-24 16:44:59,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2023-12-24 16:44:59,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 129. [2023-12-24 16:44:59,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 103 states have (on average 1.2815533980582525) internal successors, (132), 103 states have internal predecessors, (132), 18 states have call successors, (18), 7 states have call predecessors, (18), 7 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-12-24 16:44:59,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 168 transitions. [2023-12-24 16:44:59,420 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 168 transitions. Word has length 136 [2023-12-24 16:44:59,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 16:44:59,420 INFO L495 AbstractCegarLoop]: Abstraction has 129 states and 168 transitions. [2023-12-24 16:44:59,421 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 40 states have (on average 3.1) internal successors, (124), 38 states have internal predecessors, (124), 17 states have call successors, (36), 16 states have call predecessors, (36), 17 states have return successors, (36), 11 states have call predecessors, (36), 17 states have call successors, (36) [2023-12-24 16:44:59,421 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 168 transitions. [2023-12-24 16:44:59,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2023-12-24 16:44:59,421 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 16:44:59,422 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 16:44:59,431 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2023-12-24 16:44:59,646 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (10)] Forceful destruction successful, exit code 0 [2023-12-24 16:44:59,831 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,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2023-12-24 16:44:59,831 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 16:44:59,831 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 16:44:59,831 INFO L85 PathProgramCache]: Analyzing trace with hash 2110355759, now seen corresponding path program 1 times [2023-12-24 16:44:59,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 16:44:59,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1816359010] [2023-12-24 16:44:59,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 16:44:59,832 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 16:44:59,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 16:44:59,833 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 16:44:59,864 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2023-12-24 16:45:00,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 16:45:00,188 INFO L262 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-24 16:45:00,191 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 16:45:00,195 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2023-12-24 16:45:00,205 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-12-24 16:45:00,205 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 16:45:00,205 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 16:45:00,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1816359010] [2023-12-24 16:45:00,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1816359010] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 16:45:00,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 16:45:00,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-24 16:45:00,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106289475] [2023-12-24 16:45:00,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 16:45:00,206 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-24 16:45:00,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 16:45:00,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-24 16:45:00,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-24 16:45:00,207 INFO L87 Difference]: Start difference. First operand 129 states and 168 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-12-24 16:45:00,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 16:45:00,252 INFO L93 Difference]: Finished difference Result 257 states and 335 transitions. [2023-12-24 16:45:00,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-24 16:45:00,253 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 138 [2023-12-24 16:45:00,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 16:45:00,254 INFO L225 Difference]: With dead ends: 257 [2023-12-24 16:45:00,254 INFO L226 Difference]: Without dead ends: 129 [2023-12-24 16:45:00,254 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-24 16:45:00,254 INFO L413 NwaCegarLoop]: 142 mSDtfsCounter, 1 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-24 16:45:00,255 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 281 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-24 16:45:00,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2023-12-24 16:45:00,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2023-12-24 16:45:00,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 103 states have (on average 1.2718446601941749) internal successors, (131), 103 states have internal predecessors, (131), 18 states have call successors, (18), 7 states have call predecessors, (18), 7 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-12-24 16:45:00,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 167 transitions. [2023-12-24 16:45:00,267 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 167 transitions. Word has length 138 [2023-12-24 16:45:00,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 16:45:00,267 INFO L495 AbstractCegarLoop]: Abstraction has 129 states and 167 transitions. [2023-12-24 16:45:00,267 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-12-24 16:45:00,267 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 167 transitions. [2023-12-24 16:45:00,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2023-12-24 16:45:00,268 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 16:45:00,268 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 16:45:00,277 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2023-12-24 16:45:00,476 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 16:45:00,477 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 16:45:00,477 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 16:45:00,477 INFO L85 PathProgramCache]: Analyzing trace with hash 1089287405, now seen corresponding path program 1 times [2023-12-24 16:45:00,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 16:45:00,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1352636138] [2023-12-24 16:45:00,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 16:45:00,477 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 16:45:00,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 16:45:00,479 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 16:45:00,480 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2023-12-24 16:45:01,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 16:45:01,227 INFO L262 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 44 conjunts are in the unsatisfiable core [2023-12-24 16:45:01,231 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 16:45:03,912 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 16:45:03,989 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2023-12-24 16:45:04,108 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 38 treesize of output 34 [2023-12-24 16:45:05,154 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 17 proven. 371 refuted. 0 times theorem prover too weak. 224 trivial. 0 not checked. [2023-12-24 16:45:05,154 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 16:45:05,620 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-12-24 16:45:05,620 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 16:45:05,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1352636138] [2023-12-24 16:45:05,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1352636138] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-24 16:45:05,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-24 16:45:05,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [31] total 35 [2023-12-24 16:45:05,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410367481] [2023-12-24 16:45:05,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 16:45:05,621 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-24 16:45:05,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 16:45:05,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-24 16:45:05,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=1073, Unknown=0, NotChecked=0, Total=1190 [2023-12-24 16:45:05,621 INFO L87 Difference]: Start difference. First operand 129 states and 167 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-12-24 16:45:05,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 16:45:05,825 INFO L93 Difference]: Finished difference Result 256 states and 331 transitions. [2023-12-24 16:45:05,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-24 16:45:05,826 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 138 [2023-12-24 16:45:05,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 16:45:05,827 INFO L225 Difference]: With dead ends: 256 [2023-12-24 16:45:05,827 INFO L226 Difference]: Without dead ends: 128 [2023-12-24 16:45:05,827 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 241 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 405 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=123, Invalid=1137, Unknown=0, NotChecked=0, Total=1260 [2023-12-24 16:45:05,828 INFO L413 NwaCegarLoop]: 125 mSDtfsCounter, 113 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 403 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-24 16:45:05,828 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 403 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-24 16:45:05,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2023-12-24 16:45:05,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 127. [2023-12-24 16:45:05,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 101 states have (on average 1.2574257425742574) internal successors, (127), 101 states have internal predecessors, (127), 18 states have call successors, (18), 7 states have call predecessors, (18), 7 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-12-24 16:45:05,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 163 transitions. [2023-12-24 16:45:05,840 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 163 transitions. Word has length 138 [2023-12-24 16:45:05,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 16:45:05,840 INFO L495 AbstractCegarLoop]: Abstraction has 127 states and 163 transitions. [2023-12-24 16:45:05,840 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-12-24 16:45:05,840 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 163 transitions. [2023-12-24 16:45:05,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2023-12-24 16:45:05,842 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 16:45:05,842 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 16:45:05,853 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2023-12-24 16:45:06,052 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 16:45:06,053 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 16:45:06,053 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 16:45:06,053 INFO L85 PathProgramCache]: Analyzing trace with hash -813875529, now seen corresponding path program 1 times [2023-12-24 16:45:06,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 16:45:06,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1968669402] [2023-12-24 16:45:06,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 16:45:06,053 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 16:45:06,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 16:45:06,055 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 16:45:06,056 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2023-12-24 16:45:06,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 16:45:06,436 INFO L262 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 11 conjunts are in the unsatisfiable core [2023-12-24 16:45:06,439 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 16:45:06,489 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 16:45:06,514 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2023-12-24 16:45:06,531 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-12-24 16:45:06,531 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 16:45:06,532 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 16:45:06,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1968669402] [2023-12-24 16:45:06,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1968669402] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 16:45:06,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 16:45:06,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-24 16:45:06,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33669740] [2023-12-24 16:45:06,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 16:45:06,532 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-24 16:45:06,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 16:45:06,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-24 16:45:06,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-12-24 16:45:06,533 INFO L87 Difference]: Start difference. First operand 127 states and 163 transitions. Second operand has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-12-24 16:45:06,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 16:45:06,841 INFO L93 Difference]: Finished difference Result 321 states and 415 transitions. [2023-12-24 16:45:06,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-24 16:45:06,842 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 143 [2023-12-24 16:45:06,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 16:45:06,843 INFO L225 Difference]: With dead ends: 321 [2023-12-24 16:45:06,843 INFO L226 Difference]: Without dead ends: 195 [2023-12-24 16:45:06,843 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2023-12-24 16:45:06,843 INFO L413 NwaCegarLoop]: 142 mSDtfsCounter, 147 mSDsluCounter, 762 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 904 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-24 16:45:06,844 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 904 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-24 16:45:06,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2023-12-24 16:45:06,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 141. [2023-12-24 16:45:06,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 115 states have (on average 1.2782608695652173) internal successors, (147), 115 states have internal predecessors, (147), 18 states have call successors, (18), 7 states have call predecessors, (18), 7 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-12-24 16:45:06,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 183 transitions. [2023-12-24 16:45:06,856 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 183 transitions. Word has length 143 [2023-12-24 16:45:06,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 16:45:06,856 INFO L495 AbstractCegarLoop]: Abstraction has 141 states and 183 transitions. [2023-12-24 16:45:06,856 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-12-24 16:45:06,857 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 183 transitions. [2023-12-24 16:45:06,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2023-12-24 16:45:06,857 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 16:45:06,857 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 16:45:06,866 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2023-12-24 16:45:07,066 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 16:45:07,066 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 16:45:07,066 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 16:45:07,067 INFO L85 PathProgramCache]: Analyzing trace with hash -1206902539, now seen corresponding path program 1 times [2023-12-24 16:45:07,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 16:45:07,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1796963820] [2023-12-24 16:45:07,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 16:45:07,067 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 16:45:07,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 16:45:07,068 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 16:45:07,069 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2023-12-24 16:45:07,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 16:45:07,426 INFO L262 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 14 conjunts are in the unsatisfiable core [2023-12-24 16:45:07,429 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 16:45:07,946 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 10 [2023-12-24 16:45:07,967 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 16 proven. 116 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-12-24 16:45:07,967 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 16:45:08,056 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 16:45:08,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1796963820] [2023-12-24 16:45:08,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1796963820] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-24 16:45:08,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1638300479] [2023-12-24 16:45:08,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 16:45:08,057 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-24 16:45:08,057 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-24 16:45:08,058 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-24 16:45:08,059 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (15)] Waiting until timeout for monitored process [2023-12-24 16:45:08,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 16:45:08,520 INFO L262 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-24 16:45:08,522 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 16:45:08,599 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 16:45:08,601 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-12-24 16:45:08,624 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-12-24 16:45:08,624 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 16:45:08,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1638300479] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 16:45:08,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-24 16:45:08,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [13] total 17 [2023-12-24 16:45:08,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792096385] [2023-12-24 16:45:08,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 16:45:08,625 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-24 16:45:08,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 16:45:08,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-24 16:45:08,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=323, Unknown=0, NotChecked=0, Total=380 [2023-12-24 16:45:08,625 INFO L87 Difference]: Start difference. First operand 141 states and 183 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-12-24 16:45:08,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 16:45:08,743 INFO L93 Difference]: Finished difference Result 331 states and 434 transitions. [2023-12-24 16:45:08,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-24 16:45:08,743 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 143 [2023-12-24 16:45:08,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 16:45:08,744 INFO L225 Difference]: With dead ends: 331 [2023-12-24 16:45:08,744 INFO L226 Difference]: Without dead ends: 191 [2023-12-24 16:45:08,745 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 315 GetRequests, 295 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=65, Invalid=397, Unknown=0, NotChecked=0, Total=462 [2023-12-24 16:45:08,745 INFO L413 NwaCegarLoop]: 156 mSDtfsCounter, 95 mSDsluCounter, 415 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 571 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-24 16:45:08,745 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 571 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-24 16:45:08,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2023-12-24 16:45:08,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 141. [2023-12-24 16:45:08,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 115 states have (on average 1.2695652173913043) internal successors, (146), 115 states have internal predecessors, (146), 18 states have call successors, (18), 7 states have call predecessors, (18), 7 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-12-24 16:45:08,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 182 transitions. [2023-12-24 16:45:08,759 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 182 transitions. Word has length 143 [2023-12-24 16:45:08,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 16:45:08,760 INFO L495 AbstractCegarLoop]: Abstraction has 141 states and 182 transitions. [2023-12-24 16:45:08,760 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-12-24 16:45:08,760 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 182 transitions. [2023-12-24 16:45:08,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2023-12-24 16:45:08,761 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 16:45:08,761 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 16:45:08,768 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (15)] Forceful destruction successful, exit code 0 [2023-12-24 16:45:08,974 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2023-12-24 16:45:09,166 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 16:45:09,166 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 16:45:09,167 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 16:45:09,167 INFO L85 PathProgramCache]: Analyzing trace with hash 1792148025, now seen corresponding path program 1 times [2023-12-24 16:45:09,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 16:45:09,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [349933296] [2023-12-24 16:45:09,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 16:45:09,168 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 16:45:09,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 16:45:09,169 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 16:45:09,170 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2023-12-24 16:45:09,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 16:45:09,538 INFO L262 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 14 conjunts are in the unsatisfiable core [2023-12-24 16:45:09,541 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 16:45:10,079 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 10 [2023-12-24 16:45:10,102 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 20 proven. 222 refuted. 0 times theorem prover too weak. 370 trivial. 0 not checked. [2023-12-24 16:45:10,103 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 16:45:10,207 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 16:45:10,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [349933296] [2023-12-24 16:45:10,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [349933296] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-24 16:45:10,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1180800076] [2023-12-24 16:45:10,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 16:45:10,207 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-24 16:45:10,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-24 16:45:10,214 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-24 16:45:10,215 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (17)] Waiting until timeout for monitored process [2023-12-24 16:45:10,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 16:45:10,687 INFO L262 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-24 16:45:10,690 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 16:45:10,783 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2023-12-24 16:45:10,786 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 16 treesize of output 8 [2023-12-24 16:45:10,810 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-12-24 16:45:10,810 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 16:45:10,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1180800076] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 16:45:10,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-24 16:45:10,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [13] total 17 [2023-12-24 16:45:10,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305751587] [2023-12-24 16:45:10,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 16:45:10,811 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-24 16:45:10,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 16:45:10,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-24 16:45:10,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=323, Unknown=0, NotChecked=0, Total=380 [2023-12-24 16:45:10,812 INFO L87 Difference]: Start difference. First operand 141 states and 182 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-12-24 16:45:10,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 16:45:10,974 INFO L93 Difference]: Finished difference Result 308 states and 399 transitions. [2023-12-24 16:45:10,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-24 16:45:10,975 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 143 [2023-12-24 16:45:10,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 16:45:10,976 INFO L225 Difference]: With dead ends: 308 [2023-12-24 16:45:10,976 INFO L226 Difference]: Without dead ends: 168 [2023-12-24 16:45:10,977 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 315 GetRequests, 295 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=65, Invalid=397, Unknown=0, NotChecked=0, Total=462 [2023-12-24 16:45:10,977 INFO L413 NwaCegarLoop]: 164 mSDtfsCounter, 83 mSDsluCounter, 429 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 593 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-24 16:45:10,977 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 593 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-24 16:45:10,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2023-12-24 16:45:11,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 141. [2023-12-24 16:45:11,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 115 states have (on average 1.2608695652173914) internal successors, (145), 115 states have internal predecessors, (145), 18 states have call successors, (18), 7 states have call predecessors, (18), 7 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-12-24 16:45:11,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 181 transitions. [2023-12-24 16:45:11,007 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 181 transitions. Word has length 143 [2023-12-24 16:45:11,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 16:45:11,008 INFO L495 AbstractCegarLoop]: Abstraction has 141 states and 181 transitions. [2023-12-24 16:45:11,008 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-12-24 16:45:11,008 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 181 transitions. [2023-12-24 16:45:11,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2023-12-24 16:45:11,009 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 16:45:11,009 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 16:45:11,039 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2023-12-24 16:45:11,216 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (17)] Forceful destruction successful, exit code 0 [2023-12-24 16:45:11,409 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,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2023-12-24 16:45:11,410 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 16:45:11,410 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 16:45:11,410 INFO L85 PathProgramCache]: Analyzing trace with hash 1399121015, now seen corresponding path program 1 times [2023-12-24 16:45:11,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 16:45:11,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1293698832] [2023-12-24 16:45:11,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 16:45:11,411 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 16:45:11,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 16:45:11,412 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 16:45:11,433 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2023-12-24 16:45:11,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 16:45:11,775 INFO L262 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 12 conjunts are in the unsatisfiable core [2023-12-24 16:45:11,777 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 16:45:11,846 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 16:45:11,875 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2023-12-24 16:45:11,897 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-12-24 16:45:11,898 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 16:45:11,898 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 16:45:11,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1293698832] [2023-12-24 16:45:11,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1293698832] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 16:45:11,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 16:45:11,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-24 16:45:11,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464677645] [2023-12-24 16:45:11,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 16:45:11,898 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-24 16:45:11,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 16:45:11,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-24 16:45:11,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-12-24 16:45:11,899 INFO L87 Difference]: Start difference. First operand 141 states and 181 transitions. Second operand has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-12-24 16:45:12,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 16:45:12,166 INFO L93 Difference]: Finished difference Result 308 states and 397 transitions. [2023-12-24 16:45:12,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-24 16:45:12,166 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 143 [2023-12-24 16:45:12,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 16:45:12,167 INFO L225 Difference]: With dead ends: 308 [2023-12-24 16:45:12,167 INFO L226 Difference]: Without dead ends: 168 [2023-12-24 16:45:12,168 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2023-12-24 16:45:12,168 INFO L413 NwaCegarLoop]: 177 mSDtfsCounter, 122 mSDsluCounter, 746 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 923 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-24 16:45:12,169 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 923 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-24 16:45:12,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2023-12-24 16:45:12,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 140. [2023-12-24 16:45:12,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 114 states have (on average 1.2543859649122806) internal successors, (143), 114 states have internal predecessors, (143), 18 states have call successors, (18), 7 states have call predecessors, (18), 7 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-12-24 16:45:12,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 179 transitions. [2023-12-24 16:45:12,180 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 179 transitions. Word has length 143 [2023-12-24 16:45:12,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 16:45:12,180 INFO L495 AbstractCegarLoop]: Abstraction has 140 states and 179 transitions. [2023-12-24 16:45:12,181 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-12-24 16:45:12,181 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 179 transitions. [2023-12-24 16:45:12,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2023-12-24 16:45:12,182 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 16:45:12,182 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 16:45:12,193 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2023-12-24 16:45:12,391 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 16:45:12,392 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 16:45:12,392 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 16:45:12,392 INFO L85 PathProgramCache]: Analyzing trace with hash 1110451611, now seen corresponding path program 1 times [2023-12-24 16:45:12,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 16:45:12,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1414031508] [2023-12-24 16:45:12,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 16:45:12,400 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 16:45:12,401 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 16:45:12,402 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 16:45:12,403 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2023-12-24 16:45:12,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 16:45:12,735 INFO L262 TraceCheckSpWp]: Trace formula consists of 391 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-24 16:45:12,737 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 16:45:12,756 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-12-24 16:45:12,756 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 16:45:12,756 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 16:45:12,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1414031508] [2023-12-24 16:45:12,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1414031508] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 16:45:12,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 16:45:12,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-24 16:45:12,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397893996] [2023-12-24 16:45:12,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 16:45:12,757 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-24 16:45:12,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 16:45:12,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-24 16:45:12,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-24 16:45:12,757 INFO L87 Difference]: Start difference. First operand 140 states and 179 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-12-24 16:45:12,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 16:45:12,827 INFO L93 Difference]: Finished difference Result 294 states and 377 transitions. [2023-12-24 16:45:12,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-24 16:45:12,827 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 145 [2023-12-24 16:45:12,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 16:45:12,828 INFO L225 Difference]: With dead ends: 294 [2023-12-24 16:45:12,828 INFO L226 Difference]: Without dead ends: 155 [2023-12-24 16:45:12,828 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 140 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 16:45:12,829 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 79 mSDsluCounter, 518 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 654 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-24 16:45:12,829 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 654 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-24 16:45:12,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2023-12-24 16:45:12,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 144. [2023-12-24 16:45:12,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 118 states have (on average 1.2457627118644068) internal successors, (147), 118 states have internal predecessors, (147), 18 states have call successors, (18), 7 states have call predecessors, (18), 7 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-12-24 16:45:12,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 183 transitions. [2023-12-24 16:45:12,847 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 183 transitions. Word has length 145 [2023-12-24 16:45:12,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 16:45:12,847 INFO L495 AbstractCegarLoop]: Abstraction has 144 states and 183 transitions. [2023-12-24 16:45:12,847 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-12-24 16:45:12,847 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 183 transitions. [2023-12-24 16:45:12,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2023-12-24 16:45:12,848 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 16:45:12,848 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 16:45:12,857 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2023-12-24 16:45:13,057 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 16:45:13,057 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 16:45:13,058 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 16:45:13,058 INFO L85 PathProgramCache]: Analyzing trace with hash -1884686711, now seen corresponding path program 1 times [2023-12-24 16:45:13,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 16:45:13,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [538187564] [2023-12-24 16:45:13,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 16:45:13,059 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 16:45:13,059 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 16:45:13,060 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 16:45:13,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 (20)] Waiting until timeout for monitored process [2023-12-24 16:45:13,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 16:45:13,425 INFO L262 TraceCheckSpWp]: Trace formula consists of 397 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-24 16:45:13,427 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 16:45:13,440 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-12-24 16:45:13,440 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 16:45:13,440 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 16:45:13,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [538187564] [2023-12-24 16:45:13,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [538187564] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 16:45:13,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 16:45:13,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-24 16:45:13,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730246030] [2023-12-24 16:45:13,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 16:45:13,442 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-24 16:45:13,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 16:45:13,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-24 16:45:13,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-24 16:45:13,442 INFO L87 Difference]: Start difference. First operand 144 states and 183 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-12-24 16:45:13,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 16:45:13,502 INFO L93 Difference]: Finished difference Result 295 states and 376 transitions. [2023-12-24 16:45:13,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-24 16:45:13,503 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 147 [2023-12-24 16:45:13,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 16:45:13,504 INFO L225 Difference]: With dead ends: 295 [2023-12-24 16:45:13,504 INFO L226 Difference]: Without dead ends: 152 [2023-12-24 16:45:13,504 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-12-24 16:45:13,505 INFO L413 NwaCegarLoop]: 137 mSDtfsCounter, 32 mSDsluCounter, 395 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 532 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-24 16:45:13,506 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 532 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-24 16:45:13,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2023-12-24 16:45:13,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 147. [2023-12-24 16:45:13,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 121 states have (on average 1.2396694214876034) internal successors, (150), 121 states have internal predecessors, (150), 18 states have call successors, (18), 7 states have call predecessors, (18), 7 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-12-24 16:45:13,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 186 transitions. [2023-12-24 16:45:13,520 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 186 transitions. Word has length 147 [2023-12-24 16:45:13,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 16:45:13,520 INFO L495 AbstractCegarLoop]: Abstraction has 147 states and 186 transitions. [2023-12-24 16:45:13,521 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-12-24 16:45:13,521 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 186 transitions. [2023-12-24 16:45:13,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2023-12-24 16:45:13,522 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 16:45:13,522 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 16:45:13,540 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2023-12-24 16:45:13,730 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 16:45:13,731 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 16:45:13,731 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 16:45:13,731 INFO L85 PathProgramCache]: Analyzing trace with hash 799860688, now seen corresponding path program 1 times [2023-12-24 16:45:13,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 16:45:13,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1604494055] [2023-12-24 16:45:13,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 16:45:13,731 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 16:45:13,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 16:45:13,733 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 16:45:13,733 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2023-12-24 16:45:14,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 16:45:14,099 INFO L262 TraceCheckSpWp]: Trace formula consists of 394 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-24 16:45:14,101 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 16:45:14,125 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-12-24 16:45:14,125 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 16:45:14,125 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 16:45:14,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1604494055] [2023-12-24 16:45:14,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1604494055] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 16:45:14,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 16:45:14,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-24 16:45:14,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597190883] [2023-12-24 16:45:14,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 16:45:14,125 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-24 16:45:14,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 16:45:14,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-24 16:45:14,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-24 16:45:14,126 INFO L87 Difference]: Start difference. First operand 147 states and 186 transitions. Second operand has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-12-24 16:45:14,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 16:45:14,236 INFO L93 Difference]: Finished difference Result 326 states and 413 transitions. [2023-12-24 16:45:14,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-24 16:45:14,237 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 147 [2023-12-24 16:45:14,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 16:45:14,237 INFO L225 Difference]: With dead ends: 326 [2023-12-24 16:45:14,238 INFO L226 Difference]: Without dead ends: 180 [2023-12-24 16:45:14,238 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2023-12-24 16:45:14,238 INFO L413 NwaCegarLoop]: 149 mSDtfsCounter, 99 mSDsluCounter, 656 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 805 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-24 16:45:14,238 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 805 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-24 16:45:14,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2023-12-24 16:45:14,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 148. [2023-12-24 16:45:14,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 122 states have (on average 1.2377049180327868) internal successors, (151), 122 states have internal predecessors, (151), 18 states have call successors, (18), 7 states have call predecessors, (18), 7 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-12-24 16:45:14,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 187 transitions. [2023-12-24 16:45:14,253 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 187 transitions. Word has length 147 [2023-12-24 16:45:14,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 16:45:14,253 INFO L495 AbstractCegarLoop]: Abstraction has 148 states and 187 transitions. [2023-12-24 16:45:14,253 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-12-24 16:45:14,253 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 187 transitions. [2023-12-24 16:45:14,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2023-12-24 16:45:14,255 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 16:45:14,255 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 16:45:14,282 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 16:45:14,464 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 16:45:14,464 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 16:45:14,464 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 16:45:14,465 INFO L85 PathProgramCache]: Analyzing trace with hash -729110750, now seen corresponding path program 1 times [2023-12-24 16:45:14,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 16:45:14,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [244280861] [2023-12-24 16:45:14,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 16:45:14,465 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 16:45:14,465 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 16:45:14,467 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 16:45:14,500 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2023-12-24 16:45:14,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 16:45:14,893 INFO L262 TraceCheckSpWp]: Trace formula consists of 402 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-24 16:45:14,895 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 16:45:14,899 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2023-12-24 16:45:14,907 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-12-24 16:45:14,907 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 16:45:14,907 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 16:45:14,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [244280861] [2023-12-24 16:45:14,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [244280861] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 16:45:14,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 16:45:14,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-24 16:45:14,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602223111] [2023-12-24 16:45:14,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 16:45:14,908 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-24 16:45:14,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 16:45:14,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-24 16:45:14,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-24 16:45:14,908 INFO L87 Difference]: Start difference. First operand 148 states and 187 transitions. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-12-24 16:45:14,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 16:45:14,958 INFO L93 Difference]: Finished difference Result 295 states and 373 transitions. [2023-12-24 16:45:14,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-24 16:45:14,959 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 149 [2023-12-24 16:45:14,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 16:45:14,959 INFO L225 Difference]: With dead ends: 295 [2023-12-24 16:45:14,959 INFO L226 Difference]: Without dead ends: 148 [2023-12-24 16:45:14,960 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-24 16:45:14,960 INFO L413 NwaCegarLoop]: 138 mSDtfsCounter, 35 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-24 16:45:14,960 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 240 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-24 16:45:14,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2023-12-24 16:45:14,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 148. [2023-12-24 16:45:14,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 122 states have (on average 1.221311475409836) internal successors, (149), 122 states have internal predecessors, (149), 18 states have call successors, (18), 7 states have call predecessors, (18), 7 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-12-24 16:45:14,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 185 transitions. [2023-12-24 16:45:14,972 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 185 transitions. Word has length 149 [2023-12-24 16:45:14,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 16:45:14,972 INFO L495 AbstractCegarLoop]: Abstraction has 148 states and 185 transitions. [2023-12-24 16:45:14,972 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-12-24 16:45:14,972 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 185 transitions. [2023-12-24 16:45:14,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2023-12-24 16:45:14,973 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 16:45:14,973 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 16:45:14,984 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Forceful destruction successful, exit code 0 [2023-12-24 16:45:15,182 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 16:45:15,182 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 16:45:15,182 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 16:45:15,182 INFO L85 PathProgramCache]: Analyzing trace with hash 1571711840, now seen corresponding path program 1 times [2023-12-24 16:45:15,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 16:45:15,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [626590908] [2023-12-24 16:45:15,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 16:45:15,183 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 16:45:15,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 16:45:15,193 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 16:45:15,264 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2023-12-24 16:45:15,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 16:45:15,740 INFO L262 TraceCheckSpWp]: Trace formula consists of 402 conjuncts, 14 conjunts are in the unsatisfiable core [2023-12-24 16:45:15,743 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 16:45:16,045 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 16:45:16,098 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 16:45:16,111 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 16:45:16,153 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 224 refuted. 0 times theorem prover too weak. 388 trivial. 0 not checked. [2023-12-24 16:45:16,153 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 16:45:16,289 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-12-24 16:45:16,289 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 16:45:16,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [626590908] [2023-12-24 16:45:16,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [626590908] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-24 16:45:16,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-24 16:45:16,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10] total 14 [2023-12-24 16:45:16,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567008681] [2023-12-24 16:45:16,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 16:45:16,291 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-24 16:45:16,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 16:45:16,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-24 16:45:16,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2023-12-24 16:45:16,291 INFO L87 Difference]: Start difference. First operand 148 states and 185 transitions. Second operand has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 9 states have internal predecessors, (62), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-12-24 16:45:16,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 16:45:16,689 INFO L93 Difference]: Finished difference Result 374 states and 466 transitions. [2023-12-24 16:45:16,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-24 16:45:16,690 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 9 states have internal predecessors, (62), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 149 [2023-12-24 16:45:16,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 16:45:16,691 INFO L225 Difference]: With dead ends: 374 [2023-12-24 16:45:16,691 INFO L226 Difference]: Without dead ends: 227 [2023-12-24 16:45:16,691 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 304 GetRequests, 283 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=370, Unknown=0, NotChecked=0, Total=462 [2023-12-24 16:45:16,691 INFO L413 NwaCegarLoop]: 191 mSDtfsCounter, 167 mSDsluCounter, 1113 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 1304 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-24 16:45:16,692 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 1304 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 215 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-24 16:45:16,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2023-12-24 16:45:16,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 213. [2023-12-24 16:45:16,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 166 states have (on average 1.1987951807228916) internal successors, (199), 167 states have internal predecessors, (199), 32 states have call successors, (32), 14 states have call predecessors, (32), 14 states have return successors, (32), 31 states have call predecessors, (32), 32 states have call successors, (32) [2023-12-24 16:45:16,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 263 transitions. [2023-12-24 16:45:16,729 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 263 transitions. Word has length 149 [2023-12-24 16:45:16,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 16:45:16,729 INFO L495 AbstractCegarLoop]: Abstraction has 213 states and 263 transitions. [2023-12-24 16:45:16,729 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 9 states have internal predecessors, (62), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-12-24 16:45:16,729 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 263 transitions. [2023-12-24 16:45:16,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2023-12-24 16:45:16,730 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 16:45:16,730 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 16:45:16,739 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Ended with exit code 0 [2023-12-24 16:45:16,938 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 16:45:16,939 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 16:45:16,939 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 16:45:16,939 INFO L85 PathProgramCache]: Analyzing trace with hash -1227568564, now seen corresponding path program 1 times [2023-12-24 16:45:16,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 16:45:16,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [227951710] [2023-12-24 16:45:16,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 16:45:16,940 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 16:45:16,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 16:45:16,941 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 16:45:16,942 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2023-12-24 16:45:17,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 16:45:17,380 INFO L262 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 21 conjunts are in the unsatisfiable core [2023-12-24 16:45:17,384 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 16:45:17,829 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 51 treesize of output 38 [2023-12-24 16:45:17,833 WARN L214 Elim1Store]: Array PQE input equivalent to false [2023-12-24 16:45:17,835 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2023-12-24 16:45:18,023 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 141 treesize of output 109 [2023-12-24 16:45:18,026 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 107 treesize of output 87 [2023-12-24 16:45:18,084 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 36 proven. 326 refuted. 0 times theorem prover too weak. 250 trivial. 0 not checked. [2023-12-24 16:45:18,084 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 16:45:18,356 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 36 [2023-12-24 16:45:18,361 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-24 16:45:18,365 INFO L349 Elim1Store]: treesize reduction 14, result has 6.7 percent of original size [2023-12-24 16:45:18,365 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 1 [2023-12-24 16:45:18,417 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-12-24 16:45:18,417 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 16:45:18,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [227951710] [2023-12-24 16:45:18,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [227951710] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-24 16:45:18,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-24 16:45:18,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [15] total 19 [2023-12-24 16:45:18,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580331224] [2023-12-24 16:45:18,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 16:45:18,418 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-24 16:45:18,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 16:45:18,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-24 16:45:18,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=293, Unknown=0, NotChecked=0, Total=342 [2023-12-24 16:45:18,418 INFO L87 Difference]: Start difference. First operand 213 states and 263 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-12-24 16:45:18,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 16:45:18,969 INFO L93 Difference]: Finished difference Result 337 states and 415 transitions. [2023-12-24 16:45:18,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-24 16:45:18,970 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 149 [2023-12-24 16:45:18,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 16:45:18,972 INFO L225 Difference]: With dead ends: 337 [2023-12-24 16:45:18,972 INFO L226 Difference]: Without dead ends: 335 [2023-12-24 16:45:18,973 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 299 GetRequests, 279 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=399, Unknown=0, NotChecked=0, Total=462 [2023-12-24 16:45:18,980 INFO L413 NwaCegarLoop]: 181 mSDtfsCounter, 100 mSDsluCounter, 662 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 843 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-24 16:45:18,980 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 843 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-24 16:45:18,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2023-12-24 16:45:19,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 332. [2023-12-24 16:45:19,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 332 states, 269 states have (on average 1.2156133828996283) internal successors, (327), 271 states have internal predecessors, (327), 42 states have call successors, (42), 20 states have call predecessors, (42), 20 states have return successors, (42), 40 states have call predecessors, (42), 42 states have call successors, (42) [2023-12-24 16:45:19,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 411 transitions. [2023-12-24 16:45:19,029 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 411 transitions. Word has length 149 [2023-12-24 16:45:19,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 16:45:19,029 INFO L495 AbstractCegarLoop]: Abstraction has 332 states and 411 transitions. [2023-12-24 16:45:19,029 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-12-24 16:45:19,030 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 411 transitions. [2023-12-24 16:45:19,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2023-12-24 16:45:19,030 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 16:45:19,030 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 16:45:19,041 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Forceful destruction successful, exit code 0 [2023-12-24 16:45:19,240 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 16:45:19,241 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 16:45:19,241 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 16:45:19,241 INFO L85 PathProgramCache]: Analyzing trace with hash -1426595136, now seen corresponding path program 1 times [2023-12-24 16:45:19,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 16:45:19,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [110450855] [2023-12-24 16:45:19,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 16:45:19,242 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 16:45:19,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 16:45:19,243 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 16:45:19,244 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2023-12-24 16:45:19,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 16:45:19,597 INFO L262 TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-24 16:45:19,600 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 16:45:19,860 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 19 [2023-12-24 16:45:19,862 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-12-24 16:45:19,941 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2023-12-24 16:45:19,960 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 10 proven. 338 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-24 16:45:19,960 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 16:45:20,141 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2023-12-24 16:45:20,141 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 20 treesize of output 19 [2023-12-24 16:45:20,228 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 21 proven. 30 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2023-12-24 16:45:20,228 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 16:45:20,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [110450855] [2023-12-24 16:45:20,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [110450855] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 16:45:20,229 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 16:45:20,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2023-12-24 16:45:20,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989626066] [2023-12-24 16:45:20,229 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 16:45:20,229 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-24 16:45:20,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 16:45:20,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-24 16:45:20,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2023-12-24 16:45:20,230 INFO L87 Difference]: Start difference. First operand 332 states and 411 transitions. Second operand has 14 states, 12 states have (on average 8.083333333333334) internal successors, (97), 14 states have internal predecessors, (97), 4 states have call successors, (36), 3 states have call predecessors, (36), 5 states have return successors, (36), 2 states have call predecessors, (36), 4 states have call successors, (36) [2023-12-24 16:45:20,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 16:45:20,783 INFO L93 Difference]: Finished difference Result 637 states and 776 transitions. [2023-12-24 16:45:20,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-24 16:45:20,783 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 8.083333333333334) internal successors, (97), 14 states have internal predecessors, (97), 4 states have call successors, (36), 3 states have call predecessors, (36), 5 states have return successors, (36), 2 states have call predecessors, (36), 4 states have call successors, (36) Word has length 149 [2023-12-24 16:45:20,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 16:45:20,784 INFO L225 Difference]: With dead ends: 637 [2023-12-24 16:45:20,785 INFO L226 Difference]: Without dead ends: 368 [2023-12-24 16:45:20,785 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 309 GetRequests, 285 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=158, Invalid=442, Unknown=0, NotChecked=0, Total=600 [2023-12-24 16:45:20,785 INFO L413 NwaCegarLoop]: 120 mSDtfsCounter, 348 mSDsluCounter, 404 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 348 SdHoareTripleChecker+Valid, 524 SdHoareTripleChecker+Invalid, 314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-24 16:45:20,786 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [348 Valid, 524 Invalid, 314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-24 16:45:20,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2023-12-24 16:45:20,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 322. [2023-12-24 16:45:20,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 322 states, 256 states have (on average 1.1875) internal successors, (304), 258 states have internal predecessors, (304), 42 states have call successors, (42), 23 states have call predecessors, (42), 23 states have return successors, (42), 40 states have call predecessors, (42), 42 states have call successors, (42) [2023-12-24 16:45:20,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 388 transitions. [2023-12-24 16:45:20,824 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 388 transitions. Word has length 149 [2023-12-24 16:45:20,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 16:45:20,824 INFO L495 AbstractCegarLoop]: Abstraction has 322 states and 388 transitions. [2023-12-24 16:45:20,824 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 8.083333333333334) internal successors, (97), 14 states have internal predecessors, (97), 4 states have call successors, (36), 3 states have call predecessors, (36), 5 states have return successors, (36), 2 states have call predecessors, (36), 4 states have call successors, (36) [2023-12-24 16:45:20,824 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 388 transitions. [2023-12-24 16:45:20,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2023-12-24 16:45:20,825 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 16:45:20,825 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 16:45:20,834 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Forceful destruction successful, exit code 0 [2023-12-24 16:45:21,033 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 16:45:21,034 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 16:45:21,035 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 16:45:21,035 INFO L85 PathProgramCache]: Analyzing trace with hash -1328433838, now seen corresponding path program 1 times [2023-12-24 16:45:21,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 16:45:21,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [209548412] [2023-12-24 16:45:21,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 16:45:21,036 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 16:45:21,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 16:45:21,037 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 16:45:21,038 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Waiting until timeout for monitored process [2023-12-24 16:45:21,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 16:45:21,509 INFO L262 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 28 conjunts are in the unsatisfiable core [2023-12-24 16:45:21,512 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 16:45:23,498 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-12-24 16:45:23,501 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 10 [2023-12-24 16:45:23,506 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-12-24 16:45:23,543 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 18 proven. 488 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2023-12-24 16:45:23,543 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 16:45:24,060 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 16:45:24,060 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 27 treesize of output 30 [2023-12-24 16:45:24,302 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 16:45:24,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [209548412] [2023-12-24 16:45:24,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [209548412] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-24 16:45:24,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [454768216] [2023-12-24 16:45:24,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 16:45:24,303 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-24 16:45:24,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-24 16:45:24,303 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-24 16:45:24,320 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (27)] Waiting until timeout for monitored process [2023-12-24 16:45:25,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 16:45:25,233 INFO L262 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-24 16:45:25,235 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 16:45:42,371 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 16:45:42,371 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 140 treesize of output 80 [2023-12-24 16:45:42,404 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 16:45:42,404 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 110 treesize of output 50 [2023-12-24 16:45:48,745 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-12-24 16:45:48,746 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 16:45:48,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [454768216] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 16:45:48,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-24 16:45:48,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [22] total 26 [2023-12-24 16:45:48,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518711997] [2023-12-24 16:45:48,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 16:45:48,746 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-24 16:45:48,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 16:45:48,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-24 16:45:48,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=889, Unknown=0, NotChecked=0, Total=992 [2023-12-24 16:45:48,747 INFO L87 Difference]: Start difference. First operand 322 states and 388 transitions. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-12-24 16:46:13,484 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.34s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-24 16:46:15,760 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 16:46:19,771 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-24 16:46:20,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 16:46:20,687 INFO L93 Difference]: Finished difference Result 572 states and 689 transitions. [2023-12-24 16:46:20,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-24 16:46:20,697 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 151 [2023-12-24 16:46:20,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 16:46:20,698 INFO L225 Difference]: With dead ends: 572 [2023-12-24 16:46:20,698 INFO L226 Difference]: Without dead ends: 317 [2023-12-24 16:46:20,699 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 374 GetRequests, 343 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 331 ImplicationChecksByTransitivity, 32.7s TimeCoverageRelationStatistics Valid=107, Invalid=949, Unknown=0, NotChecked=0, Total=1056 [2023-12-24 16:46:20,699 INFO L413 NwaCegarLoop]: 123 mSDtfsCounter, 51 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 433 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.0s IncrementalHoareTripleChecker+Time [2023-12-24 16:46:20,700 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 433 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 99 Invalid, 1 Unknown, 0 Unchecked, 14.0s Time] [2023-12-24 16:46:20,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2023-12-24 16:46:20,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 317. [2023-12-24 16:46:20,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 317 states, 251 states have (on average 1.1792828685258965) internal successors, (296), 253 states have internal predecessors, (296), 42 states have call successors, (42), 23 states have call predecessors, (42), 23 states have return successors, (42), 40 states have call predecessors, (42), 42 states have call successors, (42) [2023-12-24 16:46:20,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 380 transitions. [2023-12-24 16:46:20,757 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 380 transitions. Word has length 151 [2023-12-24 16:46:20,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 16:46:20,757 INFO L495 AbstractCegarLoop]: Abstraction has 317 states and 380 transitions. [2023-12-24 16:46:20,757 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-12-24 16:46:20,757 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 380 transitions. [2023-12-24 16:46:20,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2023-12-24 16:46:20,758 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 16:46:20,758 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 16:46:20,777 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (27)] Forceful destruction successful, exit code 0 [2023-12-24 16:46:20,980 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Forceful destruction successful, exit code 0 [2023-12-24 16:46:21,178 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 16:46:21,178 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 16:46:21,178 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 16:46:21,179 INFO L85 PathProgramCache]: Analyzing trace with hash -288528654, now seen corresponding path program 1 times [2023-12-24 16:46:21,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 16:46:21,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [303928007] [2023-12-24 16:46:21,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 16:46:21,179 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 16:46:21,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 16:46:21,180 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 16:46:21,182 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (28)] Waiting until timeout for monitored process [2023-12-24 16:46:21,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 16:46:21,653 INFO L262 TraceCheckSpWp]: Trace formula consists of 409 conjuncts, 28 conjunts are in the unsatisfiable core [2023-12-24 16:46:21,656 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 16:46:26,971 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-12-24 16:46:26,979 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 10 [2023-12-24 16:46:26,992 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-12-24 16:46:27,093 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 18 proven. 488 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2023-12-24 16:46:27,093 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 16:46:28,134 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 16:46:28,135 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 27 treesize of output 30 [2023-12-24 16:46:28,635 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 16:46:28,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [303928007] [2023-12-24 16:46:28,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [303928007] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-24 16:46:28,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1931778621] [2023-12-24 16:46:28,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 16:46:28,635 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-24 16:46:28,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-24 16:46:28,636 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-24 16:46:28,637 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (29)] Waiting until timeout for monitored process [2023-12-24 16:46:29,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 16:46:29,575 INFO L262 TraceCheckSpWp]: Trace formula consists of 409 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-24 16:46:29,577 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 16:46:53,835 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 16:46:53,835 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 141 treesize of output 81 [2023-12-24 16:46:53,877 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 16:46:53,877 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 111 treesize of output 51 [2023-12-24 16:47:08,777 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-12-24 16:47:08,777 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 16:47:08,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1931778621] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 16:47:08,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-24 16:47:08,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [22] total 26 [2023-12-24 16:47:08,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375390057] [2023-12-24 16:47:08,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 16:47:08,778 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-24 16:47:08,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 16:47:08,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-24 16:47:08,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=888, Unknown=1, NotChecked=0, Total=992 [2023-12-24 16:47:08,779 INFO L87 Difference]: Start difference. First operand 317 states and 380 transitions. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-12-24 16:47:19,011 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-24 16:47:43,991 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-24 16:47:46,762 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.77s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-24 16:47:47,771 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-24 16:47:55,079 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.31s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-24 16:47:55,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 16:47:55,972 INFO L93 Difference]: Finished difference Result 567 states and 680 transitions. [2023-12-24 16:47:55,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-24 16:47:55,985 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 151 [2023-12-24 16:47:55,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 16:47:55,986 INFO L225 Difference]: With dead ends: 567 [2023-12-24 16:47:55,986 INFO L226 Difference]: Without dead ends: 317 [2023-12-24 16:47:55,987 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 374 GetRequests, 343 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 331 ImplicationChecksByTransitivity, 46.5s TimeCoverageRelationStatistics Valid=107, Invalid=948, Unknown=1, NotChecked=0, Total=1056 [2023-12-24 16:47:55,987 INFO L413 NwaCegarLoop]: 192 mSDtfsCounter, 60 mSDsluCounter, 428 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 0 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 24.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 620 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 27.0s IncrementalHoareTripleChecker+Time [2023-12-24 16:47:55,988 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 620 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 111 Invalid, 2 Unknown, 0 Unchecked, 27.0s Time] [2023-12-24 16:47:55,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2023-12-24 16:47:56,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 317. [2023-12-24 16:47:56,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 317 states, 251 states have (on average 1.1752988047808766) internal successors, (295), 253 states have internal predecessors, (295), 42 states have call successors, (42), 23 states have call predecessors, (42), 23 states have return successors, (42), 40 states have call predecessors, (42), 42 states have call successors, (42) [2023-12-24 16:47:56,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 379 transitions. [2023-12-24 16:47:56,042 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 379 transitions. Word has length 151 [2023-12-24 16:47:56,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 16:47:56,042 INFO L495 AbstractCegarLoop]: Abstraction has 317 states and 379 transitions. [2023-12-24 16:47:56,042 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-12-24 16:47:56,043 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 379 transitions. [2023-12-24 16:47:56,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2023-12-24 16:47:56,043 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 16:47:56,043 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 16:47:56,055 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (29)] Forceful destruction successful, exit code 0 [2023-12-24 16:47:56,263 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (28)] Forceful destruction successful, exit code 0 [2023-12-24 16:47:56,456 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 16:47:56,456 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 16:47:56,456 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 16:47:56,456 INFO L85 PathProgramCache]: Analyzing trace with hash -854212488, now seen corresponding path program 1 times [2023-12-24 16:47:56,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 16:47:56,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [650796590] [2023-12-24 16:47:56,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 16:47:56,457 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 16:47:56,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 16:47:56,458 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 16:47:56,460 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (30)] Waiting until timeout for monitored process [2023-12-24 16:47:56,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 16:47:56,879 INFO L262 TraceCheckSpWp]: Trace formula consists of 413 conjuncts, 25 conjunts are in the unsatisfiable core [2023-12-24 16:47:56,882 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 16:47:59,019 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2023-12-24 16:47:59,595 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2023-12-24 16:47:59,690 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 26 [2023-12-24 16:48:00,006 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 48 proven. 68 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2023-12-24 16:48:00,006 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 16:48:01,637 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-12-24 16:48:01,637 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 16:48:01,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [650796590] [2023-12-24 16:48:01,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [650796590] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-24 16:48:01,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-24 16:48:01,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [18] total 25 [2023-12-24 16:48:01,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616092561] [2023-12-24 16:48:01,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 16:48:01,638 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-24 16:48:01,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 16:48:01,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-24 16:48:01,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=532, Unknown=0, NotChecked=0, Total=600 [2023-12-24 16:48:01,639 INFO L87 Difference]: Start difference. First operand 317 states and 379 transitions. Second operand has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 9 states have internal predecessors, (66), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-12-24 16:48:04,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 16:48:04,329 INFO L93 Difference]: Finished difference Result 456 states and 543 transitions. [2023-12-24 16:48:04,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-24 16:48:04,331 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 9 states have internal predecessors, (66), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 153 [2023-12-24 16:48:04,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 16:48:04,333 INFO L225 Difference]: With dead ends: 456 [2023-12-24 16:48:04,333 INFO L226 Difference]: Without dead ends: 454 [2023-12-24 16:48:04,333 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 310 GetRequests, 281 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 234 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=107, Invalid=823, Unknown=0, NotChecked=0, Total=930 [2023-12-24 16:48:04,333 INFO L413 NwaCegarLoop]: 232 mSDtfsCounter, 116 mSDsluCounter, 1419 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 1651 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2023-12-24 16:48:04,333 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 1651 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2023-12-24 16:48:04,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2023-12-24 16:48:04,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 451. [2023-12-24 16:48:04,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 451 states, 360 states have (on average 1.175) internal successors, (423), 363 states have internal predecessors, (423), 58 states have call successors, (58), 32 states have call predecessors, (58), 32 states have return successors, (58), 55 states have call predecessors, (58), 58 states have call successors, (58) [2023-12-24 16:48:04,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 451 states to 451 states and 539 transitions. [2023-12-24 16:48:04,394 INFO L78 Accepts]: Start accepts. Automaton has 451 states and 539 transitions. Word has length 153 [2023-12-24 16:48:04,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 16:48:04,394 INFO L495 AbstractCegarLoop]: Abstraction has 451 states and 539 transitions. [2023-12-24 16:48:04,394 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 9 states have internal predecessors, (66), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-12-24 16:48:04,394 INFO L276 IsEmpty]: Start isEmpty. Operand 451 states and 539 transitions. [2023-12-24 16:48:04,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2023-12-24 16:48:04,395 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 16:48:04,395 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 16:48:04,406 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (30)] Forceful destruction successful, exit code 0 [2023-12-24 16:48:04,597 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 16:48:04,598 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 16:48:04,598 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 16:48:04,598 INFO L85 PathProgramCache]: Analyzing trace with hash -796954186, now seen corresponding path program 1 times [2023-12-24 16:48:04,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 16:48:04,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [650341368] [2023-12-24 16:48:04,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 16:48:04,599 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 16:48:04,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 16:48:04,600 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 16:48:04,600 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (31)] Waiting until timeout for monitored process [2023-12-24 16:48:05,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 16:48:05,053 INFO L262 TraceCheckSpWp]: Trace formula consists of 411 conjuncts, 13 conjunts are in the unsatisfiable core [2023-12-24 16:48:05,056 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 16:48:07,537 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 26 [2023-12-24 16:48:07,604 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 36 proven. 326 refuted. 0 times theorem prover too weak. 250 trivial. 0 not checked. [2023-12-24 16:48:07,604 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 16:48:08,831 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2023-12-24 16:48:08,831 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 25 [2023-12-24 16:48:09,248 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 63 proven. 36 refuted. 0 times theorem prover too weak. 513 trivial. 0 not checked. [2023-12-24 16:48:09,248 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 16:48:09,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [650341368] [2023-12-24 16:48:09,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [650341368] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 16:48:09,248 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 16:48:09,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 20 [2023-12-24 16:48:09,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438338993] [2023-12-24 16:48:09,249 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 16:48:09,249 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-12-24 16:48:09,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 16:48:09,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-12-24 16:48:09,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=277, Unknown=0, NotChecked=0, Total=380 [2023-12-24 16:48:09,250 INFO L87 Difference]: Start difference. First operand 451 states and 539 transitions. Second operand has 20 states, 16 states have (on average 7.75) internal successors, (124), 18 states have internal predecessors, (124), 7 states have call successors, (36), 4 states have call predecessors, (36), 7 states have return successors, (36), 5 states have call predecessors, (36), 7 states have call successors, (36) [2023-12-24 16:48:12,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 16:48:12,589 INFO L93 Difference]: Finished difference Result 875 states and 1031 transitions. [2023-12-24 16:48:12,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-12-24 16:48:12,590 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 16 states have (on average 7.75) internal successors, (124), 18 states have internal predecessors, (124), 7 states have call successors, (36), 4 states have call predecessors, (36), 7 states have return successors, (36), 5 states have call predecessors, (36), 7 states have call successors, (36) Word has length 153 [2023-12-24 16:48:12,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 16:48:12,591 INFO L225 Difference]: With dead ends: 875 [2023-12-24 16:48:12,591 INFO L226 Difference]: Without dead ends: 491 [2023-12-24 16:48:12,592 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 316 GetRequests, 286 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=270, Invalid=660, Unknown=0, NotChecked=0, Total=930 [2023-12-24 16:48:12,593 INFO L413 NwaCegarLoop]: 102 mSDtfsCounter, 324 mSDsluCounter, 604 mSDsCounter, 0 mSdLazyCounter, 360 mSolverCounterSat, 128 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 325 SdHoareTripleChecker+Valid, 706 SdHoareTripleChecker+Invalid, 488 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 128 IncrementalHoareTripleChecker+Valid, 360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2023-12-24 16:48:12,593 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [325 Valid, 706 Invalid, 488 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [128 Valid, 360 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2023-12-24 16:48:12,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 491 states. [2023-12-24 16:48:12,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 491 to 471. [2023-12-24 16:48:12,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 471 states, 374 states have (on average 1.160427807486631) internal successors, (434), 377 states have internal predecessors, (434), 58 states have call successors, (58), 38 states have call predecessors, (58), 38 states have return successors, (58), 55 states have call predecessors, (58), 58 states have call successors, (58) [2023-12-24 16:48:12,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 471 states and 550 transitions. [2023-12-24 16:48:12,655 INFO L78 Accepts]: Start accepts. Automaton has 471 states and 550 transitions. Word has length 153 [2023-12-24 16:48:12,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 16:48:12,655 INFO L495 AbstractCegarLoop]: Abstraction has 471 states and 550 transitions. [2023-12-24 16:48:12,655 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 16 states have (on average 7.75) internal successors, (124), 18 states have internal predecessors, (124), 7 states have call successors, (36), 4 states have call predecessors, (36), 7 states have return successors, (36), 5 states have call predecessors, (36), 7 states have call successors, (36) [2023-12-24 16:48:12,655 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 550 transitions. [2023-12-24 16:48:12,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2023-12-24 16:48:12,656 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 16:48:12,656 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 16:48:12,678 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (31)] Forceful destruction successful, exit code 0 [2023-12-24 16:48:12,866 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 16:48:12,867 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 16:48:12,867 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 16:48:12,867 INFO L85 PathProgramCache]: Analyzing trace with hash -579452874, now seen corresponding path program 1 times [2023-12-24 16:48:12,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 16:48:12,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [333632182] [2023-12-24 16:48:12,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 16:48:12,868 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 16:48:12,868 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 16:48:12,869 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 16:48:12,871 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (32)] Waiting until timeout for monitored process [2023-12-24 16:48:13,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 16:48:13,302 INFO L262 TraceCheckSpWp]: Trace formula consists of 411 conjuncts, 13 conjunts are in the unsatisfiable core [2023-12-24 16:48:13,304 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 16:48:15,448 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 26 [2023-12-24 16:48:15,508 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 36 proven. 326 refuted. 0 times theorem prover too weak. 250 trivial. 0 not checked. [2023-12-24 16:48:15,508 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 16:48:16,413 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2023-12-24 16:48:16,413 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 25 [2023-12-24 16:48:16,763 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 63 proven. 36 refuted. 0 times theorem prover too weak. 513 trivial. 0 not checked. [2023-12-24 16:48:16,763 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 16:48:16,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [333632182] [2023-12-24 16:48:16,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [333632182] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 16:48:16,763 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 16:48:16,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 20 [2023-12-24 16:48:16,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032997] [2023-12-24 16:48:16,764 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 16:48:16,764 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-12-24 16:48:16,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 16:48:16,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-12-24 16:48:16,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=277, Unknown=0, NotChecked=0, Total=380 [2023-12-24 16:48:16,765 INFO L87 Difference]: Start difference. First operand 471 states and 550 transitions. Second operand has 20 states, 16 states have (on average 6.125) internal successors, (98), 18 states have internal predecessors, (98), 7 states have call successors, (36), 4 states have call predecessors, (36), 7 states have return successors, (36), 5 states have call predecessors, (36), 7 states have call successors, (36) [2023-12-24 16:48:19,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 16:48:19,904 INFO L93 Difference]: Finished difference Result 775 states and 901 transitions. [2023-12-24 16:48:19,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-12-24 16:48:19,916 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 16 states have (on average 6.125) internal successors, (98), 18 states have internal predecessors, (98), 7 states have call successors, (36), 4 states have call predecessors, (36), 7 states have return successors, (36), 5 states have call predecessors, (36), 7 states have call successors, (36) Word has length 153 [2023-12-24 16:48:19,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 16:48:19,916 INFO L225 Difference]: With dead ends: 775 [2023-12-24 16:48:19,916 INFO L226 Difference]: Without dead ends: 0 [2023-12-24 16:48:19,917 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 316 GetRequests, 286 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=270, Invalid=660, Unknown=0, NotChecked=0, Total=930 [2023-12-24 16:48:19,932 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 255 mSDsluCounter, 585 mSDsCounter, 0 mSdLazyCounter, 370 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 256 SdHoareTripleChecker+Valid, 684 SdHoareTripleChecker+Invalid, 449 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 370 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2023-12-24 16:48:19,933 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [256 Valid, 684 Invalid, 449 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 370 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2023-12-24 16:48:19,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-12-24 16:48:19,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-12-24 16:48:19,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 16:48:19,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-12-24 16:48:19,933 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 153 [2023-12-24 16:48:19,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 16:48:19,933 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-12-24 16:48:19,933 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 16 states have (on average 6.125) internal successors, (98), 18 states have internal predecessors, (98), 7 states have call successors, (36), 4 states have call predecessors, (36), 7 states have return successors, (36), 5 states have call predecessors, (36), 7 states have call successors, (36) [2023-12-24 16:48:19,933 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-12-24 16:48:19,933 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-12-24 16:48:19,936 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-24 16:48:19,948 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (32)] Forceful destruction successful, exit code 0 [2023-12-24 16:48:20,146 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 16:48:20,148 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-12-24 16:48:38,040 WARN L293 SmtUtils]: Spent 14.00s on a formula simplification. DAG size of input: 191 DAG size of output: 169 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2023-12-24 16:48:46,050 WARN L293 SmtUtils]: Spent 6.99s on a formula simplification. DAG size of input: 174 DAG size of output: 161 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2023-12-24 16:48:55,994 WARN L293 SmtUtils]: Spent 8.93s on a formula simplification. DAG size of input: 176 DAG size of output: 164 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2023-12-24 16:49:10,586 WARN L293 SmtUtils]: Spent 14.59s on a formula simplification. DAG size of input: 175 DAG size of output: 162 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2023-12-24 16:49:17,724 WARN L293 SmtUtils]: Spent 7.14s on a formula simplification. DAG size of input: 180 DAG size of output: 167 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2023-12-24 16:49:25,939 WARN L293 SmtUtils]: Spent 7.39s on a formula simplification. DAG size of input: 176 DAG size of output: 161 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2023-12-24 16:49:41,770 WARN L293 SmtUtils]: Spent 14.93s on a formula simplification. DAG size of input: 190 DAG size of output: 170 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2023-12-24 16:50:18,818 WARN L293 SmtUtils]: Spent 36.07s on a formula simplification. DAG size of input: 483 DAG size of output: 1 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2023-12-24 16:50:30,470 WARN L293 SmtUtils]: Spent 9.82s on a formula simplification. DAG size of input: 170 DAG size of output: 158 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2023-12-24 16:50:42,264 WARN L293 SmtUtils]: Spent 9.90s on a formula simplification. DAG size of input: 213 DAG size of output: 168 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2023-12-24 16:50:43,208 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(line 20) the Hoare annotation is: true [2023-12-24 16:50:43,208 INFO L899 garLoopResultBuilder]: For program point L20(line 20) no Hoare annotation was computed. [2023-12-24 16:50:43,208 INFO L899 garLoopResultBuilder]: For program point L20-2(line 20) no Hoare annotation was computed. [2023-12-24 16:50:43,208 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(line 20) no Hoare annotation was computed. [2023-12-24 16:50:43,208 INFO L899 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2023-12-24 16:50:43,208 INFO L899 garLoopResultBuilder]: For program point L19-1(line 19) no Hoare annotation was computed. [2023-12-24 16:50:43,208 INFO L899 garLoopResultBuilder]: For program point L19-3(line 19) no Hoare annotation was computed. [2023-12-24 16:50:43,208 INFO L895 garLoopResultBuilder]: At program point L102(line 102) the Hoare annotation is: (let ((.cse0 ((_ zero_extend 24) ((_ extract 7 0) (select (select |#memory_int#10| ~var_1_11_Pointer~0.base) ~var_1_11_Pointer~0.offset)))) (.cse2 (select (select |#memory_int#2| (_ bv5 32)) (_ bv0 32))) (.cse3 (select (select |#memory_int#3| (_ bv6 32)) (_ bv0 32)))) (and (= |~#var_1_3~0.base| (_ bv5 32)) (= ~var_1_5_Pointer~0.offset (_ bv0 32)) (= |~#var_1_4~0.offset| (_ bv0 32)) (bvsle .cse0 (_ bv1 32)) (= |~#var_1_3~0.offset| (_ bv0 32)) (= ~var_1_3_Pointer~0.base (_ bv5 32)) (= |~#var_1_11~0.base| ~var_1_11_Pointer~0.base) (= ~var_1_7_Pointer~0.offset |~#var_1_7~0.offset|) (= |~#var_1_11~0.offset| ~var_1_11_Pointer~0.offset) (bvsge .cse0 (_ bv1 32)) (= ~var_1_3_Pointer~0.offset (_ bv0 32)) (exists ((v_arrayElimCell_35 (_ BitVec 32))) (let ((.cse1 ((_ extract 7 0) v_arrayElimCell_35))) (and (bvsle ((_ zero_extend 24) .cse1) (_ bv0 32)) (= ((_ sign_extend 24) .cse1) (select (select |#memory_int#5| ~var_1_6_Pointer~0.base) ~var_1_6_Pointer~0.offset))))) (= |~#var_1_13~0.offset| (_ bv0 32)) (bvsle ((_ zero_extend 24) ((_ extract 7 0) (select (select |#memory_int#6| ~var_1_7_Pointer~0.base) ~var_1_7_Pointer~0.offset))) (_ bv0 32)) (= |~#var_1_13~0.base| (_ bv15 32)) (= (select (select |#memory_int#12| (_ bv15 32)) (_ bv0 32)) |ULTIMATE.start_updateVariables_#t~mem74#1|) (bvule (select (select |#memory_int#4| (_ bv7 32)) (_ bv0 32)) (_ bv536870911 32)) (= |~#var_1_5~0.offset| (_ bv0 32)) (bvule .cse2 (_ bv2147483647 32)) (= ~var_1_4_Pointer~0.offset (_ bv0 32)) (= ~var_1_13_Pointer~0.offset (_ bv0 32)) (bvule .cse3 (_ bv1073741823 32)) (= ~var_1_4_Pointer~0.base (_ bv6 32)) (bvuge .cse2 (_ bv1073741823 32)) (= ~var_1_7_Pointer~0.base |~#var_1_7~0.base|) (= ~var_1_5_Pointer~0.base (_ bv7 32)) (= |~#var_1_5~0.base| (_ bv7 32)) (bvuge .cse3 (_ bv536870911 32)) (= (_ bv6 32) |~#var_1_4~0.base|) (= (_ bv15 32) ~var_1_13_Pointer~0.base))) [2023-12-24 16:50:43,208 INFO L899 garLoopResultBuilder]: For program point L102-1(line 102) no Hoare annotation was computed. [2023-12-24 16:50:43,209 INFO L899 garLoopResultBuilder]: For program point L69(lines 69 75) no Hoare annotation was computed. [2023-12-24 16:50:43,209 INFO L895 garLoopResultBuilder]: At program point L86(line 86) the Hoare annotation is: (let ((.cse33 (select (select |#memory_int#2| (_ bv5 32)) (_ bv0 32))) (.cse35 (select (select |#memory_int#5| ~var_1_6_Pointer~0.base) ~var_1_6_Pointer~0.offset)) (.cse36 ((_ zero_extend 24) ((_ extract 7 0) (select (select |#memory_int#10| ~var_1_11_Pointer~0.base) ~var_1_11_Pointer~0.offset))))) (let ((.cse0 (= |~#var_1_3~0.base| (_ bv5 32))) (.cse1 (= ~var_1_5_Pointer~0.offset (_ bv0 32))) (.cse2 (= |~#var_1_4~0.offset| (_ bv0 32))) (.cse3 (bvsle .cse36 (_ bv1 32))) (.cse4 (= |~#var_1_3~0.offset| (_ bv0 32))) (.cse5 (= ~var_1_3_Pointer~0.base (_ bv5 32))) (.cse6 (= |~#var_1_11~0.base| ~var_1_11_Pointer~0.base)) (.cse7 (= ~var_1_7_Pointer~0.offset |~#var_1_7~0.offset|)) (.cse8 (= |~#var_1_11~0.offset| ~var_1_11_Pointer~0.offset)) (.cse9 (bvsge .cse36 (_ bv1 32))) (.cse10 (= ((_ zero_extend 24) ((_ extract 7 0) .cse35)) ((_ zero_extend 24) ((_ extract 7 0) (select (select |#memory_int#6| ~var_1_7_Pointer~0.base) ~var_1_7_Pointer~0.offset))))) (.cse15 (= ~var_1_3_Pointer~0.offset (_ bv0 32))) (.cse16 (exists ((v_arrayElimCell_35 (_ BitVec 32))) (let ((.cse34 ((_ extract 7 0) v_arrayElimCell_35))) (and (bvsle ((_ zero_extend 24) .cse34) (_ bv0 32)) (= ((_ sign_extend 24) .cse34) .cse35))))) (.cse17 (= |~#var_1_13~0.offset| (_ bv0 32))) (.cse18 (= |~#var_1_13~0.base| (_ bv15 32))) (.cse19 (= (select (select |#memory_int#3| (_ bv6 32)) (_ bv0 32)) |ULTIMATE.start_updateVariables_#t~mem46#1|)) (.cse20 (= |~#var_1_5~0.offset| (_ bv0 32))) (.cse21 (bvule .cse33 (_ bv2147483647 32))) (.cse22 (= ~var_1_4_Pointer~0.offset (_ bv0 32))) (.cse23 (= ~var_1_13_Pointer~0.offset (_ bv0 32))) (.cse24 (= ~var_1_4_Pointer~0.base (_ bv6 32))) (.cse25 (bvuge .cse33 (_ bv1073741823 32))) (.cse26 (= ~var_1_7_Pointer~0.base |~#var_1_7~0.base|)) (.cse27 (= ~var_1_5_Pointer~0.base (_ bv7 32))) (.cse28 (= |~#var_1_5~0.base| (_ bv7 32))) (.cse29 (= (_ bv6 32) |~#var_1_4~0.base|)) (.cse30 (= (_ bv15 32) ~var_1_13_Pointer~0.base))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (fp.gt (fp.mul currentRoundingMode (let ((.cse11 (let ((.cse12 (select |#memory_int#8| ~var_1_9_Pointer~0.base))) (concat (select .cse12 (bvadd (_ bv4 32) ~var_1_9_Pointer~0.offset)) (select .cse12 ~var_1_9_Pointer~0.offset))))) (fp ((_ extract 63 63) .cse11) ((_ extract 62 52) .cse11) ((_ extract 51 0) .cse11))) ((_ to_fp 11 53) currentRoundingMode ((_ to_fp 8 24) currentRoundingMode (/ 33.0 2.0)))) (let ((.cse13 (let ((.cse14 (select |#memory_int#9| ~var_1_10_Pointer~0.base))) (concat (select .cse14 (bvadd ~var_1_10_Pointer~0.offset (_ bv4 32))) (select .cse14 ~var_1_10_Pointer~0.offset))))) (fp ((_ extract 63 63) .cse13) ((_ extract 62 52) .cse13) ((_ extract 51 0) .cse13)))) .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30) (let ((.cse32 (= ((_ extract 7 0) (select (select |#memory_int#15| ~var_1_16_Pointer~0.base) ~var_1_16_Pointer~0.offset)) (_ bv0 8))) (.cse31 ((_ zero_extend 24) ((_ extract 7 0) (select (select |#memory_int#14| ~var_1_15_Pointer~0.base) ~var_1_15_Pointer~0.offset))))) (and .cse0 (= ((_ extract 15 0) ((_ sign_extend 16) ((_ extract 15 0) ((_ zero_extend 16) ((_ extract 15 0) (select (select |#memory_int#13| ~var_1_14_Pointer~0.base) ~var_1_14_Pointer~0.offset)))))) ((_ extract 15 0) (select (select |#memory_int#11| ~var_1_12_Pointer~0.base) ~var_1_12_Pointer~0.offset))) .cse1 .cse2 (or (= .cse31 (_ bv1 32)) .cse32) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse15 .cse16 .cse17 .cse18 (or (not .cse32) (= .cse31 (_ bv0 32))) .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30))))) [2023-12-24 16:50:43,209 INFO L899 garLoopResultBuilder]: For program point L86-1(line 86) no Hoare annotation was computed. [2023-12-24 16:50:43,209 INFO L895 garLoopResultBuilder]: At program point L103(line 103) the Hoare annotation is: (let ((.cse0 ((_ zero_extend 24) ((_ extract 7 0) (select (select |#memory_int#10| ~var_1_11_Pointer~0.base) ~var_1_11_Pointer~0.offset)))) (.cse2 (select (select |#memory_int#2| (_ bv5 32)) (_ bv0 32))) (.cse3 (select (select |#memory_int#3| (_ bv6 32)) (_ bv0 32)))) (and (= |~#var_1_3~0.base| (_ bv5 32)) (= ~var_1_5_Pointer~0.offset (_ bv0 32)) (= |~#var_1_4~0.offset| (_ bv0 32)) (bvsle .cse0 (_ bv1 32)) (= |~#var_1_3~0.offset| (_ bv0 32)) (= ~var_1_3_Pointer~0.base (_ bv5 32)) (= |~#var_1_11~0.base| ~var_1_11_Pointer~0.base) (= ~var_1_7_Pointer~0.offset |~#var_1_7~0.offset|) (= |~#var_1_11~0.offset| ~var_1_11_Pointer~0.offset) (bvsge .cse0 (_ bv1 32)) (= ~var_1_3_Pointer~0.offset (_ bv0 32)) (bvuge (select (select |#memory_int#12| (_ bv15 32)) (_ bv0 32)) (_ bv2147483647 32)) (exists ((v_arrayElimCell_35 (_ BitVec 32))) (let ((.cse1 ((_ extract 7 0) v_arrayElimCell_35))) (and (bvsle ((_ zero_extend 24) .cse1) (_ bv0 32)) (= ((_ sign_extend 24) .cse1) (select (select |#memory_int#5| ~var_1_6_Pointer~0.base) ~var_1_6_Pointer~0.offset))))) (= |~#var_1_13~0.offset| (_ bv0 32)) (bvsle ((_ zero_extend 24) ((_ extract 7 0) (select (select |#memory_int#6| ~var_1_7_Pointer~0.base) ~var_1_7_Pointer~0.offset))) (_ bv0 32)) (= |~#var_1_13~0.base| (_ bv15 32)) (bvule (select (select |#memory_int#4| (_ bv7 32)) (_ bv0 32)) (_ bv536870911 32)) (= |~#var_1_5~0.offset| (_ bv0 32)) (bvule .cse2 (_ bv2147483647 32)) (= ~var_1_4_Pointer~0.offset (_ bv0 32)) (= ~var_1_13_Pointer~0.offset (_ bv0 32)) (bvule .cse3 (_ bv1073741823 32)) (= ~var_1_4_Pointer~0.base (_ bv6 32)) (bvuge .cse2 (_ bv1073741823 32)) (= ~var_1_7_Pointer~0.base |~#var_1_7~0.base|) (= ~var_1_5_Pointer~0.base (_ bv7 32)) (= |~#var_1_5~0.base| (_ bv7 32)) (bvuge .cse3 (_ bv536870911 32)) (= (_ bv6 32) |~#var_1_4~0.base|) (= (_ bv15 32) ~var_1_13_Pointer~0.base))) [2023-12-24 16:50:43,209 INFO L899 garLoopResultBuilder]: For program point L103-1(line 103) no Hoare annotation was computed. [2023-12-24 16:50:43,209 INFO L899 garLoopResultBuilder]: For program point L70(lines 70 74) no Hoare annotation was computed. [2023-12-24 16:50:43,209 INFO L895 garLoopResultBuilder]: At program point L87(line 87) the Hoare annotation is: (let ((.cse34 (select (select |#memory_int#3| (_ bv6 32)) (_ bv0 32))) (.cse35 (select (select |#memory_int#2| (_ bv5 32)) (_ bv0 32))) (.cse37 ((_ zero_extend 24) ((_ extract 7 0) (select (select |#memory_int#10| ~var_1_11_Pointer~0.base) ~var_1_11_Pointer~0.offset))))) (let ((.cse0 (= |~#var_1_3~0.base| (_ bv5 32))) (.cse1 (= ~var_1_5_Pointer~0.offset (_ bv0 32))) (.cse2 (= |~#var_1_4~0.offset| (_ bv0 32))) (.cse3 (bvsle .cse37 (_ bv1 32))) (.cse4 (= |~#var_1_3~0.offset| (_ bv0 32))) (.cse5 (= ~var_1_3_Pointer~0.base (_ bv5 32))) (.cse6 (= |~#var_1_11~0.base| ~var_1_11_Pointer~0.base)) (.cse7 (= ~var_1_7_Pointer~0.offset |~#var_1_7~0.offset|)) (.cse8 (= |~#var_1_11~0.offset| ~var_1_11_Pointer~0.offset)) (.cse9 (bvsge .cse37 (_ bv1 32))) (.cse14 (= ~var_1_3_Pointer~0.offset (_ bv0 32))) (.cse15 (exists ((v_arrayElimCell_35 (_ BitVec 32))) (let ((.cse36 ((_ extract 7 0) v_arrayElimCell_35))) (and (bvsle ((_ zero_extend 24) .cse36) (_ bv0 32)) (= ((_ sign_extend 24) .cse36) (select (select |#memory_int#5| ~var_1_6_Pointer~0.base) ~var_1_6_Pointer~0.offset)))))) (.cse16 (= |~#var_1_13~0.offset| (_ bv0 32))) (.cse17 (bvsle ((_ zero_extend 24) ((_ extract 7 0) (select (select |#memory_int#6| ~var_1_7_Pointer~0.base) ~var_1_7_Pointer~0.offset))) (_ bv0 32))) (.cse18 (= |~#var_1_13~0.base| (_ bv15 32))) (.cse19 (= |~#var_1_5~0.offset| (_ bv0 32))) (.cse20 (bvule .cse35 (_ bv2147483647 32))) (.cse21 (= ~var_1_4_Pointer~0.offset (_ bv0 32))) (.cse22 (= ~var_1_13_Pointer~0.offset (_ bv0 32))) (.cse23 (= ~var_1_4_Pointer~0.base (_ bv6 32))) (.cse24 (bvuge .cse35 (_ bv1073741823 32))) (.cse25 (= ~var_1_7_Pointer~0.base |~#var_1_7~0.base|)) (.cse26 (= ~var_1_5_Pointer~0.base (_ bv7 32))) (.cse27 (= |~#var_1_5~0.base| (_ bv7 32))) (.cse28 (bvuge .cse34 (_ bv536870911 32))) (.cse29 (= (_ bv6 32) |~#var_1_4~0.base|)) (.cse30 (= (_ bv15 32) ~var_1_13_Pointer~0.base)) (.cse31 (= .cse34 |ULTIMATE.start_updateVariables_#t~mem47#1|))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (fp.gt (fp.mul currentRoundingMode (let ((.cse10 (let ((.cse11 (select |#memory_int#8| ~var_1_9_Pointer~0.base))) (concat (select .cse11 (bvadd (_ bv4 32) ~var_1_9_Pointer~0.offset)) (select .cse11 ~var_1_9_Pointer~0.offset))))) (fp ((_ extract 63 63) .cse10) ((_ extract 62 52) .cse10) ((_ extract 51 0) .cse10))) ((_ to_fp 11 53) currentRoundingMode ((_ to_fp 8 24) currentRoundingMode (/ 33.0 2.0)))) (let ((.cse12 (let ((.cse13 (select |#memory_int#9| ~var_1_10_Pointer~0.base))) (concat (select .cse13 (bvadd ~var_1_10_Pointer~0.offset (_ bv4 32))) (select .cse13 ~var_1_10_Pointer~0.offset))))) (fp ((_ extract 63 63) .cse12) ((_ extract 62 52) .cse12) ((_ extract 51 0) .cse12)))) .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31) (let ((.cse33 (= ((_ extract 7 0) (select (select |#memory_int#15| ~var_1_16_Pointer~0.base) ~var_1_16_Pointer~0.offset)) (_ bv0 8))) (.cse32 ((_ zero_extend 24) ((_ extract 7 0) (select (select |#memory_int#14| ~var_1_15_Pointer~0.base) ~var_1_15_Pointer~0.offset))))) (and .cse0 (= ((_ extract 15 0) ((_ sign_extend 16) ((_ extract 15 0) ((_ zero_extend 16) ((_ extract 15 0) (select (select |#memory_int#13| ~var_1_14_Pointer~0.base) ~var_1_14_Pointer~0.offset)))))) ((_ extract 15 0) (select (select |#memory_int#11| ~var_1_12_Pointer~0.base) ~var_1_12_Pointer~0.offset))) .cse1 .cse2 (or (= .cse32 (_ bv1 32)) .cse33) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse14 .cse15 .cse16 .cse17 .cse18 (or (not .cse33) (= .cse32 (_ bv0 32))) .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31))))) [2023-12-24 16:50:43,209 INFO L899 garLoopResultBuilder]: For program point L87-1(line 87) no Hoare annotation was computed. [2023-12-24 16:50:43,209 INFO L899 garLoopResultBuilder]: For program point L54(lines 54 80) no Hoare annotation was computed. [2023-12-24 16:50:43,210 INFO L895 garLoopResultBuilder]: At program point L120-2(lines 120 126) the Hoare annotation is: (let ((.cse36 (select (select |#memory_int#3| (_ bv6 32)) (_ bv0 32))) (.cse37 (select (select |#memory_int#2| (_ bv5 32)) (_ bv0 32))) (.cse39 ((_ zero_extend 24) ((_ extract 7 0) (select (select |#memory_int#10| ~var_1_11_Pointer~0.base) ~var_1_11_Pointer~0.offset))))) (let ((.cse0 (= |~#var_1_3~0.base| (_ bv5 32))) (.cse1 (= ~var_1_5_Pointer~0.offset (_ bv0 32))) (.cse2 (= |~#var_1_4~0.offset| (_ bv0 32))) (.cse5 (bvsle .cse39 (_ bv1 32))) (.cse6 (= |~#var_1_3~0.offset| (_ bv0 32))) (.cse7 (= ~var_1_3_Pointer~0.base (_ bv5 32))) (.cse8 (= |~#var_1_11~0.base| ~var_1_11_Pointer~0.base)) (.cse9 (= ~var_1_7_Pointer~0.offset |~#var_1_7~0.offset|)) (.cse10 (= |~#var_1_11~0.offset| ~var_1_11_Pointer~0.offset)) (.cse11 (bvsge .cse39 (_ bv1 32))) (.cse12 (= ~var_1_3_Pointer~0.offset (_ bv0 32))) (.cse13 (bvuge (select (select |#memory_int#12| (_ bv15 32)) (_ bv0 32)) (_ bv2147483647 32))) (.cse14 (exists ((v_arrayElimCell_35 (_ BitVec 32))) (let ((.cse38 ((_ extract 7 0) v_arrayElimCell_35))) (and (bvsle ((_ zero_extend 24) .cse38) (_ bv0 32)) (= ((_ sign_extend 24) .cse38) (select (select |#memory_int#5| ~var_1_6_Pointer~0.base) ~var_1_6_Pointer~0.offset)))))) (.cse15 (= |~#var_1_13~0.offset| (_ bv0 32))) (.cse16 (bvsle ((_ zero_extend 24) ((_ extract 7 0) (select (select |#memory_int#6| ~var_1_7_Pointer~0.base) ~var_1_7_Pointer~0.offset))) (_ bv0 32))) (.cse17 (= |~#var_1_13~0.base| (_ bv15 32))) (.cse18 (bvule (select (select |#memory_int#4| (_ bv7 32)) (_ bv0 32)) (_ bv536870911 32))) (.cse19 (= |~#var_1_5~0.offset| (_ bv0 32))) (.cse20 (bvule .cse37 (_ bv2147483647 32))) (.cse21 (= ~var_1_4_Pointer~0.offset (_ bv0 32))) (.cse22 (= ~var_1_13_Pointer~0.offset (_ bv0 32))) (.cse23 (bvule .cse36 (_ bv1073741823 32))) (.cse24 (= ~var_1_4_Pointer~0.base (_ bv6 32))) (.cse25 (bvuge .cse37 (_ bv1073741823 32))) (.cse26 (= ~var_1_7_Pointer~0.base |~#var_1_7~0.base|)) (.cse27 (= ~var_1_5_Pointer~0.base (_ bv7 32))) (.cse28 (= |~#var_1_5~0.base| (_ bv7 32))) (.cse29 (bvuge .cse36 (_ bv536870911 32))) (.cse30 (= (_ bv6 32) |~#var_1_4~0.base|)) (.cse31 (= (_ bv15 32) ~var_1_13_Pointer~0.base))) (or (let ((.cse4 (= ((_ extract 7 0) (select (select |#memory_int#15| ~var_1_16_Pointer~0.base) ~var_1_16_Pointer~0.offset)) (_ bv0 8))) (.cse3 ((_ zero_extend 24) ((_ extract 7 0) (select (select |#memory_int#14| ~var_1_15_Pointer~0.base) ~var_1_15_Pointer~0.offset))))) (and .cse0 (= ((_ extract 15 0) ((_ sign_extend 16) ((_ extract 15 0) ((_ zero_extend 16) ((_ extract 15 0) (select (select |#memory_int#13| ~var_1_14_Pointer~0.base) ~var_1_14_Pointer~0.offset)))))) ((_ extract 15 0) (select (select |#memory_int#11| ~var_1_12_Pointer~0.base) ~var_1_12_Pointer~0.offset))) .cse1 .cse2 (or (= .cse3 (_ bv1 32)) .cse4) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 (or (not .cse4) (= .cse3 (_ bv0 32))) .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31)) (and .cse0 .cse1 .cse2 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (fp.gt (fp.mul currentRoundingMode (let ((.cse32 (let ((.cse33 (select |#memory_int#8| ~var_1_9_Pointer~0.base))) (concat (select .cse33 (bvadd (_ bv4 32) ~var_1_9_Pointer~0.offset)) (select .cse33 ~var_1_9_Pointer~0.offset))))) (fp ((_ extract 63 63) .cse32) ((_ extract 62 52) .cse32) ((_ extract 51 0) .cse32))) ((_ to_fp 11 53) currentRoundingMode ((_ to_fp 8 24) currentRoundingMode (/ 33.0 2.0)))) (let ((.cse34 (let ((.cse35 (select |#memory_int#9| ~var_1_10_Pointer~0.base))) (concat (select .cse35 (bvadd ~var_1_10_Pointer~0.offset (_ bv4 32))) (select .cse35 ~var_1_10_Pointer~0.offset))))) (fp ((_ extract 63 63) .cse34) ((_ extract 62 52) .cse34) ((_ extract 51 0) .cse34)))) .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31)))) [2023-12-24 16:50:43,210 INFO L899 garLoopResultBuilder]: For program point L120-3(lines 120 126) no Hoare annotation was computed. [2023-12-24 16:50:43,210 INFO L899 garLoopResultBuilder]: For program point L71(line 71) no Hoare annotation was computed. [2023-12-24 16:50:43,210 INFO L899 garLoopResultBuilder]: For program point L71-2(line 71) no Hoare annotation was computed. [2023-12-24 16:50:43,210 INFO L895 garLoopResultBuilder]: At program point L105(line 105) the Hoare annotation is: (let ((.cse0 ((_ zero_extend 24) ((_ extract 7 0) (select (select |#memory_int#10| ~var_1_11_Pointer~0.base) ~var_1_11_Pointer~0.offset)))) (.cse2 (select (select |#memory_int#2| (_ bv5 32)) (_ bv0 32))) (.cse3 (select (select |#memory_int#3| (_ bv6 32)) (_ bv0 32)))) (and (= |~#var_1_3~0.base| (_ bv5 32)) (= ~var_1_5_Pointer~0.offset (_ bv0 32)) (= |~#var_1_4~0.offset| (_ bv0 32)) (bvsle .cse0 (_ bv1 32)) (= |~#var_1_3~0.offset| (_ bv0 32)) (= ~var_1_3_Pointer~0.base (_ bv5 32)) (= |~#var_1_11~0.base| ~var_1_11_Pointer~0.base) (= ~var_1_7_Pointer~0.offset |~#var_1_7~0.offset|) (= |~#var_1_11~0.offset| ~var_1_11_Pointer~0.offset) (bvsge .cse0 (_ bv1 32)) (= ~var_1_3_Pointer~0.offset (_ bv0 32)) (bvuge (select (select |#memory_int#12| (_ bv15 32)) (_ bv0 32)) (_ bv2147483647 32)) (exists ((v_arrayElimCell_35 (_ BitVec 32))) (let ((.cse1 ((_ extract 7 0) v_arrayElimCell_35))) (and (bvsle ((_ zero_extend 24) .cse1) (_ bv0 32)) (= ((_ sign_extend 24) .cse1) (select (select |#memory_int#5| ~var_1_6_Pointer~0.base) ~var_1_6_Pointer~0.offset))))) (= |~#var_1_13~0.offset| (_ bv0 32)) (bvsle ((_ zero_extend 24) ((_ extract 7 0) (select (select |#memory_int#6| ~var_1_7_Pointer~0.base) ~var_1_7_Pointer~0.offset))) (_ bv0 32)) (= |~#var_1_13~0.base| (_ bv15 32)) (bvule (select (select |#memory_int#4| (_ bv7 32)) (_ bv0 32)) (_ bv536870911 32)) (= |~#var_1_5~0.offset| (_ bv0 32)) (bvule .cse2 (_ bv2147483647 32)) (= ~var_1_4_Pointer~0.offset (_ bv0 32)) (= ~var_1_13_Pointer~0.offset (_ bv0 32)) (bvule .cse3 (_ bv1073741823 32)) (= ~var_1_4_Pointer~0.base (_ bv6 32)) (bvuge .cse2 (_ bv1073741823 32)) (= ~var_1_7_Pointer~0.base |~#var_1_7~0.base|) (= ~var_1_5_Pointer~0.base (_ bv7 32)) (= |~#var_1_5~0.base| (_ bv7 32)) (bvuge .cse3 (_ bv536870911 32)) (= (_ bv6 32) |~#var_1_4~0.base|) (= (_ bv15 32) ~var_1_13_Pointer~0.base))) [2023-12-24 16:50:43,210 INFO L899 garLoopResultBuilder]: For program point L105-1(line 105) no Hoare annotation was computed. [2023-12-24 16:50:43,210 INFO L895 garLoopResultBuilder]: At program point L89(line 89) the Hoare annotation is: (let ((.cse34 (select (select |#memory_int#3| (_ bv6 32)) (_ bv0 32))) (.cse35 (select (select |#memory_int#2| (_ bv5 32)) (_ bv0 32))) (.cse37 (select (select |#memory_int#5| ~var_1_6_Pointer~0.base) ~var_1_6_Pointer~0.offset)) (.cse38 ((_ zero_extend 24) ((_ extract 7 0) (select (select |#memory_int#10| ~var_1_11_Pointer~0.base) ~var_1_11_Pointer~0.offset))))) (let ((.cse0 (= |~#var_1_3~0.base| (_ bv5 32))) (.cse1 (= ~var_1_5_Pointer~0.offset (_ bv0 32))) (.cse2 (= |~#var_1_4~0.offset| (_ bv0 32))) (.cse3 (bvsle .cse38 (_ bv1 32))) (.cse4 (= |~#var_1_3~0.offset| (_ bv0 32))) (.cse5 (= ~var_1_3_Pointer~0.base (_ bv5 32))) (.cse6 (= |~#var_1_11~0.base| ~var_1_11_Pointer~0.base)) (.cse7 (= ~var_1_7_Pointer~0.offset |~#var_1_7~0.offset|)) (.cse8 (= |~#var_1_11~0.offset| ~var_1_11_Pointer~0.offset)) (.cse9 (bvsge .cse38 (_ bv1 32))) (.cse10 (= ((_ zero_extend 24) ((_ extract 7 0) .cse37)) ((_ zero_extend 24) ((_ extract 7 0) (select (select |#memory_int#6| ~var_1_7_Pointer~0.base) ~var_1_7_Pointer~0.offset))))) (.cse15 (= ~var_1_3_Pointer~0.offset (_ bv0 32))) (.cse16 (exists ((v_arrayElimCell_35 (_ BitVec 32))) (let ((.cse36 ((_ extract 7 0) v_arrayElimCell_35))) (and (bvsle ((_ zero_extend 24) .cse36) (_ bv0 32)) (= ((_ sign_extend 24) .cse36) .cse37))))) (.cse17 (= |~#var_1_13~0.offset| (_ bv0 32))) (.cse18 (= |~#var_1_13~0.base| (_ bv15 32))) (.cse19 (= |~#var_1_5~0.offset| (_ bv0 32))) (.cse20 (bvule .cse35 (_ bv2147483647 32))) (.cse21 (= ~var_1_4_Pointer~0.offset (_ bv0 32))) (.cse22 (= ~var_1_13_Pointer~0.offset (_ bv0 32))) (.cse23 (bvule .cse34 (_ bv1073741823 32))) (.cse24 (= ~var_1_4_Pointer~0.base (_ bv6 32))) (.cse25 (bvuge .cse35 (_ bv1073741823 32))) (.cse26 (= ~var_1_7_Pointer~0.base |~#var_1_7~0.base|)) (.cse27 (= ~var_1_5_Pointer~0.base (_ bv7 32))) (.cse28 (= |~#var_1_5~0.base| (_ bv7 32))) (.cse29 (bvuge .cse34 (_ bv536870911 32))) (.cse30 (= (_ bv6 32) |~#var_1_4~0.base|)) (.cse31 (= (_ bv15 32) ~var_1_13_Pointer~0.base))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (fp.gt (fp.mul currentRoundingMode (let ((.cse11 (let ((.cse12 (select |#memory_int#8| ~var_1_9_Pointer~0.base))) (concat (select .cse12 (bvadd (_ bv4 32) ~var_1_9_Pointer~0.offset)) (select .cse12 ~var_1_9_Pointer~0.offset))))) (fp ((_ extract 63 63) .cse11) ((_ extract 62 52) .cse11) ((_ extract 51 0) .cse11))) ((_ to_fp 11 53) currentRoundingMode ((_ to_fp 8 24) currentRoundingMode (/ 33.0 2.0)))) (let ((.cse13 (let ((.cse14 (select |#memory_int#9| ~var_1_10_Pointer~0.base))) (concat (select .cse14 (bvadd ~var_1_10_Pointer~0.offset (_ bv4 32))) (select .cse14 ~var_1_10_Pointer~0.offset))))) (fp ((_ extract 63 63) .cse13) ((_ extract 62 52) .cse13) ((_ extract 51 0) .cse13)))) .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31) (let ((.cse33 (= ((_ extract 7 0) (select (select |#memory_int#15| ~var_1_16_Pointer~0.base) ~var_1_16_Pointer~0.offset)) (_ bv0 8))) (.cse32 ((_ zero_extend 24) ((_ extract 7 0) (select (select |#memory_int#14| ~var_1_15_Pointer~0.base) ~var_1_15_Pointer~0.offset))))) (and .cse0 (= ((_ extract 15 0) ((_ sign_extend 16) ((_ extract 15 0) ((_ zero_extend 16) ((_ extract 15 0) (select (select |#memory_int#13| ~var_1_14_Pointer~0.base) ~var_1_14_Pointer~0.offset)))))) ((_ extract 15 0) (select (select |#memory_int#11| ~var_1_12_Pointer~0.base) ~var_1_12_Pointer~0.offset))) .cse1 .cse2 (or (= .cse32 (_ bv1 32)) .cse33) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse15 .cse16 .cse17 .cse18 (or (not .cse33) (= .cse32 (_ bv0 32))) .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31))))) [2023-12-24 16:50:43,210 INFO L899 garLoopResultBuilder]: For program point L89-1(line 89) no Hoare annotation was computed. [2023-12-24 16:50:43,210 INFO L899 garLoopResultBuilder]: For program point L56(lines 56 58) no Hoare annotation was computed. [2023-12-24 16:50:43,210 INFO L899 garLoopResultBuilder]: For program point L56-2(lines 56 58) no Hoare annotation was computed. [2023-12-24 16:50:43,211 INFO L895 garLoopResultBuilder]: At program point L106(line 106) the Hoare annotation is: (let ((.cse0 ((_ zero_extend 24) ((_ extract 7 0) (select (select |#memory_int#10| ~var_1_11_Pointer~0.base) ~var_1_11_Pointer~0.offset)))) (.cse2 (select (select |#memory_int#2| (_ bv5 32)) (_ bv0 32))) (.cse3 (select (select |#memory_int#3| (_ bv6 32)) (_ bv0 32)))) (and (= |~#var_1_3~0.base| (_ bv5 32)) (= ~var_1_5_Pointer~0.offset (_ bv0 32)) (= |~#var_1_4~0.offset| (_ bv0 32)) (bvsle .cse0 (_ bv1 32)) (= |~#var_1_3~0.offset| (_ bv0 32)) (= ~var_1_3_Pointer~0.base (_ bv5 32)) (= |~#var_1_11~0.base| ~var_1_11_Pointer~0.base) (= ~var_1_7_Pointer~0.offset |~#var_1_7~0.offset|) (= |~#var_1_11~0.offset| ~var_1_11_Pointer~0.offset) (bvsge .cse0 (_ bv1 32)) (= ~var_1_3_Pointer~0.offset (_ bv0 32)) (bvuge (select (select |#memory_int#12| (_ bv15 32)) (_ bv0 32)) (_ bv2147483647 32)) (exists ((v_arrayElimCell_35 (_ BitVec 32))) (let ((.cse1 ((_ extract 7 0) v_arrayElimCell_35))) (and (bvsle ((_ zero_extend 24) .cse1) (_ bv0 32)) (= ((_ sign_extend 24) .cse1) (select (select |#memory_int#5| ~var_1_6_Pointer~0.base) ~var_1_6_Pointer~0.offset))))) (= |~#var_1_13~0.offset| (_ bv0 32)) (bvsle ((_ zero_extend 24) ((_ extract 7 0) (select (select |#memory_int#6| ~var_1_7_Pointer~0.base) ~var_1_7_Pointer~0.offset))) (_ bv0 32)) (= |~#var_1_13~0.base| (_ bv15 32)) (bvule (select (select |#memory_int#4| (_ bv7 32)) (_ bv0 32)) (_ bv536870911 32)) (= |~#var_1_5~0.offset| (_ bv0 32)) (bvule .cse2 (_ bv2147483647 32)) (= ~var_1_4_Pointer~0.offset (_ bv0 32)) (= ~var_1_13_Pointer~0.offset (_ bv0 32)) (bvule .cse3 (_ bv1073741823 32)) (= ~var_1_4_Pointer~0.base (_ bv6 32)) (bvuge .cse2 (_ bv1073741823 32)) (= ~var_1_7_Pointer~0.base |~#var_1_7~0.base|) (= ~var_1_5_Pointer~0.base (_ bv7 32)) (= |~#var_1_5~0.base| (_ bv7 32)) (bvuge .cse3 (_ bv536870911 32)) (= (_ bv6 32) |~#var_1_4~0.base|) (= (_ bv15 32) ~var_1_13_Pointer~0.base))) [2023-12-24 16:50:43,211 INFO L899 garLoopResultBuilder]: For program point L106-1(line 106) no Hoare annotation was computed. [2023-12-24 16:50:43,211 INFO L895 garLoopResultBuilder]: At program point L90(line 90) the Hoare annotation is: (let ((.cse35 (select (select |#memory_int#3| (_ bv6 32)) (_ bv0 32))) (.cse36 (select (select |#memory_int#2| (_ bv5 32)) (_ bv0 32))) (.cse38 (select (select |#memory_int#5| ~var_1_6_Pointer~0.base) ~var_1_6_Pointer~0.offset)) (.cse39 ((_ zero_extend 24) ((_ extract 7 0) (select (select |#memory_int#10| ~var_1_11_Pointer~0.base) ~var_1_11_Pointer~0.offset))))) (let ((.cse0 (= |~#var_1_3~0.base| (_ bv5 32))) (.cse1 (= ~var_1_5_Pointer~0.offset (_ bv0 32))) (.cse2 (= |~#var_1_4~0.offset| (_ bv0 32))) (.cse3 (bvsle .cse39 (_ bv1 32))) (.cse4 (= |~#var_1_3~0.offset| (_ bv0 32))) (.cse5 (= ~var_1_3_Pointer~0.base (_ bv5 32))) (.cse6 (= |~#var_1_11~0.base| ~var_1_11_Pointer~0.base)) (.cse7 (= ~var_1_7_Pointer~0.offset |~#var_1_7~0.offset|)) (.cse8 (= |~#var_1_11~0.offset| ~var_1_11_Pointer~0.offset)) (.cse9 (bvsge .cse39 (_ bv1 32))) (.cse10 (= ((_ zero_extend 24) ((_ extract 7 0) .cse38)) ((_ zero_extend 24) ((_ extract 7 0) (select (select |#memory_int#6| ~var_1_7_Pointer~0.base) ~var_1_7_Pointer~0.offset))))) (.cse15 (= ~var_1_3_Pointer~0.offset (_ bv0 32))) (.cse16 (exists ((v_arrayElimCell_35 (_ BitVec 32))) (let ((.cse37 ((_ extract 7 0) v_arrayElimCell_35))) (and (bvsle ((_ zero_extend 24) .cse37) (_ bv0 32)) (= ((_ sign_extend 24) .cse37) .cse38))))) (.cse17 (= |~#var_1_13~0.offset| (_ bv0 32))) (.cse18 (= |~#var_1_13~0.base| (_ bv15 32))) (.cse19 (= |~#var_1_5~0.offset| (_ bv0 32))) (.cse20 (bvule .cse36 (_ bv2147483647 32))) (.cse21 (= ~var_1_4_Pointer~0.offset (_ bv0 32))) (.cse22 (= ~var_1_13_Pointer~0.offset (_ bv0 32))) (.cse23 (bvule .cse35 (_ bv1073741823 32))) (.cse24 (= ~var_1_4_Pointer~0.base (_ bv6 32))) (.cse25 (bvuge .cse36 (_ bv1073741823 32))) (.cse26 (= (select (select |#memory_int#4| (_ bv7 32)) (_ bv0 32)) |ULTIMATE.start_updateVariables_#t~mem50#1|)) (.cse27 (= ~var_1_7_Pointer~0.base |~#var_1_7~0.base|)) (.cse28 (= ~var_1_5_Pointer~0.base (_ bv7 32))) (.cse29 (= |~#var_1_5~0.base| (_ bv7 32))) (.cse30 (bvuge .cse35 (_ bv536870911 32))) (.cse31 (= (_ bv6 32) |~#var_1_4~0.base|)) (.cse32 (= (_ bv15 32) ~var_1_13_Pointer~0.base))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (fp.gt (fp.mul currentRoundingMode (let ((.cse11 (let ((.cse12 (select |#memory_int#8| ~var_1_9_Pointer~0.base))) (concat (select .cse12 (bvadd (_ bv4 32) ~var_1_9_Pointer~0.offset)) (select .cse12 ~var_1_9_Pointer~0.offset))))) (fp ((_ extract 63 63) .cse11) ((_ extract 62 52) .cse11) ((_ extract 51 0) .cse11))) ((_ to_fp 11 53) currentRoundingMode ((_ to_fp 8 24) currentRoundingMode (/ 33.0 2.0)))) (let ((.cse13 (let ((.cse14 (select |#memory_int#9| ~var_1_10_Pointer~0.base))) (concat (select .cse14 (bvadd ~var_1_10_Pointer~0.offset (_ bv4 32))) (select .cse14 ~var_1_10_Pointer~0.offset))))) (fp ((_ extract 63 63) .cse13) ((_ extract 62 52) .cse13) ((_ extract 51 0) .cse13)))) .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32) (let ((.cse34 (= ((_ extract 7 0) (select (select |#memory_int#15| ~var_1_16_Pointer~0.base) ~var_1_16_Pointer~0.offset)) (_ bv0 8))) (.cse33 ((_ zero_extend 24) ((_ extract 7 0) (select (select |#memory_int#14| ~var_1_15_Pointer~0.base) ~var_1_15_Pointer~0.offset))))) (and .cse0 (= ((_ extract 15 0) ((_ sign_extend 16) ((_ extract 15 0) ((_ zero_extend 16) ((_ extract 15 0) (select (select |#memory_int#13| ~var_1_14_Pointer~0.base) ~var_1_14_Pointer~0.offset)))))) ((_ extract 15 0) (select (select |#memory_int#11| ~var_1_12_Pointer~0.base) ~var_1_12_Pointer~0.offset))) .cse1 .cse2 (or (= .cse33 (_ bv1 32)) .cse34) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse15 .cse16 .cse17 .cse18 (or (not .cse34) (= .cse33 (_ bv0 32))) .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32))))) [2023-12-24 16:50:43,211 INFO L899 garLoopResultBuilder]: For program point L90-1(line 90) no Hoare annotation was computed. [2023-12-24 16:50:43,211 INFO L899 garLoopResultBuilder]: For program point L57(line 57) no Hoare annotation was computed. [2023-12-24 16:50:43,211 INFO L899 garLoopResultBuilder]: For program point L57-2(line 57) no Hoare annotation was computed. [2023-12-24 16:50:43,211 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-12-24 16:50:43,211 INFO L895 garLoopResultBuilder]: At program point L108(line 108) the Hoare annotation is: (let ((.cse0 ((_ zero_extend 24) ((_ extract 7 0) (select (select |#memory_int#10| ~var_1_11_Pointer~0.base) ~var_1_11_Pointer~0.offset)))) (.cse2 (select (select |#memory_int#2| (_ bv5 32)) (_ bv0 32))) (.cse3 (select (select |#memory_int#3| (_ bv6 32)) (_ bv0 32)))) (and (= |~#var_1_3~0.base| (_ bv5 32)) (= ~var_1_5_Pointer~0.offset (_ bv0 32)) (= |~#var_1_4~0.offset| (_ bv0 32)) (bvsle .cse0 (_ bv1 32)) (= |~#var_1_3~0.offset| (_ bv0 32)) (= ~var_1_3_Pointer~0.base (_ bv5 32)) (= |~#var_1_11~0.base| ~var_1_11_Pointer~0.base) (= ~var_1_7_Pointer~0.offset |~#var_1_7~0.offset|) (= |~#var_1_11~0.offset| ~var_1_11_Pointer~0.offset) (bvsge .cse0 (_ bv1 32)) (= ~var_1_3_Pointer~0.offset (_ bv0 32)) (bvuge (select (select |#memory_int#12| (_ bv15 32)) (_ bv0 32)) (_ bv2147483647 32)) (exists ((v_arrayElimCell_35 (_ BitVec 32))) (let ((.cse1 ((_ extract 7 0) v_arrayElimCell_35))) (and (bvsle ((_ zero_extend 24) .cse1) (_ bv0 32)) (= ((_ sign_extend 24) .cse1) (select (select |#memory_int#5| ~var_1_6_Pointer~0.base) ~var_1_6_Pointer~0.offset))))) (= |~#var_1_13~0.offset| (_ bv0 32)) (bvsle ((_ zero_extend 24) ((_ extract 7 0) (select (select |#memory_int#6| ~var_1_7_Pointer~0.base) ~var_1_7_Pointer~0.offset))) (_ bv0 32)) (= |~#var_1_13~0.base| (_ bv15 32)) (bvule (select (select |#memory_int#4| (_ bv7 32)) (_ bv0 32)) (_ bv536870911 32)) (= |~#var_1_5~0.offset| (_ bv0 32)) (bvule .cse2 (_ bv2147483647 32)) (= ~var_1_4_Pointer~0.offset (_ bv0 32)) (= ~var_1_13_Pointer~0.offset (_ bv0 32)) (bvule .cse3 (_ bv1073741823 32)) (= ~var_1_4_Pointer~0.base (_ bv6 32)) (bvuge .cse2 (_ bv1073741823 32)) (= ~var_1_7_Pointer~0.base |~#var_1_7~0.base|) (= ~var_1_5_Pointer~0.base (_ bv7 32)) (= |~#var_1_5~0.base| (_ bv7 32)) (bvuge .cse3 (_ bv536870911 32)) (= (_ bv6 32) |~#var_1_4~0.base|) (= (_ bv15 32) ~var_1_13_Pointer~0.base))) [2023-12-24 16:50:43,211 INFO L899 garLoopResultBuilder]: For program point L108-1(line 108) no Hoare annotation was computed. [2023-12-24 16:50:43,212 INFO L895 garLoopResultBuilder]: At program point L92(line 92) the Hoare annotation is: (let ((.cse34 (select (select |#memory_int#3| (_ bv6 32)) (_ bv0 32))) (.cse35 (select (select |#memory_int#2| (_ bv5 32)) (_ bv0 32))) (.cse37 ((_ zero_extend 24) ((_ extract 7 0) (select (select |#memory_int#10| ~var_1_11_Pointer~0.base) ~var_1_11_Pointer~0.offset))))) (let ((.cse0 (= |~#var_1_3~0.base| (_ bv5 32))) (.cse1 (= ~var_1_5_Pointer~0.offset (_ bv0 32))) (.cse2 (= |~#var_1_4~0.offset| (_ bv0 32))) (.cse3 (bvsle .cse37 (_ bv1 32))) (.cse4 (= |~#var_1_3~0.offset| (_ bv0 32))) (.cse5 (= ~var_1_3_Pointer~0.base (_ bv5 32))) (.cse6 (= |~#var_1_11~0.base| ~var_1_11_Pointer~0.base)) (.cse7 (= ~var_1_7_Pointer~0.offset |~#var_1_7~0.offset|)) (.cse8 (= |~#var_1_11~0.offset| ~var_1_11_Pointer~0.offset)) (.cse9 (bvsge .cse37 (_ bv1 32))) (.cse14 (= ~var_1_3_Pointer~0.offset (_ bv0 32))) (.cse15 (exists ((v_arrayElimCell_35 (_ BitVec 32))) (let ((.cse36 ((_ extract 7 0) v_arrayElimCell_35))) (and (bvsle ((_ zero_extend 24) .cse36) (_ bv0 32)) (= ((_ sign_extend 24) .cse36) (select (select |#memory_int#5| ~var_1_6_Pointer~0.base) ~var_1_6_Pointer~0.offset)))))) (.cse16 (= |~#var_1_13~0.offset| (_ bv0 32))) (.cse17 (= |~#var_1_13~0.base| (_ bv15 32))) (.cse18 (bvule (select (select |#memory_int#4| (_ bv7 32)) (_ bv0 32)) (_ bv536870911 32))) (.cse19 (= |~#var_1_5~0.offset| (_ bv0 32))) (.cse20 (bvule .cse35 (_ bv2147483647 32))) (.cse21 (= ~var_1_4_Pointer~0.offset (_ bv0 32))) (.cse22 (= ~var_1_13_Pointer~0.offset (_ bv0 32))) (.cse23 (bvule .cse34 (_ bv1073741823 32))) (.cse24 (= ~var_1_4_Pointer~0.base (_ bv6 32))) (.cse25 (bvuge .cse35 (_ bv1073741823 32))) (.cse26 (= ~var_1_7_Pointer~0.base |~#var_1_7~0.base|)) (.cse27 (= ~var_1_5_Pointer~0.base (_ bv7 32))) (.cse28 (= |~#var_1_5~0.base| (_ bv7 32))) (.cse29 (bvuge .cse34 (_ bv536870911 32))) (.cse30 (= (_ bv6 32) |~#var_1_4~0.base|)) (.cse31 (= (_ bv15 32) ~var_1_13_Pointer~0.base))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (fp.gt (fp.mul currentRoundingMode (let ((.cse10 (let ((.cse11 (select |#memory_int#8| ~var_1_9_Pointer~0.base))) (concat (select .cse11 (bvadd (_ bv4 32) ~var_1_9_Pointer~0.offset)) (select .cse11 ~var_1_9_Pointer~0.offset))))) (fp ((_ extract 63 63) .cse10) ((_ extract 62 52) .cse10) ((_ extract 51 0) .cse10))) ((_ to_fp 11 53) currentRoundingMode ((_ to_fp 8 24) currentRoundingMode (/ 33.0 2.0)))) (let ((.cse12 (let ((.cse13 (select |#memory_int#9| ~var_1_10_Pointer~0.base))) (concat (select .cse13 (bvadd ~var_1_10_Pointer~0.offset (_ bv4 32))) (select .cse13 ~var_1_10_Pointer~0.offset))))) (fp ((_ extract 63 63) .cse12) ((_ extract 62 52) .cse12) ((_ extract 51 0) .cse12)))) .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31) (let ((.cse33 (= ((_ extract 7 0) (select (select |#memory_int#15| ~var_1_16_Pointer~0.base) ~var_1_16_Pointer~0.offset)) (_ bv0 8))) (.cse32 ((_ zero_extend 24) ((_ extract 7 0) (select (select |#memory_int#14| ~var_1_15_Pointer~0.base) ~var_1_15_Pointer~0.offset))))) (and .cse0 (= ((_ extract 15 0) ((_ sign_extend 16) ((_ extract 15 0) ((_ zero_extend 16) ((_ extract 15 0) (select (select |#memory_int#13| ~var_1_14_Pointer~0.base) ~var_1_14_Pointer~0.offset)))))) ((_ extract 15 0) (select (select |#memory_int#11| ~var_1_12_Pointer~0.base) ~var_1_12_Pointer~0.offset))) .cse1 .cse2 (or (= .cse32 (_ bv1 32)) .cse33) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse14 .cse15 .cse16 .cse17 (or (not .cse33) (= .cse32 (_ bv0 32))) .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31))))) [2023-12-24 16:50:43,212 INFO L899 garLoopResultBuilder]: For program point L92-1(line 92) no Hoare annotation was computed. [2023-12-24 16:50:43,212 INFO L899 garLoopResultBuilder]: For program point L59(lines 59 63) no Hoare annotation was computed. [2023-12-24 16:50:43,212 INFO L899 garLoopResultBuilder]: For program point L59-2(lines 59 63) no Hoare annotation was computed. [2023-12-24 16:50:43,212 INFO L895 garLoopResultBuilder]: At program point L109(line 109) the Hoare annotation is: (let ((.cse0 ((_ zero_extend 24) ((_ extract 7 0) (select (select |#memory_int#10| ~var_1_11_Pointer~0.base) ~var_1_11_Pointer~0.offset)))) (.cse2 (select (select |#memory_int#2| (_ bv5 32)) (_ bv0 32))) (.cse3 (select (select |#memory_int#3| (_ bv6 32)) (_ bv0 32)))) (and (= |~#var_1_3~0.base| (_ bv5 32)) (= ~var_1_5_Pointer~0.offset (_ bv0 32)) (= |~#var_1_4~0.offset| (_ bv0 32)) (bvsle .cse0 (_ bv1 32)) (= |~#var_1_3~0.offset| (_ bv0 32)) (= ~var_1_3_Pointer~0.base (_ bv5 32)) (= |~#var_1_11~0.base| ~var_1_11_Pointer~0.base) (= ~var_1_7_Pointer~0.offset |~#var_1_7~0.offset|) (= |~#var_1_11~0.offset| ~var_1_11_Pointer~0.offset) (bvsge .cse0 (_ bv1 32)) (= ~var_1_3_Pointer~0.offset (_ bv0 32)) (bvuge (select (select |#memory_int#12| (_ bv15 32)) (_ bv0 32)) (_ bv2147483647 32)) (exists ((v_arrayElimCell_35 (_ BitVec 32))) (let ((.cse1 ((_ extract 7 0) v_arrayElimCell_35))) (and (bvsle ((_ zero_extend 24) .cse1) (_ bv0 32)) (= ((_ sign_extend 24) .cse1) (select (select |#memory_int#5| ~var_1_6_Pointer~0.base) ~var_1_6_Pointer~0.offset))))) (= |~#var_1_13~0.offset| (_ bv0 32)) (bvsle ((_ zero_extend 24) ((_ extract 7 0) (select (select |#memory_int#6| ~var_1_7_Pointer~0.base) ~var_1_7_Pointer~0.offset))) (_ bv0 32)) (= |~#var_1_13~0.base| (_ bv15 32)) (bvule (select (select |#memory_int#4| (_ bv7 32)) (_ bv0 32)) (_ bv536870911 32)) (= |~#var_1_5~0.offset| (_ bv0 32)) (bvule .cse2 (_ bv2147483647 32)) (= ~var_1_4_Pointer~0.offset (_ bv0 32)) (= ~var_1_13_Pointer~0.offset (_ bv0 32)) (bvule .cse3 (_ bv1073741823 32)) (= ~var_1_4_Pointer~0.base (_ bv6 32)) (bvuge .cse2 (_ bv1073741823 32)) (= ~var_1_7_Pointer~0.base |~#var_1_7~0.base|) (= ~var_1_5_Pointer~0.base (_ bv7 32)) (= |~#var_1_5~0.base| (_ bv7 32)) (bvuge .cse3 (_ bv536870911 32)) (= (_ bv6 32) |~#var_1_4~0.base|) (= (_ bv15 32) ~var_1_13_Pointer~0.base))) [2023-12-24 16:50:43,212 INFO L899 garLoopResultBuilder]: For program point L109-1(line 109) no Hoare annotation was computed. [2023-12-24 16:50:43,212 INFO L895 garLoopResultBuilder]: At program point L93(line 93) the Hoare annotation is: (let ((.cse35 (select (select |#memory_int#3| (_ bv6 32)) (_ bv0 32))) (.cse36 (select (select |#memory_int#2| (_ bv5 32)) (_ bv0 32))) (.cse38 ((_ zero_extend 24) ((_ extract 7 0) (select (select |#memory_int#10| ~var_1_11_Pointer~0.base) ~var_1_11_Pointer~0.offset))))) (let ((.cse0 (= |~#var_1_3~0.base| (_ bv5 32))) (.cse1 (= ~var_1_5_Pointer~0.offset (_ bv0 32))) (.cse2 (= |~#var_1_4~0.offset| (_ bv0 32))) (.cse3 (bvsle .cse38 (_ bv1 32))) (.cse4 (= |~#var_1_3~0.offset| (_ bv0 32))) (.cse5 (= ~var_1_3_Pointer~0.base (_ bv5 32))) (.cse6 (= |~#var_1_11~0.base| ~var_1_11_Pointer~0.base)) (.cse7 (= ~var_1_7_Pointer~0.offset |~#var_1_7~0.offset|)) (.cse8 (= ((_ extract 7 0) (select (select |#memory_int#6| ~var_1_7_Pointer~0.base) ~var_1_7_Pointer~0.offset)) |ULTIMATE.start_updateVariables_#t~mem53#1|)) (.cse9 (= |~#var_1_11~0.offset| ~var_1_11_Pointer~0.offset)) (.cse10 (bvsge .cse38 (_ bv1 32))) (.cse15 (= ~var_1_3_Pointer~0.offset (_ bv0 32))) (.cse16 (exists ((v_arrayElimCell_35 (_ BitVec 32))) (let ((.cse37 ((_ extract 7 0) v_arrayElimCell_35))) (and (bvsle ((_ zero_extend 24) .cse37) (_ bv0 32)) (= ((_ sign_extend 24) .cse37) (select (select |#memory_int#5| ~var_1_6_Pointer~0.base) ~var_1_6_Pointer~0.offset)))))) (.cse17 (= |~#var_1_13~0.offset| (_ bv0 32))) (.cse18 (= |~#var_1_13~0.base| (_ bv15 32))) (.cse19 (bvule (select (select |#memory_int#4| (_ bv7 32)) (_ bv0 32)) (_ bv536870911 32))) (.cse20 (= |~#var_1_5~0.offset| (_ bv0 32))) (.cse21 (bvule .cse36 (_ bv2147483647 32))) (.cse22 (= ~var_1_4_Pointer~0.offset (_ bv0 32))) (.cse23 (= ~var_1_13_Pointer~0.offset (_ bv0 32))) (.cse24 (bvule .cse35 (_ bv1073741823 32))) (.cse25 (= ~var_1_4_Pointer~0.base (_ bv6 32))) (.cse26 (bvuge .cse36 (_ bv1073741823 32))) (.cse27 (= ~var_1_7_Pointer~0.base |~#var_1_7~0.base|)) (.cse28 (= ~var_1_5_Pointer~0.base (_ bv7 32))) (.cse29 (= |~#var_1_5~0.base| (_ bv7 32))) (.cse30 (bvuge .cse35 (_ bv536870911 32))) (.cse31 (= (_ bv6 32) |~#var_1_4~0.base|)) (.cse32 (= (_ bv15 32) ~var_1_13_Pointer~0.base))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (fp.gt (fp.mul currentRoundingMode (let ((.cse11 (let ((.cse12 (select |#memory_int#8| ~var_1_9_Pointer~0.base))) (concat (select .cse12 (bvadd (_ bv4 32) ~var_1_9_Pointer~0.offset)) (select .cse12 ~var_1_9_Pointer~0.offset))))) (fp ((_ extract 63 63) .cse11) ((_ extract 62 52) .cse11) ((_ extract 51 0) .cse11))) ((_ to_fp 11 53) currentRoundingMode ((_ to_fp 8 24) currentRoundingMode (/ 33.0 2.0)))) (let ((.cse13 (let ((.cse14 (select |#memory_int#9| ~var_1_10_Pointer~0.base))) (concat (select .cse14 (bvadd ~var_1_10_Pointer~0.offset (_ bv4 32))) (select .cse14 ~var_1_10_Pointer~0.offset))))) (fp ((_ extract 63 63) .cse13) ((_ extract 62 52) .cse13) ((_ extract 51 0) .cse13)))) .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32) (let ((.cse34 (= ((_ extract 7 0) (select (select |#memory_int#15| ~var_1_16_Pointer~0.base) ~var_1_16_Pointer~0.offset)) (_ bv0 8))) (.cse33 ((_ zero_extend 24) ((_ extract 7 0) (select (select |#memory_int#14| ~var_1_15_Pointer~0.base) ~var_1_15_Pointer~0.offset))))) (and .cse0 (= ((_ extract 15 0) ((_ sign_extend 16) ((_ extract 15 0) ((_ zero_extend 16) ((_ extract 15 0) (select (select |#memory_int#13| ~var_1_14_Pointer~0.base) ~var_1_14_Pointer~0.offset)))))) ((_ extract 15 0) (select (select |#memory_int#11| ~var_1_12_Pointer~0.base) ~var_1_12_Pointer~0.offset))) .cse1 .cse2 (or (= .cse33 (_ bv1 32)) .cse34) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse15 .cse16 .cse17 .cse18 (or (not .cse34) (= .cse33 (_ bv0 32))) .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32))))) [2023-12-24 16:50:43,212 INFO L899 garLoopResultBuilder]: For program point L93-1(line 93) no Hoare annotation was computed. [2023-12-24 16:50:43,212 INFO L899 garLoopResultBuilder]: For program point L95(line 95) no Hoare annotation was computed. [2023-12-24 16:50:43,212 INFO L899 garLoopResultBuilder]: For program point L62(line 62) no Hoare annotation was computed. [2023-12-24 16:50:43,212 INFO L899 garLoopResultBuilder]: For program point L95-2(line 95) no Hoare annotation was computed. [2023-12-24 16:50:43,212 INFO L899 garLoopResultBuilder]: For program point L95-3(line 95) no Hoare annotation was computed. [2023-12-24 16:50:43,212 INFO L899 garLoopResultBuilder]: For program point L62-2(line 62) no Hoare annotation was computed. [2023-12-24 16:50:43,213 INFO L899 garLoopResultBuilder]: For program point L95-5(line 95) no Hoare annotation was computed. [2023-12-24 16:50:43,213 INFO L899 garLoopResultBuilder]: For program point L95-7(line 95) no Hoare annotation was computed. [2023-12-24 16:50:43,213 INFO L895 garLoopResultBuilder]: At program point L95-8(line 95) the Hoare annotation is: (let ((.cse0 ((_ zero_extend 24) ((_ extract 7 0) (select (select |#memory_int#10| ~var_1_11_Pointer~0.base) ~var_1_11_Pointer~0.offset)))) (.cse2 (select (select |#memory_int#2| (_ bv5 32)) (_ bv0 32))) (.cse3 (select (select |#memory_int#3| (_ bv6 32)) (_ bv0 32)))) (and (= |~#var_1_3~0.base| (_ bv5 32)) (= ~var_1_5_Pointer~0.offset (_ bv0 32)) (= |~#var_1_4~0.offset| (_ bv0 32)) (bvsle .cse0 (_ bv1 32)) (= |~#var_1_3~0.offset| (_ bv0 32)) (= ~var_1_3_Pointer~0.base (_ bv5 32)) (= |~#var_1_11~0.base| ~var_1_11_Pointer~0.base) (= ~var_1_7_Pointer~0.offset |~#var_1_7~0.offset|) (= |~#var_1_11~0.offset| ~var_1_11_Pointer~0.offset) (bvsge .cse0 (_ bv1 32)) (= ~var_1_3_Pointer~0.offset (_ bv0 32)) (exists ((v_arrayElimCell_35 (_ BitVec 32))) (let ((.cse1 ((_ extract 7 0) v_arrayElimCell_35))) (and (bvsle ((_ zero_extend 24) .cse1) (_ bv0 32)) (= ((_ sign_extend 24) .cse1) (select (select |#memory_int#5| ~var_1_6_Pointer~0.base) ~var_1_6_Pointer~0.offset))))) (= |~#var_1_13~0.offset| (_ bv0 32)) (bvsle ((_ zero_extend 24) ((_ extract 7 0) (select (select |#memory_int#6| ~var_1_7_Pointer~0.base) ~var_1_7_Pointer~0.offset))) (_ bv0 32)) (= |~#var_1_13~0.base| (_ bv15 32)) (bvule (select (select |#memory_int#4| (_ bv7 32)) (_ bv0 32)) (_ bv536870911 32)) (= |~#var_1_5~0.offset| (_ bv0 32)) (bvule .cse2 (_ bv2147483647 32)) (= ~var_1_4_Pointer~0.offset (_ bv0 32)) (= ~var_1_13_Pointer~0.offset (_ bv0 32)) (bvule .cse3 (_ bv1073741823 32)) (= ~var_1_4_Pointer~0.base (_ bv6 32)) (bvuge .cse2 (_ bv1073741823 32)) (= ~var_1_7_Pointer~0.base |~#var_1_7~0.base|) (= ~var_1_5_Pointer~0.base (_ bv7 32)) (= |~#var_1_5~0.base| (_ bv7 32)) (bvuge .cse3 (_ bv536870911 32)) (= (_ bv6 32) |~#var_1_4~0.base|) (= (_ bv15 32) ~var_1_13_Pointer~0.base))) [2023-12-24 16:50:43,213 INFO L899 garLoopResultBuilder]: For program point L95-9(line 95) no Hoare annotation was computed. [2023-12-24 16:50:43,213 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-12-24 16:50:43,213 INFO L899 garLoopResultBuilder]: For program point L97(line 97) no Hoare annotation was computed. [2023-12-24 16:50:43,213 INFO L899 garLoopResultBuilder]: For program point L97-2(line 97) no Hoare annotation was computed. [2023-12-24 16:50:43,213 INFO L899 garLoopResultBuilder]: For program point L97-3(line 97) no Hoare annotation was computed. [2023-12-24 16:50:43,213 INFO L899 garLoopResultBuilder]: For program point L97-5(line 97) no Hoare annotation was computed. [2023-12-24 16:50:43,213 INFO L899 garLoopResultBuilder]: For program point L97-7(line 97) no Hoare annotation was computed. [2023-12-24 16:50:43,213 INFO L895 garLoopResultBuilder]: At program point L97-8(line 97) the Hoare annotation is: (let ((.cse0 ((_ zero_extend 24) ((_ extract 7 0) (select (select |#memory_int#10| ~var_1_11_Pointer~0.base) ~var_1_11_Pointer~0.offset)))) (.cse2 (select (select |#memory_int#2| (_ bv5 32)) (_ bv0 32))) (.cse3 (select (select |#memory_int#3| (_ bv6 32)) (_ bv0 32)))) (and (= |~#var_1_3~0.base| (_ bv5 32)) (= ~var_1_5_Pointer~0.offset (_ bv0 32)) (= |~#var_1_4~0.offset| (_ bv0 32)) (bvsle .cse0 (_ bv1 32)) (= |~#var_1_3~0.offset| (_ bv0 32)) (= ~var_1_3_Pointer~0.base (_ bv5 32)) (= |~#var_1_11~0.base| ~var_1_11_Pointer~0.base) (= ~var_1_7_Pointer~0.offset |~#var_1_7~0.offset|) (= |~#var_1_11~0.offset| ~var_1_11_Pointer~0.offset) (bvsge .cse0 (_ bv1 32)) (= ~var_1_3_Pointer~0.offset (_ bv0 32)) (exists ((v_arrayElimCell_35 (_ BitVec 32))) (let ((.cse1 ((_ extract 7 0) v_arrayElimCell_35))) (and (bvsle ((_ zero_extend 24) .cse1) (_ bv0 32)) (= ((_ sign_extend 24) .cse1) (select (select |#memory_int#5| ~var_1_6_Pointer~0.base) ~var_1_6_Pointer~0.offset))))) (= |~#var_1_13~0.offset| (_ bv0 32)) (bvsle ((_ zero_extend 24) ((_ extract 7 0) (select (select |#memory_int#6| ~var_1_7_Pointer~0.base) ~var_1_7_Pointer~0.offset))) (_ bv0 32)) (= |~#var_1_13~0.base| (_ bv15 32)) (bvule (select (select |#memory_int#4| (_ bv7 32)) (_ bv0 32)) (_ bv536870911 32)) (= |~#var_1_5~0.offset| (_ bv0 32)) (bvule .cse2 (_ bv2147483647 32)) (= ~var_1_4_Pointer~0.offset (_ bv0 32)) (= ~var_1_13_Pointer~0.offset (_ bv0 32)) (bvule .cse3 (_ bv1073741823 32)) (= ~var_1_4_Pointer~0.base (_ bv6 32)) (bvuge .cse2 (_ bv1073741823 32)) (= ~var_1_7_Pointer~0.base |~#var_1_7~0.base|) (= ~var_1_5_Pointer~0.base (_ bv7 32)) (= |~#var_1_5~0.base| (_ bv7 32)) (bvuge .cse3 (_ bv536870911 32)) (= (_ bv6 32) |~#var_1_4~0.base|) (= (_ bv15 32) ~var_1_13_Pointer~0.base))) [2023-12-24 16:50:43,213 INFO L899 garLoopResultBuilder]: For program point L97-9(line 97) no Hoare annotation was computed. [2023-12-24 16:50:43,213 INFO L899 garLoopResultBuilder]: For program point L114(line 114) no Hoare annotation was computed. [2023-12-24 16:50:43,213 INFO L899 garLoopResultBuilder]: For program point L114-2(line 114) no Hoare annotation was computed. [2023-12-24 16:50:43,213 INFO L899 garLoopResultBuilder]: For program point L114-3(line 114) no Hoare annotation was computed. [2023-12-24 16:50:43,213 INFO L899 garLoopResultBuilder]: For program point L114-4(line 114) no Hoare annotation was computed. [2023-12-24 16:50:43,213 INFO L899 garLoopResultBuilder]: For program point L114-6(line 114) no Hoare annotation was computed. [2023-12-24 16:50:43,213 INFO L899 garLoopResultBuilder]: For program point L114-7(line 114) no Hoare annotation was computed. [2023-12-24 16:50:43,214 INFO L899 garLoopResultBuilder]: For program point L114-9(line 114) no Hoare annotation was computed. [2023-12-24 16:50:43,214 INFO L899 garLoopResultBuilder]: For program point L114-10(line 114) no Hoare annotation was computed. [2023-12-24 16:50:43,214 INFO L899 garLoopResultBuilder]: For program point L114-11(line 114) no Hoare annotation was computed. [2023-12-24 16:50:43,214 INFO L899 garLoopResultBuilder]: For program point L114-12(line 114) no Hoare annotation was computed. [2023-12-24 16:50:43,214 INFO L899 garLoopResultBuilder]: For program point L114-13(line 114) no Hoare annotation was computed. [2023-12-24 16:50:43,214 INFO L899 garLoopResultBuilder]: For program point L114-15(line 114) no Hoare annotation was computed. [2023-12-24 16:50:43,214 INFO L899 garLoopResultBuilder]: For program point L65(line 65) no Hoare annotation was computed. [2023-12-24 16:50:43,214 INFO L899 garLoopResultBuilder]: For program point L114-17(line 114) no Hoare annotation was computed. [2023-12-24 16:50:43,214 INFO L899 garLoopResultBuilder]: For program point L65-2(line 65) no Hoare annotation was computed. [2023-12-24 16:50:43,214 INFO L899 garLoopResultBuilder]: For program point L114-19(line 114) no Hoare annotation was computed. [2023-12-24 16:50:43,214 INFO L899 garLoopResultBuilder]: For program point L114-21(line 114) no Hoare annotation was computed. [2023-12-24 16:50:43,214 INFO L899 garLoopResultBuilder]: For program point L114-23(line 114) no Hoare annotation was computed. [2023-12-24 16:50:43,214 INFO L899 garLoopResultBuilder]: For program point L114-25(line 114) no Hoare annotation was computed. [2023-12-24 16:50:43,214 INFO L899 garLoopResultBuilder]: For program point L114-26(line 114) no Hoare annotation was computed. [2023-12-24 16:50:43,214 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2023-12-24 16:50:43,214 INFO L899 garLoopResultBuilder]: For program point L114-27(line 114) no Hoare annotation was computed. [2023-12-24 16:50:43,214 INFO L899 garLoopResultBuilder]: For program point L114-28(line 114) no Hoare annotation was computed. [2023-12-24 16:50:43,214 INFO L899 garLoopResultBuilder]: For program point L114-30(line 114) no Hoare annotation was computed. [2023-12-24 16:50:43,214 INFO L899 garLoopResultBuilder]: For program point L114-32(line 114) no Hoare annotation was computed. [2023-12-24 16:50:43,214 INFO L899 garLoopResultBuilder]: For program point L114-34(line 114) no Hoare annotation was computed. [2023-12-24 16:50:43,214 INFO L899 garLoopResultBuilder]: For program point L114-35(line 114) no Hoare annotation was computed. [2023-12-24 16:50:43,214 INFO L899 garLoopResultBuilder]: For program point L114-36(line 114) no Hoare annotation was computed. [2023-12-24 16:50:43,214 INFO L899 garLoopResultBuilder]: For program point L114-38(line 114) no Hoare annotation was computed. [2023-12-24 16:50:43,214 INFO L899 garLoopResultBuilder]: For program point L114-40(line 114) no Hoare annotation was computed. [2023-12-24 16:50:43,214 INFO L899 garLoopResultBuilder]: For program point L114-41(line 114) no Hoare annotation was computed. [2023-12-24 16:50:43,215 INFO L899 garLoopResultBuilder]: For program point L114-43(line 114) no Hoare annotation was computed. [2023-12-24 16:50:43,215 INFO L895 garLoopResultBuilder]: At program point L99(line 99) the Hoare annotation is: (let ((.cse1 (select (select |#memory_int#2| (_ bv5 32)) (_ bv0 32))) (.cse2 (select (select |#memory_int#3| (_ bv6 32)) (_ bv0 32)))) (and (= |~#var_1_3~0.base| (_ bv5 32)) (= ~var_1_5_Pointer~0.offset (_ bv0 32)) (= |~#var_1_4~0.offset| (_ bv0 32)) (= |~#var_1_3~0.offset| (_ bv0 32)) (= ~var_1_3_Pointer~0.base (_ bv5 32)) (= |~#var_1_11~0.base| ~var_1_11_Pointer~0.base) (= ~var_1_7_Pointer~0.offset |~#var_1_7~0.offset|) (= |~#var_1_11~0.offset| ~var_1_11_Pointer~0.offset) (= |ULTIMATE.start_updateVariables_#t~mem71#1| ((_ extract 7 0) (select (select |#memory_int#10| |~#var_1_11~0.base|) |~#var_1_11~0.offset|))) (= ~var_1_3_Pointer~0.offset (_ bv0 32)) (exists ((v_arrayElimCell_35 (_ BitVec 32))) (let ((.cse0 ((_ extract 7 0) v_arrayElimCell_35))) (and (bvsle ((_ zero_extend 24) .cse0) (_ bv0 32)) (= ((_ sign_extend 24) .cse0) (select (select |#memory_int#5| ~var_1_6_Pointer~0.base) ~var_1_6_Pointer~0.offset))))) (= |~#var_1_13~0.offset| (_ bv0 32)) (bvsle ((_ zero_extend 24) ((_ extract 7 0) (select (select |#memory_int#6| ~var_1_7_Pointer~0.base) ~var_1_7_Pointer~0.offset))) (_ bv0 32)) (= |~#var_1_13~0.base| (_ bv15 32)) (bvule (select (select |#memory_int#4| (_ bv7 32)) (_ bv0 32)) (_ bv536870911 32)) (= |~#var_1_5~0.offset| (_ bv0 32)) (bvule .cse1 (_ bv2147483647 32)) (= ~var_1_4_Pointer~0.offset (_ bv0 32)) (= ~var_1_13_Pointer~0.offset (_ bv0 32)) (bvule .cse2 (_ bv1073741823 32)) (= ~var_1_4_Pointer~0.base (_ bv6 32)) (bvuge .cse1 (_ bv1073741823 32)) (= ~var_1_7_Pointer~0.base |~#var_1_7~0.base|) (= ~var_1_5_Pointer~0.base (_ bv7 32)) (= |~#var_1_5~0.base| (_ bv7 32)) (bvuge .cse2 (_ bv536870911 32)) (= (_ bv6 32) |~#var_1_4~0.base|) (= (_ bv15 32) ~var_1_13_Pointer~0.base))) [2023-12-24 16:50:43,215 INFO L899 garLoopResultBuilder]: For program point L99-1(line 99) no Hoare annotation was computed. [2023-12-24 16:50:43,215 INFO L895 garLoopResultBuilder]: At program point L83(line 83) the Hoare annotation is: (let ((.cse35 (select (select |#memory_int#3| (_ bv6 32)) (_ bv0 32))) (.cse37 (select (select |#memory_int#5| ~var_1_6_Pointer~0.base) ~var_1_6_Pointer~0.offset)) (.cse38 ((_ zero_extend 24) ((_ extract 7 0) (select (select |#memory_int#10| ~var_1_11_Pointer~0.base) ~var_1_11_Pointer~0.offset))))) (let ((.cse0 (= |~#var_1_3~0.base| (_ bv5 32))) (.cse1 (= ~var_1_5_Pointer~0.offset (_ bv0 32))) (.cse2 (= |~#var_1_4~0.offset| (_ bv0 32))) (.cse3 (bvsle .cse38 (_ bv1 32))) (.cse4 (= |~#var_1_3~0.offset| (_ bv0 32))) (.cse5 (= ~var_1_3_Pointer~0.base (_ bv5 32))) (.cse6 (= |~#var_1_11~0.base| ~var_1_11_Pointer~0.base)) (.cse7 (= ~var_1_7_Pointer~0.offset |~#var_1_7~0.offset|)) (.cse8 (= |~#var_1_11~0.offset| ~var_1_11_Pointer~0.offset)) (.cse9 (bvsge .cse38 (_ bv1 32))) (.cse10 (= ((_ zero_extend 24) ((_ extract 7 0) .cse37)) ((_ zero_extend 24) ((_ extract 7 0) (select (select |#memory_int#6| ~var_1_7_Pointer~0.base) ~var_1_7_Pointer~0.offset))))) (.cse15 (= ~var_1_3_Pointer~0.offset (_ bv0 32))) (.cse16 (bvuge (select (select |#memory_int#12| (_ bv15 32)) (_ bv0 32)) (_ bv2147483647 32))) (.cse17 (exists ((v_arrayElimCell_35 (_ BitVec 32))) (let ((.cse36 ((_ extract 7 0) v_arrayElimCell_35))) (and (bvsle ((_ zero_extend 24) .cse36) (_ bv0 32)) (= ((_ sign_extend 24) .cse36) .cse37))))) (.cse18 (= |~#var_1_13~0.offset| (_ bv0 32))) (.cse19 (= |~#var_1_13~0.base| (_ bv15 32))) (.cse20 (bvule (select (select |#memory_int#4| (_ bv7 32)) (_ bv0 32)) (_ bv536870911 32))) (.cse21 (= |~#var_1_5~0.offset| (_ bv0 32))) (.cse22 (= (select (select |#memory_int#2| (_ bv5 32)) (_ bv0 32)) |ULTIMATE.start_updateVariables_#t~mem43#1|)) (.cse23 (= ~var_1_4_Pointer~0.offset (_ bv0 32))) (.cse24 (= ~var_1_13_Pointer~0.offset (_ bv0 32))) (.cse25 (bvule .cse35 (_ bv1073741823 32))) (.cse26 (= ~var_1_4_Pointer~0.base (_ bv6 32))) (.cse27 (= ~var_1_7_Pointer~0.base |~#var_1_7~0.base|)) (.cse28 (= ~var_1_5_Pointer~0.base (_ bv7 32))) (.cse29 (= |~#var_1_5~0.base| (_ bv7 32))) (.cse30 (bvuge .cse35 (_ bv536870911 32))) (.cse31 (= (_ bv6 32) |~#var_1_4~0.base|)) (.cse32 (= (_ bv15 32) ~var_1_13_Pointer~0.base))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (fp.gt (fp.mul currentRoundingMode (let ((.cse11 (let ((.cse12 (select |#memory_int#8| ~var_1_9_Pointer~0.base))) (concat (select .cse12 (bvadd (_ bv4 32) ~var_1_9_Pointer~0.offset)) (select .cse12 ~var_1_9_Pointer~0.offset))))) (fp ((_ extract 63 63) .cse11) ((_ extract 62 52) .cse11) ((_ extract 51 0) .cse11))) ((_ to_fp 11 53) currentRoundingMode ((_ to_fp 8 24) currentRoundingMode (/ 33.0 2.0)))) (let ((.cse13 (let ((.cse14 (select |#memory_int#9| ~var_1_10_Pointer~0.base))) (concat (select .cse14 (bvadd ~var_1_10_Pointer~0.offset (_ bv4 32))) (select .cse14 ~var_1_10_Pointer~0.offset))))) (fp ((_ extract 63 63) .cse13) ((_ extract 62 52) .cse13) ((_ extract 51 0) .cse13)))) .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32) (let ((.cse34 (= ((_ extract 7 0) (select (select |#memory_int#15| ~var_1_16_Pointer~0.base) ~var_1_16_Pointer~0.offset)) (_ bv0 8))) (.cse33 ((_ zero_extend 24) ((_ extract 7 0) (select (select |#memory_int#14| ~var_1_15_Pointer~0.base) ~var_1_15_Pointer~0.offset))))) (and .cse0 (= ((_ extract 15 0) ((_ sign_extend 16) ((_ extract 15 0) ((_ zero_extend 16) ((_ extract 15 0) (select (select |#memory_int#13| ~var_1_14_Pointer~0.base) ~var_1_14_Pointer~0.offset)))))) ((_ extract 15 0) (select (select |#memory_int#11| ~var_1_12_Pointer~0.base) ~var_1_12_Pointer~0.offset))) .cse1 .cse2 (or (= .cse33 (_ bv1 32)) .cse34) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse15 .cse16 .cse17 .cse18 .cse19 (or (not .cse34) (= .cse33 (_ bv0 32))) .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32))))) [2023-12-24 16:50:43,215 INFO L899 garLoopResultBuilder]: For program point L83-1(line 83) no Hoare annotation was computed. [2023-12-24 16:50:43,215 INFO L895 garLoopResultBuilder]: At program point L100(line 100) the Hoare annotation is: (let ((.cse0 ((_ extract 7 0) (select (select |#memory_int#10| ~var_1_11_Pointer~0.base) ~var_1_11_Pointer~0.offset))) (.cse2 (select (select |#memory_int#2| (_ bv5 32)) (_ bv0 32))) (.cse3 (select (select |#memory_int#3| (_ bv6 32)) (_ bv0 32)))) (and (= |~#var_1_3~0.base| (_ bv5 32)) (= ~var_1_5_Pointer~0.offset (_ bv0 32)) (= |~#var_1_4~0.offset| (_ bv0 32)) (= |~#var_1_3~0.offset| (_ bv0 32)) (= ~var_1_3_Pointer~0.base (_ bv5 32)) (= |~#var_1_11~0.base| ~var_1_11_Pointer~0.base) (= ~var_1_7_Pointer~0.offset |~#var_1_7~0.offset|) (= |~#var_1_11~0.offset| ~var_1_11_Pointer~0.offset) (bvsge ((_ zero_extend 24) .cse0) (_ bv1 32)) (= ~var_1_3_Pointer~0.offset (_ bv0 32)) (exists ((v_arrayElimCell_35 (_ BitVec 32))) (let ((.cse1 ((_ extract 7 0) v_arrayElimCell_35))) (and (bvsle ((_ zero_extend 24) .cse1) (_ bv0 32)) (= ((_ sign_extend 24) .cse1) (select (select |#memory_int#5| ~var_1_6_Pointer~0.base) ~var_1_6_Pointer~0.offset))))) (= |~#var_1_13~0.offset| (_ bv0 32)) (= .cse0 |ULTIMATE.start_updateVariables_#t~mem72#1|) (bvsle ((_ zero_extend 24) ((_ extract 7 0) (select (select |#memory_int#6| ~var_1_7_Pointer~0.base) ~var_1_7_Pointer~0.offset))) (_ bv0 32)) (= |~#var_1_13~0.base| (_ bv15 32)) (bvule (select (select |#memory_int#4| (_ bv7 32)) (_ bv0 32)) (_ bv536870911 32)) (= |~#var_1_5~0.offset| (_ bv0 32)) (bvule .cse2 (_ bv2147483647 32)) (= ~var_1_4_Pointer~0.offset (_ bv0 32)) (= ~var_1_13_Pointer~0.offset (_ bv0 32)) (bvule .cse3 (_ bv1073741823 32)) (= ~var_1_4_Pointer~0.base (_ bv6 32)) (bvuge .cse2 (_ bv1073741823 32)) (= ~var_1_7_Pointer~0.base |~#var_1_7~0.base|) (= ~var_1_5_Pointer~0.base (_ bv7 32)) (= |~#var_1_5~0.base| (_ bv7 32)) (bvuge .cse3 (_ bv536870911 32)) (= (_ bv6 32) |~#var_1_4~0.base|) (= (_ bv15 32) ~var_1_13_Pointer~0.base))) [2023-12-24 16:50:43,215 INFO L899 garLoopResultBuilder]: For program point L100-1(line 100) no Hoare annotation was computed. [2023-12-24 16:50:43,215 INFO L899 garLoopResultBuilder]: For program point L67(line 67) no Hoare annotation was computed. [2023-12-24 16:50:43,215 INFO L899 garLoopResultBuilder]: For program point L67-2(lines 67 79) no Hoare annotation was computed. [2023-12-24 16:50:43,216 INFO L895 garLoopResultBuilder]: At program point L84(line 84) the Hoare annotation is: (let ((.cse37 (select (select |#memory_int#2| (_ bv5 32)) (_ bv0 32))) (.cse36 (select (select |#memory_int#3| (_ bv6 32)) (_ bv0 32))) (.cse39 ((_ zero_extend 24) ((_ extract 7 0) (select (select |#memory_int#10| ~var_1_11_Pointer~0.base) ~var_1_11_Pointer~0.offset))))) (let ((.cse0 (= |~#var_1_3~0.base| (_ bv5 32))) (.cse1 (= ~var_1_5_Pointer~0.offset (_ bv0 32))) (.cse2 (= |~#var_1_4~0.offset| (_ bv0 32))) (.cse5 (bvsle .cse39 (_ bv1 32))) (.cse6 (= |~#var_1_3~0.offset| (_ bv0 32))) (.cse7 (= ~var_1_3_Pointer~0.base (_ bv5 32))) (.cse8 (= |~#var_1_11~0.base| ~var_1_11_Pointer~0.base)) (.cse9 (= ~var_1_7_Pointer~0.offset |~#var_1_7~0.offset|)) (.cse10 (= |~#var_1_11~0.offset| ~var_1_11_Pointer~0.offset)) (.cse11 (bvsge .cse39 (_ bv1 32))) (.cse12 (= ~var_1_3_Pointer~0.offset (_ bv0 32))) (.cse13 (bvuge (select (select |#memory_int#12| (_ bv15 32)) (_ bv0 32)) (_ bv2147483647 32))) (.cse14 (exists ((v_arrayElimCell_35 (_ BitVec 32))) (let ((.cse38 ((_ extract 7 0) v_arrayElimCell_35))) (and (bvsle ((_ zero_extend 24) .cse38) (_ bv0 32)) (= ((_ sign_extend 24) .cse38) (select (select |#memory_int#5| ~var_1_6_Pointer~0.base) ~var_1_6_Pointer~0.offset)))))) (.cse15 (= |~#var_1_13~0.offset| (_ bv0 32))) (.cse16 (bvsle ((_ zero_extend 24) ((_ extract 7 0) (select (select |#memory_int#6| ~var_1_7_Pointer~0.base) ~var_1_7_Pointer~0.offset))) (_ bv0 32))) (.cse17 (= |~#var_1_13~0.base| (_ bv15 32))) (.cse18 (bvule (select (select |#memory_int#4| (_ bv7 32)) (_ bv0 32)) (_ bv536870911 32))) (.cse19 (= |~#var_1_5~0.offset| (_ bv0 32))) (.cse20 (= ~var_1_4_Pointer~0.offset (_ bv0 32))) (.cse21 (= ~var_1_13_Pointer~0.offset (_ bv0 32))) (.cse22 (bvule .cse36 (_ bv1073741823 32))) (.cse23 (= ~var_1_4_Pointer~0.base (_ bv6 32))) (.cse24 (bvuge .cse37 (_ bv1073741823 32))) (.cse25 (= ~var_1_7_Pointer~0.base |~#var_1_7~0.base|)) (.cse26 (= .cse37 |ULTIMATE.start_updateVariables_#t~mem44#1|)) (.cse27 (= ~var_1_5_Pointer~0.base (_ bv7 32))) (.cse28 (= |~#var_1_5~0.base| (_ bv7 32))) (.cse29 (bvuge .cse36 (_ bv536870911 32))) (.cse30 (= (_ bv6 32) |~#var_1_4~0.base|)) (.cse31 (= (_ bv15 32) ~var_1_13_Pointer~0.base))) (or (let ((.cse4 (= ((_ extract 7 0) (select (select |#memory_int#15| ~var_1_16_Pointer~0.base) ~var_1_16_Pointer~0.offset)) (_ bv0 8))) (.cse3 ((_ zero_extend 24) ((_ extract 7 0) (select (select |#memory_int#14| ~var_1_15_Pointer~0.base) ~var_1_15_Pointer~0.offset))))) (and .cse0 (= ((_ extract 15 0) ((_ sign_extend 16) ((_ extract 15 0) ((_ zero_extend 16) ((_ extract 15 0) (select (select |#memory_int#13| ~var_1_14_Pointer~0.base) ~var_1_14_Pointer~0.offset)))))) ((_ extract 15 0) (select (select |#memory_int#11| ~var_1_12_Pointer~0.base) ~var_1_12_Pointer~0.offset))) .cse1 .cse2 (or (= .cse3 (_ bv1 32)) .cse4) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 (or (not .cse4) (= .cse3 (_ bv0 32))) .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31)) (and .cse0 .cse1 .cse2 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (fp.gt (fp.mul currentRoundingMode (let ((.cse32 (let ((.cse33 (select |#memory_int#8| ~var_1_9_Pointer~0.base))) (concat (select .cse33 (bvadd (_ bv4 32) ~var_1_9_Pointer~0.offset)) (select .cse33 ~var_1_9_Pointer~0.offset))))) (fp ((_ extract 63 63) .cse32) ((_ extract 62 52) .cse32) ((_ extract 51 0) .cse32))) ((_ to_fp 11 53) currentRoundingMode ((_ to_fp 8 24) currentRoundingMode (/ 33.0 2.0)))) (let ((.cse34 (let ((.cse35 (select |#memory_int#9| ~var_1_10_Pointer~0.base))) (concat (select .cse35 (bvadd ~var_1_10_Pointer~0.offset (_ bv4 32))) (select .cse35 ~var_1_10_Pointer~0.offset))))) (fp ((_ extract 63 63) .cse34) ((_ extract 62 52) .cse34) ((_ extract 51 0) .cse34)))) .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31)))) [2023-12-24 16:50:43,216 INFO L899 garLoopResultBuilder]: For program point L84-1(line 84) no Hoare annotation was computed. [2023-12-24 16:50:43,216 INFO L899 garLoopResultBuilder]: For program point L68(lines 68 76) no Hoare annotation was computed. [2023-12-24 16:50:43,219 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] [2023-12-24 16:50:43,220 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-24 16:50:43,242 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#13[~var_1_14_Pointer~0!base][~var_1_14_Pointer~0!offset] could not be translated [2023-12-24 16:50:43,243 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#11[~var_1_12_Pointer~0!base][~var_1_12_Pointer~0!offset] could not be translated [2023-12-24 16:50:43,243 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#14[~var_1_15_Pointer~0!base][~var_1_15_Pointer~0!offset] could not be translated [2023-12-24 16:50:43,243 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#15[~var_1_16_Pointer~0!base][~var_1_16_Pointer~0!offset] could not be translated [2023-12-24 16:50:43,243 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#10[~var_1_11_Pointer~0!base][~var_1_11_Pointer~0!offset] could not be translated [2023-12-24 16:50:43,244 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#10[~var_1_11_Pointer~0!base][~var_1_11_Pointer~0!offset] could not be translated [2023-12-24 16:50:43,244 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#12[15bv32][0bv32] could not be translated [2023-12-24 16:50:43,244 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_arrayElimCell_35 : bv32 :: ~bvsle~64(~zero_extend~32~8(v_arrayElimCell_35[7:0]), 0bv32) && ~sign_extend~32~16(v_arrayElimCell_35[7:0]) == #memory_int#5[~var_1_6_Pointer~0!base][~var_1_6_Pointer~0!offset]) could not be translated [2023-12-24 16:50:43,244 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#6[~var_1_7_Pointer~0!base][~var_1_7_Pointer~0!offset] could not be translated [2023-12-24 16:50:43,244 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#15[~var_1_16_Pointer~0!base][~var_1_16_Pointer~0!offset] could not be translated [2023-12-24 16:50:43,244 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#14[~var_1_15_Pointer~0!base][~var_1_15_Pointer~0!offset] could not be translated [2023-12-24 16:50:43,244 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#4[7bv32][0bv32] could not be translated [2023-12-24 16:50:43,244 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[5bv32][0bv32] could not be translated [2023-12-24 16:50:43,244 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[6bv32][0bv32] could not be translated [2023-12-24 16:50:43,244 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[5bv32][0bv32] could not be translated [2023-12-24 16:50:43,245 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[6bv32][0bv32] could not be translated [2023-12-24 16:50:43,245 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#10[~var_1_11_Pointer~0!base][~var_1_11_Pointer~0!offset] could not be translated [2023-12-24 16:50:43,245 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#10[~var_1_11_Pointer~0!base][~var_1_11_Pointer~0!offset] could not be translated [2023-12-24 16:50:43,245 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#12[15bv32][0bv32] could not be translated [2023-12-24 16:50:43,245 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_arrayElimCell_35 : bv32 :: ~bvsle~64(~zero_extend~32~8(v_arrayElimCell_35[7:0]), 0bv32) && ~sign_extend~32~16(v_arrayElimCell_35[7:0]) == #memory_int#5[~var_1_6_Pointer~0!base][~var_1_6_Pointer~0!offset]) could not be translated [2023-12-24 16:50:43,245 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#6[~var_1_7_Pointer~0!base][~var_1_7_Pointer~0!offset] could not be translated [2023-12-24 16:50:43,246 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#4[7bv32][0bv32] could not be translated [2023-12-24 16:50:43,246 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[5bv32][0bv32] could not be translated [2023-12-24 16:50:43,246 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[6bv32][0bv32] could not be translated [2023-12-24 16:50:43,246 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[5bv32][0bv32] could not be translated [2023-12-24 16:50:43,247 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[6bv32][0bv32] could not be translated [2023-12-24 16:50:43,250 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.12 04:50:43 BoogieIcfgContainer [2023-12-24 16:50:43,250 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-24 16:50:43,251 INFO L158 Benchmark]: Toolchain (without parser) took 375675.00ms. Allocated memory was 250.6MB in the beginning and 832.6MB in the end (delta: 582.0MB). Free memory was 196.4MB in the beginning and 442.5MB in the end (delta: -246.1MB). Peak memory consumption was 498.4MB. Max. memory is 8.0GB. [2023-12-24 16:50:43,251 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 208.7MB. Free memory is still 156.3MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-24 16:50:43,251 INFO L158 Benchmark]: CACSL2BoogieTranslator took 259.61ms. Allocated memory is still 250.6MB. Free memory was 195.9MB in the beginning and 180.6MB in the end (delta: 15.2MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. [2023-12-24 16:50:43,251 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.09ms. Allocated memory is still 250.6MB. Free memory was 180.6MB in the beginning and 177.5MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-24 16:50:43,251 INFO L158 Benchmark]: Boogie Preprocessor took 104.21ms. Allocated memory is still 250.6MB. Free memory was 177.5MB in the beginning and 169.0MB in the end (delta: 8.5MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2023-12-24 16:50:43,251 INFO L158 Benchmark]: RCFGBuilder took 1549.80ms. Allocated memory is still 250.6MB. Free memory was 169.0MB in the beginning and 188.9MB in the end (delta: -19.8MB). Peak memory consumption was 44.7MB. Max. memory is 8.0GB. [2023-12-24 16:50:43,251 INFO L158 Benchmark]: TraceAbstraction took 373702.29ms. Allocated memory was 250.6MB in the beginning and 832.6MB in the end (delta: 582.0MB). Free memory was 188.4MB in the beginning and 442.5MB in the end (delta: -254.1MB). Peak memory consumption was 489.3MB. Max. memory is 8.0GB. [2023-12-24 16:50:43,252 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.14ms. Allocated memory is still 208.7MB. Free memory is still 156.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 259.61ms. Allocated memory is still 250.6MB. Free memory was 195.9MB in the beginning and 180.6MB in the end (delta: 15.2MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 55.09ms. Allocated memory is still 250.6MB. Free memory was 180.6MB in the beginning and 177.5MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 104.21ms. Allocated memory is still 250.6MB. Free memory was 177.5MB in the beginning and 169.0MB in the end (delta: 8.5MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * RCFGBuilder took 1549.80ms. Allocated memory is still 250.6MB. Free memory was 169.0MB in the beginning and 188.9MB in the end (delta: -19.8MB). Peak memory consumption was 44.7MB. Max. memory is 8.0GB. * TraceAbstraction took 373702.29ms. Allocated memory was 250.6MB in the beginning and 832.6MB in the end (delta: 582.0MB). Free memory was 188.4MB in the beginning and 442.5MB in the end (delta: -254.1MB). Peak memory consumption was 489.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#13[~var_1_14_Pointer~0!base][~var_1_14_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#11[~var_1_12_Pointer~0!base][~var_1_12_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#14[~var_1_15_Pointer~0!base][~var_1_15_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#15[~var_1_16_Pointer~0!base][~var_1_16_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#10[~var_1_11_Pointer~0!base][~var_1_11_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#10[~var_1_11_Pointer~0!base][~var_1_11_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#12[15bv32][0bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_arrayElimCell_35 : bv32 :: ~bvsle~64(~zero_extend~32~8(v_arrayElimCell_35[7:0]), 0bv32) && ~sign_extend~32~16(v_arrayElimCell_35[7:0]) == #memory_int#5[~var_1_6_Pointer~0!base][~var_1_6_Pointer~0!offset]) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#6[~var_1_7_Pointer~0!base][~var_1_7_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#15[~var_1_16_Pointer~0!base][~var_1_16_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#14[~var_1_15_Pointer~0!base][~var_1_15_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#4[7bv32][0bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[5bv32][0bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[6bv32][0bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[5bv32][0bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[6bv32][0bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#10[~var_1_11_Pointer~0!base][~var_1_11_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#10[~var_1_11_Pointer~0!base][~var_1_11_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#12[15bv32][0bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_arrayElimCell_35 : bv32 :: ~bvsle~64(~zero_extend~32~8(v_arrayElimCell_35[7:0]), 0bv32) && ~sign_extend~32~16(v_arrayElimCell_35[7:0]) == #memory_int#5[~var_1_6_Pointer~0!base][~var_1_6_Pointer~0!offset]) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#6[~var_1_7_Pointer~0!base][~var_1_7_Pointer~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#4[7bv32][0bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[5bv32][0bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[6bv32][0bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[5bv32][0bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[6bv32][0bv32] 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, 105 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 373.6s, OverallIterations: 24, TraceHistogramMax: 18, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 98.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 143.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 3 mSolverCounterUnknown, 4280 SdHoareTripleChecker+Valid, 52.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4278 mSDsluCounter, 18885 SdHoareTripleChecker+Invalid, 49.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 15394 mSDsCounter, 727 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5273 IncrementalHoareTripleChecker+Invalid, 6003 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 727 mSolverCounterUnsat, 3491 mSDtfsCounter, 5273 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 6142 GetRequests, 5614 SyntacticMatches, 6 SemanticMatches, 522 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 5455 ImplicationChecksByTransitivity, 98.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=471occurred in iteration=23, InterpolantAutomatonStates: 238, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 24 MinimizatonAttempts, 448 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 20 LocationsWithAnnotation, 617 PreInvPairs, 668 NumberOfFragments, 5265 HoareAnnotationTreeSize, 617 FormulaSimplifications, 98829 FormulaSimplificationTreeSizeReduction, 3.9s HoareSimplificationTime, 20 FormulaSimplificationsInter, 169974 FormulaSimplificationTreeSizeReductionInter, 139.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 1.3s SsaConstructionTime, 9.0s SatisfiabilityAnalysisTime, 109.6s InterpolantComputationTime, 4450 NumberOfCodeBlocks, 4450 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 5591 ConstructedInterpolants, 60 QuantifiedInterpolants, 56894 SizeOfPredicates, 416 NumberOfNonLiveVariables, 12032 ConjunctsInSsa, 455 ConjunctsInUnsatCore, 39 InterpolantComputations, 18 PerfectInterpolantSequences, 18589/23868 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: 120]: Loop Invariant Derived loop invariant: ((((((((((null & 32767) & 32767) & 32767) == (null & 32767)) && (((null & 127) == 1) || ((null & 127) == 0))) && ((null & 127) <= 1)) && ((null & 127) >= 1)) && ((null & 127) <= 0)) && (!(((null & 127) == 0)) || ((null & 127) == 0))) || ((((null & 127) <= 1) && ((null & 127) >= 1)) && ((null & 127) <= 0))) RESULT: Ultimate proved your program to be correct! [2023-12-24 16:50:43,385 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...