/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-3.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-24 13:07:59,795 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-24 13:07:59,874 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-12-24 13:07:59,879 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-24 13:07:59,880 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-24 13:07:59,908 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-24 13:07:59,908 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-24 13:07:59,908 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-24 13:07:59,909 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-24 13:07:59,912 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-24 13:07:59,912 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-24 13:07:59,912 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-24 13:07:59,913 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-24 13:07:59,914 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-24 13:07:59,914 INFO L153 SettingsManager]: * Use SBE=true [2023-12-24 13:07:59,914 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-24 13:07:59,914 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-24 13:07:59,915 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-24 13:07:59,915 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-24 13:07:59,916 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-24 13:07:59,916 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-24 13:07:59,916 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-24 13:07:59,916 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-24 13:07:59,916 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-24 13:07:59,916 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-24 13:07:59,917 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-24 13:07:59,917 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-24 13:07:59,917 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-24 13:07:59,917 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-24 13:07:59,917 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-24 13:07:59,918 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-24 13:07:59,918 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-24 13:07:59,918 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-24 13:07:59,918 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-24 13:07:59,918 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-24 13:07:59,918 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-24 13:07:59,919 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-24 13:07:59,919 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-24 13:07:59,919 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-24 13:07:59,919 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-24 13:07:59,919 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-24 13:07:59,919 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-24 13:07:59,919 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-24 13:07:59,919 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-24 13:07:59,920 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-24 13:07:59,920 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-24 13:07:59,920 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2023-12-24 13:08:00,107 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-24 13:08:00,122 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-24 13:08:00,124 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-24 13:08:00,124 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-24 13:08:00,125 INFO L274 PluginConnector]: CDTParser initialized [2023-12-24 13:08:00,126 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-3.i [2023-12-24 13:08:01,211 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-24 13:08:01,377 INFO L384 CDTParser]: Found 1 translation units. [2023-12-24 13:08:01,377 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-3.i [2023-12-24 13:08:01,383 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b65c28051/fde60207c8344bf7ad57b9de8b906d38/FLAG326c56567 [2023-12-24 13:08:01,809 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b65c28051/fde60207c8344bf7ad57b9de8b906d38 [2023-12-24 13:08:01,811 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-24 13:08:01,811 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-24 13:08:01,812 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-24 13:08:01,812 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-24 13:08:01,815 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-24 13:08:01,816 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.12 01:08:01" (1/1) ... [2023-12-24 13:08:01,817 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a5bc803 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 01:08:01, skipping insertion in model container [2023-12-24 13:08:01,817 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.12 01:08:01" (1/1) ... [2023-12-24 13:08:01,843 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-24 13:08:01,960 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-3.i[915,928] [2023-12-24 13:08:02,037 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-24 13:08:02,053 INFO L202 MainTranslator]: Completed pre-run [2023-12-24 13:08:02,066 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-3.i[915,928] [2023-12-24 13:08:02,117 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-24 13:08:02,134 INFO L206 MainTranslator]: Completed translation [2023-12-24 13:08:02,134 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 01:08:02 WrapperNode [2023-12-24 13:08:02,135 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-24 13:08:02,136 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-24 13:08:02,136 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-24 13:08:02,136 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-24 13:08:02,141 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 01:08:02" (1/1) ... [2023-12-24 13:08:02,162 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 01:08:02" (1/1) ... [2023-12-24 13:08:02,192 INFO L138 Inliner]: procedures = 33, calls = 181, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 625 [2023-12-24 13:08:02,193 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-24 13:08:02,193 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-24 13:08:02,193 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-24 13:08:02,193 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-24 13:08:02,200 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 01:08:02" (1/1) ... [2023-12-24 13:08:02,201 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 01:08:02" (1/1) ... [2023-12-24 13:08:02,206 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 01:08:02" (1/1) ... [2023-12-24 13:08:02,219 INFO L175 MemorySlicer]: Split 151 memory accesses to 4 slices as follows [2, 31, 75, 43]. 50 percent of accesses are in the largest equivalence class. The 16 initializations are split as follows [2, 4, 5, 5]. The 17 writes are split as follows [0, 5, 6, 6]. [2023-12-24 13:08:02,219 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 01:08:02" (1/1) ... [2023-12-24 13:08:02,219 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 01:08:02" (1/1) ... [2023-12-24 13:08:02,237 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 01:08:02" (1/1) ... [2023-12-24 13:08:02,240 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 01:08:02" (1/1) ... [2023-12-24 13:08:02,243 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 01:08:02" (1/1) ... [2023-12-24 13:08:02,245 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 01:08:02" (1/1) ... [2023-12-24 13:08:02,249 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-24 13:08:02,250 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-24 13:08:02,250 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-24 13:08:02,250 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-24 13:08:02,251 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 01:08:02" (1/1) ... [2023-12-24 13:08:02,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-24 13:08:02,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-24 13:08:02,272 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-12-24 13:08:02,305 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-12-24 13:08:02,307 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-24 13:08:02,307 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2023-12-24 13:08:02,307 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2023-12-24 13:08:02,307 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#2 [2023-12-24 13:08:02,308 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#3 [2023-12-24 13:08:02,308 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2023-12-24 13:08:02,308 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2023-12-24 13:08:02,308 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#2 [2023-12-24 13:08:02,308 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#3 [2023-12-24 13:08:02,308 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2023-12-24 13:08:02,308 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2023-12-24 13:08:02,308 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2023-12-24 13:08:02,308 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2023-12-24 13:08:02,308 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-24 13:08:02,309 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-12-24 13:08:02,309 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2023-12-24 13:08:02,309 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2023-12-24 13:08:02,309 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2023-12-24 13:08:02,309 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2023-12-24 13:08:02,309 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2023-12-24 13:08:02,309 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2023-12-24 13:08:02,309 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2023-12-24 13:08:02,309 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2023-12-24 13:08:02,309 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#2 [2023-12-24 13:08:02,309 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#3 [2023-12-24 13:08:02,310 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2023-12-24 13:08:02,310 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2023-12-24 13:08:02,310 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2023-12-24 13:08:02,310 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2023-12-24 13:08:02,310 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-24 13:08:02,310 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-24 13:08:02,310 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-24 13:08:02,310 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-24 13:08:02,310 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2023-12-24 13:08:02,310 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2023-12-24 13:08:02,311 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2023-12-24 13:08:02,311 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2023-12-24 13:08:02,311 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2023-12-24 13:08:02,311 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2023-12-24 13:08:02,311 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2023-12-24 13:08:02,311 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2023-12-24 13:08:02,442 INFO L241 CfgBuilder]: Building ICFG [2023-12-24 13:08:02,444 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-24 13:08:03,734 INFO L282 CfgBuilder]: Performing block encoding [2023-12-24 13:08:03,770 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-24 13:08:03,771 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-24 13:08:03,771 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.12 01:08:03 BoogieIcfgContainer [2023-12-24 13:08:03,771 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-24 13:08:03,772 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-24 13:08:03,772 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-24 13:08:03,774 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-24 13:08:03,774 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.12 01:08:01" (1/3) ... [2023-12-24 13:08:03,775 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fbcce6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.12 01:08:03, skipping insertion in model container [2023-12-24 13:08:03,775 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 01:08:02" (2/3) ... [2023-12-24 13:08:03,775 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fbcce6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.12 01:08:03, skipping insertion in model container [2023-12-24 13:08:03,775 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.12 01:08:03" (3/3) ... [2023-12-24 13:08:03,776 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-3.i [2023-12-24 13:08:03,786 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-24 13:08:03,786 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-24 13:08:03,826 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-24 13:08:03,831 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;@3d84dab7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-24 13:08:03,831 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-24 13:08:03,834 INFO L276 IsEmpty]: Start isEmpty. Operand has 142 states, 123 states have (on average 1.4878048780487805) internal successors, (183), 124 states have internal predecessors, (183), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-12-24 13:08:03,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2023-12-24 13:08:03,846 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 13:08:03,847 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 13:08:03,847 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 13:08:03,851 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 13:08:03,851 INFO L85 PathProgramCache]: Analyzing trace with hash -33667426, now seen corresponding path program 1 times [2023-12-24 13:08:03,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 13:08:03,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1917938142] [2023-12-24 13:08:03,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 13:08:03,863 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 13:08:03,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 13:08:03,865 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 13:08:03,868 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-12-24 13:08:04,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 13:08:04,117 INFO L262 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-24 13:08:04,122 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 13:08:04,171 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 246 proven. 0 refuted. 0 times theorem prover too weak. 234 trivial. 0 not checked. [2023-12-24 13:08:04,171 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 13:08:04,171 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 13:08:04,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1917938142] [2023-12-24 13:08:04,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1917938142] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 13:08:04,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 13:08:04,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-24 13:08:04,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073259115] [2023-12-24 13:08:04,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 13:08:04,178 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-24 13:08:04,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 13:08:04,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-24 13:08:04,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-24 13:08:04,236 INFO L87 Difference]: Start difference. First operand has 142 states, 123 states have (on average 1.4878048780487805) internal successors, (183), 124 states have internal predecessors, (183), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 27.5) internal successors, (55), 2 states have internal predecessors, (55), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2023-12-24 13:08:04,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 13:08:04,293 INFO L93 Difference]: Finished difference Result 281 states and 444 transitions. [2023-12-24 13:08:04,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-24 13:08:04,295 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 27.5) internal successors, (55), 2 states have internal predecessors, (55), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 128 [2023-12-24 13:08:04,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 13:08:04,303 INFO L225 Difference]: With dead ends: 281 [2023-12-24 13:08:04,304 INFO L226 Difference]: Without dead ends: 140 [2023-12-24 13:08:04,307 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-24 13:08:04,310 INFO L413 NwaCegarLoop]: 206 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, 206 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-24 13:08:04,311 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 206 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-24 13:08:04,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2023-12-24 13:08:04,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2023-12-24 13:08:04,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 122 states have (on average 1.459016393442623) internal successors, (178), 122 states have internal predecessors, (178), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-12-24 13:08:04,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 210 transitions. [2023-12-24 13:08:04,358 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 210 transitions. Word has length 128 [2023-12-24 13:08:04,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 13:08:04,358 INFO L495 AbstractCegarLoop]: Abstraction has 140 states and 210 transitions. [2023-12-24 13:08:04,359 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 27.5) internal successors, (55), 2 states have internal predecessors, (55), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2023-12-24 13:08:04,359 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 210 transitions. [2023-12-24 13:08:04,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2023-12-24 13:08:04,365 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 13:08:04,365 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 13:08:04,375 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-12-24 13:08:04,572 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 13:08:04,574 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 13:08:04,574 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 13:08:04,574 INFO L85 PathProgramCache]: Analyzing trace with hash 1613584390, now seen corresponding path program 1 times [2023-12-24 13:08:04,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 13:08:04,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [292544643] [2023-12-24 13:08:04,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 13:08:04,577 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 13:08:04,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 13:08:04,578 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 13:08:04,579 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-12-24 13:08:04,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 13:08:04,822 INFO L262 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-24 13:08:04,826 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 13:08:04,852 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 240 proven. 0 refuted. 0 times theorem prover too weak. 240 trivial. 0 not checked. [2023-12-24 13:08:04,852 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 13:08:04,852 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 13:08:04,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [292544643] [2023-12-24 13:08:04,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [292544643] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 13:08:04,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 13:08:04,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-24 13:08:04,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150862381] [2023-12-24 13:08:04,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 13:08:04,854 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-24 13:08:04,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 13:08:04,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-24 13:08:04,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-24 13:08:04,855 INFO L87 Difference]: Start difference. First operand 140 states and 210 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2023-12-24 13:08:04,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 13:08:04,934 INFO L93 Difference]: Finished difference Result 285 states and 428 transitions. [2023-12-24 13:08:04,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-24 13:08:04,935 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 128 [2023-12-24 13:08:04,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 13:08:04,936 INFO L225 Difference]: With dead ends: 285 [2023-12-24 13:08:04,936 INFO L226 Difference]: Without dead ends: 146 [2023-12-24 13:08:04,936 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-24 13:08:04,937 INFO L413 NwaCegarLoop]: 205 mSDtfsCounter, 10 mSDsluCounter, 402 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 607 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-24 13:08:04,937 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 607 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-24 13:08:04,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2023-12-24 13:08:04,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 142. [2023-12-24 13:08:04,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 124 states have (on average 1.4516129032258065) internal successors, (180), 124 states have internal predecessors, (180), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-12-24 13:08:04,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 212 transitions. [2023-12-24 13:08:04,945 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 212 transitions. Word has length 128 [2023-12-24 13:08:04,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 13:08:04,945 INFO L495 AbstractCegarLoop]: Abstraction has 142 states and 212 transitions. [2023-12-24 13:08:04,945 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2023-12-24 13:08:04,945 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 212 transitions. [2023-12-24 13:08:04,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2023-12-24 13:08:04,946 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 13:08:04,946 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 13:08:04,957 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-12-24 13:08:05,155 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 13:08:05,156 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 13:08:05,156 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 13:08:05,156 INFO L85 PathProgramCache]: Analyzing trace with hash -802251960, now seen corresponding path program 1 times [2023-12-24 13:08:05,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 13:08:05,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1767063960] [2023-12-24 13:08:05,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 13:08:05,157 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 13:08:05,157 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 13:08:05,158 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 13:08:05,185 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-12-24 13:08:05,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 13:08:05,366 INFO L262 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-24 13:08:05,369 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 13:08:05,385 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-12-24 13:08:05,386 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 13:08:05,386 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 13:08:05,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1767063960] [2023-12-24 13:08:05,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1767063960] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 13:08:05,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 13:08:05,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-24 13:08:05,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428765895] [2023-12-24 13:08:05,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 13:08:05,387 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-24 13:08:05,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 13:08:05,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-24 13:08:05,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-24 13:08:05,388 INFO L87 Difference]: Start difference. First operand 142 states and 212 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-24 13:08:05,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 13:08:05,424 INFO L93 Difference]: Finished difference Result 321 states and 481 transitions. [2023-12-24 13:08:05,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-24 13:08:05,425 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 128 [2023-12-24 13:08:05,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 13:08:05,426 INFO L225 Difference]: With dead ends: 321 [2023-12-24 13:08:05,426 INFO L226 Difference]: Without dead ends: 180 [2023-12-24 13:08:05,439 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-24 13:08:05,441 INFO L413 NwaCegarLoop]: 252 mSDtfsCounter, 67 mSDsluCounter, 444 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 696 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-24 13:08:05,441 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 696 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-24 13:08:05,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2023-12-24 13:08:05,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 144. [2023-12-24 13:08:05,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 126 states have (on average 1.4444444444444444) internal successors, (182), 126 states have internal predecessors, (182), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-12-24 13:08:05,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 214 transitions. [2023-12-24 13:08:05,459 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 214 transitions. Word has length 128 [2023-12-24 13:08:05,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 13:08:05,460 INFO L495 AbstractCegarLoop]: Abstraction has 144 states and 214 transitions. [2023-12-24 13:08:05,460 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-24 13:08:05,460 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 214 transitions. [2023-12-24 13:08:05,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2023-12-24 13:08:05,461 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 13:08:05,461 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 13:08:05,470 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 13:08:05,663 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 13:08:05,664 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 13:08:05,664 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 13:08:05,664 INFO L85 PathProgramCache]: Analyzing trace with hash -1500969418, now seen corresponding path program 1 times [2023-12-24 13:08:05,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 13:08:05,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2066629991] [2023-12-24 13:08:05,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 13:08:05,665 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 13:08:05,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 13:08:05,666 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 13:08:05,687 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-12-24 13:08:05,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 13:08:05,875 INFO L262 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-24 13:08:05,878 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 13:08:05,911 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2023-12-24 13:08:06,059 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-12-24 13:08:06,059 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 13:08:06,059 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 13:08:06,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2066629991] [2023-12-24 13:08:06,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2066629991] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 13:08:06,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 13:08:06,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-24 13:08:06,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020788382] [2023-12-24 13:08:06,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 13:08:06,060 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-24 13:08:06,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 13:08:06,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-24 13:08:06,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-24 13:08:06,061 INFO L87 Difference]: Start difference. First operand 144 states and 214 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-24 13:08:06,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 13:08:06,212 INFO L93 Difference]: Finished difference Result 491 states and 730 transitions. [2023-12-24 13:08:06,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-24 13:08:06,213 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 130 [2023-12-24 13:08:06,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 13:08:06,215 INFO L225 Difference]: With dead ends: 491 [2023-12-24 13:08:06,215 INFO L226 Difference]: Without dead ends: 348 [2023-12-24 13:08:06,215 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-24 13:08:06,216 INFO L413 NwaCegarLoop]: 190 mSDtfsCounter, 379 mSDsluCounter, 384 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 379 SdHoareTripleChecker+Valid, 574 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-24 13:08:06,216 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [379 Valid, 574 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-24 13:08:06,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2023-12-24 13:08:06,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 303. [2023-12-24 13:08:06,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 303 states, 268 states have (on average 1.4440298507462686) internal successors, (387), 268 states have internal predecessors, (387), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2023-12-24 13:08:06,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 451 transitions. [2023-12-24 13:08:06,229 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 451 transitions. Word has length 130 [2023-12-24 13:08:06,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 13:08:06,229 INFO L495 AbstractCegarLoop]: Abstraction has 303 states and 451 transitions. [2023-12-24 13:08:06,229 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-24 13:08:06,230 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 451 transitions. [2023-12-24 13:08:06,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2023-12-24 13:08:06,230 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 13:08:06,231 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 13:08:06,244 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-12-24 13:08:06,438 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 13:08:06,438 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 13:08:06,439 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 13:08:06,439 INFO L85 PathProgramCache]: Analyzing trace with hash -153492275, now seen corresponding path program 1 times [2023-12-24 13:08:06,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 13:08:06,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [303324171] [2023-12-24 13:08:06,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 13:08:06,440 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 13:08:06,440 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 13:08:06,441 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 13:08:06,476 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-12-24 13:08:06,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 13:08:06,723 INFO L262 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-24 13:08:06,727 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 13:08:06,742 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 28 treesize of output 12 [2023-12-24 13:08:06,765 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 23 treesize of output 22 [2023-12-24 13:08:07,357 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 13:08:07,357 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 13 [2023-12-24 13:08:07,366 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 368 trivial. 0 not checked. [2023-12-24 13:08:07,367 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 13:08:07,367 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 13:08:07,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [303324171] [2023-12-24 13:08:07,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [303324171] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 13:08:07,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 13:08:07,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-24 13:08:07,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841328325] [2023-12-24 13:08:07,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 13:08:07,368 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-24 13:08:07,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 13:08:07,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-24 13:08:07,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-24 13:08:07,368 INFO L87 Difference]: Start difference. First operand 303 states and 451 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2023-12-24 13:08:07,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 13:08:07,511 INFO L93 Difference]: Finished difference Result 607 states and 902 transitions. [2023-12-24 13:08:07,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-24 13:08:07,512 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 130 [2023-12-24 13:08:07,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 13:08:07,513 INFO L225 Difference]: With dead ends: 607 [2023-12-24 13:08:07,513 INFO L226 Difference]: Without dead ends: 305 [2023-12-24 13:08:07,514 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-24 13:08:07,515 INFO L413 NwaCegarLoop]: 286 mSDtfsCounter, 130 mSDsluCounter, 657 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 943 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-24 13:08:07,515 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 943 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-24 13:08:07,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2023-12-24 13:08:07,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 303. [2023-12-24 13:08:07,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 303 states, 268 states have (on average 1.4402985074626866) internal successors, (386), 268 states have internal predecessors, (386), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2023-12-24 13:08:07,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 450 transitions. [2023-12-24 13:08:07,526 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 450 transitions. Word has length 130 [2023-12-24 13:08:07,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 13:08:07,526 INFO L495 AbstractCegarLoop]: Abstraction has 303 states and 450 transitions. [2023-12-24 13:08:07,527 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2023-12-24 13:08:07,527 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 450 transitions. [2023-12-24 13:08:07,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2023-12-24 13:08:07,528 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 13:08:07,528 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 13:08:07,550 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-12-24 13:08:07,736 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 13:08:07,736 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 13:08:07,737 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 13:08:07,737 INFO L85 PathProgramCache]: Analyzing trace with hash 821857413, now seen corresponding path program 1 times [2023-12-24 13:08:07,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 13:08:07,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1593914056] [2023-12-24 13:08:07,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 13:08:07,737 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 13:08:07,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 13:08:07,738 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 13:08:07,743 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-12-24 13:08:08,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 13:08:08,039 INFO L262 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 12 conjunts are in the unsatisfiable core [2023-12-24 13:08:08,042 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 13:08:08,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 1 [2023-12-24 13:08:08,081 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2023-12-24 13:08:08,629 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 76 treesize of output 56 [2023-12-24 13:08:08,631 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-24 13:08:08,634 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 13:08:08,635 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 80 [2023-12-24 13:08:08,652 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 33 [2023-12-24 13:08:08,710 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 13:08:08,710 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 17 [2023-12-24 13:08:08,723 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 73 proven. 42 refuted. 0 times theorem prover too weak. 365 trivial. 0 not checked. [2023-12-24 13:08:08,724 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 13:08:09,010 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 3 proven. 42 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2023-12-24 13:08:09,011 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 13:08:09,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1593914056] [2023-12-24 13:08:09,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1593914056] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 13:08:09,011 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 13:08:09,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 14 [2023-12-24 13:08:09,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395755559] [2023-12-24 13:08:09,011 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 13:08:09,012 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-24 13:08:09,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 13:08:09,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-24 13:08:09,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2023-12-24 13:08:09,013 INFO L87 Difference]: Start difference. First operand 303 states and 450 transitions. Second operand has 14 states, 12 states have (on average 8.083333333333334) internal successors, (97), 14 states have internal predecessors, (97), 5 states have call successors, (31), 2 states have call predecessors, (31), 4 states have return successors, (31), 3 states have call predecessors, (31), 5 states have call successors, (31) [2023-12-24 13:08:09,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 13:08:09,889 INFO L93 Difference]: Finished difference Result 740 states and 1087 transitions. [2023-12-24 13:08:09,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-12-24 13:08:09,890 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), 5 states have call successors, (31), 2 states have call predecessors, (31), 4 states have return successors, (31), 3 states have call predecessors, (31), 5 states have call successors, (31) Word has length 131 [2023-12-24 13:08:09,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 13:08:09,892 INFO L225 Difference]: With dead ends: 740 [2023-12-24 13:08:09,892 INFO L226 Difference]: Without dead ends: 574 [2023-12-24 13:08:09,892 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 277 GetRequests, 248 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=197, Invalid=673, Unknown=0, NotChecked=0, Total=870 [2023-12-24 13:08:09,893 INFO L413 NwaCegarLoop]: 267 mSDtfsCounter, 1401 mSDsluCounter, 1584 mSDsCounter, 0 mSdLazyCounter, 490 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1403 SdHoareTripleChecker+Valid, 1851 SdHoareTripleChecker+Invalid, 549 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 490 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-24 13:08:09,893 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1403 Valid, 1851 Invalid, 549 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 490 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-24 13:08:09,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2023-12-24 13:08:09,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 480. [2023-12-24 13:08:09,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 480 states, 425 states have (on average 1.4329411764705882) internal successors, (609), 425 states have internal predecessors, (609), 48 states have call successors, (48), 6 states have call predecessors, (48), 6 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2023-12-24 13:08:09,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 480 states to 480 states and 705 transitions. [2023-12-24 13:08:09,913 INFO L78 Accepts]: Start accepts. Automaton has 480 states and 705 transitions. Word has length 131 [2023-12-24 13:08:09,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 13:08:09,913 INFO L495 AbstractCegarLoop]: Abstraction has 480 states and 705 transitions. [2023-12-24 13:08:09,914 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), 5 states have call successors, (31), 2 states have call predecessors, (31), 4 states have return successors, (31), 3 states have call predecessors, (31), 5 states have call successors, (31) [2023-12-24 13:08:09,914 INFO L276 IsEmpty]: Start isEmpty. Operand 480 states and 705 transitions. [2023-12-24 13:08:09,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2023-12-24 13:08:09,914 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 13:08:09,915 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 13:08:09,925 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2023-12-24 13:08:10,125 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 13:08:10,125 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 13:08:10,126 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 13:08:10,126 INFO L85 PathProgramCache]: Analyzing trace with hash 607847271, now seen corresponding path program 1 times [2023-12-24 13:08:10,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 13:08:10,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2069511155] [2023-12-24 13:08:10,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 13:08:10,127 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 13:08:10,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 13:08:10,128 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 13:08:10,159 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-12-24 13:08:10,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 13:08:10,366 INFO L262 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-24 13:08:10,369 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 13:08:10,394 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2023-12-24 13:08:10,440 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-12-24 13:08:10,440 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 13:08:10,440 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 13:08:10,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2069511155] [2023-12-24 13:08:10,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2069511155] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 13:08:10,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 13:08:10,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-24 13:08:10,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397332578] [2023-12-24 13:08:10,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 13:08:10,441 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-24 13:08:10,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 13:08:10,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-24 13:08:10,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-24 13:08:10,442 INFO L87 Difference]: Start difference. First operand 480 states and 705 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-24 13:08:12,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 13:08:12,187 INFO L93 Difference]: Finished difference Result 1226 states and 1807 transitions. [2023-12-24 13:08:12,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-24 13:08:12,188 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 132 [2023-12-24 13:08:12,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 13:08:12,190 INFO L225 Difference]: With dead ends: 1226 [2023-12-24 13:08:12,190 INFO L226 Difference]: Without dead ends: 747 [2023-12-24 13:08:12,191 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-12-24 13:08:12,192 INFO L413 NwaCegarLoop]: 251 mSDtfsCounter, 348 mSDsluCounter, 681 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 348 SdHoareTripleChecker+Valid, 932 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2023-12-24 13:08:12,192 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [348 Valid, 932 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2023-12-24 13:08:12,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 747 states. [2023-12-24 13:08:12,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 747 to 476. [2023-12-24 13:08:12,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 476 states, 421 states have (on average 1.4275534441805227) internal successors, (601), 421 states have internal predecessors, (601), 48 states have call successors, (48), 6 states have call predecessors, (48), 6 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2023-12-24 13:08:12,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 476 states to 476 states and 697 transitions. [2023-12-24 13:08:12,212 INFO L78 Accepts]: Start accepts. Automaton has 476 states and 697 transitions. Word has length 132 [2023-12-24 13:08:12,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 13:08:12,213 INFO L495 AbstractCegarLoop]: Abstraction has 476 states and 697 transitions. [2023-12-24 13:08:12,213 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-24 13:08:12,213 INFO L276 IsEmpty]: Start isEmpty. Operand 476 states and 697 transitions. [2023-12-24 13:08:12,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2023-12-24 13:08:12,214 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 13:08:12,214 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 13:08:12,221 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2023-12-24 13:08:12,421 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 13:08:12,422 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 13:08:12,422 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 13:08:12,422 INFO L85 PathProgramCache]: Analyzing trace with hash -747223041, now seen corresponding path program 1 times [2023-12-24 13:08:12,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 13:08:12,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [239203645] [2023-12-24 13:08:12,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 13:08:12,423 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 13:08:12,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 13:08:12,431 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 13:08:12,462 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-12-24 13:08:12,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 13:08:12,666 INFO L262 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-24 13:08:12,670 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 13:08:12,678 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 13:08:12,685 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2023-12-24 13:08:12,692 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-12-24 13:08:12,692 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 13:08:12,692 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 13:08:12,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [239203645] [2023-12-24 13:08:12,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [239203645] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 13:08:12,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 13:08:12,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-24 13:08:12,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438695764] [2023-12-24 13:08:12,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 13:08:12,693 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-24 13:08:12,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 13:08:12,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-24 13:08:12,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-24 13:08:12,694 INFO L87 Difference]: Start difference. First operand 476 states and 697 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, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-24 13:08:12,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 13:08:12,839 INFO L93 Difference]: Finished difference Result 965 states and 1414 transitions. [2023-12-24 13:08:12,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-24 13:08:12,840 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, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 133 [2023-12-24 13:08:12,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 13:08:12,842 INFO L225 Difference]: With dead ends: 965 [2023-12-24 13:08:12,842 INFO L226 Difference]: Without dead ends: 655 [2023-12-24 13:08:12,842 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-12-24 13:08:12,842 INFO L413 NwaCegarLoop]: 253 mSDtfsCounter, 202 mSDsluCounter, 689 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 942 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-24 13:08:12,843 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 942 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-24 13:08:12,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2023-12-24 13:08:12,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 478. [2023-12-24 13:08:12,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 478 states, 423 states have (on average 1.425531914893617) internal successors, (603), 423 states have internal predecessors, (603), 48 states have call successors, (48), 6 states have call predecessors, (48), 6 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2023-12-24 13:08:12,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 478 states to 478 states and 699 transitions. [2023-12-24 13:08:12,863 INFO L78 Accepts]: Start accepts. Automaton has 478 states and 699 transitions. Word has length 133 [2023-12-24 13:08:12,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 13:08:12,865 INFO L495 AbstractCegarLoop]: Abstraction has 478 states and 699 transitions. [2023-12-24 13:08:12,866 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, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-24 13:08:12,866 INFO L276 IsEmpty]: Start isEmpty. Operand 478 states and 699 transitions. [2023-12-24 13:08:12,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2023-12-24 13:08:12,866 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 13:08:12,867 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 13:08:12,873 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2023-12-24 13:08:13,073 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 13:08:13,073 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 13:08:13,074 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 13:08:13,074 INFO L85 PathProgramCache]: Analyzing trace with hash 1858800513, now seen corresponding path program 1 times [2023-12-24 13:08:13,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 13:08:13,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1629973534] [2023-12-24 13:08:13,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 13:08:13,074 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 13:08:13,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 13:08:13,076 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 13:08:13,102 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-12-24 13:08:13,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 13:08:13,384 INFO L262 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 15 conjunts are in the unsatisfiable core [2023-12-24 13:08:13,387 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 13:08:13,390 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2023-12-24 13:08:13,476 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 36 treesize of output 29 [2023-12-24 13:08:14,303 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 13:08:14,304 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 40 [2023-12-24 13:08:14,353 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 13:08:14,354 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 48 treesize of output 22 [2023-12-24 13:08:14,375 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 73 proven. 42 refuted. 0 times theorem prover too weak. 365 trivial. 0 not checked. [2023-12-24 13:08:14,376 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 13:08:14,664 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 3 proven. 42 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2023-12-24 13:08:14,664 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 13:08:14,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1629973534] [2023-12-24 13:08:14,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1629973534] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 13:08:14,664 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 13:08:14,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 18 [2023-12-24 13:08:14,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102540361] [2023-12-24 13:08:14,665 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 13:08:14,665 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-12-24 13:08:14,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 13:08:14,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-12-24 13:08:14,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=234, Unknown=0, NotChecked=0, Total=306 [2023-12-24 13:08:14,666 INFO L87 Difference]: Start difference. First operand 478 states and 699 transitions. Second operand has 18 states, 16 states have (on average 6.5625) internal successors, (105), 17 states have internal predecessors, (105), 6 states have call successors, (32), 3 states have call predecessors, (32), 5 states have return successors, (32), 5 states have call predecessors, (32), 6 states have call successors, (32) [2023-12-24 13:08:15,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 13:08:15,558 INFO L93 Difference]: Finished difference Result 713 states and 1037 transitions. [2023-12-24 13:08:15,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-12-24 13:08:15,559 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 6.5625) internal successors, (105), 17 states have internal predecessors, (105), 6 states have call successors, (32), 3 states have call predecessors, (32), 5 states have return successors, (32), 5 states have call predecessors, (32), 6 states have call successors, (32) Word has length 133 [2023-12-24 13:08:15,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 13:08:15,560 INFO L225 Difference]: With dead ends: 713 [2023-12-24 13:08:15,560 INFO L226 Difference]: Without dead ends: 402 [2023-12-24 13:08:15,561 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 278 GetRequests, 249 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=224, Invalid=706, Unknown=0, NotChecked=0, Total=930 [2023-12-24 13:08:15,562 INFO L413 NwaCegarLoop]: 264 mSDtfsCounter, 824 mSDsluCounter, 1676 mSDsCounter, 0 mSdLazyCounter, 475 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 824 SdHoareTripleChecker+Valid, 1940 SdHoareTripleChecker+Invalid, 533 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 475 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-24 13:08:15,562 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [824 Valid, 1940 Invalid, 533 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 475 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-24 13:08:15,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2023-12-24 13:08:15,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 311. [2023-12-24 13:08:15,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 311 states, 274 states have (on average 1.416058394160584) internal successors, (388), 274 states have internal predecessors, (388), 32 states have call successors, (32), 4 states have call predecessors, (32), 4 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2023-12-24 13:08:15,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 452 transitions. [2023-12-24 13:08:15,575 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 452 transitions. Word has length 133 [2023-12-24 13:08:15,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 13:08:15,575 INFO L495 AbstractCegarLoop]: Abstraction has 311 states and 452 transitions. [2023-12-24 13:08:15,575 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 6.5625) internal successors, (105), 17 states have internal predecessors, (105), 6 states have call successors, (32), 3 states have call predecessors, (32), 5 states have return successors, (32), 5 states have call predecessors, (32), 6 states have call successors, (32) [2023-12-24 13:08:15,575 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 452 transitions. [2023-12-24 13:08:15,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2023-12-24 13:08:15,576 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 13:08:15,576 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 13:08:15,584 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2023-12-24 13:08:15,784 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 13:08:15,785 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 13:08:15,785 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 13:08:15,785 INFO L85 PathProgramCache]: Analyzing trace with hash 1685879021, now seen corresponding path program 1 times [2023-12-24 13:08:15,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 13:08:15,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1600673790] [2023-12-24 13:08:15,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 13:08:15,786 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 13:08:15,786 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 13:08:15,787 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 13:08:15,788 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2023-12-24 13:08:16,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 13:08:16,293 INFO L262 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 43 conjunts are in the unsatisfiable core [2023-12-24 13:08:16,296 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 13:08:16,303 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 8 treesize of output 1 [2023-12-24 13:08:16,340 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2023-12-24 13:08:16,534 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 13:08:16,534 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 26 [2023-12-24 13:08:16,611 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 26 [2023-12-24 13:08:17,305 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 13:08:17,305 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 84 treesize of output 57 [2023-12-24 13:08:30,191 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 332 proven. 21 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2023-12-24 13:08:30,191 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 13:08:30,771 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-12-24 13:08:30,771 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 13:08:30,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1600673790] [2023-12-24 13:08:30,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1600673790] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-24 13:08:30,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-24 13:08:30,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [30] total 35 [2023-12-24 13:08:30,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350189186] [2023-12-24 13:08:30,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 13:08:30,772 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-24 13:08:30,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 13:08:30,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-24 13:08:30,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=1027, Unknown=0, NotChecked=0, Total=1190 [2023-12-24 13:08:30,773 INFO L87 Difference]: Start difference. First operand 311 states and 452 transitions. Second operand has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-24 13:08:31,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 13:08:31,752 INFO L93 Difference]: Finished difference Result 975 states and 1421 transitions. [2023-12-24 13:08:31,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-24 13:08:31,753 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 134 [2023-12-24 13:08:31,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 13:08:31,755 INFO L225 Difference]: With dead ends: 975 [2023-12-24 13:08:31,755 INFO L226 Difference]: Without dead ends: 665 [2023-12-24 13:08:31,756 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 274 GetRequests, 233 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 454 ImplicationChecksByTransitivity, 13.9s TimeCoverageRelationStatistics Valid=226, Invalid=1580, Unknown=0, NotChecked=0, Total=1806 [2023-12-24 13:08:31,756 INFO L413 NwaCegarLoop]: 289 mSDtfsCounter, 461 mSDsluCounter, 1718 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 461 SdHoareTripleChecker+Valid, 2007 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-24 13:08:31,756 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [461 Valid, 2007 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-24 13:08:31,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 665 states. [2023-12-24 13:08:31,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 665 to 569. [2023-12-24 13:08:31,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 569 states, 512 states have (on average 1.421875) internal successors, (728), 514 states have internal predecessors, (728), 48 states have call successors, (48), 8 states have call predecessors, (48), 8 states have return successors, (48), 46 states have call predecessors, (48), 48 states have call successors, (48) [2023-12-24 13:08:31,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 569 states to 569 states and 824 transitions. [2023-12-24 13:08:31,777 INFO L78 Accepts]: Start accepts. Automaton has 569 states and 824 transitions. Word has length 134 [2023-12-24 13:08:31,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 13:08:31,778 INFO L495 AbstractCegarLoop]: Abstraction has 569 states and 824 transitions. [2023-12-24 13:08:31,778 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-24 13:08:31,778 INFO L276 IsEmpty]: Start isEmpty. Operand 569 states and 824 transitions. [2023-12-24 13:08:31,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2023-12-24 13:08:31,779 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 13:08:31,779 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 13:08:31,787 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2023-12-24 13:08:31,987 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 13:08:31,987 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 13:08:31,988 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 13:08:31,988 INFO L85 PathProgramCache]: Analyzing trace with hash 1292852011, now seen corresponding path program 1 times [2023-12-24 13:08:31,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 13:08:31,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1716217011] [2023-12-24 13:08:31,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 13:08:31,988 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 13:08:31,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 13:08:31,989 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 13:08:31,991 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2023-12-24 13:08:32,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 13:08:32,286 INFO L262 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-24 13:08:32,289 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 13:08:32,293 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 8 treesize of output 1 [2023-12-24 13:08:32,304 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 27 treesize of output 11 [2023-12-24 13:08:32,326 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 13:08:32,332 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-12-24 13:08:32,332 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 13:08:32,332 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 13:08:32,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1716217011] [2023-12-24 13:08:32,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1716217011] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 13:08:32,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 13:08:32,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-24 13:08:32,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769395518] [2023-12-24 13:08:32,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 13:08:32,332 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-24 13:08:32,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 13:08:32,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-24 13:08:32,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-24 13:08:32,333 INFO L87 Difference]: Start difference. First operand 569 states and 824 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-24 13:08:32,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 13:08:32,488 INFO L93 Difference]: Finished difference Result 1279 states and 1855 transitions. [2023-12-24 13:08:32,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-24 13:08:32,489 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 134 [2023-12-24 13:08:32,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 13:08:32,492 INFO L225 Difference]: With dead ends: 1279 [2023-12-24 13:08:32,492 INFO L226 Difference]: Without dead ends: 711 [2023-12-24 13:08:32,493 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-12-24 13:08:32,493 INFO L413 NwaCegarLoop]: 236 mSDtfsCounter, 269 mSDsluCounter, 638 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 269 SdHoareTripleChecker+Valid, 874 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-24 13:08:32,494 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [269 Valid, 874 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-24 13:08:32,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 711 states. [2023-12-24 13:08:32,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 711 to 563. [2023-12-24 13:08:32,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 563 states, 506 states have (on average 1.4209486166007905) internal successors, (719), 508 states have internal predecessors, (719), 48 states have call successors, (48), 8 states have call predecessors, (48), 8 states have return successors, (48), 46 states have call predecessors, (48), 48 states have call successors, (48) [2023-12-24 13:08:32,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 563 states and 815 transitions. [2023-12-24 13:08:32,515 INFO L78 Accepts]: Start accepts. Automaton has 563 states and 815 transitions. Word has length 134 [2023-12-24 13:08:32,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 13:08:32,515 INFO L495 AbstractCegarLoop]: Abstraction has 563 states and 815 transitions. [2023-12-24 13:08:32,515 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-24 13:08:32,515 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 815 transitions. [2023-12-24 13:08:32,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2023-12-24 13:08:32,516 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 13:08:32,516 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 13:08:32,524 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2023-12-24 13:08:32,723 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 13:08:32,724 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 13:08:32,724 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 13:08:32,724 INFO L85 PathProgramCache]: Analyzing trace with hash -3064721, now seen corresponding path program 1 times [2023-12-24 13:08:32,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 13:08:32,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1840529452] [2023-12-24 13:08:32,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 13:08:32,725 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 13:08:32,725 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 13:08:32,726 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 13:08:32,728 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2023-12-24 13:08:33,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 13:08:33,071 INFO L262 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-24 13:08:33,074 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 13:08:33,078 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 8 treesize of output 1 [2023-12-24 13:08:33,093 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 28 treesize of output 12 [2023-12-24 13:08:33,106 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 13:08:33,113 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-12-24 13:08:33,113 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 13:08:33,113 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 13:08:33,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1840529452] [2023-12-24 13:08:33,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1840529452] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 13:08:33,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 13:08:33,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-24 13:08:33,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186661363] [2023-12-24 13:08:33,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 13:08:33,114 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-24 13:08:33,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 13:08:33,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-24 13:08:33,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-24 13:08:33,114 INFO L87 Difference]: Start difference. First operand 563 states and 815 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-24 13:08:33,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 13:08:33,262 INFO L93 Difference]: Finished difference Result 1169 states and 1687 transitions. [2023-12-24 13:08:33,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-24 13:08:33,262 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 134 [2023-12-24 13:08:33,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 13:08:33,264 INFO L225 Difference]: With dead ends: 1169 [2023-12-24 13:08:33,264 INFO L226 Difference]: Without dead ends: 607 [2023-12-24 13:08:33,265 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-12-24 13:08:33,265 INFO L413 NwaCegarLoop]: 313 mSDtfsCounter, 257 mSDsluCounter, 808 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 1121 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-24 13:08:33,265 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [257 Valid, 1121 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-24 13:08:33,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2023-12-24 13:08:33,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 413. [2023-12-24 13:08:33,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 413 states, 374 states have (on average 1.4064171122994653) internal successors, (526), 374 states have internal predecessors, (526), 32 states have call successors, (32), 6 states have call predecessors, (32), 6 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2023-12-24 13:08:33,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 590 transitions. [2023-12-24 13:08:33,282 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 590 transitions. Word has length 134 [2023-12-24 13:08:33,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 13:08:33,282 INFO L495 AbstractCegarLoop]: Abstraction has 413 states and 590 transitions. [2023-12-24 13:08:33,282 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-24 13:08:33,282 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 590 transitions. [2023-12-24 13:08:33,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2023-12-24 13:08:33,283 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 13:08:33,283 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 13:08:33,306 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2023-12-24 13:08:33,490 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 13:08:33,490 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 13:08:33,491 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 13:08:33,491 INFO L85 PathProgramCache]: Analyzing trace with hash -396091731, now seen corresponding path program 1 times [2023-12-24 13:08:33,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 13:08:33,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1429934458] [2023-12-24 13:08:33,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 13:08:33,491 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 13:08:33,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 13:08:33,492 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 13:08:33,493 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2023-12-24 13:08:34,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 13:08:34,035 INFO L262 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 43 conjunts are in the unsatisfiable core [2023-12-24 13:08:34,039 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 13:08:34,042 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 8 treesize of output 1 [2023-12-24 13:08:34,076 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2023-12-24 13:08:34,327 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 13:08:34,328 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 26 [2023-12-24 13:08:34,408 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 26 [2023-12-24 13:08:35,056 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 13:08:35,057 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 84 treesize of output 57 [2023-12-24 13:08:50,722 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 303 proven. 18 refuted. 0 times theorem prover too weak. 159 trivial. 0 not checked. [2023-12-24 13:08:50,722 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 13:08:51,205 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-12-24 13:08:51,205 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 13:08:51,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1429934458] [2023-12-24 13:08:51,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1429934458] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-24 13:08:51,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-24 13:08:51,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [30] total 35 [2023-12-24 13:08:51,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258921627] [2023-12-24 13:08:51,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 13:08:51,205 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-24 13:08:51,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 13:08:51,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-24 13:08:51,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=1027, Unknown=0, NotChecked=0, Total=1190 [2023-12-24 13:08:51,206 INFO L87 Difference]: Start difference. First operand 413 states and 590 transitions. Second operand has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-24 13:08:51,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 13:08:51,968 INFO L93 Difference]: Finished difference Result 1019 states and 1460 transitions. [2023-12-24 13:08:51,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-24 13:08:51,969 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 134 [2023-12-24 13:08:51,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 13:08:51,971 INFO L225 Difference]: With dead ends: 1019 [2023-12-24 13:08:51,971 INFO L226 Difference]: Without dead ends: 607 [2023-12-24 13:08:51,972 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 233 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 397 ImplicationChecksByTransitivity, 16.5s TimeCoverageRelationStatistics Valid=208, Invalid=1432, Unknown=0, NotChecked=0, Total=1640 [2023-12-24 13:08:51,972 INFO L413 NwaCegarLoop]: 355 mSDtfsCounter, 409 mSDsluCounter, 2164 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 409 SdHoareTripleChecker+Valid, 2519 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-24 13:08:51,972 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [409 Valid, 2519 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-24 13:08:51,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2023-12-24 13:08:51,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 407. [2023-12-24 13:08:51,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 407 states, 368 states have (on average 1.4103260869565217) internal successors, (519), 368 states have internal predecessors, (519), 32 states have call successors, (32), 6 states have call predecessors, (32), 6 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2023-12-24 13:08:51,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 583 transitions. [2023-12-24 13:08:51,989 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 583 transitions. Word has length 134 [2023-12-24 13:08:51,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 13:08:51,990 INFO L495 AbstractCegarLoop]: Abstraction has 407 states and 583 transitions. [2023-12-24 13:08:51,990 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-24 13:08:51,990 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 583 transitions. [2023-12-24 13:08:51,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2023-12-24 13:08:51,991 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 13:08:51,991 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 13:08:51,999 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2023-12-24 13:08:52,198 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 13:08:52,199 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 13:08:52,199 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 13:08:52,199 INFO L85 PathProgramCache]: Analyzing trace with hash 55058594, now seen corresponding path program 1 times [2023-12-24 13:08:52,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 13:08:52,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1155399974] [2023-12-24 13:08:52,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 13:08:52,200 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 13:08:52,200 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 13:08:52,201 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 13:08:52,202 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2023-12-24 13:08:52,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 13:08:52,475 INFO L262 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-24 13:08:52,478 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 13:08:52,491 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-12-24 13:08:52,492 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 13:08:52,492 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 13:08:52,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1155399974] [2023-12-24 13:08:52,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1155399974] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 13:08:52,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 13:08:52,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-24 13:08:52,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108179347] [2023-12-24 13:08:52,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 13:08:52,494 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-24 13:08:52,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 13:08:52,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-24 13:08:52,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-24 13:08:52,496 INFO L87 Difference]: Start difference. First operand 407 states and 583 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-24 13:08:52,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 13:08:52,560 INFO L93 Difference]: Finished difference Result 863 states and 1241 transitions. [2023-12-24 13:08:52,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-24 13:08:52,561 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 136 [2023-12-24 13:08:52,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 13:08:52,562 INFO L225 Difference]: With dead ends: 863 [2023-12-24 13:08:52,562 INFO L226 Difference]: Without dead ends: 457 [2023-12-24 13:08:52,563 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 132 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 13:08:52,563 INFO L413 NwaCegarLoop]: 201 mSDtfsCounter, 144 mSDsluCounter, 556 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 757 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 13:08:52,563 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 757 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-24 13:08:52,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2023-12-24 13:08:52,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 413. [2023-12-24 13:08:52,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 413 states, 374 states have (on average 1.4037433155080214) internal successors, (525), 374 states have internal predecessors, (525), 32 states have call successors, (32), 6 states have call predecessors, (32), 6 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2023-12-24 13:08:52,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 589 transitions. [2023-12-24 13:08:52,590 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 589 transitions. Word has length 136 [2023-12-24 13:08:52,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 13:08:52,591 INFO L495 AbstractCegarLoop]: Abstraction has 413 states and 589 transitions. [2023-12-24 13:08:52,591 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-24 13:08:52,591 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 589 transitions. [2023-12-24 13:08:52,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2023-12-24 13:08:52,592 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 13:08:52,592 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 13:08:52,612 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2023-12-24 13:08:52,798 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 13:08:52,799 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 13:08:52,799 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 13:08:52,799 INFO L85 PathProgramCache]: Analyzing trace with hash -1363234947, now seen corresponding path program 1 times [2023-12-24 13:08:52,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 13:08:52,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [698085757] [2023-12-24 13:08:52,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 13:08:52,800 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 13:08:52,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 13:08:52,801 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 13:08:52,802 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2023-12-24 13:08:53,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 13:08:53,118 INFO L262 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 16 conjunts are in the unsatisfiable core [2023-12-24 13:08:53,121 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 13:08:53,128 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 23 treesize of output 22 [2023-12-24 13:08:53,258 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 13:08:53,258 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 30 [2023-12-24 13:08:54,116 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 13:08:54,116 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 164 treesize of output 96 [2023-12-24 13:08:54,183 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 73 proven. 42 refuted. 0 times theorem prover too weak. 365 trivial. 0 not checked. [2023-12-24 13:08:54,183 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 13:08:55,290 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 3 proven. 42 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2023-12-24 13:08:55,290 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 13:08:55,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [698085757] [2023-12-24 13:08:55,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [698085757] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 13:08:55,290 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 13:08:55,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 20 [2023-12-24 13:08:55,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379342036] [2023-12-24 13:08:55,290 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 13:08:55,291 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-12-24 13:08:55,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 13:08:55,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-12-24 13:08:55,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=306, Unknown=0, NotChecked=0, Total=380 [2023-12-24 13:08:55,291 INFO L87 Difference]: Start difference. First operand 413 states and 589 transitions. Second operand has 20 states, 18 states have (on average 7.0) internal successors, (126), 20 states have internal predecessors, (126), 6 states have call successors, (32), 3 states have call predecessors, (32), 5 states have return successors, (32), 4 states have call predecessors, (32), 6 states have call successors, (32) [2023-12-24 13:08:56,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 13:08:56,527 INFO L93 Difference]: Finished difference Result 1359 states and 1954 transitions. [2023-12-24 13:08:56,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2023-12-24 13:08:56,527 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 7.0) internal successors, (126), 20 states have internal predecessors, (126), 6 states have call successors, (32), 3 states have call predecessors, (32), 5 states have return successors, (32), 4 states have call predecessors, (32), 6 states have call successors, (32) Word has length 138 [2023-12-24 13:08:56,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 13:08:56,530 INFO L225 Difference]: With dead ends: 1359 [2023-12-24 13:08:56,530 INFO L226 Difference]: Without dead ends: 947 [2023-12-24 13:08:56,531 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 295 GetRequests, 256 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 329 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=381, Invalid=1259, Unknown=0, NotChecked=0, Total=1640 [2023-12-24 13:08:56,531 INFO L413 NwaCegarLoop]: 198 mSDtfsCounter, 1193 mSDsluCounter, 2613 mSDsCounter, 0 mSdLazyCounter, 757 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1194 SdHoareTripleChecker+Valid, 2811 SdHoareTripleChecker+Invalid, 784 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 757 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-12-24 13:08:56,531 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1194 Valid, 2811 Invalid, 784 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 757 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-12-24 13:08:56,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 947 states. [2023-12-24 13:08:56,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 947 to 732. [2023-12-24 13:08:56,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 732 states, 674 states have (on average 1.4154302670623145) internal successors, (954), 674 states have internal predecessors, (954), 48 states have call successors, (48), 9 states have call predecessors, (48), 9 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2023-12-24 13:08:56,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 732 states to 732 states and 1050 transitions. [2023-12-24 13:08:56,574 INFO L78 Accepts]: Start accepts. Automaton has 732 states and 1050 transitions. Word has length 138 [2023-12-24 13:08:56,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 13:08:56,575 INFO L495 AbstractCegarLoop]: Abstraction has 732 states and 1050 transitions. [2023-12-24 13:08:56,575 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 18 states have (on average 7.0) internal successors, (126), 20 states have internal predecessors, (126), 6 states have call successors, (32), 3 states have call predecessors, (32), 5 states have return successors, (32), 4 states have call predecessors, (32), 6 states have call successors, (32) [2023-12-24 13:08:56,575 INFO L276 IsEmpty]: Start isEmpty. Operand 732 states and 1050 transitions. [2023-12-24 13:08:56,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2023-12-24 13:08:56,576 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 13:08:56,576 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 13:08:56,586 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 (16)] Ended with exit code 0 [2023-12-24 13:08:56,784 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 13:08:56,785 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 13:08:56,786 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 13:08:56,786 INFO L85 PathProgramCache]: Analyzing trace with hash -1059215981, now seen corresponding path program 1 times [2023-12-24 13:08:56,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 13:08:56,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1511791684] [2023-12-24 13:08:56,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 13:08:56,786 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 13:08:56,786 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 13:08:56,813 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 13:08:56,832 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2023-12-24 13:08:57,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 13:08:57,196 INFO L262 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 22 conjunts are in the unsatisfiable core [2023-12-24 13:08:57,199 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 13:08:57,272 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 8 treesize of output 1 [2023-12-24 13:08:57,825 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 13:08:57,825 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 188 treesize of output 98 [2023-12-24 13:08:58,185 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 13:08:58,186 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 384 treesize of output 134 [2023-12-24 13:08:58,257 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 252 refuted. 0 times theorem prover too weak. 228 trivial. 0 not checked. [2023-12-24 13:08:58,258 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 13:08:58,510 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 13:08:58,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1511791684] [2023-12-24 13:08:58,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1511791684] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-24 13:08:58,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1225663388] [2023-12-24 13:08:58,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 13:08:58,511 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-24 13:08:58,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-24 13:08:58,557 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-24 13:08:58,561 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (18)] Waiting until timeout for monitored process [2023-12-24 13:08:59,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 13:08:59,832 INFO L262 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 28 conjunts are in the unsatisfiable core [2023-12-24 13:08:59,836 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 13:09:00,165 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 8 [2023-12-24 13:09:01,257 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 13:09:01,258 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 158 treesize of output 96 [2023-12-24 13:09:01,922 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 13:09:01,922 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 291 treesize of output 147 [2023-12-24 13:09:01,942 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 252 refuted. 0 times theorem prover too weak. 228 trivial. 0 not checked. [2023-12-24 13:09:01,942 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 13:09:02,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1225663388] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-24 13:09:02,094 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 13:09:02,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2023-12-24 13:09:02,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619858352] [2023-12-24 13:09:02,094 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 13:09:02,103 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-12-24 13:09:02,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 13:09:02,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-12-24 13:09:02,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=356, Unknown=0, NotChecked=0, Total=420 [2023-12-24 13:09:02,104 INFO L87 Difference]: Start difference. First operand 732 states and 1050 transitions. Second operand has 17 states, 17 states have (on average 7.294117647058823) internal successors, (124), 16 states have internal predecessors, (124), 4 states have call successors, (32), 4 states have call predecessors, (32), 4 states have return successors, (32), 4 states have call predecessors, (32), 4 states have call successors, (32) [2023-12-24 13:09:06,106 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 13:09:12,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 13:09:12,077 INFO L93 Difference]: Finished difference Result 1826 states and 2585 transitions. [2023-12-24 13:09:12,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-24 13:09:12,078 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 7.294117647058823) internal successors, (124), 16 states have internal predecessors, (124), 4 states have call successors, (32), 4 states have call predecessors, (32), 4 states have return successors, (32), 4 states have call predecessors, (32), 4 states have call successors, (32) Word has length 138 [2023-12-24 13:09:12,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 13:09:12,083 INFO L225 Difference]: With dead ends: 1826 [2023-12-24 13:09:12,083 INFO L226 Difference]: Without dead ends: 1824 [2023-12-24 13:09:12,084 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 344 GetRequests, 312 SyntacticMatches, 3 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=177, Invalid=753, Unknown=0, NotChecked=0, Total=930 [2023-12-24 13:09:12,084 INFO L413 NwaCegarLoop]: 185 mSDtfsCounter, 705 mSDsluCounter, 1706 mSDsCounter, 0 mSdLazyCounter, 1562 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 706 SdHoareTripleChecker+Valid, 1891 SdHoareTripleChecker+Invalid, 1626 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 1562 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.4s IncrementalHoareTripleChecker+Time [2023-12-24 13:09:12,084 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [706 Valid, 1891 Invalid, 1626 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 1562 Invalid, 0 Unknown, 0 Unchecked, 9.4s Time] [2023-12-24 13:09:12,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1824 states. [2023-12-24 13:09:12,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1824 to 1799. [2023-12-24 13:09:12,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1799 states, 1657 states have (on average 1.3989136994568496) internal successors, (2318), 1663 states have internal predecessors, (2318), 117 states have call successors, (117), 24 states have call predecessors, (117), 24 states have return successors, (117), 111 states have call predecessors, (117), 117 states have call successors, (117) [2023-12-24 13:09:12,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1799 states to 1799 states and 2552 transitions. [2023-12-24 13:09:12,176 INFO L78 Accepts]: Start accepts. Automaton has 1799 states and 2552 transitions. Word has length 138 [2023-12-24 13:09:12,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 13:09:12,176 INFO L495 AbstractCegarLoop]: Abstraction has 1799 states and 2552 transitions. [2023-12-24 13:09:12,176 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 7.294117647058823) internal successors, (124), 16 states have internal predecessors, (124), 4 states have call successors, (32), 4 states have call predecessors, (32), 4 states have return successors, (32), 4 states have call predecessors, (32), 4 states have call successors, (32) [2023-12-24 13:09:12,176 INFO L276 IsEmpty]: Start isEmpty. Operand 1799 states and 2552 transitions. [2023-12-24 13:09:12,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2023-12-24 13:09:12,178 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 13:09:12,178 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 13:09:12,188 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2023-12-24 13:09:12,388 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (18)] Ended with exit code 0 [2023-12-24 13:09:12,578 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2023-12-24 13:09:12,578 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 13:09:12,579 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 13:09:12,579 INFO L85 PathProgramCache]: Analyzing trace with hash 817266837, now seen corresponding path program 1 times [2023-12-24 13:09:12,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 13:09:12,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [419531243] [2023-12-24 13:09:12,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 13:09:12,579 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 13:09:12,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 13:09:12,580 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 13:09:12,581 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2023-12-24 13:09:12,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 13:09:12,814 INFO L262 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-24 13:09:12,816 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 13:09:12,824 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 252 proven. 0 refuted. 0 times theorem prover too weak. 228 trivial. 0 not checked. [2023-12-24 13:09:12,824 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 13:09:12,824 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 13:09:12,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [419531243] [2023-12-24 13:09:12,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [419531243] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 13:09:12,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 13:09:12,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-24 13:09:12,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900499289] [2023-12-24 13:09:12,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 13:09:12,825 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-24 13:09:12,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 13:09:12,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-24 13:09:12,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-24 13:09:12,826 INFO L87 Difference]: Start difference. First operand 1799 states and 2552 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2023-12-24 13:09:12,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 13:09:12,956 INFO L93 Difference]: Finished difference Result 3609 states and 5121 transitions. [2023-12-24 13:09:12,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-24 13:09:12,956 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 138 [2023-12-24 13:09:12,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 13:09:12,962 INFO L225 Difference]: With dead ends: 3609 [2023-12-24 13:09:12,962 INFO L226 Difference]: Without dead ends: 1811 [2023-12-24 13:09:12,964 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-24 13:09:12,965 INFO L413 NwaCegarLoop]: 210 mSDtfsCounter, 7 mSDsluCounter, 399 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 609 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-24 13:09:12,965 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 609 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-24 13:09:12,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1811 states. [2023-12-24 13:09:13,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1811 to 1799. [2023-12-24 13:09:13,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1799 states, 1657 states have (on average 1.3971031985515994) internal successors, (2315), 1663 states have internal predecessors, (2315), 117 states have call successors, (117), 24 states have call predecessors, (117), 24 states have return successors, (117), 111 states have call predecessors, (117), 117 states have call successors, (117) [2023-12-24 13:09:13,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1799 states to 1799 states and 2549 transitions. [2023-12-24 13:09:13,049 INFO L78 Accepts]: Start accepts. Automaton has 1799 states and 2549 transitions. Word has length 138 [2023-12-24 13:09:13,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 13:09:13,049 INFO L495 AbstractCegarLoop]: Abstraction has 1799 states and 2549 transitions. [2023-12-24 13:09:13,049 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2023-12-24 13:09:13,049 INFO L276 IsEmpty]: Start isEmpty. Operand 1799 states and 2549 transitions. [2023-12-24 13:09:13,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2023-12-24 13:09:13,051 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 13:09:13,051 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 13:09:13,060 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2023-12-24 13:09:13,258 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 13:09:13,258 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 13:09:13,259 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 13:09:13,259 INFO L85 PathProgramCache]: Analyzing trace with hash -1326006345, now seen corresponding path program 1 times [2023-12-24 13:09:13,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 13:09:13,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1015161153] [2023-12-24 13:09:13,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 13:09:13,259 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 13:09:13,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 13:09:13,260 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 13:09:13,262 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2023-12-24 13:09:13,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 13:09:13,614 INFO L262 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-24 13:09:13,617 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 13:09:13,628 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2023-12-24 13:09:13,714 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 13:09:13,714 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 37 [2023-12-24 13:09:14,747 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 13:09:14,748 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 58 treesize of output 28 [2023-12-24 13:09:14,757 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 368 trivial. 0 not checked. [2023-12-24 13:09:14,757 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 13:09:14,757 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 13:09:14,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1015161153] [2023-12-24 13:09:14,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1015161153] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 13:09:14,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 13:09:14,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-24 13:09:14,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108554360] [2023-12-24 13:09:14,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 13:09:14,758 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-24 13:09:14,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 13:09:14,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-24 13:09:14,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-12-24 13:09:14,758 INFO L87 Difference]: Start difference. First operand 1799 states and 2549 transitions. Second operand has 6 states, 6 states have (on average 11.0) internal successors, (66), 5 states have internal predecessors, (66), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2023-12-24 13:09:15,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 13:09:15,056 INFO L93 Difference]: Finished difference Result 4749 states and 6731 transitions. [2023-12-24 13:09:15,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-24 13:09:15,056 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 5 states have internal predecessors, (66), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 140 [2023-12-24 13:09:15,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 13:09:15,064 INFO L225 Difference]: With dead ends: 4749 [2023-12-24 13:09:15,064 INFO L226 Difference]: Without dead ends: 2951 [2023-12-24 13:09:15,066 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-12-24 13:09:15,066 INFO L413 NwaCegarLoop]: 185 mSDtfsCounter, 124 mSDsluCounter, 737 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 922 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-24 13:09:15,066 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 922 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-24 13:09:15,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2951 states. [2023-12-24 13:09:15,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2951 to 2941. [2023-12-24 13:09:15,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2941 states, 2705 states have (on average 1.3940850277264325) internal successors, (3771), 2715 states have internal predecessors, (3771), 195 states have call successors, (195), 40 states have call predecessors, (195), 40 states have return successors, (195), 185 states have call predecessors, (195), 195 states have call successors, (195) [2023-12-24 13:09:15,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2941 states to 2941 states and 4161 transitions. [2023-12-24 13:09:15,210 INFO L78 Accepts]: Start accepts. Automaton has 2941 states and 4161 transitions. Word has length 140 [2023-12-24 13:09:15,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 13:09:15,210 INFO L495 AbstractCegarLoop]: Abstraction has 2941 states and 4161 transitions. [2023-12-24 13:09:15,210 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 5 states have internal predecessors, (66), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2023-12-24 13:09:15,210 INFO L276 IsEmpty]: Start isEmpty. Operand 2941 states and 4161 transitions. [2023-12-24 13:09:15,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2023-12-24 13:09:15,212 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 13:09:15,212 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 13:09:15,222 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2023-12-24 13:09:15,419 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 13:09:15,420 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 13:09:15,421 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 13:09:15,421 INFO L85 PathProgramCache]: Analyzing trace with hash -645947975, now seen corresponding path program 1 times [2023-12-24 13:09:15,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 13:09:15,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1061334193] [2023-12-24 13:09:15,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 13:09:15,421 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 13:09:15,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 13:09:15,433 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 13:09:15,485 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2023-12-24 13:09:15,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 13:09:15,774 INFO L262 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 17 conjunts are in the unsatisfiable core [2023-12-24 13:09:15,777 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 13:09:15,784 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 28 treesize of output 12 [2023-12-24 13:09:15,852 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 13:09:15,852 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 36 [2023-12-24 13:09:16,801 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 13:09:16,801 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 65 treesize of output 33 [2023-12-24 13:09:16,870 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 73 proven. 42 refuted. 0 times theorem prover too weak. 365 trivial. 0 not checked. [2023-12-24 13:09:16,871 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 13:09:17,803 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 3 proven. 42 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2023-12-24 13:09:17,803 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 13:09:17,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1061334193] [2023-12-24 13:09:17,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1061334193] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 13:09:17,803 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 13:09:17,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 24 [2023-12-24 13:09:17,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148950876] [2023-12-24 13:09:17,803 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 13:09:17,805 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-12-24 13:09:17,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 13:09:17,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-12-24 13:09:17,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=458, Unknown=0, NotChecked=0, Total=552 [2023-12-24 13:09:17,806 INFO L87 Difference]: Start difference. First operand 2941 states and 4161 transitions. Second operand has 24 states, 22 states have (on average 5.909090909090909) internal successors, (130), 23 states have internal predecessors, (130), 6 states have call successors, (32), 3 states have call predecessors, (32), 5 states have return successors, (32), 5 states have call predecessors, (32), 6 states have call successors, (32) [2023-12-24 13:09:19,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 13:09:19,797 INFO L93 Difference]: Finished difference Result 7403 states and 10559 transitions. [2023-12-24 13:09:19,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2023-12-24 13:09:19,798 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 22 states have (on average 5.909090909090909) internal successors, (130), 23 states have internal predecessors, (130), 6 states have call successors, (32), 3 states have call predecessors, (32), 5 states have return successors, (32), 5 states have call predecessors, (32), 6 states have call successors, (32) Word has length 140 [2023-12-24 13:09:19,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 13:09:19,808 INFO L225 Difference]: With dead ends: 7403 [2023-12-24 13:09:19,808 INFO L226 Difference]: Without dead ends: 4463 [2023-12-24 13:09:19,812 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 311 GetRequests, 256 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 733 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=666, Invalid=2526, Unknown=0, NotChecked=0, Total=3192 [2023-12-24 13:09:19,813 INFO L413 NwaCegarLoop]: 234 mSDtfsCounter, 1201 mSDsluCounter, 3487 mSDsCounter, 0 mSdLazyCounter, 992 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1202 SdHoareTripleChecker+Valid, 3721 SdHoareTripleChecker+Invalid, 1019 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 992 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-12-24 13:09:19,813 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1202 Valid, 3721 Invalid, 1019 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 992 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-12-24 13:09:19,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4463 states. [2023-12-24 13:09:19,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4463 to 2929. [2023-12-24 13:09:19,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2929 states, 2693 states have (on average 1.395841069439287) internal successors, (3759), 2703 states have internal predecessors, (3759), 195 states have call successors, (195), 40 states have call predecessors, (195), 40 states have return successors, (195), 185 states have call predecessors, (195), 195 states have call successors, (195) [2023-12-24 13:09:19,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2929 states to 2929 states and 4149 transitions. [2023-12-24 13:09:19,971 INFO L78 Accepts]: Start accepts. Automaton has 2929 states and 4149 transitions. Word has length 140 [2023-12-24 13:09:19,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 13:09:19,972 INFO L495 AbstractCegarLoop]: Abstraction has 2929 states and 4149 transitions. [2023-12-24 13:09:19,972 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 22 states have (on average 5.909090909090909) internal successors, (130), 23 states have internal predecessors, (130), 6 states have call successors, (32), 3 states have call predecessors, (32), 5 states have return successors, (32), 5 states have call predecessors, (32), 6 states have call successors, (32) [2023-12-24 13:09:19,972 INFO L276 IsEmpty]: Start isEmpty. Operand 2929 states and 4149 transitions. [2023-12-24 13:09:19,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2023-12-24 13:09:19,973 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 13:09:19,974 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 13:09:19,982 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Forceful destruction successful, exit code 0 [2023-12-24 13:09:20,181 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 13:09:20,182 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 13:09:20,182 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 13:09:20,182 INFO L85 PathProgramCache]: Analyzing trace with hash 1769392857, now seen corresponding path program 1 times [2023-12-24 13:09:20,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 13:09:20,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [674730161] [2023-12-24 13:09:20,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 13:09:20,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 13:09:20,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 13:09:20,184 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 13:09:20,184 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2023-12-24 13:09:20,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 13:09:20,569 INFO L262 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 24 conjunts are in the unsatisfiable core [2023-12-24 13:09:20,580 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 13:09:20,642 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 30 treesize of output 1 [2023-12-24 13:09:21,233 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 13:09:21,233 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 186 treesize of output 96 [2023-12-24 13:09:21,611 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 13:09:21,611 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 382 treesize of output 132 [2023-12-24 13:09:21,690 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 8 proven. 276 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2023-12-24 13:09:21,690 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 13:09:21,939 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 13:09:21,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [674730161] [2023-12-24 13:09:21,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [674730161] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-24 13:09:21,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1063050146] [2023-12-24 13:09:21,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 13:09:21,944 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-24 13:09:21,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-24 13:09:21,945 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-24 13:09:21,945 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (23)] Waiting until timeout for monitored process [2023-12-24 13:09:23,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 13:09:23,184 INFO L262 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 34 conjunts are in the unsatisfiable core [2023-12-24 13:09:23,187 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 13:09:23,516 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2023-12-24 13:09:27,212 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 13:09:27,213 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 164 treesize of output 98 [2023-12-24 13:09:27,697 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 13:09:27,698 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 324 treesize of output 140 [2023-12-24 13:09:27,718 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 8 proven. 276 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2023-12-24 13:09:27,718 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 13:09:27,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1063050146] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-24 13:09:27,879 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 13:09:27,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 23 [2023-12-24 13:09:27,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792970340] [2023-12-24 13:09:27,879 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 13:09:27,879 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-12-24 13:09:27,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 13:09:27,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-12-24 13:09:27,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=647, Unknown=1, NotChecked=0, Total=756 [2023-12-24 13:09:27,880 INFO L87 Difference]: Start difference. First operand 2929 states and 4149 transitions. Second operand has 24 states, 22 states have (on average 6.090909090909091) internal successors, (134), 21 states have internal predecessors, (134), 6 states have call successors, (32), 6 states have call predecessors, (32), 6 states have return successors, (32), 4 states have call predecessors, (32), 6 states have call successors, (32) [2023-12-24 13:09:41,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 13:09:41,527 INFO L93 Difference]: Finished difference Result 4755 states and 6680 transitions. [2023-12-24 13:09:41,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-12-24 13:09:41,528 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 22 states have (on average 6.090909090909091) internal successors, (134), 21 states have internal predecessors, (134), 6 states have call successors, (32), 6 states have call predecessors, (32), 6 states have return successors, (32), 4 states have call predecessors, (32), 6 states have call successors, (32) Word has length 140 [2023-12-24 13:09:41,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 13:09:41,539 INFO L225 Difference]: With dead ends: 4755 [2023-12-24 13:09:41,539 INFO L226 Difference]: Without dead ends: 4753 [2023-12-24 13:09:41,540 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 357 GetRequests, 309 SyntacticMatches, 3 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 480 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=406, Invalid=1755, Unknown=1, NotChecked=0, Total=2162 [2023-12-24 13:09:41,541 INFO L413 NwaCegarLoop]: 219 mSDtfsCounter, 819 mSDsluCounter, 2426 mSDsCounter, 0 mSdLazyCounter, 2811 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 820 SdHoareTripleChecker+Valid, 2645 SdHoareTripleChecker+Invalid, 2915 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 2811 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.4s IncrementalHoareTripleChecker+Time [2023-12-24 13:09:41,541 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [820 Valid, 2645 Invalid, 2915 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 2811 Invalid, 0 Unknown, 0 Unchecked, 12.4s Time] [2023-12-24 13:09:41,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4753 states. [2023-12-24 13:09:41,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4753 to 3790. [2023-12-24 13:09:41,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3790 states, 3499 states have (on average 1.3983995427264932) internal successors, (4893), 3509 states have internal predecessors, (4893), 240 states have call successors, (240), 50 states have call predecessors, (240), 50 states have return successors, (240), 230 states have call predecessors, (240), 240 states have call successors, (240) [2023-12-24 13:09:41,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3790 states to 3790 states and 5373 transitions. [2023-12-24 13:09:41,762 INFO L78 Accepts]: Start accepts. Automaton has 3790 states and 5373 transitions. Word has length 140 [2023-12-24 13:09:41,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 13:09:41,762 INFO L495 AbstractCegarLoop]: Abstraction has 3790 states and 5373 transitions. [2023-12-24 13:09:41,763 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 22 states have (on average 6.090909090909091) internal successors, (134), 21 states have internal predecessors, (134), 6 states have call successors, (32), 6 states have call predecessors, (32), 6 states have return successors, (32), 4 states have call predecessors, (32), 6 states have call successors, (32) [2023-12-24 13:09:41,763 INFO L276 IsEmpty]: Start isEmpty. Operand 3790 states and 5373 transitions. [2023-12-24 13:09:41,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2023-12-24 13:09:41,765 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 13:09:41,765 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 13:09:41,774 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (23)] Ended with exit code 0 [2023-12-24 13:09:41,983 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Forceful destruction successful, exit code 0 [2023-12-24 13:09:42,182 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 13:09:42,183 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 13:09:42,183 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 13:09:42,183 INFO L85 PathProgramCache]: Analyzing trace with hash -109738089, now seen corresponding path program 1 times [2023-12-24 13:09:42,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 13:09:42,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1652274882] [2023-12-24 13:09:42,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 13:09:42,184 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 13:09:42,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 13:09:42,185 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 13:09:42,187 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2023-12-24 13:09:42,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 13:09:42,429 INFO L262 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-24 13:09:42,431 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 13:09:42,451 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 277 proven. 0 refuted. 0 times theorem prover too weak. 203 trivial. 0 not checked. [2023-12-24 13:09:42,452 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 13:09:42,452 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 13:09:42,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1652274882] [2023-12-24 13:09:42,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1652274882] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 13:09:42,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 13:09:42,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-24 13:09:42,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499485623] [2023-12-24 13:09:42,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 13:09:42,454 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-24 13:09:42,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 13:09:42,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-24 13:09:42,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-24 13:09:42,455 INFO L87 Difference]: Start difference. First operand 3790 states and 5373 transitions. Second operand has 6 states, 5 states have (on average 13.8) internal successors, (69), 6 states have internal predecessors, (69), 3 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (16), 2 states have call predecessors, (16), 3 states have call successors, (16) [2023-12-24 13:09:42,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 13:09:42,743 INFO L93 Difference]: Finished difference Result 6498 states and 9166 transitions. [2023-12-24 13:09:42,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-24 13:09:42,744 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 13.8) internal successors, (69), 6 states have internal predecessors, (69), 3 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (16), 2 states have call predecessors, (16), 3 states have call successors, (16) Word has length 140 [2023-12-24 13:09:42,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 13:09:42,763 INFO L225 Difference]: With dead ends: 6498 [2023-12-24 13:09:42,763 INFO L226 Difference]: Without dead ends: 2679 [2023-12-24 13:09:42,768 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-12-24 13:09:42,769 INFO L413 NwaCegarLoop]: 187 mSDtfsCounter, 7 mSDsluCounter, 700 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 887 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-24 13:09:42,769 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 887 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-24 13:09:42,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2679 states. [2023-12-24 13:09:42,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2679 to 2639. [2023-12-24 13:09:42,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2639 states, 2443 states have (on average 1.391322144903807) internal successors, (3399), 2448 states have internal predecessors, (3399), 160 states have call successors, (160), 35 states have call predecessors, (160), 35 states have return successors, (160), 155 states have call predecessors, (160), 160 states have call successors, (160) [2023-12-24 13:09:42,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2639 states to 2639 states and 3719 transitions. [2023-12-24 13:09:42,900 INFO L78 Accepts]: Start accepts. Automaton has 2639 states and 3719 transitions. Word has length 140 [2023-12-24 13:09:42,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 13:09:42,900 INFO L495 AbstractCegarLoop]: Abstraction has 2639 states and 3719 transitions. [2023-12-24 13:09:42,900 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 13.8) internal successors, (69), 6 states have internal predecessors, (69), 3 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (16), 2 states have call predecessors, (16), 3 states have call successors, (16) [2023-12-24 13:09:42,900 INFO L276 IsEmpty]: Start isEmpty. Operand 2639 states and 3719 transitions. [2023-12-24 13:09:42,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2023-12-24 13:09:42,902 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 13:09:42,902 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 13:09:42,926 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 (24)] Ended with exit code 0 [2023-12-24 13:09:43,108 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 13:09:43,109 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 13:09:43,109 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 13:09:43,109 INFO L85 PathProgramCache]: Analyzing trace with hash -1683636049, now seen corresponding path program 1 times [2023-12-24 13:09:43,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 13:09:43,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [133677041] [2023-12-24 13:09:43,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 13:09:43,110 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 13:09:43,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 13:09:43,111 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 13:09:43,112 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2023-12-24 13:09:43,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 13:09:43,396 INFO L262 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-24 13:09:43,399 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 13:09:43,408 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2023-12-24 13:09:43,480 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 13:09:43,480 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 37 [2023-12-24 13:09:44,267 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 13:09:44,267 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 58 treesize of output 28 [2023-12-24 13:09:44,277 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 368 trivial. 0 not checked. [2023-12-24 13:09:44,277 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 13:09:44,277 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 13:09:44,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [133677041] [2023-12-24 13:09:44,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [133677041] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 13:09:44,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 13:09:44,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-24 13:09:44,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618294362] [2023-12-24 13:09:44,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 13:09:44,278 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-24 13:09:44,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 13:09:44,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-24 13:09:44,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-12-24 13:09:44,279 INFO L87 Difference]: Start difference. First operand 2639 states and 3719 transitions. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2023-12-24 13:09:44,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 13:09:44,604 INFO L93 Difference]: Finished difference Result 3995 states and 5637 transitions. [2023-12-24 13:09:44,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-24 13:09:44,605 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 141 [2023-12-24 13:09:44,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 13:09:44,611 INFO L225 Difference]: With dead ends: 3995 [2023-12-24 13:09:44,611 INFO L226 Difference]: Without dead ends: 2649 [2023-12-24 13:09:44,613 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-12-24 13:09:44,613 INFO L413 NwaCegarLoop]: 184 mSDtfsCounter, 139 mSDsluCounter, 734 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 918 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-24 13:09:44,613 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 918 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-24 13:09:44,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2649 states. [2023-12-24 13:09:44,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2649 to 2639. [2023-12-24 13:09:44,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2639 states, 2443 states have (on average 1.3896848137535818) internal successors, (3395), 2448 states have internal predecessors, (3395), 160 states have call successors, (160), 35 states have call predecessors, (160), 35 states have return successors, (160), 155 states have call predecessors, (160), 160 states have call successors, (160) [2023-12-24 13:09:44,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2639 states to 2639 states and 3715 transitions. [2023-12-24 13:09:44,785 INFO L78 Accepts]: Start accepts. Automaton has 2639 states and 3715 transitions. Word has length 141 [2023-12-24 13:09:44,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 13:09:44,785 INFO L495 AbstractCegarLoop]: Abstraction has 2639 states and 3715 transitions. [2023-12-24 13:09:44,785 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2023-12-24 13:09:44,785 INFO L276 IsEmpty]: Start isEmpty. Operand 2639 states and 3715 transitions. [2023-12-24 13:09:44,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2023-12-24 13:09:44,786 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 13:09:44,787 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 13:09:44,807 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Forceful destruction successful, exit code 0 [2023-12-24 13:09:45,004 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 13:09:45,004 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 13:09:45,005 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 13:09:45,005 INFO L85 PathProgramCache]: Analyzing trace with hash 239591985, now seen corresponding path program 1 times [2023-12-24 13:09:45,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 13:09:45,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [428454551] [2023-12-24 13:09:45,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 13:09:45,005 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 13:09:45,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 13:09:45,009 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 13:09:45,010 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Waiting until timeout for monitored process [2023-12-24 13:09:45,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 13:09:45,348 INFO L262 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 20 conjunts are in the unsatisfiable core [2023-12-24 13:09:45,351 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 13:09:45,354 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 1 [2023-12-24 13:09:45,385 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2023-12-24 13:09:45,923 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 13:09:45,923 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 36 [2023-12-24 13:09:46,100 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 13:09:46,100 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 164 treesize of output 96 [2023-12-24 13:09:46,174 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 73 proven. 42 refuted. 0 times theorem prover too weak. 365 trivial. 0 not checked. [2023-12-24 13:09:46,174 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 13:09:46,471 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-12-24 13:09:46,471 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 13:09:46,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [428454551] [2023-12-24 13:09:46,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [428454551] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-24 13:09:46,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-24 13:09:46,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [13] total 17 [2023-12-24 13:09:46,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724090394] [2023-12-24 13:09:46,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 13:09:46,472 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-24 13:09:46,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 13:09:46,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-24 13:09:46,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=232, Unknown=0, NotChecked=0, Total=272 [2023-12-24 13:09:46,473 INFO L87 Difference]: Start difference. First operand 2639 states and 3715 transitions. Second operand has 8 states, 8 states have (on average 8.0) internal successors, (64), 8 states have internal predecessors, (64), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-24 13:09:46,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 13:09:46,959 INFO L93 Difference]: Finished difference Result 5706 states and 8077 transitions. [2023-12-24 13:09:46,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-24 13:09:46,960 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.0) internal successors, (64), 8 states have internal predecessors, (64), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 141 [2023-12-24 13:09:46,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 13:09:46,965 INFO L225 Difference]: With dead ends: 5706 [2023-12-24 13:09:46,965 INFO L226 Difference]: Without dead ends: 4468 [2023-12-24 13:09:46,967 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 289 GetRequests, 265 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=107, Invalid=543, Unknown=0, NotChecked=0, Total=650 [2023-12-24 13:09:46,967 INFO L413 NwaCegarLoop]: 324 mSDtfsCounter, 310 mSDsluCounter, 1554 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 310 SdHoareTripleChecker+Valid, 1878 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-24 13:09:46,968 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [310 Valid, 1878 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-24 13:09:46,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4468 states. [2023-12-24 13:09:47,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4468 to 3021. [2023-12-24 13:09:47,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3021 states, 2825 states have (on average 1.3957522123893806) internal successors, (3943), 2830 states have internal predecessors, (3943), 160 states have call successors, (160), 35 states have call predecessors, (160), 35 states have return successors, (160), 155 states have call predecessors, (160), 160 states have call successors, (160) [2023-12-24 13:09:47,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3021 states to 3021 states and 4263 transitions. [2023-12-24 13:09:47,115 INFO L78 Accepts]: Start accepts. Automaton has 3021 states and 4263 transitions. Word has length 141 [2023-12-24 13:09:47,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 13:09:47,115 INFO L495 AbstractCegarLoop]: Abstraction has 3021 states and 4263 transitions. [2023-12-24 13:09:47,115 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.0) internal successors, (64), 8 states have internal predecessors, (64), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-24 13:09:47,115 INFO L276 IsEmpty]: Start isEmpty. Operand 3021 states and 4263 transitions. [2023-12-24 13:09:47,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2023-12-24 13:09:47,116 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 13:09:47,116 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 13:09:47,124 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Forceful destruction successful, exit code 0 [2023-12-24 13:09:47,324 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 13:09:47,325 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 13:09:47,325 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 13:09:47,325 INFO L85 PathProgramCache]: Analyzing trace with hash 2072441709, now seen corresponding path program 1 times [2023-12-24 13:09:47,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 13:09:47,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1164352897] [2023-12-24 13:09:47,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 13:09:47,325 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 13:09:47,326 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 13:09:47,327 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 13:09:47,327 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Waiting until timeout for monitored process [2023-12-24 13:09:47,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 13:09:47,666 INFO L262 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 21 conjunts are in the unsatisfiable core [2023-12-24 13:09:47,669 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 13:09:47,672 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 1 [2023-12-24 13:09:47,702 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2023-12-24 13:09:48,235 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 13:09:48,235 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 36 [2023-12-24 13:09:48,429 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 13:09:48,429 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 65 treesize of output 33 [2023-12-24 13:09:48,505 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 73 proven. 42 refuted. 0 times theorem prover too weak. 365 trivial. 0 not checked. [2023-12-24 13:09:48,505 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 13:09:48,904 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-12-24 13:09:48,904 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 13:09:48,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1164352897] [2023-12-24 13:09:48,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1164352897] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-24 13:09:48,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-24 13:09:48,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [15] total 21 [2023-12-24 13:09:48,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966768019] [2023-12-24 13:09:48,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 13:09:48,905 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-24 13:09:48,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 13:09:48,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-24 13:09:48,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=366, Unknown=0, NotChecked=0, Total=420 [2023-12-24 13:09:48,905 INFO L87 Difference]: Start difference. First operand 3021 states and 4263 transitions. Second operand has 10 states, 10 states have (on average 6.6) internal successors, (66), 10 states have internal predecessors, (66), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-24 13:09:49,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 13:09:49,783 INFO L93 Difference]: Finished difference Result 6388 states and 9078 transitions. [2023-12-24 13:09:49,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-12-24 13:09:49,783 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.6) internal successors, (66), 10 states have internal predecessors, (66), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 143 [2023-12-24 13:09:49,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 13:09:49,789 INFO L225 Difference]: With dead ends: 6388 [2023-12-24 13:09:49,789 INFO L226 Difference]: Without dead ends: 4768 [2023-12-24 13:09:49,792 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 300 GetRequests, 265 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 201 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=202, Invalid=1130, Unknown=0, NotChecked=0, Total=1332 [2023-12-24 13:09:49,792 INFO L413 NwaCegarLoop]: 360 mSDtfsCounter, 428 mSDsluCounter, 2365 mSDsCounter, 0 mSdLazyCounter, 297 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 428 SdHoareTripleChecker+Valid, 2725 SdHoareTripleChecker+Invalid, 303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-24 13:09:49,792 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [428 Valid, 2725 Invalid, 303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 297 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-24 13:09:49,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4768 states. [2023-12-24 13:09:49,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4768 to 2641. [2023-12-24 13:09:49,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2641 states, 2445 states have (on average 1.389366053169734) internal successors, (3397), 2450 states have internal predecessors, (3397), 160 states have call successors, (160), 35 states have call predecessors, (160), 35 states have return successors, (160), 155 states have call predecessors, (160), 160 states have call successors, (160) [2023-12-24 13:09:49,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2641 states to 2641 states and 3717 transitions. [2023-12-24 13:09:49,951 INFO L78 Accepts]: Start accepts. Automaton has 2641 states and 3717 transitions. Word has length 143 [2023-12-24 13:09:49,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 13:09:49,952 INFO L495 AbstractCegarLoop]: Abstraction has 2641 states and 3717 transitions. [2023-12-24 13:09:49,952 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.6) internal successors, (66), 10 states have internal predecessors, (66), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-24 13:09:49,952 INFO L276 IsEmpty]: Start isEmpty. Operand 2641 states and 3717 transitions. [2023-12-24 13:09:49,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2023-12-24 13:09:49,953 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 13:09:49,953 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 13:09:49,978 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Forceful destruction successful, exit code 0 [2023-12-24 13:09:50,160 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 13:09:50,161 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 13:09:50,161 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 13:09:50,161 INFO L85 PathProgramCache]: Analyzing trace with hash 934669455, now seen corresponding path program 1 times [2023-12-24 13:09:50,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 13:09:50,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [11187416] [2023-12-24 13:09:50,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 13:09:50,162 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 13:09:50,162 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 13:09:50,163 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 13:09:50,164 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (28)] Waiting until timeout for monitored process [2023-12-24 13:09:50,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 13:09:50,527 INFO L262 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-24 13:09:50,529 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 13:09:50,791 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 13:09:50,809 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 165 proven. 36 refuted. 0 times theorem prover too weak. 279 trivial. 0 not checked. [2023-12-24 13:09:50,809 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 13:09:51,023 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 9 proven. 36 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2023-12-24 13:09:51,023 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 13:09:51,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [11187416] [2023-12-24 13:09:51,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [11187416] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 13:09:51,023 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 13:09:51,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2023-12-24 13:09:51,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521899711] [2023-12-24 13:09:51,023 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 13:09:51,024 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-24 13:09:51,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 13:09:51,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-24 13:09:51,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2023-12-24 13:09:51,024 INFO L87 Difference]: Start difference. First operand 2641 states and 3717 transitions. Second operand has 11 states, 9 states have (on average 9.222222222222221) internal successors, (83), 11 states have internal predecessors, (83), 4 states have call successors, (29), 2 states have call predecessors, (29), 4 states have return successors, (29), 2 states have call predecessors, (29), 4 states have call successors, (29) [2023-12-24 13:09:51,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 13:09:51,464 INFO L93 Difference]: Finished difference Result 3809 states and 5265 transitions. [2023-12-24 13:09:51,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-24 13:09:51,464 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 9.222222222222221) internal successors, (83), 11 states have internal predecessors, (83), 4 states have call successors, (29), 2 states have call predecessors, (29), 4 states have return successors, (29), 2 states have call predecessors, (29), 4 states have call successors, (29) Word has length 148 [2023-12-24 13:09:51,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 13:09:51,466 INFO L225 Difference]: With dead ends: 3809 [2023-12-24 13:09:51,466 INFO L226 Difference]: Without dead ends: 1169 [2023-12-24 13:09:51,469 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 300 GetRequests, 284 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2023-12-24 13:09:51,469 INFO L413 NwaCegarLoop]: 135 mSDtfsCounter, 317 mSDsluCounter, 489 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 320 SdHoareTripleChecker+Valid, 624 SdHoareTripleChecker+Invalid, 284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-24 13:09:51,470 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [320 Valid, 624 Invalid, 284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 258 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-24 13:09:51,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1169 states. [2023-12-24 13:09:51,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1169 to 903. [2023-12-24 13:09:51,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 903 states, 797 states have (on average 1.2823086574654956) internal successors, (1022), 797 states have internal predecessors, (1022), 80 states have call successors, (80), 25 states have call predecessors, (80), 25 states have return successors, (80), 80 states have call predecessors, (80), 80 states have call successors, (80) [2023-12-24 13:09:51,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 903 states to 903 states and 1182 transitions. [2023-12-24 13:09:51,540 INFO L78 Accepts]: Start accepts. Automaton has 903 states and 1182 transitions. Word has length 148 [2023-12-24 13:09:51,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 13:09:51,540 INFO L495 AbstractCegarLoop]: Abstraction has 903 states and 1182 transitions. [2023-12-24 13:09:51,540 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 9.222222222222221) internal successors, (83), 11 states have internal predecessors, (83), 4 states have call successors, (29), 2 states have call predecessors, (29), 4 states have return successors, (29), 2 states have call predecessors, (29), 4 states have call successors, (29) [2023-12-24 13:09:51,540 INFO L276 IsEmpty]: Start isEmpty. Operand 903 states and 1182 transitions. [2023-12-24 13:09:51,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2023-12-24 13:09:51,541 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 13:09:51,541 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 13:09:51,568 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (28)] Forceful destruction successful, exit code 0 [2023-12-24 13:09:51,752 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 13:09:51,752 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 13:09:51,753 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 13:09:51,753 INFO L85 PathProgramCache]: Analyzing trace with hash 1965140414, now seen corresponding path program 1 times [2023-12-24 13:09:51,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 13:09:51,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [366139175] [2023-12-24 13:09:51,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 13:09:51,753 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 13:09:51,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 13:09:51,754 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 13:09:51,755 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (29)] Waiting until timeout for monitored process [2023-12-24 13:09:52,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 13:09:52,133 INFO L262 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-24 13:09:52,135 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 13:09:52,362 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 13:09:52,379 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 165 proven. 36 refuted. 0 times theorem prover too weak. 279 trivial. 0 not checked. [2023-12-24 13:09:52,379 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 13:09:52,617 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 9 proven. 36 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2023-12-24 13:09:52,617 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 13:09:52,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [366139175] [2023-12-24 13:09:52,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [366139175] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 13:09:52,617 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 13:09:52,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2023-12-24 13:09:52,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231875466] [2023-12-24 13:09:52,617 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 13:09:52,618 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-24 13:09:52,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 13:09:52,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-24 13:09:52,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2023-12-24 13:09:52,618 INFO L87 Difference]: Start difference. First operand 903 states and 1182 transitions. Second operand has 11 states, 9 states have (on average 9.222222222222221) internal successors, (83), 11 states have internal predecessors, (83), 4 states have call successors, (29), 2 states have call predecessors, (29), 4 states have return successors, (29), 2 states have call predecessors, (29), 4 states have call successors, (29) [2023-12-24 13:09:53,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 13:09:53,051 INFO L93 Difference]: Finished difference Result 1723 states and 2225 transitions. [2023-12-24 13:09:53,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-24 13:09:53,051 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 9.222222222222221) internal successors, (83), 11 states have internal predecessors, (83), 4 states have call successors, (29), 2 states have call predecessors, (29), 4 states have return successors, (29), 2 states have call predecessors, (29), 4 states have call successors, (29) Word has length 148 [2023-12-24 13:09:53,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 13:09:53,053 INFO L225 Difference]: With dead ends: 1723 [2023-12-24 13:09:53,053 INFO L226 Difference]: Without dead ends: 821 [2023-12-24 13:09:53,054 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 300 GetRequests, 284 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2023-12-24 13:09:53,054 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 184 mSDsluCounter, 364 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 468 SdHoareTripleChecker+Invalid, 283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-24 13:09:53,054 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 468 Invalid, 283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 257 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-24 13:09:53,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 821 states. [2023-12-24 13:09:53,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 821 to 801. [2023-12-24 13:09:53,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 801 states, 695 states have (on average 1.2359712230215827) internal successors, (859), 695 states have internal predecessors, (859), 80 states have call successors, (80), 25 states have call predecessors, (80), 25 states have return successors, (80), 80 states have call predecessors, (80), 80 states have call successors, (80) [2023-12-24 13:09:53,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 801 states to 801 states and 1019 transitions. [2023-12-24 13:09:53,122 INFO L78 Accepts]: Start accepts. Automaton has 801 states and 1019 transitions. Word has length 148 [2023-12-24 13:09:53,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 13:09:53,122 INFO L495 AbstractCegarLoop]: Abstraction has 801 states and 1019 transitions. [2023-12-24 13:09:53,122 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 9.222222222222221) internal successors, (83), 11 states have internal predecessors, (83), 4 states have call successors, (29), 2 states have call predecessors, (29), 4 states have return successors, (29), 2 states have call predecessors, (29), 4 states have call successors, (29) [2023-12-24 13:09:53,123 INFO L276 IsEmpty]: Start isEmpty. Operand 801 states and 1019 transitions. [2023-12-24 13:09:53,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2023-12-24 13:09:53,124 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 13:09:53,124 INFO L195 NwaCegarLoop]: trace histogram [32, 32, 32, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 13:09:53,141 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (29)] Forceful destruction successful, exit code 0 [2023-12-24 13:09:53,335 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 13:09:53,335 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 13:09:53,335 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 13:09:53,336 INFO L85 PathProgramCache]: Analyzing trace with hash 2013664876, now seen corresponding path program 1 times [2023-12-24 13:09:53,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 13:09:53,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [713658992] [2023-12-24 13:09:53,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 13:09:53,336 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 13:09:53,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 13:09:53,337 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 13:09:53,339 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (30)] Waiting until timeout for monitored process [2023-12-24 13:09:53,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 13:09:53,709 INFO L262 TraceCheckSpWp]: Trace formula consists of 536 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-24 13:09:53,713 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 13:09:53,758 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2023-12-24 13:09:54,114 INFO L134 CoverageAnalysis]: Checked inductivity of 2048 backedges. 1081 proven. 7 refuted. 0 times theorem prover too weak. 960 trivial. 0 not checked. [2023-12-24 13:09:54,114 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 13:09:54,523 INFO L134 CoverageAnalysis]: Checked inductivity of 2048 backedges. 57 proven. 7 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2023-12-24 13:09:54,524 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 13:09:54,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [713658992] [2023-12-24 13:09:54,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [713658992] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 13:09:54,524 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 13:09:54,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2023-12-24 13:09:54,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816976701] [2023-12-24 13:09:54,524 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 13:09:54,524 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-24 13:09:54,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 13:09:54,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-24 13:09:54,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-12-24 13:09:54,525 INFO L87 Difference]: Start difference. First operand 801 states and 1019 transitions. Second operand has 7 states, 7 states have (on average 22.714285714285715) internal successors, (159), 7 states have internal predecessors, (159), 3 states have call successors, (48), 2 states have call predecessors, (48), 2 states have return successors, (48), 3 states have call predecessors, (48), 3 states have call successors, (48) [2023-12-24 13:09:54,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 13:09:54,734 INFO L93 Difference]: Finished difference Result 1080 states and 1364 transitions. [2023-12-24 13:09:54,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-24 13:09:54,734 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 22.714285714285715) internal successors, (159), 7 states have internal predecessors, (159), 3 states have call successors, (48), 2 states have call predecessors, (48), 2 states have return successors, (48), 3 states have call predecessors, (48), 3 states have call successors, (48) Word has length 270 [2023-12-24 13:09:54,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 13:09:54,735 INFO L225 Difference]: With dead ends: 1080 [2023-12-24 13:09:54,735 INFO L226 Difference]: Without dead ends: 427 [2023-12-24 13:09:54,736 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 544 GetRequests, 534 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2023-12-24 13:09:54,738 INFO L413 NwaCegarLoop]: 107 mSDtfsCounter, 186 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-24 13:09:54,738 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 181 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-24 13:09:54,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2023-12-24 13:09:54,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 278. [2023-12-24 13:09:54,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 235 states have (on average 1.1574468085106382) internal successors, (272), 235 states have internal predecessors, (272), 32 states have call successors, (32), 10 states have call predecessors, (32), 10 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2023-12-24 13:09:54,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 336 transitions. [2023-12-24 13:09:54,781 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 336 transitions. Word has length 270 [2023-12-24 13:09:54,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 13:09:54,781 INFO L495 AbstractCegarLoop]: Abstraction has 278 states and 336 transitions. [2023-12-24 13:09:54,781 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 22.714285714285715) internal successors, (159), 7 states have internal predecessors, (159), 3 states have call successors, (48), 2 states have call predecessors, (48), 2 states have return successors, (48), 3 states have call predecessors, (48), 3 states have call successors, (48) [2023-12-24 13:09:54,781 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 336 transitions. [2023-12-24 13:09:54,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2023-12-24 13:09:54,782 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 13:09:54,782 INFO L195 NwaCegarLoop]: trace histogram [32, 32, 32, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 13:09:54,793 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 13:09:54,993 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 13:09:54,993 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 13:09:54,993 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 13:09:54,993 INFO L85 PathProgramCache]: Analyzing trace with hash 1249481885, now seen corresponding path program 1 times [2023-12-24 13:09:54,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 13:09:54,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [488729406] [2023-12-24 13:09:54,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 13:09:54,994 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 13:09:54,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 13:09:54,995 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 13:09:55,030 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 13:09:55,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 13:09:55,756 INFO L262 TraceCheckSpWp]: Trace formula consists of 561 conjuncts, 27 conjunts are in the unsatisfiable core [2023-12-24 13:09:55,761 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 13:09:55,763 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 8 treesize of output 1 [2023-12-24 13:09:55,796 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2023-12-24 13:09:56,367 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 13:09:56,367 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 36 [2023-12-24 13:09:56,586 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 13:09:56,587 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 49 treesize of output 30 [2023-12-24 13:09:56,747 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 13:09:56,747 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 49 treesize of output 30 [2023-12-24 13:09:57,273 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 13:09:57,273 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 154 treesize of output 92 [2023-12-24 13:09:57,337 INFO L134 CoverageAnalysis]: Checked inductivity of 2054 backedges. 166 proven. 1158 refuted. 0 times theorem prover too weak. 730 trivial. 0 not checked. [2023-12-24 13:09:57,337 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 13:09:58,745 INFO L134 CoverageAnalysis]: Checked inductivity of 2054 backedges. 56 proven. 197 refuted. 0 times theorem prover too weak. 1801 trivial. 0 not checked. [2023-12-24 13:09:58,746 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 13:09:58,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [488729406] [2023-12-24 13:09:58,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [488729406] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 13:09:58,746 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 13:09:58,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17] total 30 [2023-12-24 13:09:58,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356633080] [2023-12-24 13:09:58,746 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 13:09:58,747 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-12-24 13:09:58,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 13:09:58,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-12-24 13:09:58,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=739, Unknown=0, NotChecked=0, Total=870 [2023-12-24 13:09:58,748 INFO L87 Difference]: Start difference. First operand 278 states and 336 transitions. Second operand has 30 states, 26 states have (on average 9.73076923076923) internal successors, (253), 30 states have internal predecessors, (253), 11 states have call successors, (63), 4 states have call predecessors, (63), 8 states have return successors, (63), 8 states have call predecessors, (63), 11 states have call successors, (63) [2023-12-24 13:09:59,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 13:09:59,874 INFO L93 Difference]: Finished difference Result 474 states and 564 transitions. [2023-12-24 13:09:59,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-12-24 13:09:59,874 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 26 states have (on average 9.73076923076923) internal successors, (253), 30 states have internal predecessors, (253), 11 states have call successors, (63), 4 states have call predecessors, (63), 8 states have return successors, (63), 8 states have call predecessors, (63), 11 states have call successors, (63) Word has length 278 [2023-12-24 13:09:59,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 13:09:59,875 INFO L225 Difference]: With dead ends: 474 [2023-12-24 13:09:59,875 INFO L226 Difference]: Without dead ends: 316 [2023-12-24 13:09:59,876 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 567 GetRequests, 525 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 340 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=388, Invalid=1418, Unknown=0, NotChecked=0, Total=1806 [2023-12-24 13:09:59,876 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 114 mSDsluCounter, 991 mSDsCounter, 0 mSdLazyCounter, 668 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 1083 SdHoareTripleChecker+Invalid, 679 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 668 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-12-24 13:09:59,877 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 1083 Invalid, 679 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 668 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-12-24 13:09:59,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2023-12-24 13:09:59,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 278. [2023-12-24 13:09:59,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 235 states have (on average 1.1574468085106382) internal successors, (272), 235 states have internal predecessors, (272), 32 states have call successors, (32), 10 states have call predecessors, (32), 10 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2023-12-24 13:09:59,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 336 transitions. [2023-12-24 13:09:59,914 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 336 transitions. Word has length 278 [2023-12-24 13:09:59,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 13:09:59,914 INFO L495 AbstractCegarLoop]: Abstraction has 278 states and 336 transitions. [2023-12-24 13:09:59,914 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 26 states have (on average 9.73076923076923) internal successors, (253), 30 states have internal predecessors, (253), 11 states have call successors, (63), 4 states have call predecessors, (63), 8 states have return successors, (63), 8 states have call predecessors, (63), 11 states have call successors, (63) [2023-12-24 13:09:59,914 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 336 transitions. [2023-12-24 13:09:59,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2023-12-24 13:09:59,916 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 13:09:59,916 INFO L195 NwaCegarLoop]: trace histogram [32, 32, 32, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 13:09:59,928 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 13:10:00,128 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 13:10:00,128 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 13:10:00,128 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 13:10:00,128 INFO L85 PathProgramCache]: Analyzing trace with hash 1914026713, now seen corresponding path program 1 times [2023-12-24 13:10:00,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 13:10:00,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1254886583] [2023-12-24 13:10:00,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 13:10:00,129 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 13:10:00,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 13:10:00,130 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 13:10:00,163 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 13:10:00,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 13:10:00,851 INFO L262 TraceCheckSpWp]: Trace formula consists of 565 conjuncts, 29 conjunts are in the unsatisfiable core [2023-12-24 13:10:00,856 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 13:10:00,858 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2023-12-24 13:10:00,989 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 36 treesize of output 29 [2023-12-24 13:10:01,793 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 13:10:01,794 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 40 [2023-12-24 13:10:02,082 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 13:10:02,082 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 59 treesize of output 34 [2023-12-24 13:10:02,277 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 13:10:02,278 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 49 treesize of output 30 [2023-12-24 13:10:02,755 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-24 13:10:02,755 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 55 treesize of output 29 [2023-12-24 13:10:02,858 INFO L134 CoverageAnalysis]: Checked inductivity of 2054 backedges. 79 proven. 1245 refuted. 0 times theorem prover too weak. 730 trivial. 0 not checked. [2023-12-24 13:10:02,858 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 13:10:04,308 INFO L134 CoverageAnalysis]: Checked inductivity of 2054 backedges. 56 proven. 197 refuted. 0 times theorem prover too weak. 1801 trivial. 0 not checked. [2023-12-24 13:10:04,309 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 13:10:04,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1254886583] [2023-12-24 13:10:04,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1254886583] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 13:10:04,309 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 13:10:04,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 19] total 37 [2023-12-24 13:10:04,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759135704] [2023-12-24 13:10:04,309 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 13:10:04,310 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2023-12-24 13:10:04,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 13:10:04,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2023-12-24 13:10:04,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=1150, Unknown=0, NotChecked=0, Total=1332 [2023-12-24 13:10:04,311 INFO L87 Difference]: Start difference. First operand 278 states and 336 transitions. Second operand has 37 states, 33 states have (on average 7.909090909090909) internal successors, (261), 35 states have internal predecessors, (261), 12 states have call successors, (64), 5 states have call predecessors, (64), 9 states have return successors, (64), 10 states have call predecessors, (64), 12 states have call successors, (64) [2023-12-24 13:10:06,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 13:10:06,244 INFO L93 Difference]: Finished difference Result 466 states and 555 transitions. [2023-12-24 13:10:06,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-12-24 13:10:06,245 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 33 states have (on average 7.909090909090909) internal successors, (261), 35 states have internal predecessors, (261), 12 states have call successors, (64), 5 states have call predecessors, (64), 9 states have return successors, (64), 10 states have call predecessors, (64), 12 states have call successors, (64) Word has length 280 [2023-12-24 13:10:06,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 13:10:06,245 INFO L225 Difference]: With dead ends: 466 [2023-12-24 13:10:06,245 INFO L226 Difference]: Without dead ends: 0 [2023-12-24 13:10:06,246 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 579 GetRequests, 523 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 611 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=673, Invalid=2633, Unknown=0, NotChecked=0, Total=3306 [2023-12-24 13:10:06,247 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 360 mSDsluCounter, 1343 mSDsCounter, 0 mSdLazyCounter, 973 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 374 SdHoareTripleChecker+Valid, 1433 SdHoareTripleChecker+Invalid, 1030 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 973 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-12-24 13:10:06,247 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [374 Valid, 1433 Invalid, 1030 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 973 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-12-24 13:10:06,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-12-24 13:10:06,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-12-24 13:10:06,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 13:10:06,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-12-24 13:10:06,247 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 280 [2023-12-24 13:10:06,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 13:10:06,247 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-12-24 13:10:06,247 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 33 states have (on average 7.909090909090909) internal successors, (261), 35 states have internal predecessors, (261), 12 states have call successors, (64), 5 states have call predecessors, (64), 9 states have return successors, (64), 10 states have call predecessors, (64), 12 states have call successors, (64) [2023-12-24 13:10:06,248 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-12-24 13:10:06,248 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-12-24 13:10:06,249 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-24 13:10:06,278 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 (32)] Ended with exit code 0 [2023-12-24 13:10:06,462 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 13:10:06,463 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-12-24 13:10:21,638 WARN L293 SmtUtils]: Spent 6.98s on a formula simplification. DAG size of input: 229 DAG size of output: 226 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2023-12-24 13:10:29,503 WARN L293 SmtUtils]: Spent 6.03s on a formula simplification. DAG size of input: 251 DAG size of output: 264 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2023-12-24 13:10:44,845 WARN L293 SmtUtils]: Spent 13.27s on a formula simplification. DAG size of input: 266 DAG size of output: 273 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2023-12-24 13:10:51,602 WARN L293 SmtUtils]: Spent 6.76s on a formula simplification. DAG size of input: 229 DAG size of output: 180 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2023-12-24 13:11:04,790 WARN L293 SmtUtils]: Spent 13.08s on a formula simplification. DAG size of input: 266 DAG size of output: 207 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2023-12-24 13:11:11,756 WARN L293 SmtUtils]: Spent 5.82s on a formula simplification. DAG size of input: 251 DAG size of output: 195 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2023-12-24 13:11:37,848 WARN L293 SmtUtils]: Spent 24.47s on a formula simplification. DAG size of input: 213 DAG size of output: 130 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2023-12-24 13:12:00,084 WARN L293 SmtUtils]: Spent 22.23s on a formula simplification. DAG size of input: 148 DAG size of output: 80 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2023-12-24 13:13:51,825 WARN L293 SmtUtils]: Spent 1.86m on a formula simplification. DAG size of input: 273 DAG size of output: 169 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2023-12-24 13:14:18,046 WARN L293 SmtUtils]: Spent 26.22s on a formula simplification. DAG size of input: 213 DAG size of output: 130 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2023-12-24 13:14:42,680 WARN L293 SmtUtils]: Spent 24.63s on a formula simplification. DAG size of input: 148 DAG size of output: 80 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2023-12-24 13:15:09,151 WARN L293 SmtUtils]: Spent 26.47s on a formula simplification. DAG size of input: 210 DAG size of output: 127 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2023-12-24 13:15:34,402 WARN L293 SmtUtils]: Spent 25.25s on a formula simplification. DAG size of input: 198 DAG size of output: 130 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2023-12-24 13:16:00,907 WARN L293 SmtUtils]: Spent 26.50s on a formula simplification. DAG size of input: 201 DAG size of output: 133 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2023-12-24 13:16:26,082 WARN L293 SmtUtils]: Spent 25.17s on a formula simplification. DAG size of input: 148 DAG size of output: 80 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2023-12-24 13:16:51,393 WARN L293 SmtUtils]: Spent 25.31s on a formula simplification. DAG size of input: 148 DAG size of output: 80 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2023-12-24 13:17:15,556 WARN L293 SmtUtils]: Spent 24.16s on a formula simplification. DAG size of input: 148 DAG size of output: 80 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2023-12-24 13:17:42,946 WARN L293 SmtUtils]: Spent 27.39s on a formula simplification. DAG size of input: 213 DAG size of output: 130 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2023-12-24 13:18:08,554 WARN L293 SmtUtils]: Spent 25.61s on a formula simplification. DAG size of input: 148 DAG size of output: 80 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2023-12-24 13:18:34,355 WARN L293 SmtUtils]: Spent 25.80s on a formula simplification. DAG size of input: 148 DAG size of output: 80 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2023-12-24 13:18:58,598 WARN L293 SmtUtils]: Spent 24.24s on a formula simplification. DAG size of input: 148 DAG size of output: 80 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2023-12-24 13:20:49,314 WARN L293 SmtUtils]: Spent 1.84m on a formula simplification. DAG size of input: 911 DAG size of output: 1 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2023-12-24 13:21:27,442 WARN L293 SmtUtils]: Spent 38.13s on a formula simplification. DAG size of input: 250 DAG size of output: 130 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2023-12-24 13:21:51,319 WARN L293 SmtUtils]: Spent 23.88s on a formula simplification. DAG size of input: 213 DAG size of output: 130 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2023-12-24 13:21:51,322 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(line 20) the Hoare annotation is: true [2023-12-24 13:21:51,322 INFO L899 garLoopResultBuilder]: For program point L20(line 20) no Hoare annotation was computed. [2023-12-24 13:21:51,322 INFO L899 garLoopResultBuilder]: For program point L20-2(line 20) no Hoare annotation was computed. [2023-12-24 13:21:51,322 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(line 20) no Hoare annotation was computed. [2023-12-24 13:21:51,322 INFO L899 garLoopResultBuilder]: For program point L69(line 69) no Hoare annotation was computed. [2023-12-24 13:21:51,322 INFO L899 garLoopResultBuilder]: For program point L36(lines 36 40) no Hoare annotation was computed. [2023-12-24 13:21:51,322 INFO L899 garLoopResultBuilder]: For program point L69-2(line 69) no Hoare annotation was computed. [2023-12-24 13:21:51,323 INFO L899 garLoopResultBuilder]: For program point L36-1(lines 36 40) no Hoare annotation was computed. [2023-12-24 13:21:51,323 INFO L899 garLoopResultBuilder]: For program point L69-3(line 69) no Hoare annotation was computed. [2023-12-24 13:21:51,323 INFO L899 garLoopResultBuilder]: For program point L69-5(line 69) no Hoare annotation was computed. [2023-12-24 13:21:51,323 INFO L899 garLoopResultBuilder]: For program point L69-7(line 69) no Hoare annotation was computed. [2023-12-24 13:21:51,323 INFO L895 garLoopResultBuilder]: At program point L69-8(line 69) the Hoare annotation is: (let ((.cse13 (select |#memory_int#1| |~#BOOL_unsigned_char_Array_0~0.base|))) (let ((.cse23 (select .cse13 (bvadd |~#BOOL_unsigned_char_Array_0~0.offset| (_ bv1 32)))) (.cse12 ((_ sign_extend 24) (_ bv1 8))) (.cse25 (select .cse13 (bvadd (_ bv2 32) |~#BOOL_unsigned_char_Array_0~0.offset|)))) (and (let ((.cse18 (select |#memory_int#2| |~#double_Array_0~0.base|))) (let ((.cse14 (select .cse18 (_ bv36 32))) (.cse21 (select .cse18 (_ bv32 32)))) (let ((.cse17 ((_ to_fp 8 24) roundNearestTiesToEven 4611686018427382800.0)) (.cse22 (let ((.cse24 (concat .cse14 .cse21))) (fp ((_ extract 63 63) .cse24) ((_ extract 62 52) .cse24) ((_ extract 51 0) .cse24)))) (.cse19 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0)))) (let ((.cse0 (bvsle ((_ zero_extend 24) ((_ extract 7 0) .cse23)) (_ bv0 32))) (.cse6 (fp.geq .cse22 ((_ to_fp 11 53) roundNearestTiesToEven .cse19))) (.cse7 (exists ((|v_skolemized_q#valueAsBitvector_153| (_ BitVec 64))) (and (= ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_153|) .cse21) (= .cse14 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_153|))))) (.cse8 (fp.leq .cse22 ((_ to_fp 11 53) roundNearestTiesToEven .cse17))) (.cse2 (exists ((|v_skolemized_q#valueAsBitvector_120| (_ BitVec 64)) (|v_skolemized_q#valueAsBitvector_121| (_ BitVec 64))) (let ((.cse15 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_120|))) (let ((.cse16 (let ((.cse20 (concat .cse15 .cse21))) (fp ((_ extract 63 63) .cse20) ((_ extract 62 52) .cse20) ((_ extract 51 0) .cse20))))) (and (= .cse14 .cse15) (fp.geq .cse16 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse17))) (= ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_121|) (select .cse18 (_ bv0 32))) (= (select .cse18 (_ bv4 32)) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_121|)) (= .cse16 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_121|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_121|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_121|))) (fp.leq .cse16 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse19)))))))) (.cse4 (= |~#double_Array_0~0.offset| (_ bv0 32))) (.cse5 (= currentRoundingMode roundNearestTiesToEven)) (.cse1 (= ((_ sign_extend 24) (_ bv0 8)) (select .cse13 (bvadd (_ bv3 32) |~#BOOL_unsigned_char_Array_0~0.offset|))))) (or (and .cse0 .cse1 (let ((.cse3 (let ((.cse9 (select |#memory_int#3| |~#signed_long_int_Array_0~0.base|))) (let ((.cse10 (select .cse9 |~#signed_long_int_Array_0~0.offset|))) (or (= (bvadd (select .cse9 (bvadd (_ bv4 32) |~#signed_long_int_Array_0~0.offset|)) (bvneg .cse10) (select .cse9 (bvadd |~#signed_long_int_Array_0~0.offset| (_ bv12 32)))) (select .cse9 (bvadd (_ bv16 32) |~#signed_long_int_Array_0~0.offset|))) (not (bvslt .cse10 (_ bv0 32)))))))) (or (and .cse2 .cse3 .cse4 .cse5) (and .cse6 .cse3 .cse7 .cse4 .cse8 .cse5))) (not (= ~last_1_BOOL_unsigned_char_Array_0_0__0_~0 (_ bv0 8)))) (and .cse0 (let ((.cse11 (= ((_ extract 7 0) .cse12) ~last_1_BOOL_unsigned_char_Array_0_0__0_~0))) (or (and .cse6 .cse7 .cse4 .cse8 .cse11 .cse5) (and .cse2 .cse4 .cse11 .cse5))) .cse1)))))) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet62#1_69| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet62#1_69|) .cse23)) (= .cse12 (select .cse13 |~#BOOL_unsigned_char_Array_0~0.offset|)) (bvsle ((_ zero_extend 24) ((_ extract 7 0) .cse25)) (_ bv0 32)) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet59#1_67| (_ BitVec 8))) (= .cse25 ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet59#1_67|)))))) [2023-12-24 13:21:51,323 INFO L899 garLoopResultBuilder]: For program point L69-9(line 69) no Hoare annotation was computed. [2023-12-24 13:21:51,323 INFO L899 garLoopResultBuilder]: For program point L37(lines 37 39) no Hoare annotation was computed. [2023-12-24 13:21:51,323 INFO L899 garLoopResultBuilder]: For program point L71(line 71) no Hoare annotation was computed. [2023-12-24 13:21:51,323 INFO L899 garLoopResultBuilder]: For program point L38(line 38) no Hoare annotation was computed. [2023-12-24 13:21:51,323 INFO L899 garLoopResultBuilder]: For program point L71-2(line 71) no Hoare annotation was computed. [2023-12-24 13:21:51,323 INFO L899 garLoopResultBuilder]: For program point L71-3(line 71) no Hoare annotation was computed. [2023-12-24 13:21:51,323 INFO L899 garLoopResultBuilder]: For program point L38-2(line 38) no Hoare annotation was computed. [2023-12-24 13:21:51,323 INFO L899 garLoopResultBuilder]: For program point L71-5(line 71) no Hoare annotation was computed. [2023-12-24 13:21:51,323 INFO L899 garLoopResultBuilder]: For program point L71-7(line 71) no Hoare annotation was computed. [2023-12-24 13:21:51,324 INFO L895 garLoopResultBuilder]: At program point L71-8(line 71) the Hoare annotation is: (let ((.cse13 (select |#memory_int#1| |~#BOOL_unsigned_char_Array_0~0.base|))) (let ((.cse23 (select .cse13 (bvadd |~#BOOL_unsigned_char_Array_0~0.offset| (_ bv1 32)))) (.cse12 ((_ sign_extend 24) (_ bv1 8))) (.cse25 (select .cse13 (bvadd (_ bv2 32) |~#BOOL_unsigned_char_Array_0~0.offset|)))) (and (let ((.cse18 (select |#memory_int#2| |~#double_Array_0~0.base|))) (let ((.cse14 (select .cse18 (_ bv36 32))) (.cse21 (select .cse18 (_ bv32 32)))) (let ((.cse17 ((_ to_fp 8 24) roundNearestTiesToEven 4611686018427382800.0)) (.cse22 (let ((.cse24 (concat .cse14 .cse21))) (fp ((_ extract 63 63) .cse24) ((_ extract 62 52) .cse24) ((_ extract 51 0) .cse24)))) (.cse19 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0)))) (let ((.cse0 (bvsle ((_ zero_extend 24) ((_ extract 7 0) .cse23)) (_ bv0 32))) (.cse6 (fp.geq .cse22 ((_ to_fp 11 53) roundNearestTiesToEven .cse19))) (.cse7 (exists ((|v_skolemized_q#valueAsBitvector_153| (_ BitVec 64))) (and (= ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_153|) .cse21) (= .cse14 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_153|))))) (.cse8 (fp.leq .cse22 ((_ to_fp 11 53) roundNearestTiesToEven .cse17))) (.cse2 (exists ((|v_skolemized_q#valueAsBitvector_120| (_ BitVec 64)) (|v_skolemized_q#valueAsBitvector_121| (_ BitVec 64))) (let ((.cse15 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_120|))) (let ((.cse16 (let ((.cse20 (concat .cse15 .cse21))) (fp ((_ extract 63 63) .cse20) ((_ extract 62 52) .cse20) ((_ extract 51 0) .cse20))))) (and (= .cse14 .cse15) (fp.geq .cse16 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse17))) (= ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_121|) (select .cse18 (_ bv0 32))) (= (select .cse18 (_ bv4 32)) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_121|)) (= .cse16 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_121|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_121|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_121|))) (fp.leq .cse16 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse19)))))))) (.cse4 (= |~#double_Array_0~0.offset| (_ bv0 32))) (.cse5 (= currentRoundingMode roundNearestTiesToEven)) (.cse1 (= ((_ sign_extend 24) (_ bv0 8)) (select .cse13 (bvadd (_ bv3 32) |~#BOOL_unsigned_char_Array_0~0.offset|))))) (or (and .cse0 .cse1 (let ((.cse3 (let ((.cse9 (select |#memory_int#3| |~#signed_long_int_Array_0~0.base|))) (let ((.cse10 (select .cse9 |~#signed_long_int_Array_0~0.offset|))) (or (= (bvadd (select .cse9 (bvadd (_ bv4 32) |~#signed_long_int_Array_0~0.offset|)) (bvneg .cse10) (select .cse9 (bvadd |~#signed_long_int_Array_0~0.offset| (_ bv12 32)))) (select .cse9 (bvadd (_ bv16 32) |~#signed_long_int_Array_0~0.offset|))) (not (bvslt .cse10 (_ bv0 32)))))))) (or (and .cse2 .cse3 .cse4 .cse5) (and .cse6 .cse3 .cse7 .cse4 .cse8 .cse5))) (not (= ~last_1_BOOL_unsigned_char_Array_0_0__0_~0 (_ bv0 8)))) (and .cse0 (let ((.cse11 (= ((_ extract 7 0) .cse12) ~last_1_BOOL_unsigned_char_Array_0_0__0_~0))) (or (and .cse6 .cse7 .cse4 .cse8 .cse11 .cse5) (and .cse2 .cse4 .cse11 .cse5))) .cse1)))))) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet62#1_69| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet62#1_69|) .cse23)) (= .cse12 (select .cse13 |~#BOOL_unsigned_char_Array_0~0.offset|)) (bvsle ((_ zero_extend 24) ((_ extract 7 0) .cse25)) (_ bv0 32)) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet59#1_67| (_ BitVec 8))) (= .cse25 ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet59#1_67|)))))) [2023-12-24 13:21:51,324 INFO L899 garLoopResultBuilder]: For program point L71-9(line 71) no Hoare annotation was computed. [2023-12-24 13:21:51,324 INFO L899 garLoopResultBuilder]: For program point L73(line 73) no Hoare annotation was computed. [2023-12-24 13:21:51,324 INFO L899 garLoopResultBuilder]: For program point L73-2(line 73) no Hoare annotation was computed. [2023-12-24 13:21:51,324 INFO L899 garLoopResultBuilder]: For program point L73-3(line 73) no Hoare annotation was computed. [2023-12-24 13:21:51,324 INFO L899 garLoopResultBuilder]: For program point L73-5(line 73) no Hoare annotation was computed. [2023-12-24 13:21:51,324 INFO L899 garLoopResultBuilder]: For program point L73-7(line 73) no Hoare annotation was computed. [2023-12-24 13:21:51,324 INFO L895 garLoopResultBuilder]: At program point L73-8(line 73) the Hoare annotation is: (let ((.cse13 (select |#memory_int#1| |~#BOOL_unsigned_char_Array_0~0.base|))) (let ((.cse23 (select .cse13 (bvadd |~#BOOL_unsigned_char_Array_0~0.offset| (_ bv1 32)))) (.cse12 ((_ sign_extend 24) (_ bv1 8))) (.cse25 (select .cse13 (bvadd (_ bv2 32) |~#BOOL_unsigned_char_Array_0~0.offset|)))) (and (let ((.cse18 (select |#memory_int#2| |~#double_Array_0~0.base|))) (let ((.cse14 (select .cse18 (_ bv36 32))) (.cse21 (select .cse18 (_ bv32 32)))) (let ((.cse17 ((_ to_fp 8 24) roundNearestTiesToEven 4611686018427382800.0)) (.cse22 (let ((.cse24 (concat .cse14 .cse21))) (fp ((_ extract 63 63) .cse24) ((_ extract 62 52) .cse24) ((_ extract 51 0) .cse24)))) (.cse19 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0)))) (let ((.cse0 (bvsle ((_ zero_extend 24) ((_ extract 7 0) .cse23)) (_ bv0 32))) (.cse6 (fp.geq .cse22 ((_ to_fp 11 53) roundNearestTiesToEven .cse19))) (.cse7 (exists ((|v_skolemized_q#valueAsBitvector_153| (_ BitVec 64))) (and (= ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_153|) .cse21) (= .cse14 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_153|))))) (.cse8 (fp.leq .cse22 ((_ to_fp 11 53) roundNearestTiesToEven .cse17))) (.cse2 (exists ((|v_skolemized_q#valueAsBitvector_120| (_ BitVec 64)) (|v_skolemized_q#valueAsBitvector_121| (_ BitVec 64))) (let ((.cse15 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_120|))) (let ((.cse16 (let ((.cse20 (concat .cse15 .cse21))) (fp ((_ extract 63 63) .cse20) ((_ extract 62 52) .cse20) ((_ extract 51 0) .cse20))))) (and (= .cse14 .cse15) (fp.geq .cse16 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse17))) (= ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_121|) (select .cse18 (_ bv0 32))) (= (select .cse18 (_ bv4 32)) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_121|)) (= .cse16 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_121|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_121|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_121|))) (fp.leq .cse16 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse19)))))))) (.cse4 (= |~#double_Array_0~0.offset| (_ bv0 32))) (.cse5 (= currentRoundingMode roundNearestTiesToEven)) (.cse1 (= ((_ sign_extend 24) (_ bv0 8)) (select .cse13 (bvadd (_ bv3 32) |~#BOOL_unsigned_char_Array_0~0.offset|))))) (or (and .cse0 .cse1 (let ((.cse3 (let ((.cse9 (select |#memory_int#3| |~#signed_long_int_Array_0~0.base|))) (let ((.cse10 (select .cse9 |~#signed_long_int_Array_0~0.offset|))) (or (= (bvadd (select .cse9 (bvadd (_ bv4 32) |~#signed_long_int_Array_0~0.offset|)) (bvneg .cse10) (select .cse9 (bvadd |~#signed_long_int_Array_0~0.offset| (_ bv12 32)))) (select .cse9 (bvadd (_ bv16 32) |~#signed_long_int_Array_0~0.offset|))) (not (bvslt .cse10 (_ bv0 32)))))))) (or (and .cse2 .cse3 .cse4 .cse5) (and .cse6 .cse3 .cse7 .cse4 .cse8 .cse5))) (not (= ~last_1_BOOL_unsigned_char_Array_0_0__0_~0 (_ bv0 8)))) (and .cse0 (let ((.cse11 (= ((_ extract 7 0) .cse12) ~last_1_BOOL_unsigned_char_Array_0_0__0_~0))) (or (and .cse6 .cse7 .cse4 .cse8 .cse11 .cse5) (and .cse2 .cse4 .cse11 .cse5))) .cse1)))))) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet62#1_69| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet62#1_69|) .cse23)) (= .cse12 (select .cse13 |~#BOOL_unsigned_char_Array_0~0.offset|)) (bvsle ((_ zero_extend 24) ((_ extract 7 0) .cse25)) (_ bv0 32)) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet59#1_67| (_ BitVec 8))) (= .cse25 ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet59#1_67|)))))) [2023-12-24 13:21:51,324 INFO L899 garLoopResultBuilder]: For program point L73-9(line 73) no Hoare annotation was computed. [2023-12-24 13:21:51,325 INFO L899 garLoopResultBuilder]: For program point L75(line 75) no Hoare annotation was computed. [2023-12-24 13:21:51,325 INFO L899 garLoopResultBuilder]: For program point L75-2(line 75) no Hoare annotation was computed. [2023-12-24 13:21:51,325 INFO L899 garLoopResultBuilder]: For program point L75-3(line 75) no Hoare annotation was computed. [2023-12-24 13:21:51,325 INFO L899 garLoopResultBuilder]: For program point L75-5(line 75) no Hoare annotation was computed. [2023-12-24 13:21:51,325 INFO L899 garLoopResultBuilder]: For program point L75-7(line 75) no Hoare annotation was computed. [2023-12-24 13:21:51,325 INFO L895 garLoopResultBuilder]: At program point L75-8(line 75) the Hoare annotation is: (let ((.cse43 (select |#memory_int#2| |~#double_Array_0~0.base|))) (let ((.cse40 (select .cse43 (_ bv36 32))) (.cse39 (select .cse43 (_ bv32 32))) (.cse35 (select |#memory_int#3| |~#signed_long_int_Array_0~0.base|)) (.cse34 (select |#memory_int#1| |~#BOOL_unsigned_char_Array_0~0.base|))) (let ((.cse27 (select .cse34 (bvadd (_ bv2 32) |~#BOOL_unsigned_char_Array_0~0.offset|))) (.cse36 (select .cse35 |~#signed_long_int_Array_0~0.offset|)) (.cse25 (not |ULTIMATE.start_updateVariables_#t~short92#1|)) (.cse20 ((_ to_fp 8 24) roundNearestTiesToEven 4611686018427382800.0)) (.cse19 (let ((.cse42 (concat .cse40 .cse39))) (fp ((_ extract 63 63) .cse42) ((_ extract 62 52) .cse42) ((_ extract 51 0) .cse42)))) (.cse38 ((_ to_fp 8 24) currentRoundingMode 4611686018427382800.0)) (.cse33 (select .cse34 |~#BOOL_unsigned_char_Array_0~0.offset|)) (.cse41 ((_ sign_extend 24) (_ bv1 8)))) (let ((.cse9 (= ((_ sign_extend 24) (_ bv0 8)) (select .cse34 (bvadd (_ bv3 32) |~#BOOL_unsigned_char_Array_0~0.offset|)))) (.cse18 (= ((_ extract 7 0) .cse41) ~last_1_BOOL_unsigned_char_Array_0_0__0_~0)) (.cse1 (= .cse41 .cse33)) (.cse28 (not (fp.leq .cse19 ((_ to_fp 11 53) currentRoundingMode .cse38)))) (.cse24 (not |ULTIMATE.start_updateVariables_#t~short95#1|)) (.cse6 (exists ((|v_skolemized_q#valueAsBitvector_153| (_ BitVec 64))) (and (= ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_153|) .cse39) (= .cse40 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_153|))))) (.cse7 (fp.geq .cse19 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse20)))) (.cse14 (let ((.cse37 (fp.geq .cse19 ((_ to_fp 11 53) currentRoundingMode (fp.neg .cse38))))) (or (and .cse25 (not .cse37)) (and |ULTIMATE.start_updateVariables_#t~short92#1| .cse37)))) (.cse17 (not (bvslt .cse36 (_ bv0 32)))) (.cse29 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet59#1_22| (_ BitVec 8))) (= .cse27 ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet59#1_22|)))) (.cse16 (= (bvadd (select .cse35 (bvadd (_ bv4 32) |~#signed_long_int_Array_0~0.offset|)) (bvneg .cse36) (select .cse35 (bvadd |~#signed_long_int_Array_0~0.offset| (_ bv12 32)))) (select .cse35 (bvadd (_ bv16 32) |~#signed_long_int_Array_0~0.offset|)))) (.cse2 (bvsle ((_ zero_extend 24) ((_ extract 7 0) .cse27)) (_ bv0 32))) (.cse0 (select .cse34 (bvadd |~#BOOL_unsigned_char_Array_0~0.offset| (_ bv1 32)))) (.cse8 (= |~#double_Array_0~0.offset| (_ bv0 32))) (.cse23 (not |ULTIMATE.start_updateVariables_#t~short96#1|)) (.cse10 (= currentRoundingMode roundNearestTiesToEven))) (or (and (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet62#1_69| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet62#1_69|) .cse0)) .cse1 .cse2 (let ((.cse26 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0)))) (let ((.cse21 (fp.geq .cse19 ((_ to_fp 11 53) roundNearestTiesToEven .cse26)))) (let ((.cse22 (not .cse21)) (.cse4 (fp.leq .cse19 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse26))))) (let ((.cse3 (bvsle ((_ zero_extend 24) ((_ extract 7 0) .cse0)) (_ bv0 32))) (.cse15 (or (and .cse25 (not .cse4)) (and .cse4 |ULTIMATE.start_updateVariables_#t~short92#1|))) (.cse11 (or (and .cse21 |ULTIMATE.start_updateVariables_#t~short95#1|) (and .cse24 .cse22))) (.cse12 (or (and .cse21 |ULTIMATE.start_updateVariables_#t~short96#1|) (and .cse22 .cse23))) (.cse13 (fp.leq .cse19 ((_ to_fp 11 53) roundNearestTiesToEven .cse20)))) (or (and .cse3 (let ((.cse5 (or .cse16 .cse17))) (or (and .cse4 .cse5 |ULTIMATE.start_updateVariables_#t~short96#1| |ULTIMATE.start_updateVariables_#t~short92#1| .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse6 .cse11 .cse12 .cse8 .cse13 .cse9 (or (and .cse5 .cse14) (and .cse15 .cse5 .cse7)) .cse10))) (not (= ~last_1_BOOL_unsigned_char_Array_0_0__0_~0 (_ bv0 8)))) (and .cse3 (or (and (or (and .cse15 .cse7 .cse18) (and .cse14 .cse18)) .cse6 .cse11 .cse12 .cse8 .cse13 .cse9 .cse10) (and .cse4 |ULTIMATE.start_updateVariables_#t~short96#1| |ULTIMATE.start_updateVariables_#t~short92#1| .cse6 .cse7 .cse8 .cse9 .cse18 .cse10)))))))) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet59#1_67| (_ BitVec 8))) (= .cse27 ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet59#1_67|)))) (and .cse28 .cse24 .cse6 .cse8 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet62#1_43| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet62#1_43|) .cse0)) .cse9 .cse23 (or (and .cse29 .cse25 .cse18) (and .cse29 .cse14 .cse18)) .cse1 .cse10 .cse2) (and .cse28 .cse24 .cse6 (let ((.cse30 (let ((.cse31 (not (= ((_ extract 7 0) .cse33) (_ bv0 8)))) (.cse32 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet62#1_17| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet62#1_17|) .cse0)))) (or (and .cse29 .cse31 .cse17 .cse2 .cse32) (and .cse29 .cse31 .cse16 .cse2 .cse32))))) (or (and .cse30 .cse7) (and .cse30 .cse14))) .cse8 .cse23 .cse10)))))) [2023-12-24 13:21:51,325 INFO L899 garLoopResultBuilder]: For program point L75-9(line 75) no Hoare annotation was computed. [2023-12-24 13:21:51,325 INFO L899 garLoopResultBuilder]: For program point L43(lines 43 49) no Hoare annotation was computed. [2023-12-24 13:21:51,325 INFO L899 garLoopResultBuilder]: For program point L43-1(lines 43 49) no Hoare annotation was computed. [2023-12-24 13:21:51,325 INFO L895 garLoopResultBuilder]: At program point L77(line 77) the Hoare annotation is: (let ((.cse8 (select |#memory_int#1| |~#BOOL_unsigned_char_Array_0~0.base|))) (let ((.cse0 (select .cse8 (bvadd |~#BOOL_unsigned_char_Array_0~0.offset| (_ bv1 32)))) (.cse13 (select .cse8 (bvadd (_ bv2 32) |~#BOOL_unsigned_char_Array_0~0.offset|)))) (and (bvsle ((_ zero_extend 24) ((_ extract 7 0) .cse0)) (_ bv0 32)) (let ((.cse12 (select |#memory_int#2| |~#double_Array_0~0.base|))) (let ((.cse11 (select .cse12 (_ bv32 32))) (.cse10 (select .cse12 (_ bv36 32)))) (let ((.cse2 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0))) (.cse3 (exists ((|v_skolemized_q#valueAsBitvector_153| (_ BitVec 64))) (and (= ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_153|) .cse11) (= .cse10 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_153|))))) (.cse5 (= |~#double_Array_0~0.offset| (_ bv0 32))) (.cse1 (let ((.cse9 (concat .cse10 .cse11))) (fp ((_ extract 63 63) .cse9) ((_ extract 62 52) .cse9) ((_ extract 51 0) .cse9)))) (.cse4 ((_ to_fp 8 24) roundNearestTiesToEven 4611686018427382800.0)) (.cse6 (= ((_ sign_extend 24) (_ bv0 8)) (select .cse8 (bvadd (_ bv3 32) |~#BOOL_unsigned_char_Array_0~0.offset|)))) (.cse7 (= currentRoundingMode roundNearestTiesToEven))) (or (and (fp.leq .cse1 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse2))) .cse3 (fp.geq .cse1 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse4))) .cse5 .cse6 .cse7) (and (fp.geq .cse1 ((_ to_fp 11 53) roundNearestTiesToEven .cse2)) .cse3 .cse5 (fp.leq .cse1 ((_ to_fp 11 53) roundNearestTiesToEven .cse4)) .cse6 .cse7))))) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet62#1_69| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet62#1_69|) .cse0)) (= ((_ sign_extend 24) (_ bv1 8)) (select .cse8 |~#BOOL_unsigned_char_Array_0~0.offset|)) (not (= ~last_1_BOOL_unsigned_char_Array_0_0__0_~0 (_ bv0 8))) (bvsle ((_ zero_extend 24) ((_ extract 7 0) .cse13)) (_ bv0 32)) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet59#1_67| (_ BitVec 8))) (= .cse13 ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet59#1_67|)))))) [2023-12-24 13:21:51,326 INFO L899 garLoopResultBuilder]: For program point L77-1(line 77) no Hoare annotation was computed. [2023-12-24 13:21:51,326 INFO L899 garLoopResultBuilder]: For program point L44(lines 44 48) no Hoare annotation was computed. [2023-12-24 13:21:51,326 INFO L895 garLoopResultBuilder]: At program point L78(line 78) the Hoare annotation is: (let ((.cse8 (select |#memory_int#1| |~#BOOL_unsigned_char_Array_0~0.base|))) (let ((.cse0 (select .cse8 (bvadd |~#BOOL_unsigned_char_Array_0~0.offset| (_ bv1 32)))) (.cse13 (select .cse8 (bvadd (_ bv2 32) |~#BOOL_unsigned_char_Array_0~0.offset|)))) (and (bvsle ((_ zero_extend 24) ((_ extract 7 0) .cse0)) (_ bv0 32)) (let ((.cse12 (select |#memory_int#2| |~#double_Array_0~0.base|))) (let ((.cse11 (select .cse12 (_ bv32 32))) (.cse10 (select .cse12 (_ bv36 32)))) (let ((.cse2 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0))) (.cse3 (exists ((|v_skolemized_q#valueAsBitvector_153| (_ BitVec 64))) (and (= ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_153|) .cse11) (= .cse10 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_153|))))) (.cse5 (= |~#double_Array_0~0.offset| (_ bv0 32))) (.cse1 (let ((.cse9 (concat .cse10 .cse11))) (fp ((_ extract 63 63) .cse9) ((_ extract 62 52) .cse9) ((_ extract 51 0) .cse9)))) (.cse4 ((_ to_fp 8 24) roundNearestTiesToEven 4611686018427382800.0)) (.cse6 (= ((_ sign_extend 24) (_ bv0 8)) (select .cse8 (bvadd (_ bv3 32) |~#BOOL_unsigned_char_Array_0~0.offset|)))) (.cse7 (= currentRoundingMode roundNearestTiesToEven))) (or (and (fp.leq .cse1 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse2))) .cse3 (fp.geq .cse1 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse4))) .cse5 .cse6 .cse7) (and (fp.geq .cse1 ((_ to_fp 11 53) roundNearestTiesToEven .cse2)) .cse3 .cse5 (fp.leq .cse1 ((_ to_fp 11 53) roundNearestTiesToEven .cse4)) .cse6 .cse7))))) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet62#1_69| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet62#1_69|) .cse0)) (= ((_ sign_extend 24) (_ bv1 8)) (select .cse8 |~#BOOL_unsigned_char_Array_0~0.offset|)) (not (= ~last_1_BOOL_unsigned_char_Array_0_0__0_~0 (_ bv0 8))) (bvsle ((_ zero_extend 24) ((_ extract 7 0) .cse13)) (_ bv0 32)) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet59#1_67| (_ BitVec 8))) (= .cse13 ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet59#1_67|)))))) [2023-12-24 13:21:51,326 INFO L899 garLoopResultBuilder]: For program point L78-1(line 78) no Hoare annotation was computed. [2023-12-24 13:21:51,326 INFO L895 garLoopResultBuilder]: At program point L80(line 80) the Hoare annotation is: (let ((.cse8 (select |#memory_int#1| |~#BOOL_unsigned_char_Array_0~0.base|))) (let ((.cse0 (select .cse8 (bvadd |~#BOOL_unsigned_char_Array_0~0.offset| (_ bv1 32)))) (.cse13 (select .cse8 (bvadd (_ bv2 32) |~#BOOL_unsigned_char_Array_0~0.offset|)))) (and (bvsle ((_ zero_extend 24) ((_ extract 7 0) .cse0)) (_ bv0 32)) (let ((.cse12 (select |#memory_int#2| |~#double_Array_0~0.base|))) (let ((.cse11 (select .cse12 (_ bv32 32))) (.cse10 (select .cse12 (_ bv36 32)))) (let ((.cse2 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0))) (.cse3 (exists ((|v_skolemized_q#valueAsBitvector_153| (_ BitVec 64))) (and (= ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_153|) .cse11) (= .cse10 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_153|))))) (.cse5 (= |~#double_Array_0~0.offset| (_ bv0 32))) (.cse1 (let ((.cse9 (concat .cse10 .cse11))) (fp ((_ extract 63 63) .cse9) ((_ extract 62 52) .cse9) ((_ extract 51 0) .cse9)))) (.cse4 ((_ to_fp 8 24) roundNearestTiesToEven 4611686018427382800.0)) (.cse6 (= ((_ sign_extend 24) (_ bv0 8)) (select .cse8 (bvadd (_ bv3 32) |~#BOOL_unsigned_char_Array_0~0.offset|)))) (.cse7 (= currentRoundingMode roundNearestTiesToEven))) (or (and (fp.leq .cse1 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse2))) .cse3 (fp.geq .cse1 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse4))) .cse5 .cse6 .cse7) (and (fp.geq .cse1 ((_ to_fp 11 53) roundNearestTiesToEven .cse2)) .cse3 .cse5 (fp.leq .cse1 ((_ to_fp 11 53) roundNearestTiesToEven .cse4)) .cse6 .cse7))))) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet62#1_69| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet62#1_69|) .cse0)) (= ((_ sign_extend 24) (_ bv1 8)) (select .cse8 |~#BOOL_unsigned_char_Array_0~0.offset|)) (not (= ~last_1_BOOL_unsigned_char_Array_0_0__0_~0 (_ bv0 8))) (bvsle ((_ zero_extend 24) ((_ extract 7 0) .cse13)) (_ bv0 32)) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet59#1_67| (_ BitVec 8))) (= .cse13 ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet59#1_67|)))))) [2023-12-24 13:21:51,326 INFO L899 garLoopResultBuilder]: For program point L80-1(line 80) no Hoare annotation was computed. [2023-12-24 13:21:51,326 INFO L899 garLoopResultBuilder]: For program point L47(line 47) no Hoare annotation was computed. [2023-12-24 13:21:51,326 INFO L899 garLoopResultBuilder]: For program point L47-2(line 47) no Hoare annotation was computed. [2023-12-24 13:21:51,326 INFO L895 garLoopResultBuilder]: At program point L81(line 81) the Hoare annotation is: (let ((.cse8 (select |#memory_int#1| |~#BOOL_unsigned_char_Array_0~0.base|))) (let ((.cse0 (select .cse8 (bvadd |~#BOOL_unsigned_char_Array_0~0.offset| (_ bv1 32)))) (.cse13 (select .cse8 (bvadd (_ bv2 32) |~#BOOL_unsigned_char_Array_0~0.offset|)))) (and (bvsle ((_ zero_extend 24) ((_ extract 7 0) .cse0)) (_ bv0 32)) (let ((.cse12 (select |#memory_int#2| |~#double_Array_0~0.base|))) (let ((.cse11 (select .cse12 (_ bv32 32))) (.cse10 (select .cse12 (_ bv36 32)))) (let ((.cse2 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0))) (.cse3 (exists ((|v_skolemized_q#valueAsBitvector_153| (_ BitVec 64))) (and (= ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_153|) .cse11) (= .cse10 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_153|))))) (.cse5 (= |~#double_Array_0~0.offset| (_ bv0 32))) (.cse1 (let ((.cse9 (concat .cse10 .cse11))) (fp ((_ extract 63 63) .cse9) ((_ extract 62 52) .cse9) ((_ extract 51 0) .cse9)))) (.cse4 ((_ to_fp 8 24) roundNearestTiesToEven 4611686018427382800.0)) (.cse6 (= ((_ sign_extend 24) (_ bv0 8)) (select .cse8 (bvadd (_ bv3 32) |~#BOOL_unsigned_char_Array_0~0.offset|)))) (.cse7 (= currentRoundingMode roundNearestTiesToEven))) (or (and (fp.leq .cse1 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse2))) .cse3 (fp.geq .cse1 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse4))) .cse5 .cse6 .cse7) (and (fp.geq .cse1 ((_ to_fp 11 53) roundNearestTiesToEven .cse2)) .cse3 .cse5 (fp.leq .cse1 ((_ to_fp 11 53) roundNearestTiesToEven .cse4)) .cse6 .cse7))))) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet62#1_69| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet62#1_69|) .cse0)) (= ((_ sign_extend 24) (_ bv1 8)) (select .cse8 |~#BOOL_unsigned_char_Array_0~0.offset|)) (not (= ~last_1_BOOL_unsigned_char_Array_0_0__0_~0 (_ bv0 8))) (bvsle ((_ zero_extend 24) ((_ extract 7 0) .cse13)) (_ bv0 32)) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet59#1_67| (_ BitVec 8))) (= .cse13 ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet59#1_67|)))))) [2023-12-24 13:21:51,326 INFO L899 garLoopResultBuilder]: For program point L81-1(line 81) no Hoare annotation was computed. [2023-12-24 13:21:51,327 INFO L895 garLoopResultBuilder]: At program point L83(line 83) the Hoare annotation is: (let ((.cse8 (select |#memory_int#1| |~#BOOL_unsigned_char_Array_0~0.base|))) (let ((.cse0 (select .cse8 (bvadd |~#BOOL_unsigned_char_Array_0~0.offset| (_ bv1 32)))) (.cse13 (select .cse8 (bvadd (_ bv2 32) |~#BOOL_unsigned_char_Array_0~0.offset|)))) (and (bvsle ((_ zero_extend 24) ((_ extract 7 0) .cse0)) (_ bv0 32)) (let ((.cse12 (select |#memory_int#2| |~#double_Array_0~0.base|))) (let ((.cse11 (select .cse12 (_ bv32 32))) (.cse10 (select .cse12 (_ bv36 32)))) (let ((.cse2 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0))) (.cse3 (exists ((|v_skolemized_q#valueAsBitvector_153| (_ BitVec 64))) (and (= ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_153|) .cse11) (= .cse10 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_153|))))) (.cse5 (= |~#double_Array_0~0.offset| (_ bv0 32))) (.cse1 (let ((.cse9 (concat .cse10 .cse11))) (fp ((_ extract 63 63) .cse9) ((_ extract 62 52) .cse9) ((_ extract 51 0) .cse9)))) (.cse4 ((_ to_fp 8 24) roundNearestTiesToEven 4611686018427382800.0)) (.cse6 (= ((_ sign_extend 24) (_ bv0 8)) (select .cse8 (bvadd (_ bv3 32) |~#BOOL_unsigned_char_Array_0~0.offset|)))) (.cse7 (= currentRoundingMode roundNearestTiesToEven))) (or (and (fp.leq .cse1 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse2))) .cse3 (fp.geq .cse1 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse4))) .cse5 .cse6 .cse7) (and (fp.geq .cse1 ((_ to_fp 11 53) roundNearestTiesToEven .cse2)) .cse3 .cse5 (fp.leq .cse1 ((_ to_fp 11 53) roundNearestTiesToEven .cse4)) .cse6 .cse7))))) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet62#1_69| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet62#1_69|) .cse0)) (= ((_ sign_extend 24) (_ bv1 8)) (select .cse8 |~#BOOL_unsigned_char_Array_0~0.offset|)) (not (= ~last_1_BOOL_unsigned_char_Array_0_0__0_~0 (_ bv0 8))) (bvsle ((_ zero_extend 24) ((_ extract 7 0) .cse13)) (_ bv0 32)) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet59#1_67| (_ BitVec 8))) (= .cse13 ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet59#1_67|)))))) [2023-12-24 13:21:51,327 INFO L899 garLoopResultBuilder]: For program point L83-1(line 83) no Hoare annotation was computed. [2023-12-24 13:21:51,327 INFO L899 garLoopResultBuilder]: For program point L50(lines 50 54) no Hoare annotation was computed. [2023-12-24 13:21:51,327 INFO L899 garLoopResultBuilder]: For program point L50-2(lines 50 54) no Hoare annotation was computed. [2023-12-24 13:21:51,327 INFO L895 garLoopResultBuilder]: At program point L84(line 84) the Hoare annotation is: (let ((.cse8 (select |#memory_int#1| |~#BOOL_unsigned_char_Array_0~0.base|))) (let ((.cse0 (select .cse8 (bvadd |~#BOOL_unsigned_char_Array_0~0.offset| (_ bv1 32)))) (.cse13 (select .cse8 (bvadd (_ bv2 32) |~#BOOL_unsigned_char_Array_0~0.offset|)))) (and (bvsle ((_ zero_extend 24) ((_ extract 7 0) .cse0)) (_ bv0 32)) (let ((.cse12 (select |#memory_int#2| |~#double_Array_0~0.base|))) (let ((.cse11 (select .cse12 (_ bv32 32))) (.cse10 (select .cse12 (_ bv36 32)))) (let ((.cse2 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0))) (.cse3 (exists ((|v_skolemized_q#valueAsBitvector_153| (_ BitVec 64))) (and (= ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_153|) .cse11) (= .cse10 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_153|))))) (.cse5 (= |~#double_Array_0~0.offset| (_ bv0 32))) (.cse1 (let ((.cse9 (concat .cse10 .cse11))) (fp ((_ extract 63 63) .cse9) ((_ extract 62 52) .cse9) ((_ extract 51 0) .cse9)))) (.cse4 ((_ to_fp 8 24) roundNearestTiesToEven 4611686018427382800.0)) (.cse6 (= ((_ sign_extend 24) (_ bv0 8)) (select .cse8 (bvadd (_ bv3 32) |~#BOOL_unsigned_char_Array_0~0.offset|)))) (.cse7 (= currentRoundingMode roundNearestTiesToEven))) (or (and (fp.leq .cse1 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse2))) .cse3 (fp.geq .cse1 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse4))) .cse5 .cse6 .cse7) (and (fp.geq .cse1 ((_ to_fp 11 53) roundNearestTiesToEven .cse2)) .cse3 .cse5 (fp.leq .cse1 ((_ to_fp 11 53) roundNearestTiesToEven .cse4)) .cse6 .cse7))))) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet62#1_69| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet62#1_69|) .cse0)) (= ((_ sign_extend 24) (_ bv1 8)) (select .cse8 |~#BOOL_unsigned_char_Array_0~0.offset|)) (not (= ~last_1_BOOL_unsigned_char_Array_0_0__0_~0 (_ bv0 8))) (bvsle ((_ zero_extend 24) ((_ extract 7 0) .cse13)) (_ bv0 32)) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet59#1_67| (_ BitVec 8))) (= .cse13 ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet59#1_67|)))))) [2023-12-24 13:21:51,327 INFO L899 garLoopResultBuilder]: For program point L84-1(line 84) no Hoare annotation was computed. [2023-12-24 13:21:51,327 INFO L899 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2023-12-24 13:21:51,327 INFO L899 garLoopResultBuilder]: For program point L19-1(line 19) no Hoare annotation was computed. [2023-12-24 13:21:51,327 INFO L899 garLoopResultBuilder]: For program point L19-3(line 19) no Hoare annotation was computed. [2023-12-24 13:21:51,327 INFO L895 garLoopResultBuilder]: At program point L86(line 86) the Hoare annotation is: (let ((.cse8 (select |#memory_int#1| |~#BOOL_unsigned_char_Array_0~0.base|))) (let ((.cse0 (select .cse8 (bvadd |~#BOOL_unsigned_char_Array_0~0.offset| (_ bv1 32)))) (.cse13 (select .cse8 (bvadd (_ bv2 32) |~#BOOL_unsigned_char_Array_0~0.offset|)))) (and (bvsle ((_ zero_extend 24) ((_ extract 7 0) .cse0)) (_ bv0 32)) (let ((.cse12 (select |#memory_int#2| |~#double_Array_0~0.base|))) (let ((.cse11 (select .cse12 (_ bv32 32))) (.cse10 (select .cse12 (_ bv36 32)))) (let ((.cse2 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0))) (.cse3 (exists ((|v_skolemized_q#valueAsBitvector_153| (_ BitVec 64))) (and (= ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_153|) .cse11) (= .cse10 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_153|))))) (.cse5 (= |~#double_Array_0~0.offset| (_ bv0 32))) (.cse1 (let ((.cse9 (concat .cse10 .cse11))) (fp ((_ extract 63 63) .cse9) ((_ extract 62 52) .cse9) ((_ extract 51 0) .cse9)))) (.cse4 ((_ to_fp 8 24) roundNearestTiesToEven 4611686018427382800.0)) (.cse6 (= ((_ sign_extend 24) (_ bv0 8)) (select .cse8 (bvadd (_ bv3 32) |~#BOOL_unsigned_char_Array_0~0.offset|)))) (.cse7 (= currentRoundingMode roundNearestTiesToEven))) (or (and (fp.leq .cse1 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse2))) .cse3 (fp.geq .cse1 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse4))) .cse5 .cse6 .cse7) (and (fp.geq .cse1 ((_ to_fp 11 53) roundNearestTiesToEven .cse2)) .cse3 .cse5 (fp.leq .cse1 ((_ to_fp 11 53) roundNearestTiesToEven .cse4)) .cse6 .cse7))))) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet62#1_69| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet62#1_69|) .cse0)) (= ((_ sign_extend 24) (_ bv1 8)) (select .cse8 |~#BOOL_unsigned_char_Array_0~0.offset|)) (not (= ~last_1_BOOL_unsigned_char_Array_0_0__0_~0 (_ bv0 8))) (bvsle ((_ zero_extend 24) ((_ extract 7 0) .cse13)) (_ bv0 32)) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet59#1_67| (_ BitVec 8))) (= .cse13 ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet59#1_67|)))))) [2023-12-24 13:21:51,327 INFO L899 garLoopResultBuilder]: For program point L86-1(line 86) no Hoare annotation was computed. [2023-12-24 13:21:51,327 INFO L899 garLoopResultBuilder]: For program point L53(line 53) no Hoare annotation was computed. [2023-12-24 13:21:51,327 INFO L899 garLoopResultBuilder]: For program point L53-2(line 53) no Hoare annotation was computed. [2023-12-24 13:21:51,328 INFO L895 garLoopResultBuilder]: At program point L87(line 87) the Hoare annotation is: (let ((.cse8 (select |#memory_int#1| |~#BOOL_unsigned_char_Array_0~0.base|))) (let ((.cse0 (select .cse8 (bvadd |~#BOOL_unsigned_char_Array_0~0.offset| (_ bv1 32)))) (.cse13 (select .cse8 (bvadd (_ bv2 32) |~#BOOL_unsigned_char_Array_0~0.offset|)))) (and (bvsle ((_ zero_extend 24) ((_ extract 7 0) .cse0)) (_ bv0 32)) (let ((.cse12 (select |#memory_int#2| |~#double_Array_0~0.base|))) (let ((.cse11 (select .cse12 (_ bv32 32))) (.cse10 (select .cse12 (_ bv36 32)))) (let ((.cse2 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0))) (.cse3 (exists ((|v_skolemized_q#valueAsBitvector_153| (_ BitVec 64))) (and (= ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_153|) .cse11) (= .cse10 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_153|))))) (.cse5 (= |~#double_Array_0~0.offset| (_ bv0 32))) (.cse1 (let ((.cse9 (concat .cse10 .cse11))) (fp ((_ extract 63 63) .cse9) ((_ extract 62 52) .cse9) ((_ extract 51 0) .cse9)))) (.cse4 ((_ to_fp 8 24) roundNearestTiesToEven 4611686018427382800.0)) (.cse6 (= ((_ sign_extend 24) (_ bv0 8)) (select .cse8 (bvadd (_ bv3 32) |~#BOOL_unsigned_char_Array_0~0.offset|)))) (.cse7 (= currentRoundingMode roundNearestTiesToEven))) (or (and (fp.leq .cse1 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse2))) .cse3 (fp.geq .cse1 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse4))) .cse5 .cse6 .cse7) (and (fp.geq .cse1 ((_ to_fp 11 53) roundNearestTiesToEven .cse2)) .cse3 .cse5 (fp.leq .cse1 ((_ to_fp 11 53) roundNearestTiesToEven .cse4)) .cse6 .cse7))))) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet62#1_69| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet62#1_69|) .cse0)) (= ((_ sign_extend 24) (_ bv1 8)) (select .cse8 |~#BOOL_unsigned_char_Array_0~0.offset|)) (not (= ~last_1_BOOL_unsigned_char_Array_0_0__0_~0 (_ bv0 8))) (bvsle ((_ zero_extend 24) ((_ extract 7 0) .cse13)) (_ bv0 32)) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet59#1_67| (_ BitVec 8))) (= .cse13 ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet59#1_67|)))))) [2023-12-24 13:21:51,328 INFO L899 garLoopResultBuilder]: For program point L87-1(line 87) no Hoare annotation was computed. [2023-12-24 13:21:51,328 INFO L899 garLoopResultBuilder]: For program point L55(lines 55 59) no Hoare annotation was computed. [2023-12-24 13:21:51,328 INFO L899 garLoopResultBuilder]: For program point L56(line 56) no Hoare annotation was computed. [2023-12-24 13:21:51,328 INFO L899 garLoopResultBuilder]: For program point L56-2(line 56) no Hoare annotation was computed. [2023-12-24 13:21:51,328 INFO L899 garLoopResultBuilder]: For program point L56-3(line 56) no Hoare annotation was computed. [2023-12-24 13:21:51,328 INFO L899 garLoopResultBuilder]: For program point L56-5(line 56) no Hoare annotation was computed. [2023-12-24 13:21:51,328 INFO L899 garLoopResultBuilder]: For program point L56-6(line 56) no Hoare annotation was computed. [2023-12-24 13:21:51,328 INFO L899 garLoopResultBuilder]: For program point L56-8(line 56) no Hoare annotation was computed. [2023-12-24 13:21:51,328 INFO L899 garLoopResultBuilder]: For program point L56-10(line 56) no Hoare annotation was computed. [2023-12-24 13:21:51,328 INFO L899 garLoopResultBuilder]: For program point L56-12(line 56) no Hoare annotation was computed. [2023-12-24 13:21:51,328 INFO L899 garLoopResultBuilder]: For program point L56-13(line 56) no Hoare annotation was computed. [2023-12-24 13:21:51,328 INFO L899 garLoopResultBuilder]: For program point L56-14(line 56) no Hoare annotation was computed. [2023-12-24 13:21:51,328 INFO L899 garLoopResultBuilder]: For program point L56-16(line 56) no Hoare annotation was computed. [2023-12-24 13:21:51,328 INFO L899 garLoopResultBuilder]: For program point L56-18(line 56) no Hoare annotation was computed. [2023-12-24 13:21:51,328 INFO L899 garLoopResultBuilder]: For program point L56-20(line 56) no Hoare annotation was computed. [2023-12-24 13:21:51,328 INFO L899 garLoopResultBuilder]: For program point L56-21(line 56) no Hoare annotation was computed. [2023-12-24 13:21:51,328 INFO L899 garLoopResultBuilder]: For program point L56-23(line 56) no Hoare annotation was computed. [2023-12-24 13:21:51,328 INFO L899 garLoopResultBuilder]: For program point L56-25(line 56) no Hoare annotation was computed. [2023-12-24 13:21:51,328 INFO L899 garLoopResultBuilder]: For program point L56-27(line 56) no Hoare annotation was computed. [2023-12-24 13:21:51,328 INFO L899 garLoopResultBuilder]: For program point L56-28(line 56) no Hoare annotation was computed. [2023-12-24 13:21:51,328 INFO L899 garLoopResultBuilder]: For program point L56-29(line 56) no Hoare annotation was computed. [2023-12-24 13:21:51,328 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-12-24 13:21:51,328 INFO L899 garLoopResultBuilder]: For program point L93(line 93) no Hoare annotation was computed. [2023-12-24 13:21:51,329 INFO L899 garLoopResultBuilder]: For program point L93-1(line 93) no Hoare annotation was computed. [2023-12-24 13:21:51,329 INFO L899 garLoopResultBuilder]: For program point L93-2(line 93) no Hoare annotation was computed. [2023-12-24 13:21:51,329 INFO L899 garLoopResultBuilder]: For program point L93-4(line 93) no Hoare annotation was computed. [2023-12-24 13:21:51,329 INFO L899 garLoopResultBuilder]: For program point L93-6(line 93) no Hoare annotation was computed. [2023-12-24 13:21:51,329 INFO L899 garLoopResultBuilder]: For program point L93-8(line 93) no Hoare annotation was computed. [2023-12-24 13:21:51,329 INFO L899 garLoopResultBuilder]: For program point L93-9(line 93) no Hoare annotation was computed. [2023-12-24 13:21:51,329 INFO L899 garLoopResultBuilder]: For program point L93-10(line 93) no Hoare annotation was computed. [2023-12-24 13:21:51,329 INFO L899 garLoopResultBuilder]: For program point L93-12(line 93) no Hoare annotation was computed. [2023-12-24 13:21:51,329 INFO L899 garLoopResultBuilder]: For program point L93-14(line 93) no Hoare annotation was computed. [2023-12-24 13:21:51,329 INFO L899 garLoopResultBuilder]: For program point L93-15(line 93) no Hoare annotation was computed. [2023-12-24 13:21:51,329 INFO L899 garLoopResultBuilder]: For program point L93-17(line 93) no Hoare annotation was computed. [2023-12-24 13:21:51,329 INFO L899 garLoopResultBuilder]: For program point L93-18(line 93) no Hoare annotation was computed. [2023-12-24 13:21:51,329 INFO L899 garLoopResultBuilder]: For program point L93-19(line 93) no Hoare annotation was computed. [2023-12-24 13:21:51,329 INFO L899 garLoopResultBuilder]: For program point L93-20(line 93) no Hoare annotation was computed. [2023-12-24 13:21:51,329 INFO L899 garLoopResultBuilder]: For program point L93-22(line 93) no Hoare annotation was computed. [2023-12-24 13:21:51,329 INFO L899 garLoopResultBuilder]: For program point L93-24(line 93) no Hoare annotation was computed. [2023-12-24 13:21:51,329 INFO L899 garLoopResultBuilder]: For program point L93-25(line 93) no Hoare annotation was computed. [2023-12-24 13:21:51,329 INFO L899 garLoopResultBuilder]: For program point L93-27(line 93) no Hoare annotation was computed. [2023-12-24 13:21:51,329 INFO L899 garLoopResultBuilder]: For program point L93-29(line 93) no Hoare annotation was computed. [2023-12-24 13:21:51,329 INFO L899 garLoopResultBuilder]: For program point L93-30(line 93) no Hoare annotation was computed. [2023-12-24 13:21:51,329 INFO L899 garLoopResultBuilder]: For program point L93-31(line 93) no Hoare annotation was computed. [2023-12-24 13:21:51,329 INFO L899 garLoopResultBuilder]: For program point L93-32(line 93) no Hoare annotation was computed. [2023-12-24 13:21:51,329 INFO L899 garLoopResultBuilder]: For program point L93-34(line 93) no Hoare annotation was computed. [2023-12-24 13:21:51,329 INFO L899 garLoopResultBuilder]: For program point L93-35(line 93) no Hoare annotation was computed. [2023-12-24 13:21:51,329 INFO L899 garLoopResultBuilder]: For program point L93-37(line 93) no Hoare annotation was computed. [2023-12-24 13:21:51,329 INFO L899 garLoopResultBuilder]: For program point L93-38(line 93) no Hoare annotation was computed. [2023-12-24 13:21:51,330 INFO L899 garLoopResultBuilder]: For program point L93-40(line 93) no Hoare annotation was computed. [2023-12-24 13:21:51,330 INFO L899 garLoopResultBuilder]: For program point L93-42(line 93) no Hoare annotation was computed. [2023-12-24 13:21:51,330 INFO L899 garLoopResultBuilder]: For program point L93-44(line 93) no Hoare annotation was computed. [2023-12-24 13:21:51,330 INFO L899 garLoopResultBuilder]: For program point L93-45(line 93) no Hoare annotation was computed. [2023-12-24 13:21:51,330 INFO L899 garLoopResultBuilder]: For program point L93-46(line 93) no Hoare annotation was computed. [2023-12-24 13:21:51,330 INFO L899 garLoopResultBuilder]: For program point L93-48(line 93) no Hoare annotation was computed. [2023-12-24 13:21:51,330 INFO L899 garLoopResultBuilder]: For program point L93-50(line 93) no Hoare annotation was computed. [2023-12-24 13:21:51,330 INFO L899 garLoopResultBuilder]: For program point L93-52(line 93) no Hoare annotation was computed. [2023-12-24 13:21:51,330 INFO L899 garLoopResultBuilder]: For program point L93-53(line 93) no Hoare annotation was computed. [2023-12-24 13:21:51,330 INFO L899 garLoopResultBuilder]: For program point L93-55(line 93) no Hoare annotation was computed. [2023-12-24 13:21:51,330 INFO L899 garLoopResultBuilder]: For program point L93-57(line 93) no Hoare annotation was computed. [2023-12-24 13:21:51,330 INFO L899 garLoopResultBuilder]: For program point L93-59(line 93) no Hoare annotation was computed. [2023-12-24 13:21:51,330 INFO L899 garLoopResultBuilder]: For program point L93-60(line 93) no Hoare annotation was computed. [2023-12-24 13:21:51,330 INFO L899 garLoopResultBuilder]: For program point L93-61(line 93) no Hoare annotation was computed. [2023-12-24 13:21:51,330 INFO L899 garLoopResultBuilder]: For program point L93-63(line 93) no Hoare annotation was computed. [2023-12-24 13:21:51,330 INFO L899 garLoopResultBuilder]: For program point L93-65(line 93) no Hoare annotation was computed. [2023-12-24 13:21:51,330 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-12-24 13:21:51,330 INFO L895 garLoopResultBuilder]: At program point L63(line 63) the Hoare annotation is: (let ((.cse24 (select |#memory_int#2| |~#double_Array_0~0.base|))) (let ((.cse16 (select |#memory_int#1| |~#BOOL_unsigned_char_Array_0~0.base|)) (.cse20 (select .cse24 (_ bv36 32))) (.cse19 (select .cse24 (_ bv32 32)))) (let ((.cse8 ((_ sign_extend 24) (_ bv1 8))) (.cse17 (let ((.cse26 (concat .cse20 .cse19))) (fp ((_ extract 63 63) .cse26) ((_ extract 62 52) .cse26) ((_ extract 51 0) .cse26)))) (.cse18 ((_ to_fp 8 24) roundNearestTiesToEven 4611686018427382800.0)) (.cse21 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0))) (.cse10 (select .cse16 (bvadd |~#BOOL_unsigned_char_Array_0~0.offset| (_ bv1 32))))) (let ((.cse0 (bvsle ((_ zero_extend 24) ((_ extract 7 0) .cse10)) (_ bv0 32))) (.cse9 (= ((_ sign_extend 24) (_ bv0 8)) (select .cse16 (bvadd (_ bv3 32) |~#BOOL_unsigned_char_Array_0~0.offset|)))) (.cse7 (exists ((|v_skolemized_q#valueAsBitvector_120| (_ BitVec 64)) (|v_skolemized_q#valueAsBitvector_121| (_ BitVec 64))) (let ((.cse22 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_120|))) (let ((.cse23 (let ((.cse25 (concat .cse22 .cse19))) (fp ((_ extract 63 63) .cse25) ((_ extract 62 52) .cse25) ((_ extract 51 0) .cse25))))) (and (= .cse20 .cse22) (fp.geq .cse23 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse18))) (= ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_121|) (select .cse24 (_ bv0 32))) (= (select .cse24 (_ bv4 32)) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_121|)) (= .cse23 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_121|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_121|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_121|))) (fp.leq .cse23 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse21)))))))) (.cse1 (fp.geq .cse17 ((_ to_fp 11 53) roundNearestTiesToEven .cse21))) (.cse2 (exists ((|v_skolemized_q#valueAsBitvector_153| (_ BitVec 64))) (and (= ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_153|) .cse19) (= .cse20 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_153|))))) (.cse3 (= |~#double_Array_0~0.offset| (_ bv0 32))) (.cse4 (fp.leq .cse17 ((_ to_fp 11 53) roundNearestTiesToEven .cse18))) (.cse6 (= currentRoundingMode roundNearestTiesToEven)) (.cse11 (= .cse8 (select .cse16 |~#BOOL_unsigned_char_Array_0~0.offset|))) (.cse12 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet59#1_67| (_ BitVec 8))) (= (select .cse16 (bvadd (_ bv2 32) |~#BOOL_unsigned_char_Array_0~0.offset|)) ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet59#1_67|))))) (or (and .cse0 (let ((.cse5 (= ((_ extract 7 0) .cse8) ~last_1_BOOL_unsigned_char_Array_0_0__0_~0))) (or (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse3 .cse5 .cse6))) .cse9 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet62#1_69| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet62#1_69|) .cse10)) .cse11 .cse12) (and .cse0 .cse9 (let ((.cse13 (let ((.cse14 (select |#memory_int#3| |~#signed_long_int_Array_0~0.base|))) (let ((.cse15 (select .cse14 |~#signed_long_int_Array_0~0.offset|))) (or (= (bvadd (select .cse14 (bvadd (_ bv4 32) |~#signed_long_int_Array_0~0.offset|)) (bvneg .cse15) (select .cse14 (bvadd |~#signed_long_int_Array_0~0.offset| (_ bv12 32)))) (select .cse14 (bvadd (_ bv16 32) |~#signed_long_int_Array_0~0.offset|))) (not (bvslt .cse15 (_ bv0 32)))))))) (or (and .cse7 .cse13 .cse3 .cse6) (and .cse1 .cse13 .cse2 .cse3 .cse4 .cse6))) .cse11 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet62#1_53| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet62#1_53|) .cse10)) (not (= ~last_1_BOOL_unsigned_char_Array_0_0__0_~0 (_ bv0 8))) .cse12)))))) [2023-12-24 13:21:51,331 INFO L899 garLoopResultBuilder]: For program point L63-1(line 63) no Hoare annotation was computed. [2023-12-24 13:21:51,331 INFO L895 garLoopResultBuilder]: At program point L64(line 64) the Hoare annotation is: (let ((.cse26 (select |#memory_int#2| |~#double_Array_0~0.base|))) (let ((.cse18 (select |#memory_int#1| |~#BOOL_unsigned_char_Array_0~0.base|)) (.cse22 (select .cse26 (_ bv36 32))) (.cse21 (select .cse26 (_ bv32 32)))) (let ((.cse8 ((_ sign_extend 24) (_ bv1 8))) (.cse19 (let ((.cse28 (concat .cse22 .cse21))) (fp ((_ extract 63 63) .cse28) ((_ extract 62 52) .cse28) ((_ extract 51 0) .cse28)))) (.cse20 ((_ to_fp 8 24) roundNearestTiesToEven 4611686018427382800.0)) (.cse23 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0))) (.cse17 (select .cse18 (bvadd (_ bv2 32) |~#BOOL_unsigned_char_Array_0~0.offset|))) (.cse11 (select .cse18 (bvadd |~#BOOL_unsigned_char_Array_0~0.offset| (_ bv1 32))))) (let ((.cse0 (bvsle ((_ zero_extend 24) ((_ extract 7 0) .cse11)) (_ bv0 32))) (.cse9 (= ((_ extract 7 0) .cse17) |ULTIMATE.start_updateVariables_#t~mem61#1|)) (.cse10 (= ((_ sign_extend 24) (_ bv0 8)) (select .cse18 (bvadd (_ bv3 32) |~#BOOL_unsigned_char_Array_0~0.offset|)))) (.cse7 (exists ((|v_skolemized_q#valueAsBitvector_120| (_ BitVec 64)) (|v_skolemized_q#valueAsBitvector_121| (_ BitVec 64))) (let ((.cse24 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_120|))) (let ((.cse25 (let ((.cse27 (concat .cse24 .cse21))) (fp ((_ extract 63 63) .cse27) ((_ extract 62 52) .cse27) ((_ extract 51 0) .cse27))))) (and (= .cse22 .cse24) (fp.geq .cse25 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse20))) (= ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_121|) (select .cse26 (_ bv0 32))) (= (select .cse26 (_ bv4 32)) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_121|)) (= .cse25 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_121|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_121|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_121|))) (fp.leq .cse25 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse23)))))))) (.cse1 (fp.geq .cse19 ((_ to_fp 11 53) roundNearestTiesToEven .cse23))) (.cse2 (exists ((|v_skolemized_q#valueAsBitvector_153| (_ BitVec 64))) (and (= ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_153|) .cse21) (= .cse22 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_153|))))) (.cse3 (= |~#double_Array_0~0.offset| (_ bv0 32))) (.cse4 (fp.leq .cse19 ((_ to_fp 11 53) roundNearestTiesToEven .cse20))) (.cse6 (= currentRoundingMode roundNearestTiesToEven)) (.cse12 (= .cse8 (select .cse18 |~#BOOL_unsigned_char_Array_0~0.offset|))) (.cse13 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet59#1_67| (_ BitVec 8))) (= .cse17 ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet59#1_67|))))) (or (and .cse0 (let ((.cse5 (= ((_ extract 7 0) .cse8) ~last_1_BOOL_unsigned_char_Array_0_0__0_~0))) (or (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse3 .cse5 .cse6))) .cse9 .cse10 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet62#1_69| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet62#1_69|) .cse11)) .cse12 .cse13) (and .cse0 .cse9 .cse10 (let ((.cse14 (let ((.cse15 (select |#memory_int#3| |~#signed_long_int_Array_0~0.base|))) (let ((.cse16 (select .cse15 |~#signed_long_int_Array_0~0.offset|))) (or (= (bvadd (select .cse15 (bvadd (_ bv4 32) |~#signed_long_int_Array_0~0.offset|)) (bvneg .cse16) (select .cse15 (bvadd |~#signed_long_int_Array_0~0.offset| (_ bv12 32)))) (select .cse15 (bvadd (_ bv16 32) |~#signed_long_int_Array_0~0.offset|))) (not (bvslt .cse16 (_ bv0 32)))))))) (or (and .cse7 .cse14 .cse3 .cse6) (and .cse1 .cse14 .cse2 .cse3 .cse4 .cse6))) .cse12 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet62#1_53| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet62#1_53|) .cse11)) (not (= ~last_1_BOOL_unsigned_char_Array_0_0__0_~0 (_ bv0 8))) .cse13)))))) [2023-12-24 13:21:51,331 INFO L899 garLoopResultBuilder]: For program point L64-1(line 64) no Hoare annotation was computed. [2023-12-24 13:21:51,331 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2023-12-24 13:21:51,331 INFO L895 garLoopResultBuilder]: At program point L66(line 66) the Hoare annotation is: (let ((.cse21 (select |#memory_int#1| |~#BOOL_unsigned_char_Array_0~0.base|))) (let ((.cse7 ((_ sign_extend 24) (_ bv1 8))) (.cse23 (select .cse21 (bvadd (_ bv2 32) |~#BOOL_unsigned_char_Array_0~0.offset|)))) (and (let ((.cse19 (select |#memory_int#2| |~#double_Array_0~0.base|))) (let ((.cse15 (select .cse19 (_ bv36 32))) (.cse14 (select .cse19 (_ bv32 32)))) (let ((.cse12 (let ((.cse22 (concat .cse15 .cse14))) (fp ((_ extract 63 63) .cse22) ((_ extract 62 52) .cse22) ((_ extract 51 0) .cse22)))) (.cse13 ((_ to_fp 8 24) roundNearestTiesToEven 4611686018427382800.0)) (.cse16 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0)))) (let ((.cse8 (= ((_ sign_extend 24) (_ bv0 8)) (select .cse21 (bvadd (_ bv3 32) |~#BOOL_unsigned_char_Array_0~0.offset|)))) (.cse6 (exists ((|v_skolemized_q#valueAsBitvector_120| (_ BitVec 64)) (|v_skolemized_q#valueAsBitvector_121| (_ BitVec 64))) (let ((.cse17 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_120|))) (let ((.cse18 (let ((.cse20 (concat .cse17 .cse14))) (fp ((_ extract 63 63) .cse20) ((_ extract 62 52) .cse20) ((_ extract 51 0) .cse20))))) (and (= .cse15 .cse17) (fp.geq .cse18 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse13))) (= ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_121|) (select .cse19 (_ bv0 32))) (= (select .cse19 (_ bv4 32)) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_121|)) (= .cse18 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_121|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_121|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_121|))) (fp.leq .cse18 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse16)))))))) (.cse0 (fp.geq .cse12 ((_ to_fp 11 53) roundNearestTiesToEven .cse16))) (.cse1 (exists ((|v_skolemized_q#valueAsBitvector_153| (_ BitVec 64))) (and (= ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_153|) .cse14) (= .cse15 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_153|))))) (.cse2 (= |~#double_Array_0~0.offset| (_ bv0 32))) (.cse3 (fp.leq .cse12 ((_ to_fp 11 53) roundNearestTiesToEven .cse13))) (.cse5 (= currentRoundingMode roundNearestTiesToEven))) (or (and (let ((.cse4 (= ((_ extract 7 0) .cse7) ~last_1_BOOL_unsigned_char_Array_0_0__0_~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse6 .cse2 .cse4 .cse5))) .cse8) (and .cse8 (let ((.cse9 (let ((.cse10 (select |#memory_int#3| |~#signed_long_int_Array_0~0.base|))) (let ((.cse11 (select .cse10 |~#signed_long_int_Array_0~0.offset|))) (or (= (bvadd (select .cse10 (bvadd (_ bv4 32) |~#signed_long_int_Array_0~0.offset|)) (bvneg .cse11) (select .cse10 (bvadd |~#signed_long_int_Array_0~0.offset| (_ bv12 32)))) (select .cse10 (bvadd (_ bv16 32) |~#signed_long_int_Array_0~0.offset|))) (not (bvslt .cse11 (_ bv0 32)))))))) (or (and .cse6 .cse9 .cse2 .cse5) (and .cse0 .cse9 .cse1 .cse2 .cse3 .cse5))) (not (= ~last_1_BOOL_unsigned_char_Array_0_0__0_~0 (_ bv0 8))))))))) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet62#1_69| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet62#1_69|) (select .cse21 (bvadd |~#BOOL_unsigned_char_Array_0~0.offset| (_ bv1 32))))) (= .cse7 (select .cse21 |~#BOOL_unsigned_char_Array_0~0.offset|)) (bvsle ((_ zero_extend 24) ((_ extract 7 0) .cse23)) (_ bv0 32)) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet59#1_67| (_ BitVec 8))) (= .cse23 ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet59#1_67|)))))) [2023-12-24 13:21:51,331 INFO L899 garLoopResultBuilder]: For program point L66-1(line 66) no Hoare annotation was computed. [2023-12-24 13:21:51,333 INFO L895 garLoopResultBuilder]: At program point L99-2(lines 99 105) the Hoare annotation is: (let ((.cse13 (select |#memory_int#1| |~#BOOL_unsigned_char_Array_0~0.base|))) (let ((.cse23 (select .cse13 (bvadd |~#BOOL_unsigned_char_Array_0~0.offset| (_ bv1 32)))) (.cse12 ((_ sign_extend 24) (_ bv1 8))) (.cse25 (select .cse13 (bvadd (_ bv2 32) |~#BOOL_unsigned_char_Array_0~0.offset|)))) (and (let ((.cse18 (select |#memory_int#2| |~#double_Array_0~0.base|))) (let ((.cse14 (select .cse18 (_ bv36 32))) (.cse21 (select .cse18 (_ bv32 32)))) (let ((.cse17 ((_ to_fp 8 24) roundNearestTiesToEven 4611686018427382800.0)) (.cse22 (let ((.cse24 (concat .cse14 .cse21))) (fp ((_ extract 63 63) .cse24) ((_ extract 62 52) .cse24) ((_ extract 51 0) .cse24)))) (.cse19 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0)))) (let ((.cse0 (bvsle ((_ zero_extend 24) ((_ extract 7 0) .cse23)) (_ bv0 32))) (.cse6 (fp.geq .cse22 ((_ to_fp 11 53) roundNearestTiesToEven .cse19))) (.cse7 (exists ((|v_skolemized_q#valueAsBitvector_153| (_ BitVec 64))) (and (= ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_153|) .cse21) (= .cse14 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_153|))))) (.cse8 (fp.leq .cse22 ((_ to_fp 11 53) roundNearestTiesToEven .cse17))) (.cse2 (exists ((|v_skolemized_q#valueAsBitvector_120| (_ BitVec 64)) (|v_skolemized_q#valueAsBitvector_121| (_ BitVec 64))) (let ((.cse15 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_120|))) (let ((.cse16 (let ((.cse20 (concat .cse15 .cse21))) (fp ((_ extract 63 63) .cse20) ((_ extract 62 52) .cse20) ((_ extract 51 0) .cse20))))) (and (= .cse14 .cse15) (fp.geq .cse16 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse17))) (= ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_121|) (select .cse18 (_ bv0 32))) (= (select .cse18 (_ bv4 32)) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_121|)) (= .cse16 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_121|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_121|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_121|))) (fp.leq .cse16 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse19)))))))) (.cse4 (= |~#double_Array_0~0.offset| (_ bv0 32))) (.cse5 (= currentRoundingMode roundNearestTiesToEven)) (.cse1 (= ((_ sign_extend 24) (_ bv0 8)) (select .cse13 (bvadd (_ bv3 32) |~#BOOL_unsigned_char_Array_0~0.offset|))))) (or (and .cse0 .cse1 (let ((.cse3 (let ((.cse9 (select |#memory_int#3| |~#signed_long_int_Array_0~0.base|))) (let ((.cse10 (select .cse9 |~#signed_long_int_Array_0~0.offset|))) (or (= (bvadd (select .cse9 (bvadd (_ bv4 32) |~#signed_long_int_Array_0~0.offset|)) (bvneg .cse10) (select .cse9 (bvadd |~#signed_long_int_Array_0~0.offset| (_ bv12 32)))) (select .cse9 (bvadd (_ bv16 32) |~#signed_long_int_Array_0~0.offset|))) (not (bvslt .cse10 (_ bv0 32)))))))) (or (and .cse2 .cse3 .cse4 .cse5) (and .cse6 .cse3 .cse7 .cse4 .cse8 .cse5))) (not (= ~last_1_BOOL_unsigned_char_Array_0_0__0_~0 (_ bv0 8)))) (and .cse0 (let ((.cse11 (= ((_ extract 7 0) .cse12) ~last_1_BOOL_unsigned_char_Array_0_0__0_~0))) (or (and .cse6 .cse7 .cse4 .cse8 .cse11 .cse5) (and .cse2 .cse4 .cse11 .cse5))) .cse1)))))) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet62#1_69| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet62#1_69|) .cse23)) (= .cse12 (select .cse13 |~#BOOL_unsigned_char_Array_0~0.offset|)) (bvsle ((_ zero_extend 24) ((_ extract 7 0) .cse25)) (_ bv0 32)) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet59#1_67| (_ BitVec 8))) (= .cse25 ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet59#1_67|)))))) [2023-12-24 13:21:51,333 INFO L899 garLoopResultBuilder]: For program point L99-3(lines 99 105) no Hoare annotation was computed. [2023-12-24 13:21:51,333 INFO L895 garLoopResultBuilder]: At program point L67(line 67) the Hoare annotation is: (let ((.cse23 (select |#memory_int#1| |~#BOOL_unsigned_char_Array_0~0.base|))) (let ((.cse13 (select .cse23 (bvadd |~#BOOL_unsigned_char_Array_0~0.offset| (_ bv1 32)))) (.cse7 ((_ sign_extend 24) (_ bv1 8))) (.cse25 (select .cse23 (bvadd (_ bv2 32) |~#BOOL_unsigned_char_Array_0~0.offset|)))) (and (let ((.cse21 (select |#memory_int#2| |~#double_Array_0~0.base|))) (let ((.cse17 (select .cse21 (_ bv36 32))) (.cse16 (select .cse21 (_ bv32 32)))) (let ((.cse14 (let ((.cse24 (concat .cse17 .cse16))) (fp ((_ extract 63 63) .cse24) ((_ extract 62 52) .cse24) ((_ extract 51 0) .cse24)))) (.cse15 ((_ to_fp 8 24) roundNearestTiesToEven 4611686018427382800.0)) (.cse18 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0)))) (let ((.cse8 (= ((_ sign_extend 24) (_ bv0 8)) (select .cse23 (bvadd (_ bv3 32) |~#BOOL_unsigned_char_Array_0~0.offset|)))) (.cse6 (exists ((|v_skolemized_q#valueAsBitvector_120| (_ BitVec 64)) (|v_skolemized_q#valueAsBitvector_121| (_ BitVec 64))) (let ((.cse19 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_120|))) (let ((.cse20 (let ((.cse22 (concat .cse19 .cse16))) (fp ((_ extract 63 63) .cse22) ((_ extract 62 52) .cse22) ((_ extract 51 0) .cse22))))) (and (= .cse17 .cse19) (fp.geq .cse20 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse15))) (= ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_121|) (select .cse21 (_ bv0 32))) (= (select .cse21 (_ bv4 32)) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_121|)) (= .cse20 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_121|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_121|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_121|))) (fp.leq .cse20 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse18)))))))) (.cse0 (fp.geq .cse14 ((_ to_fp 11 53) roundNearestTiesToEven .cse18))) (.cse1 (exists ((|v_skolemized_q#valueAsBitvector_153| (_ BitVec 64))) (and (= ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_153|) .cse16) (= .cse17 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_153|))))) (.cse2 (= |~#double_Array_0~0.offset| (_ bv0 32))) (.cse3 (fp.leq .cse14 ((_ to_fp 11 53) roundNearestTiesToEven .cse15))) (.cse5 (= currentRoundingMode roundNearestTiesToEven)) (.cse9 (= |ULTIMATE.start_updateVariables_#t~mem64#1| ((_ extract 7 0) .cse13)))) (or (and (let ((.cse4 (= ((_ extract 7 0) .cse7) ~last_1_BOOL_unsigned_char_Array_0_0__0_~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse6 .cse2 .cse4 .cse5))) .cse8 .cse9) (and .cse8 (let ((.cse10 (let ((.cse11 (select |#memory_int#3| |~#signed_long_int_Array_0~0.base|))) (let ((.cse12 (select .cse11 |~#signed_long_int_Array_0~0.offset|))) (or (= (bvadd (select .cse11 (bvadd (_ bv4 32) |~#signed_long_int_Array_0~0.offset|)) (bvneg .cse12) (select .cse11 (bvadd |~#signed_long_int_Array_0~0.offset| (_ bv12 32)))) (select .cse11 (bvadd (_ bv16 32) |~#signed_long_int_Array_0~0.offset|))) (not (bvslt .cse12 (_ bv0 32)))))))) (or (and .cse6 .cse10 .cse2 .cse5) (and .cse0 .cse10 .cse1 .cse2 .cse3 .cse5))) (not (= ~last_1_BOOL_unsigned_char_Array_0_0__0_~0 (_ bv0 8))) .cse9)))))) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet62#1_69| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet62#1_69|) .cse13)) (= .cse7 (select .cse23 |~#BOOL_unsigned_char_Array_0~0.offset|)) (bvsle ((_ zero_extend 24) ((_ extract 7 0) .cse25)) (_ bv0 32)) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet59#1_67| (_ BitVec 8))) (= .cse25 ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet59#1_67|)))))) [2023-12-24 13:21:51,333 INFO L899 garLoopResultBuilder]: For program point L67-1(line 67) no Hoare annotation was computed. [2023-12-24 13:21:51,333 INFO L899 garLoopResultBuilder]: For program point L34(lines 34 60) no Hoare annotation was computed. [2023-12-24 13:21:51,343 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 13:21:51,344 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-24 13:21:51,369 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#BOOL_unsigned_char_Array_0~0!base][~bvadd~32(~#BOOL_unsigned_char_Array_0~0!offset, 1bv32)] could not be translated [2023-12-24 13:21:51,371 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#BOOL_unsigned_char_Array_0~0!base][~bvadd~32(3bv32, ~#BOOL_unsigned_char_Array_0~0!offset)] could not be translated [2023-12-24 13:21:51,376 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_skolemized_q#valueAsBitvector_120 : bv64, v_skolemized_q#valueAsBitvector_121 : bv64 :: ((((#memory_int#2[~#double_Array_0~0!base][36bv32] == v_skolemized_q#valueAsBitvector_120[63:32] && ~fp.geq~64(~fp~64((v_skolemized_q#valueAsBitvector_120[63:32] ++ #memory_int#2[~#double_Array_0~0!base][32bv32])[63:63], (v_skolemized_q#valueAsBitvector_120[63:32] ++ #memory_int#2[~#double_Array_0~0!base][32bv32])[62:52], (v_skolemized_q#valueAsBitvector_120[63:32] ++ #memory_int#2[~#double_Array_0~0!base][32bv32])[51:0]), ~to_fp~64(~roundNearestTiesToEven, ~fp.neg~32(~to_fp~32(~roundNearestTiesToEven, 4.6116860184273828E18))))) && v_skolemized_q#valueAsBitvector_121[31:0] == #memory_int#2[~#double_Array_0~0!base][0bv32]) && #memory_int#2[~#double_Array_0~0!base][4bv32] == v_skolemized_q#valueAsBitvector_121[63:32]) && ~fp~64((v_skolemized_q#valueAsBitvector_120[63:32] ++ #memory_int#2[~#double_Array_0~0!base][32bv32])[63:63], (v_skolemized_q#valueAsBitvector_120[63:32] ++ #memory_int#2[~#double_Array_0~0!base][32bv32])[62:52], (v_skolemized_q#valueAsBitvector_120[63:32] ++ #memory_int#2[~#double_Array_0~0!base][32bv32])[51:0]) == ~fp~64(v_skolemized_q#valueAsBitvector_121[63:63], v_skolemized_q#valueAsBitvector_121[62:52], v_skolemized_q#valueAsBitvector_121[51:0])) && ~fp.leq~64(~fp~64((v_skolemized_q#valueAsBitvector_120[63:32] ++ #memory_int#2[~#double_Array_0~0!base][32bv32])[63:63], (v_skolemized_q#valueAsBitvector_120[63:32] ++ #memory_int#2[~#double_Array_0~0!base][32bv32])[62:52], (v_skolemized_q#valueAsBitvector_120[63:32] ++ #memory_int#2[~#double_Array_0~0!base][32bv32])[51:0]), ~to_fp~64(~roundNearestTiesToEven, ~fp.neg~32(~to_fp~32(~roundNearestTiesToEven, 1/100000000000000000000))))) could not be translated [2023-12-24 13:21:51,376 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~#signed_long_int_Array_0~0!base][~bvadd~32(4bv32, ~#signed_long_int_Array_0~0!offset)] could not be translated [2023-12-24 13:21:51,376 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~#signed_long_int_Array_0~0!base][~bvadd~32(16bv32, ~#signed_long_int_Array_0~0!offset)] could not be translated [2023-12-24 13:21:51,377 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~#signed_long_int_Array_0~0!base][~#signed_long_int_Array_0~0!offset] could not be translated [2023-12-24 13:21:51,377 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated [2023-12-24 13:21:51,377 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#double_Array_0~0!base][36bv32] could not be translated [2023-12-24 13:21:51,377 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#double_Array_0~0!base][32bv32] could not be translated [2023-12-24 13:21:51,377 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#double_Array_0~0!base][36bv32] could not be translated [2023-12-24 13:21:51,377 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#double_Array_0~0!base][32bv32] could not be translated [2023-12-24 13:21:51,377 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#double_Array_0~0!base][36bv32] could not be translated [2023-12-24 13:21:51,377 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#double_Array_0~0!base][32bv32] could not be translated [2023-12-24 13:21:51,378 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: fp can only be backtranslated, if the arguments are literals: FunctionApplication[~fp~64,[BitVectorAccessExpression[BinaryExpression[BITVECCONCAT,ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#double_Array_0~0!base,GLOBAL]]],[BitvecLiteral[36,32]]],ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#double_Array_0~0!base,GLOBAL]]],[BitvecLiteral[32,32]]]],63,63],BitVectorAccessExpression[BinaryExpression[BITVECCONCAT,ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#double_Array_0~0!base,GLOBAL]]],[BitvecLiteral[36,32]]],ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#double_Array_0~0!base,GLOBAL]]],[BitvecLiteral[32,32]]]],62,52],BitVectorAccessExpression[BinaryExpression[BITVECCONCAT,ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#double_Array_0~0!base,GLOBAL]]],[BitvecLiteral[36,32]]],ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#double_Array_0~0!base,GLOBAL]]],[BitvecLiteral[32,32]]]],51,0]]] [2023-12-24 13:21:51,378 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~#signed_long_int_Array_0~0!base][~bvadd~32(4bv32, ~#signed_long_int_Array_0~0!offset)] could not be translated [2023-12-24 13:21:51,378 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~#signed_long_int_Array_0~0!base][~bvadd~32(16bv32, ~#signed_long_int_Array_0~0!offset)] could not be translated [2023-12-24 13:21:51,378 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~#signed_long_int_Array_0~0!base][~#signed_long_int_Array_0~0!offset] could not be translated [2023-12-24 13:21:51,378 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_skolemized_q#valueAsBitvector_153 : bv64 :: v_skolemized_q#valueAsBitvector_153[31:0] == #memory_int#2[~#double_Array_0~0!base][32bv32] && #memory_int#2[~#double_Array_0~0!base][36bv32] == v_skolemized_q#valueAsBitvector_153[63:32]) could not be translated [2023-12-24 13:21:51,378 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#double_Array_0~0!base][36bv32] could not be translated [2023-12-24 13:21:51,378 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#double_Array_0~0!base][32bv32] could not be translated [2023-12-24 13:21:51,378 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#double_Array_0~0!base][36bv32] could not be translated [2023-12-24 13:21:51,378 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#double_Array_0~0!base][32bv32] could not be translated [2023-12-24 13:21:51,378 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#double_Array_0~0!base][36bv32] could not be translated [2023-12-24 13:21:51,378 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#double_Array_0~0!base][32bv32] could not be translated [2023-12-24 13:21:51,379 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: fp can only be backtranslated, if the arguments are literals: FunctionApplication[~fp~64,[BitVectorAccessExpression[BinaryExpression[BITVECCONCAT,ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#double_Array_0~0!base,GLOBAL]]],[BitvecLiteral[36,32]]],ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#double_Array_0~0!base,GLOBAL]]],[BitvecLiteral[32,32]]]],63,63],BitVectorAccessExpression[BinaryExpression[BITVECCONCAT,ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#double_Array_0~0!base,GLOBAL]]],[BitvecLiteral[36,32]]],ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#double_Array_0~0!base,GLOBAL]]],[BitvecLiteral[32,32]]]],62,52],BitVectorAccessExpression[BinaryExpression[BITVECCONCAT,ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#double_Array_0~0!base,GLOBAL]]],[BitvecLiteral[36,32]]],ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#double_Array_0~0!base,GLOBAL]]],[BitvecLiteral[32,32]]]],51,0]]] [2023-12-24 13:21:51,379 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated [2023-12-24 13:21:51,379 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#BOOL_unsigned_char_Array_0~0!base][~bvadd~32(~#BOOL_unsigned_char_Array_0~0!offset, 1bv32)] could not be translated [2023-12-24 13:21:51,379 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#double_Array_0~0!base][36bv32] could not be translated [2023-12-24 13:21:51,379 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#double_Array_0~0!base][32bv32] could not be translated [2023-12-24 13:21:51,380 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#double_Array_0~0!base][36bv32] could not be translated [2023-12-24 13:21:51,380 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#double_Array_0~0!base][32bv32] could not be translated [2023-12-24 13:21:51,380 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#double_Array_0~0!base][36bv32] could not be translated [2023-12-24 13:21:51,380 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#double_Array_0~0!base][32bv32] could not be translated [2023-12-24 13:21:51,380 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: fp can only be backtranslated, if the arguments are literals: FunctionApplication[~fp~64,[BitVectorAccessExpression[BinaryExpression[BITVECCONCAT,ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#double_Array_0~0!base,GLOBAL]]],[BitvecLiteral[36,32]]],ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#double_Array_0~0!base,GLOBAL]]],[BitvecLiteral[32,32]]]],63,63],BitVectorAccessExpression[BinaryExpression[BITVECCONCAT,ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#double_Array_0~0!base,GLOBAL]]],[BitvecLiteral[36,32]]],ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#double_Array_0~0!base,GLOBAL]]],[BitvecLiteral[32,32]]]],62,52],BitVectorAccessExpression[BinaryExpression[BITVECCONCAT,ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#double_Array_0~0!base,GLOBAL]]],[BitvecLiteral[36,32]]],ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#double_Array_0~0!base,GLOBAL]]],[BitvecLiteral[32,32]]]],51,0]]] [2023-12-24 13:21:51,380 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_skolemized_q#valueAsBitvector_153 : bv64 :: v_skolemized_q#valueAsBitvector_153[31:0] == #memory_int#2[~#double_Array_0~0!base][32bv32] && #memory_int#2[~#double_Array_0~0!base][36bv32] == v_skolemized_q#valueAsBitvector_153[63:32]) could not be translated [2023-12-24 13:21:51,380 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#double_Array_0~0!base][36bv32] could not be translated [2023-12-24 13:21:51,380 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#double_Array_0~0!base][32bv32] could not be translated [2023-12-24 13:21:51,380 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#double_Array_0~0!base][36bv32] could not be translated [2023-12-24 13:21:51,380 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#double_Array_0~0!base][32bv32] could not be translated [2023-12-24 13:21:51,380 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#double_Array_0~0!base][36bv32] could not be translated [2023-12-24 13:21:51,380 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#double_Array_0~0!base][32bv32] could not be translated [2023-12-24 13:21:51,380 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: fp can only be backtranslated, if the arguments are literals: FunctionApplication[~fp~64,[BitVectorAccessExpression[BinaryExpression[BITVECCONCAT,ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#double_Array_0~0!base,GLOBAL]]],[BitvecLiteral[36,32]]],ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#double_Array_0~0!base,GLOBAL]]],[BitvecLiteral[32,32]]]],63,63],BitVectorAccessExpression[BinaryExpression[BITVECCONCAT,ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#double_Array_0~0!base,GLOBAL]]],[BitvecLiteral[36,32]]],ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#double_Array_0~0!base,GLOBAL]]],[BitvecLiteral[32,32]]]],62,52],BitVectorAccessExpression[BinaryExpression[BITVECCONCAT,ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#double_Array_0~0!base,GLOBAL]]],[BitvecLiteral[36,32]]],ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#double_Array_0~0!base,GLOBAL]]],[BitvecLiteral[32,32]]]],51,0]]] [2023-12-24 13:21:51,381 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated [2023-12-24 13:21:51,387 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_skolemized_q#valueAsBitvector_120 : bv64, v_skolemized_q#valueAsBitvector_121 : bv64 :: ((((#memory_int#2[~#double_Array_0~0!base][36bv32] == v_skolemized_q#valueAsBitvector_120[63:32] && ~fp.geq~64(~fp~64((v_skolemized_q#valueAsBitvector_120[63:32] ++ #memory_int#2[~#double_Array_0~0!base][32bv32])[63:63], (v_skolemized_q#valueAsBitvector_120[63:32] ++ #memory_int#2[~#double_Array_0~0!base][32bv32])[62:52], (v_skolemized_q#valueAsBitvector_120[63:32] ++ #memory_int#2[~#double_Array_0~0!base][32bv32])[51:0]), ~to_fp~64(~roundNearestTiesToEven, ~fp.neg~32(~to_fp~32(~roundNearestTiesToEven, 4.6116860184273828E18))))) && v_skolemized_q#valueAsBitvector_121[31:0] == #memory_int#2[~#double_Array_0~0!base][0bv32]) && #memory_int#2[~#double_Array_0~0!base][4bv32] == v_skolemized_q#valueAsBitvector_121[63:32]) && ~fp~64((v_skolemized_q#valueAsBitvector_120[63:32] ++ #memory_int#2[~#double_Array_0~0!base][32bv32])[63:63], (v_skolemized_q#valueAsBitvector_120[63:32] ++ #memory_int#2[~#double_Array_0~0!base][32bv32])[62:52], (v_skolemized_q#valueAsBitvector_120[63:32] ++ #memory_int#2[~#double_Array_0~0!base][32bv32])[51:0]) == ~fp~64(v_skolemized_q#valueAsBitvector_121[63:63], v_skolemized_q#valueAsBitvector_121[62:52], v_skolemized_q#valueAsBitvector_121[51:0])) && ~fp.leq~64(~fp~64((v_skolemized_q#valueAsBitvector_120[63:32] ++ #memory_int#2[~#double_Array_0~0!base][32bv32])[63:63], (v_skolemized_q#valueAsBitvector_120[63:32] ++ #memory_int#2[~#double_Array_0~0!base][32bv32])[62:52], (v_skolemized_q#valueAsBitvector_120[63:32] ++ #memory_int#2[~#double_Array_0~0!base][32bv32])[51:0]), ~to_fp~64(~roundNearestTiesToEven, ~fp.neg~32(~to_fp~32(~roundNearestTiesToEven, 1/100000000000000000000))))) could not be translated [2023-12-24 13:21:51,387 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated [2023-12-24 13:21:51,387 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#BOOL_unsigned_char_Array_0~0!base][~bvadd~32(3bv32, ~#BOOL_unsigned_char_Array_0~0!offset)] could not be translated [2023-12-24 13:21:51,387 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_updateVariables_#t~nondet62#1_69 : bv8 :: ~sign_extend~32~8(v_ULTIMATE.start_updateVariables_#t~nondet62#1_69) == #memory_int#1[~#BOOL_unsigned_char_Array_0~0!base][~bvadd~32(~#BOOL_unsigned_char_Array_0~0!offset, 1bv32)]) could not be translated [2023-12-24 13:21:51,387 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#BOOL_unsigned_char_Array_0~0!base][~#BOOL_unsigned_char_Array_0~0!offset] could not be translated [2023-12-24 13:21:51,387 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#BOOL_unsigned_char_Array_0~0!base][~bvadd~32(2bv32, ~#BOOL_unsigned_char_Array_0~0!offset)] could not be translated [2023-12-24 13:21:51,387 WARN L1574 BoogieBacktranslator]: Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_updateVariables_#t~nondet59#1_67 : bv8 :: #memory_int#1[~#BOOL_unsigned_char_Array_0~0!base][~bvadd~32(2bv32, ~#BOOL_unsigned_char_Array_0~0!offset)] == ~sign_extend~32~8(v_ULTIMATE.start_updateVariables_#t~nondet59#1_67)) could not be translated [2023-12-24 13:21:51,388 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.12 01:21:51 BoogieIcfgContainer [2023-12-24 13:21:51,388 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-24 13:21:51,388 INFO L158 Benchmark]: Toolchain (without parser) took 829576.95ms. Allocated memory was 220.2MB in the beginning and 858.8MB in the end (delta: 638.6MB). Free memory was 176.2MB in the beginning and 781.5MB in the end (delta: -605.3MB). Peak memory consumption was 521.4MB. Max. memory is 8.0GB. [2023-12-24 13:21:51,388 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 170.9MB. Free memory is still 121.5MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-24 13:21:51,388 INFO L158 Benchmark]: CACSL2BoogieTranslator took 322.83ms. Allocated memory is still 220.2MB. Free memory was 175.8MB in the beginning and 158.3MB in the end (delta: 17.5MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2023-12-24 13:21:51,389 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.93ms. Allocated memory is still 220.2MB. Free memory was 158.3MB in the beginning and 153.8MB in the end (delta: 4.5MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. [2023-12-24 13:21:51,389 INFO L158 Benchmark]: Boogie Preprocessor took 56.12ms. Allocated memory is still 220.2MB. Free memory was 153.8MB in the beginning and 147.5MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 8.0GB. [2023-12-24 13:21:51,389 INFO L158 Benchmark]: RCFGBuilder took 1521.18ms. Allocated memory is still 220.2MB. Free memory was 147.5MB in the beginning and 154.6MB in the end (delta: -7.1MB). Peak memory consumption was 30.5MB. Max. memory is 8.0GB. [2023-12-24 13:21:51,389 INFO L158 Benchmark]: TraceAbstraction took 827615.71ms. Allocated memory was 220.2MB in the beginning and 858.8MB in the end (delta: 638.6MB). Free memory was 154.1MB in the beginning and 781.5MB in the end (delta: -627.4MB). Peak memory consumption was 498.3MB. Max. memory is 8.0GB. [2023-12-24 13:21:51,389 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.12ms. Allocated memory is still 170.9MB. Free memory is still 121.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 322.83ms. Allocated memory is still 220.2MB. Free memory was 175.8MB in the beginning and 158.3MB in the end (delta: 17.5MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 56.93ms. Allocated memory is still 220.2MB. Free memory was 158.3MB in the beginning and 153.8MB in the end (delta: 4.5MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 56.12ms. Allocated memory is still 220.2MB. Free memory was 153.8MB in the beginning and 147.5MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 8.0GB. * RCFGBuilder took 1521.18ms. Allocated memory is still 220.2MB. Free memory was 147.5MB in the beginning and 154.6MB in the end (delta: -7.1MB). Peak memory consumption was 30.5MB. Max. memory is 8.0GB. * TraceAbstraction took 827615.71ms. Allocated memory was 220.2MB in the beginning and 858.8MB in the end (delta: 638.6MB). Free memory was 154.1MB in the beginning and 781.5MB in the end (delta: -627.4MB). Peak memory consumption was 498.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#BOOL_unsigned_char_Array_0~0!base][~bvadd~32(~#BOOL_unsigned_char_Array_0~0!offset, 1bv32)] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#BOOL_unsigned_char_Array_0~0!base][~bvadd~32(3bv32, ~#BOOL_unsigned_char_Array_0~0!offset)] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_skolemized_q#valueAsBitvector_120 : bv64, v_skolemized_q#valueAsBitvector_121 : bv64 :: ((((#memory_int#2[~#double_Array_0~0!base][36bv32] == v_skolemized_q#valueAsBitvector_120[63:32] && ~fp.geq~64(~fp~64((v_skolemized_q#valueAsBitvector_120[63:32] ++ #memory_int#2[~#double_Array_0~0!base][32bv32])[63:63], (v_skolemized_q#valueAsBitvector_120[63:32] ++ #memory_int#2[~#double_Array_0~0!base][32bv32])[62:52], (v_skolemized_q#valueAsBitvector_120[63:32] ++ #memory_int#2[~#double_Array_0~0!base][32bv32])[51:0]), ~to_fp~64(~roundNearestTiesToEven, ~fp.neg~32(~to_fp~32(~roundNearestTiesToEven, 4.6116860184273828E18))))) && v_skolemized_q#valueAsBitvector_121[31:0] == #memory_int#2[~#double_Array_0~0!base][0bv32]) && #memory_int#2[~#double_Array_0~0!base][4bv32] == v_skolemized_q#valueAsBitvector_121[63:32]) && ~fp~64((v_skolemized_q#valueAsBitvector_120[63:32] ++ #memory_int#2[~#double_Array_0~0!base][32bv32])[63:63], (v_skolemized_q#valueAsBitvector_120[63:32] ++ #memory_int#2[~#double_Array_0~0!base][32bv32])[62:52], (v_skolemized_q#valueAsBitvector_120[63:32] ++ #memory_int#2[~#double_Array_0~0!base][32bv32])[51:0]) == ~fp~64(v_skolemized_q#valueAsBitvector_121[63:63], v_skolemized_q#valueAsBitvector_121[62:52], v_skolemized_q#valueAsBitvector_121[51:0])) && ~fp.leq~64(~fp~64((v_skolemized_q#valueAsBitvector_120[63:32] ++ #memory_int#2[~#double_Array_0~0!base][32bv32])[63:63], (v_skolemized_q#valueAsBitvector_120[63:32] ++ #memory_int#2[~#double_Array_0~0!base][32bv32])[62:52], (v_skolemized_q#valueAsBitvector_120[63:32] ++ #memory_int#2[~#double_Array_0~0!base][32bv32])[51:0]), ~to_fp~64(~roundNearestTiesToEven, ~fp.neg~32(~to_fp~32(~roundNearestTiesToEven, 1/100000000000000000000))))) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~#signed_long_int_Array_0~0!base][~bvadd~32(4bv32, ~#signed_long_int_Array_0~0!offset)] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~#signed_long_int_Array_0~0!base][~bvadd~32(16bv32, ~#signed_long_int_Array_0~0!offset)] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~#signed_long_int_Array_0~0!base][~#signed_long_int_Array_0~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#double_Array_0~0!base][36bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#double_Array_0~0!base][32bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#double_Array_0~0!base][36bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#double_Array_0~0!base][32bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#double_Array_0~0!base][36bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#double_Array_0~0!base][32bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: fp can only be backtranslated, if the arguments are literals: FunctionApplication[~fp~64,[BitVectorAccessExpression[BinaryExpression[BITVECCONCAT,ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#double_Array_0~0!base,GLOBAL]]],[BitvecLiteral[36,32]]],ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#double_Array_0~0!base,GLOBAL]]],[BitvecLiteral[32,32]]]],63,63],BitVectorAccessExpression[BinaryExpression[BITVECCONCAT,ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#double_Array_0~0!base,GLOBAL]]],[BitvecLiteral[36,32]]],ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#double_Array_0~0!base,GLOBAL]]],[BitvecLiteral[32,32]]]],62,52],BitVectorAccessExpression[BinaryExpression[BITVECCONCAT,ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#double_Array_0~0!base,GLOBAL]]],[BitvecLiteral[36,32]]],ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#double_Array_0~0!base,GLOBAL]]],[BitvecLiteral[32,32]]]],51,0]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~#signed_long_int_Array_0~0!base][~bvadd~32(4bv32, ~#signed_long_int_Array_0~0!offset)] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~#signed_long_int_Array_0~0!base][~bvadd~32(16bv32, ~#signed_long_int_Array_0~0!offset)] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#3[~#signed_long_int_Array_0~0!base][~#signed_long_int_Array_0~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_skolemized_q#valueAsBitvector_153 : bv64 :: v_skolemized_q#valueAsBitvector_153[31:0] == #memory_int#2[~#double_Array_0~0!base][32bv32] && #memory_int#2[~#double_Array_0~0!base][36bv32] == v_skolemized_q#valueAsBitvector_153[63:32]) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#double_Array_0~0!base][36bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#double_Array_0~0!base][32bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#double_Array_0~0!base][36bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#double_Array_0~0!base][32bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#double_Array_0~0!base][36bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#double_Array_0~0!base][32bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: fp can only be backtranslated, if the arguments are literals: FunctionApplication[~fp~64,[BitVectorAccessExpression[BinaryExpression[BITVECCONCAT,ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#double_Array_0~0!base,GLOBAL]]],[BitvecLiteral[36,32]]],ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#double_Array_0~0!base,GLOBAL]]],[BitvecLiteral[32,32]]]],63,63],BitVectorAccessExpression[BinaryExpression[BITVECCONCAT,ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#double_Array_0~0!base,GLOBAL]]],[BitvecLiteral[36,32]]],ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#double_Array_0~0!base,GLOBAL]]],[BitvecLiteral[32,32]]]],62,52],BitVectorAccessExpression[BinaryExpression[BITVECCONCAT,ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#double_Array_0~0!base,GLOBAL]]],[BitvecLiteral[36,32]]],ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#double_Array_0~0!base,GLOBAL]]],[BitvecLiteral[32,32]]]],51,0]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#BOOL_unsigned_char_Array_0~0!base][~bvadd~32(~#BOOL_unsigned_char_Array_0~0!offset, 1bv32)] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#double_Array_0~0!base][36bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#double_Array_0~0!base][32bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#double_Array_0~0!base][36bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#double_Array_0~0!base][32bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#double_Array_0~0!base][36bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#double_Array_0~0!base][32bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: fp can only be backtranslated, if the arguments are literals: FunctionApplication[~fp~64,[BitVectorAccessExpression[BinaryExpression[BITVECCONCAT,ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#double_Array_0~0!base,GLOBAL]]],[BitvecLiteral[36,32]]],ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#double_Array_0~0!base,GLOBAL]]],[BitvecLiteral[32,32]]]],63,63],BitVectorAccessExpression[BinaryExpression[BITVECCONCAT,ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#double_Array_0~0!base,GLOBAL]]],[BitvecLiteral[36,32]]],ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#double_Array_0~0!base,GLOBAL]]],[BitvecLiteral[32,32]]]],62,52],BitVectorAccessExpression[BinaryExpression[BITVECCONCAT,ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#double_Array_0~0!base,GLOBAL]]],[BitvecLiteral[36,32]]],ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#double_Array_0~0!base,GLOBAL]]],[BitvecLiteral[32,32]]]],51,0]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_skolemized_q#valueAsBitvector_153 : bv64 :: v_skolemized_q#valueAsBitvector_153[31:0] == #memory_int#2[~#double_Array_0~0!base][32bv32] && #memory_int#2[~#double_Array_0~0!base][36bv32] == v_skolemized_q#valueAsBitvector_153[63:32]) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#double_Array_0~0!base][36bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#double_Array_0~0!base][32bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#double_Array_0~0!base][36bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#double_Array_0~0!base][32bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#double_Array_0~0!base][36bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#2[~#double_Array_0~0!base][32bv32] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: fp can only be backtranslated, if the arguments are literals: FunctionApplication[~fp~64,[BitVectorAccessExpression[BinaryExpression[BITVECCONCAT,ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#double_Array_0~0!base,GLOBAL]]],[BitvecLiteral[36,32]]],ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#double_Array_0~0!base,GLOBAL]]],[BitvecLiteral[32,32]]]],63,63],BitVectorAccessExpression[BinaryExpression[BITVECCONCAT,ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#double_Array_0~0!base,GLOBAL]]],[BitvecLiteral[36,32]]],ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#double_Array_0~0!base,GLOBAL]]],[BitvecLiteral[32,32]]]],62,52],BitVectorAccessExpression[BinaryExpression[BITVECCONCAT,ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#double_Array_0~0!base,GLOBAL]]],[BitvecLiteral[36,32]]],ArrayAccessExpression[ArrayAccessExpression[IdentifierExpression[#memory_int#2,GLOBAL],[IdentifierExpression[~#double_Array_0~0!base,GLOBAL]]],[BitvecLiteral[32,32]]]],51,0]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_skolemized_q#valueAsBitvector_120 : bv64, v_skolemized_q#valueAsBitvector_121 : bv64 :: ((((#memory_int#2[~#double_Array_0~0!base][36bv32] == v_skolemized_q#valueAsBitvector_120[63:32] && ~fp.geq~64(~fp~64((v_skolemized_q#valueAsBitvector_120[63:32] ++ #memory_int#2[~#double_Array_0~0!base][32bv32])[63:63], (v_skolemized_q#valueAsBitvector_120[63:32] ++ #memory_int#2[~#double_Array_0~0!base][32bv32])[62:52], (v_skolemized_q#valueAsBitvector_120[63:32] ++ #memory_int#2[~#double_Array_0~0!base][32bv32])[51:0]), ~to_fp~64(~roundNearestTiesToEven, ~fp.neg~32(~to_fp~32(~roundNearestTiesToEven, 4.6116860184273828E18))))) && v_skolemized_q#valueAsBitvector_121[31:0] == #memory_int#2[~#double_Array_0~0!base][0bv32]) && #memory_int#2[~#double_Array_0~0!base][4bv32] == v_skolemized_q#valueAsBitvector_121[63:32]) && ~fp~64((v_skolemized_q#valueAsBitvector_120[63:32] ++ #memory_int#2[~#double_Array_0~0!base][32bv32])[63:63], (v_skolemized_q#valueAsBitvector_120[63:32] ++ #memory_int#2[~#double_Array_0~0!base][32bv32])[62:52], (v_skolemized_q#valueAsBitvector_120[63:32] ++ #memory_int#2[~#double_Array_0~0!base][32bv32])[51:0]) == ~fp~64(v_skolemized_q#valueAsBitvector_121[63:63], v_skolemized_q#valueAsBitvector_121[62:52], v_skolemized_q#valueAsBitvector_121[51:0])) && ~fp.leq~64(~fp~64((v_skolemized_q#valueAsBitvector_120[63:32] ++ #memory_int#2[~#double_Array_0~0!base][32bv32])[63:63], (v_skolemized_q#valueAsBitvector_120[63:32] ++ #memory_int#2[~#double_Array_0~0!base][32bv32])[62:52], (v_skolemized_q#valueAsBitvector_120[63:32] ++ #memory_int#2[~#double_Array_0~0!base][32bv32])[51:0]), ~to_fp~64(~roundNearestTiesToEven, ~fp.neg~32(~to_fp~32(~roundNearestTiesToEven, 1/100000000000000000000))))) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression ~roundNearestTiesToEven could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#BOOL_unsigned_char_Array_0~0!base][~bvadd~32(3bv32, ~#BOOL_unsigned_char_Array_0~0!offset)] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_updateVariables_#t~nondet62#1_69 : bv8 :: ~sign_extend~32~8(v_ULTIMATE.start_updateVariables_#t~nondet62#1_69) == #memory_int#1[~#BOOL_unsigned_char_Array_0~0!base][~bvadd~32(~#BOOL_unsigned_char_Array_0~0!offset, 1bv32)]) could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#BOOL_unsigned_char_Array_0~0!base][~#BOOL_unsigned_char_Array_0~0!offset] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: ArrayAccessExpression #memory_int#1[~#BOOL_unsigned_char_Array_0~0!base][~bvadd~32(2bv32, ~#BOOL_unsigned_char_Array_0~0!offset)] could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: QuantifierExpression (exists v_ULTIMATE.start_updateVariables_#t~nondet59#1_67 : bv8 :: #memory_int#1[~#BOOL_unsigned_char_Array_0~0!base][~bvadd~32(2bv32, ~#BOOL_unsigned_char_Array_0~0!offset)] == ~sign_extend~32~8(v_ULTIMATE.start_updateVariables_#t~nondet59#1_67)) 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, 142 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 827.5s, OverallIterations: 29, TraceHistogramMax: 32, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 39.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 704.9s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 11038 SdHoareTripleChecker+Valid, 31.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 10995 mSDsluCounter, 38765 SdHoareTripleChecker+Invalid, 28.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 32383 mSDsCounter, 615 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 11347 IncrementalHoareTripleChecker+Invalid, 11962 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 615 mSolverCounterUnsat, 6382 mSDtfsCounter, 11347 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 7164 GetRequests, 6596 SyntacticMatches, 12 SemanticMatches, 556 ConstructedPredicates, 0 IntricatePredicates, 3 DeprecatedPredicates, 4159 ImplicationChecksByTransitivity, 44.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3790occurred in iteration=20, InterpolantAutomatonStates: 364, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.8s AutomataMinimizationTime, 29 MinimizatonAttempts, 8258 StatesRemovedByMinimization, 27 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 18 LocationsWithAnnotation, 1699 PreInvPairs, 1738 NumberOfFragments, 10044 HoareAnnotationTreeSize, 1699 FormulaSimplifications, 8838856 FormulaSimplificationTreeSizeReduction, 66.9s HoareSimplificationTime, 18 FormulaSimplificationsInter, 8484597 FormulaSimplificationTreeSizeReductionInter, 637.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 1.2s SsaConstructionTime, 8.3s SatisfiabilityAnalysisTime, 61.9s InterpolantComputationTime, 4646 NumberOfCodeBlocks, 4646 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 6820 ConstructedInterpolants, 1654 QuantifiedInterpolants, 114858 SizeOfPredicates, 246 NumberOfNonLiveVariables, 9961 ConjunctsInSsa, 436 ConjunctsInUnsatCore, 44 InterpolantComputations, 18 PerfectInterpolantSequences, 26082/30552 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: 99]: Loop Invariant Derived loop invariant: (((((null & 127) <= 0) && !((last_1_BOOL_unsigned_char_Array_0_0__0_ == 0))) || (((null & 127) <= 0) && (((1 & 127) == last_1_BOOL_unsigned_char_Array_0_0__0_) || ((1 & 127) == last_1_BOOL_unsigned_char_Array_0_0__0_)))) && ((null & 127) <= 0)) RESULT: Ultimate proved your program to be correct! [2023-12-24 13:21:51,596 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forcibly destroying the process [2023-12-24 13:21:51,647 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 137 Received shutdown request...