./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/bitvector/soft_float_5a.c.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 26d01a9c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/bitvector/soft_float_5a.c.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f6c91769726962c1478685c30d57ac239987d5f8a5f6832d1d60b9c031f35855 --- Real Ultimate output --- This is Ultimate 0.2.2-?-26d01a9 [2023-02-18 07:42:23,184 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-18 07:42:23,185 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-18 07:42:23,209 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-18 07:42:23,210 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-18 07:42:23,211 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-18 07:42:23,212 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-18 07:42:23,214 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-18 07:42:23,215 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-18 07:42:23,216 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-18 07:42:23,217 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-18 07:42:23,218 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-18 07:42:23,218 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-18 07:42:23,219 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-18 07:42:23,220 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-18 07:42:23,221 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-18 07:42:23,222 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-18 07:42:23,223 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-18 07:42:23,224 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-18 07:42:23,226 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-18 07:42:23,227 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-18 07:42:23,228 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-18 07:42:23,229 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-18 07:42:23,230 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-18 07:42:23,232 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-18 07:42:23,233 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-18 07:42:23,233 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-18 07:42:23,234 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-18 07:42:23,234 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-18 07:42:23,235 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-18 07:42:23,235 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-18 07:42:23,236 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-18 07:42:23,237 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-18 07:42:23,237 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-18 07:42:23,238 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-18 07:42:23,238 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-18 07:42:23,239 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-18 07:42:23,239 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-18 07:42:23,239 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-18 07:42:23,240 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-18 07:42:23,241 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-18 07:42:23,248 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2023-02-18 07:42:23,272 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-18 07:42:23,275 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-18 07:42:23,276 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-18 07:42:23,276 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-18 07:42:23,277 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-18 07:42:23,277 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-18 07:42:23,278 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-18 07:42:23,278 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-18 07:42:23,278 INFO L138 SettingsManager]: * Use SBE=true [2023-02-18 07:42:23,279 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-18 07:42:23,279 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-18 07:42:23,280 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-18 07:42:23,280 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-18 07:42:23,280 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-18 07:42:23,280 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-18 07:42:23,280 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-18 07:42:23,281 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-18 07:42:23,281 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-18 07:42:23,281 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2023-02-18 07:42:23,281 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-18 07:42:23,281 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-18 07:42:23,282 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-18 07:42:23,282 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-18 07:42:23,282 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-18 07:42:23,282 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-18 07:42:23,282 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-18 07:42:23,282 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-18 07:42:23,283 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-18 07:42:23,283 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-18 07:42:23,283 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-18 07:42:23,283 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-18 07:42:23,284 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-18 07:42:23,284 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-18 07:42:23,284 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-18 07:42:23,285 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-18 07:42:23,285 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-18 07:42:23,285 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-18 07:42:23,285 INFO L138 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f6c91769726962c1478685c30d57ac239987d5f8a5f6832d1d60b9c031f35855 [2023-02-18 07:42:23,508 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-18 07:42:23,529 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-18 07:42:23,532 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-18 07:42:23,533 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-18 07:42:23,533 INFO L275 PluginConnector]: CDTParser initialized [2023-02-18 07:42:23,535 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/soft_float_5a.c.cil.c [2023-02-18 07:42:24,771 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-18 07:42:24,992 INFO L351 CDTParser]: Found 1 translation units. [2023-02-18 07:42:24,997 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_5a.c.cil.c [2023-02-18 07:42:25,007 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/23e0c2aae/1c226f6415954fa9a364d37d25d68a49/FLAGa0534b060 [2023-02-18 07:42:25,023 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/23e0c2aae/1c226f6415954fa9a364d37d25d68a49 [2023-02-18 07:42:25,025 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-18 07:42:25,027 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-18 07:42:25,031 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-18 07:42:25,031 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-18 07:42:25,034 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-18 07:42:25,035 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.02 07:42:25" (1/1) ... [2023-02-18 07:42:25,037 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@229aa7a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 07:42:25, skipping insertion in model container [2023-02-18 07:42:25,037 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.02 07:42:25" (1/1) ... [2023-02-18 07:42:25,043 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-18 07:42:25,081 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-18 07:42:25,191 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_5a.c.cil.c[728,741] [2023-02-18 07:42:25,235 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-18 07:42:25,244 INFO L203 MainTranslator]: Completed pre-run [2023-02-18 07:42:25,254 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_5a.c.cil.c[728,741] [2023-02-18 07:42:25,286 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-18 07:42:25,297 INFO L208 MainTranslator]: Completed translation [2023-02-18 07:42:25,297 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 07:42:25 WrapperNode [2023-02-18 07:42:25,298 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-18 07:42:25,299 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-18 07:42:25,299 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-18 07:42:25,299 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-18 07:42:25,305 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 07:42:25" (1/1) ... [2023-02-18 07:42:25,315 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 07:42:25" (1/1) ... [2023-02-18 07:42:25,338 INFO L138 Inliner]: procedures = 17, calls = 15, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 176 [2023-02-18 07:42:25,338 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-18 07:42:25,339 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-18 07:42:25,339 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-18 07:42:25,339 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-18 07:42:25,351 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 07:42:25" (1/1) ... [2023-02-18 07:42:25,352 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 07:42:25" (1/1) ... [2023-02-18 07:42:25,354 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 07:42:25" (1/1) ... [2023-02-18 07:42:25,355 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 07:42:25" (1/1) ... [2023-02-18 07:42:25,361 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 07:42:25" (1/1) ... [2023-02-18 07:42:25,366 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 07:42:25" (1/1) ... [2023-02-18 07:42:25,368 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 07:42:25" (1/1) ... [2023-02-18 07:42:25,369 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 07:42:25" (1/1) ... [2023-02-18 07:42:25,372 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-18 07:42:25,373 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-18 07:42:25,373 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-18 07:42:25,373 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-18 07:42:25,374 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 07:42:25" (1/1) ... [2023-02-18 07:42:25,380 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-18 07:42:25,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 07:42:25,414 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-02-18 07:42:25,421 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-02-18 07:42:25,447 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-18 07:42:25,448 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-18 07:42:25,448 INFO L130 BoogieDeclarations]: Found specification of procedure base2flt [2023-02-18 07:42:25,448 INFO L138 BoogieDeclarations]: Found implementation of procedure base2flt [2023-02-18 07:42:25,448 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-18 07:42:25,448 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-18 07:42:25,449 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-02-18 07:42:25,449 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-02-18 07:42:25,535 INFO L235 CfgBuilder]: Building ICFG [2023-02-18 07:42:25,545 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-18 07:42:25,932 INFO L276 CfgBuilder]: Performing block encoding [2023-02-18 07:42:25,941 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-18 07:42:25,943 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2023-02-18 07:42:25,945 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 07:42:25 BoogieIcfgContainer [2023-02-18 07:42:25,945 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-18 07:42:25,947 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-18 07:42:25,947 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-18 07:42:25,950 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-18 07:42:25,950 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.02 07:42:25" (1/3) ... [2023-02-18 07:42:25,951 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58f87481 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.02 07:42:25, skipping insertion in model container [2023-02-18 07:42:25,951 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 07:42:25" (2/3) ... [2023-02-18 07:42:25,952 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58f87481 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.02 07:42:25, skipping insertion in model container [2023-02-18 07:42:25,952 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 07:42:25" (3/3) ... [2023-02-18 07:42:25,953 INFO L112 eAbstractionObserver]: Analyzing ICFG soft_float_5a.c.cil.c [2023-02-18 07:42:25,970 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-18 07:42:25,970 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 16 error locations. [2023-02-18 07:42:26,036 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-18 07:42:26,042 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=LoopsAndPotentialCycles, 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;@38f90130, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-18 07:42:26,042 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2023-02-18 07:42:26,046 INFO L276 IsEmpty]: Start isEmpty. Operand has 106 states, 82 states have (on average 1.670731707317073) internal successors, (137), 99 states have internal predecessors, (137), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-02-18 07:42:26,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-02-18 07:42:26,051 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 07:42:26,051 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 07:42:26,052 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-18 07:42:26,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 07:42:26,057 INFO L85 PathProgramCache]: Analyzing trace with hash 1819356335, now seen corresponding path program 1 times [2023-02-18 07:42:26,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 07:42:26,065 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933209984] [2023-02-18 07:42:26,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 07:42:26,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 07:42:26,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:26,295 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 07:42:26,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 07:42:26,296 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933209984] [2023-02-18 07:42:26,297 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [933209984] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 07:42:26,297 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 07:42:26,298 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-18 07:42:26,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145841457] [2023-02-18 07:42:26,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 07:42:26,303 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-18 07:42:26,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 07:42:26,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-18 07:42:26,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-18 07:42:26,330 INFO L87 Difference]: Start difference. First operand has 106 states, 82 states have (on average 1.670731707317073) internal successors, (137), 99 states have internal predecessors, (137), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 07:42:26,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 07:42:26,445 INFO L93 Difference]: Finished difference Result 257 states and 376 transitions. [2023-02-18 07:42:26,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-18 07:42:26,447 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2023-02-18 07:42:26,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 07:42:26,456 INFO L225 Difference]: With dead ends: 257 [2023-02-18 07:42:26,456 INFO L226 Difference]: Without dead ends: 130 [2023-02-18 07:42:26,460 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-02-18 07:42:26,464 INFO L413 NwaCegarLoop]: 124 mSDtfsCounter, 83 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 370 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 07:42:26,465 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 370 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 07:42:26,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2023-02-18 07:42:26,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 120. [2023-02-18 07:42:26,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 100 states have (on average 1.52) internal successors, (152), 113 states have internal predecessors, (152), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-18 07:42:26,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 160 transitions. [2023-02-18 07:42:26,509 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 160 transitions. Word has length 9 [2023-02-18 07:42:26,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 07:42:26,510 INFO L495 AbstractCegarLoop]: Abstraction has 120 states and 160 transitions. [2023-02-18 07:42:26,510 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 07:42:26,510 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 160 transitions. [2023-02-18 07:42:26,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-02-18 07:42:26,512 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 07:42:26,513 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 07:42:26,513 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-18 07:42:26,513 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-18 07:42:26,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 07:42:26,514 INFO L85 PathProgramCache]: Analyzing trace with hash -179612527, now seen corresponding path program 1 times [2023-02-18 07:42:26,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 07:42:26,515 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550053944] [2023-02-18 07:42:26,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 07:42:26,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 07:42:26,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:26,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 07:42:26,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 07:42:26,619 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550053944] [2023-02-18 07:42:26,620 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550053944] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 07:42:26,620 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 07:42:26,620 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-18 07:42:26,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529773662] [2023-02-18 07:42:26,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 07:42:26,622 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-18 07:42:26,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 07:42:26,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-18 07:42:26,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-02-18 07:42:26,623 INFO L87 Difference]: Start difference. First operand 120 states and 160 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 07:42:26,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 07:42:26,734 INFO L93 Difference]: Finished difference Result 265 states and 354 transitions. [2023-02-18 07:42:26,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-18 07:42:26,735 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2023-02-18 07:42:26,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 07:42:26,737 INFO L225 Difference]: With dead ends: 265 [2023-02-18 07:42:26,737 INFO L226 Difference]: Without dead ends: 148 [2023-02-18 07:42:26,738 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-02-18 07:42:26,739 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 128 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 343 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 07:42:26,739 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 343 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 07:42:26,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2023-02-18 07:42:26,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 129. [2023-02-18 07:42:26,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 109 states have (on average 1.5045871559633028) internal successors, (164), 122 states have internal predecessors, (164), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-18 07:42:26,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 172 transitions. [2023-02-18 07:42:26,764 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 172 transitions. Word has length 14 [2023-02-18 07:42:26,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 07:42:26,766 INFO L495 AbstractCegarLoop]: Abstraction has 129 states and 172 transitions. [2023-02-18 07:42:26,766 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 07:42:26,766 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 172 transitions. [2023-02-18 07:42:26,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-02-18 07:42:26,768 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 07:42:26,769 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 07:42:26,770 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-18 07:42:26,770 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-18 07:42:26,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 07:42:26,772 INFO L85 PathProgramCache]: Analyzing trace with hash -1273020929, now seen corresponding path program 1 times [2023-02-18 07:42:26,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 07:42:26,773 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896111783] [2023-02-18 07:42:26,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 07:42:26,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 07:42:26,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:26,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 07:42:26,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 07:42:26,873 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896111783] [2023-02-18 07:42:26,873 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [896111783] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 07:42:26,874 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 07:42:26,875 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-18 07:42:26,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668645488] [2023-02-18 07:42:26,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 07:42:26,876 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-18 07:42:26,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 07:42:26,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-18 07:42:26,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-18 07:42:26,878 INFO L87 Difference]: Start difference. First operand 129 states and 172 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 07:42:26,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 07:42:26,981 INFO L93 Difference]: Finished difference Result 156 states and 201 transitions. [2023-02-18 07:42:26,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-18 07:42:26,982 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2023-02-18 07:42:26,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 07:42:26,983 INFO L225 Difference]: With dead ends: 156 [2023-02-18 07:42:26,984 INFO L226 Difference]: Without dead ends: 154 [2023-02-18 07:42:26,984 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 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-02-18 07:42:26,985 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 112 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 07:42:26,986 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 355 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 07:42:26,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2023-02-18 07:42:26,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 129. [2023-02-18 07:42:26,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 109 states have (on average 1.4862385321100917) internal successors, (162), 122 states have internal predecessors, (162), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-18 07:42:27,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 170 transitions. [2023-02-18 07:42:27,001 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 170 transitions. Word has length 15 [2023-02-18 07:42:27,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 07:42:27,001 INFO L495 AbstractCegarLoop]: Abstraction has 129 states and 170 transitions. [2023-02-18 07:42:27,001 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 07:42:27,002 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 170 transitions. [2023-02-18 07:42:27,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-02-18 07:42:27,002 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 07:42:27,003 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 07:42:27,003 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-02-18 07:42:27,003 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting base2fltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-18 07:42:27,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 07:42:27,004 INFO L85 PathProgramCache]: Analyzing trace with hash 550260128, now seen corresponding path program 1 times [2023-02-18 07:42:27,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 07:42:27,004 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79014239] [2023-02-18 07:42:27,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 07:42:27,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 07:42:27,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:27,033 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-18 07:42:27,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 07:42:27,034 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79014239] [2023-02-18 07:42:27,034 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [79014239] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 07:42:27,034 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 07:42:27,034 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-18 07:42:27,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017806944] [2023-02-18 07:42:27,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 07:42:27,035 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-18 07:42:27,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 07:42:27,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-18 07:42:27,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-18 07:42:27,036 INFO L87 Difference]: Start difference. First operand 129 states and 170 transitions. Second operand has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 07:42:27,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 07:42:27,063 INFO L93 Difference]: Finished difference Result 137 states and 180 transitions. [2023-02-18 07:42:27,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-18 07:42:27,065 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2023-02-18 07:42:27,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 07:42:27,068 INFO L225 Difference]: With dead ends: 137 [2023-02-18 07:42:27,068 INFO L226 Difference]: Without dead ends: 136 [2023-02-18 07:42:27,069 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-18 07:42:27,079 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 4 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-18 07:42:27,081 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 188 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-18 07:42:27,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2023-02-18 07:42:27,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 126. [2023-02-18 07:42:27,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 107 states have (on average 1.4766355140186915) internal successors, (158), 119 states have internal predecessors, (158), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-18 07:42:27,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 166 transitions. [2023-02-18 07:42:27,092 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 166 transitions. Word has length 16 [2023-02-18 07:42:27,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 07:42:27,097 INFO L495 AbstractCegarLoop]: Abstraction has 126 states and 166 transitions. [2023-02-18 07:42:27,097 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 07:42:27,097 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 166 transitions. [2023-02-18 07:42:27,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-02-18 07:42:27,103 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 07:42:27,103 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 07:42:27,104 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-02-18 07:42:27,104 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-18 07:42:27,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 07:42:27,105 INFO L85 PathProgramCache]: Analyzing trace with hash -119643288, now seen corresponding path program 1 times [2023-02-18 07:42:27,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 07:42:27,105 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024419131] [2023-02-18 07:42:27,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 07:42:27,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 07:42:27,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:27,184 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 07:42:27,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 07:42:27,184 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024419131] [2023-02-18 07:42:27,184 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1024419131] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 07:42:27,185 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [761098870] [2023-02-18 07:42:27,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 07:42:27,185 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 07:42:27,186 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 07:42:27,191 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 07:42:27,193 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-02-18 07:42:27,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:27,264 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-18 07:42:27,268 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 07:42:27,328 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 07:42:27,340 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 07:42:27,341 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [761098870] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 07:42:27,341 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-18 07:42:27,341 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2023-02-18 07:42:27,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669369177] [2023-02-18 07:42:27,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 07:42:27,344 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-18 07:42:27,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 07:42:27,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-18 07:42:27,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-02-18 07:42:27,345 INFO L87 Difference]: Start difference. First operand 126 states and 166 transitions. Second operand has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 07:42:27,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 07:42:27,393 INFO L93 Difference]: Finished difference Result 155 states and 207 transitions. [2023-02-18 07:42:27,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-18 07:42:27,394 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2023-02-18 07:42:27,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 07:42:27,397 INFO L225 Difference]: With dead ends: 155 [2023-02-18 07:42:27,397 INFO L226 Difference]: Without dead ends: 154 [2023-02-18 07:42:27,401 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 15 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-02-18 07:42:27,402 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 16 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-18 07:42:27,402 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 299 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-18 07:42:27,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2023-02-18 07:42:27,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 128. [2023-02-18 07:42:27,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 109 states have (on average 1.4770642201834863) internal successors, (161), 121 states have internal predecessors, (161), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-18 07:42:27,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 169 transitions. [2023-02-18 07:42:27,423 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 169 transitions. Word has length 17 [2023-02-18 07:42:27,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 07:42:27,423 INFO L495 AbstractCegarLoop]: Abstraction has 128 states and 169 transitions. [2023-02-18 07:42:27,424 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 07:42:27,424 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 169 transitions. [2023-02-18 07:42:27,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-02-18 07:42:27,425 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 07:42:27,426 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 07:42:27,437 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-02-18 07:42:27,632 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 07:42:27,633 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-18 07:42:27,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 07:42:27,634 INFO L85 PathProgramCache]: Analyzing trace with hash -171865727, now seen corresponding path program 1 times [2023-02-18 07:42:27,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 07:42:27,634 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791070784] [2023-02-18 07:42:27,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 07:42:27,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 07:42:27,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:27,696 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-18 07:42:27,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 07:42:27,697 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791070784] [2023-02-18 07:42:27,697 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1791070784] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 07:42:27,697 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 07:42:27,697 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-18 07:42:27,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889275765] [2023-02-18 07:42:27,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 07:42:27,698 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-18 07:42:27,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 07:42:27,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-18 07:42:27,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-02-18 07:42:27,701 INFO L87 Difference]: Start difference. First operand 128 states and 169 transitions. Second operand has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 07:42:27,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 07:42:27,746 INFO L93 Difference]: Finished difference Result 161 states and 215 transitions. [2023-02-18 07:42:27,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-18 07:42:27,747 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2023-02-18 07:42:27,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 07:42:27,749 INFO L225 Difference]: With dead ends: 161 [2023-02-18 07:42:27,750 INFO L226 Difference]: Without dead ends: 159 [2023-02-18 07:42:27,751 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-02-18 07:42:27,751 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 22 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-18 07:42:27,752 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 201 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-18 07:42:27,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2023-02-18 07:42:27,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 130. [2023-02-18 07:42:27,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 112 states have (on average 1.4553571428571428) internal successors, (163), 123 states have internal predecessors, (163), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-18 07:42:27,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 171 transitions. [2023-02-18 07:42:27,774 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 171 transitions. Word has length 19 [2023-02-18 07:42:27,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 07:42:27,774 INFO L495 AbstractCegarLoop]: Abstraction has 130 states and 171 transitions. [2023-02-18 07:42:27,775 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 07:42:27,775 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 171 transitions. [2023-02-18 07:42:27,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-02-18 07:42:27,775 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 07:42:27,775 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 07:42:27,776 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-02-18 07:42:27,776 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-18 07:42:27,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 07:42:27,776 INFO L85 PathProgramCache]: Analyzing trace with hash -1906214428, now seen corresponding path program 1 times [2023-02-18 07:42:27,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 07:42:27,777 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053529298] [2023-02-18 07:42:27,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 07:42:27,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 07:42:27,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:27,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-18 07:42:27,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:27,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-18 07:42:27,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:27,862 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-02-18 07:42:27,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 07:42:27,862 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053529298] [2023-02-18 07:42:27,862 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1053529298] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 07:42:27,863 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 07:42:27,863 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-18 07:42:27,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947594474] [2023-02-18 07:42:27,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 07:42:27,864 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-18 07:42:27,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 07:42:27,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-18 07:42:27,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-18 07:42:27,865 INFO L87 Difference]: Start difference. First operand 130 states and 171 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-18 07:42:27,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 07:42:27,949 INFO L93 Difference]: Finished difference Result 193 states and 257 transitions. [2023-02-18 07:42:27,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-18 07:42:27,950 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2023-02-18 07:42:27,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 07:42:27,953 INFO L225 Difference]: With dead ends: 193 [2023-02-18 07:42:27,953 INFO L226 Difference]: Without dead ends: 191 [2023-02-18 07:42:27,954 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-02-18 07:42:27,954 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 130 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 07:42:27,955 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 277 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 07:42:27,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2023-02-18 07:42:27,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 161. [2023-02-18 07:42:27,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 142 states have (on average 1.4647887323943662) internal successors, (208), 153 states have internal predecessors, (208), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-18 07:42:27,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 216 transitions. [2023-02-18 07:42:27,972 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 216 transitions. Word has length 24 [2023-02-18 07:42:27,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 07:42:27,972 INFO L495 AbstractCegarLoop]: Abstraction has 161 states and 216 transitions. [2023-02-18 07:42:27,973 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-18 07:42:27,973 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 216 transitions. [2023-02-18 07:42:27,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-02-18 07:42:27,974 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 07:42:27,974 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 07:42:27,974 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-02-18 07:42:27,974 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-18 07:42:27,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 07:42:27,975 INFO L85 PathProgramCache]: Analyzing trace with hash -1934841784, now seen corresponding path program 1 times [2023-02-18 07:42:27,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 07:42:27,975 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63832670] [2023-02-18 07:42:27,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 07:42:27,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 07:42:27,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:28,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-18 07:42:28,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:28,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-18 07:42:28,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:28,039 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-02-18 07:42:28,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 07:42:28,039 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63832670] [2023-02-18 07:42:28,039 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [63832670] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 07:42:28,040 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 07:42:28,040 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-18 07:42:28,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153485789] [2023-02-18 07:42:28,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 07:42:28,041 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-18 07:42:28,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 07:42:28,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-18 07:42:28,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-18 07:42:28,043 INFO L87 Difference]: Start difference. First operand 161 states and 216 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-18 07:42:28,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 07:42:28,110 INFO L93 Difference]: Finished difference Result 185 states and 245 transitions. [2023-02-18 07:42:28,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-18 07:42:28,111 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2023-02-18 07:42:28,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 07:42:28,112 INFO L225 Difference]: With dead ends: 185 [2023-02-18 07:42:28,112 INFO L226 Difference]: Without dead ends: 183 [2023-02-18 07:42:28,113 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-02-18 07:42:28,114 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 131 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 07:42:28,114 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 277 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 07:42:28,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2023-02-18 07:42:28,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 154. [2023-02-18 07:42:28,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 135 states have (on average 1.451851851851852) internal successors, (196), 146 states have internal predecessors, (196), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-18 07:42:28,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 204 transitions. [2023-02-18 07:42:28,140 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 204 transitions. Word has length 24 [2023-02-18 07:42:28,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 07:42:28,142 INFO L495 AbstractCegarLoop]: Abstraction has 154 states and 204 transitions. [2023-02-18 07:42:28,142 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-18 07:42:28,142 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 204 transitions. [2023-02-18 07:42:28,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-02-18 07:42:28,143 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 07:42:28,144 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 07:42:28,144 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-02-18 07:42:28,144 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-18 07:42:28,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 07:42:28,145 INFO L85 PathProgramCache]: Analyzing trace with hash -735396699, now seen corresponding path program 1 times [2023-02-18 07:42:28,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 07:42:28,145 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571379218] [2023-02-18 07:42:28,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 07:42:28,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 07:42:28,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:28,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-18 07:42:28,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:28,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-18 07:42:28,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:28,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-18 07:42:28,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:28,231 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-02-18 07:42:28,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 07:42:28,231 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571379218] [2023-02-18 07:42:28,231 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1571379218] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 07:42:28,231 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 07:42:28,232 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-18 07:42:28,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830810693] [2023-02-18 07:42:28,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 07:42:28,232 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-18 07:42:28,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 07:42:28,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-18 07:42:28,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-18 07:42:28,238 INFO L87 Difference]: Start difference. First operand 154 states and 204 transitions. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-18 07:42:28,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 07:42:28,304 INFO L93 Difference]: Finished difference Result 178 states and 236 transitions. [2023-02-18 07:42:28,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-18 07:42:28,304 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 31 [2023-02-18 07:42:28,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 07:42:28,306 INFO L225 Difference]: With dead ends: 178 [2023-02-18 07:42:28,306 INFO L226 Difference]: Without dead ends: 176 [2023-02-18 07:42:28,306 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-02-18 07:42:28,308 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 128 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-18 07:42:28,308 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 270 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-18 07:42:28,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2023-02-18 07:42:28,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 148. [2023-02-18 07:42:28,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 131 states have (on average 1.4274809160305344) internal successors, (187), 140 states have internal predecessors, (187), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-18 07:42:28,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 195 transitions. [2023-02-18 07:42:28,316 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 195 transitions. Word has length 31 [2023-02-18 07:42:28,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 07:42:28,316 INFO L495 AbstractCegarLoop]: Abstraction has 148 states and 195 transitions. [2023-02-18 07:42:28,316 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-18 07:42:28,316 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 195 transitions. [2023-02-18 07:42:28,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-02-18 07:42:28,317 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 07:42:28,317 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 07:42:28,317 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-02-18 07:42:28,318 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-18 07:42:28,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 07:42:28,318 INFO L85 PathProgramCache]: Analyzing trace with hash -764024055, now seen corresponding path program 1 times [2023-02-18 07:42:28,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 07:42:28,318 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527708374] [2023-02-18 07:42:28,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 07:42:28,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 07:42:28,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:28,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-18 07:42:28,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:28,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-18 07:42:28,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:28,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-18 07:42:28,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:28,380 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-02-18 07:42:28,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 07:42:28,380 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527708374] [2023-02-18 07:42:28,380 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [527708374] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 07:42:28,380 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 07:42:28,380 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-18 07:42:28,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937436998] [2023-02-18 07:42:28,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 07:42:28,381 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-18 07:42:28,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 07:42:28,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-18 07:42:28,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-18 07:42:28,382 INFO L87 Difference]: Start difference. First operand 148 states and 195 transitions. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-18 07:42:28,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 07:42:28,442 INFO L93 Difference]: Finished difference Result 170 states and 224 transitions. [2023-02-18 07:42:28,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-18 07:42:28,443 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 31 [2023-02-18 07:42:28,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 07:42:28,444 INFO L225 Difference]: With dead ends: 170 [2023-02-18 07:42:28,444 INFO L226 Difference]: Without dead ends: 168 [2023-02-18 07:42:28,444 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-02-18 07:42:28,445 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 129 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-18 07:42:28,445 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 268 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-18 07:42:28,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2023-02-18 07:42:28,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 139. [2023-02-18 07:42:28,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 124 states have (on average 1.4112903225806452) internal successors, (175), 131 states have internal predecessors, (175), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-18 07:42:28,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 183 transitions. [2023-02-18 07:42:28,453 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 183 transitions. Word has length 31 [2023-02-18 07:42:28,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 07:42:28,453 INFO L495 AbstractCegarLoop]: Abstraction has 139 states and 183 transitions. [2023-02-18 07:42:28,453 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-18 07:42:28,453 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 183 transitions. [2023-02-18 07:42:28,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-02-18 07:42:28,454 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 07:42:28,454 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 07:42:28,454 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-02-18 07:42:28,454 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-18 07:42:28,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 07:42:28,455 INFO L85 PathProgramCache]: Analyzing trace with hash 1822749775, now seen corresponding path program 1 times [2023-02-18 07:42:28,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 07:42:28,455 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164410948] [2023-02-18 07:42:28,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 07:42:28,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 07:42:28,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:28,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-18 07:42:28,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:28,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-18 07:42:28,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:28,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-18 07:42:28,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:28,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-18 07:42:28,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:28,530 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-18 07:42:28,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 07:42:28,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164410948] [2023-02-18 07:42:28,530 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164410948] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 07:42:28,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1937305768] [2023-02-18 07:42:28,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 07:42:28,530 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 07:42:28,531 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 07:42:28,532 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 07:42:28,534 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-02-18 07:42:28,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:28,588 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 22 conjunts are in the unsatisfiable core [2023-02-18 07:42:28,591 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 07:42:28,660 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-02-18 07:42:28,660 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 07:42:28,769 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-02-18 07:42:28,769 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1937305768] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 07:42:28,769 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-18 07:42:28,770 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 10, 8] total 18 [2023-02-18 07:42:28,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435529597] [2023-02-18 07:42:28,770 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-18 07:42:28,771 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-02-18 07:42:28,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 07:42:28,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-02-18 07:42:28,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2023-02-18 07:42:28,773 INFO L87 Difference]: Start difference. First operand 139 states and 183 transitions. Second operand has 18 states, 18 states have (on average 2.4444444444444446) internal successors, (44), 16 states have internal predecessors, (44), 4 states have call successors, (7), 1 states have call predecessors, (7), 5 states have return successors, (10), 6 states have call predecessors, (10), 4 states have call successors, (10) [2023-02-18 07:42:29,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 07:42:29,161 INFO L93 Difference]: Finished difference Result 454 states and 581 transitions. [2023-02-18 07:42:29,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-02-18 07:42:29,161 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.4444444444444446) internal successors, (44), 16 states have internal predecessors, (44), 4 states have call successors, (7), 1 states have call predecessors, (7), 5 states have return successors, (10), 6 states have call predecessors, (10), 4 states have call successors, (10) Word has length 37 [2023-02-18 07:42:29,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 07:42:29,163 INFO L225 Difference]: With dead ends: 454 [2023-02-18 07:42:29,163 INFO L226 Difference]: Without dead ends: 275 [2023-02-18 07:42:29,167 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=128, Invalid=684, Unknown=0, NotChecked=0, Total=812 [2023-02-18 07:42:29,168 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 274 mSDsluCounter, 863 mSDsCounter, 0 mSdLazyCounter, 378 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 274 SdHoareTripleChecker+Valid, 937 SdHoareTripleChecker+Invalid, 394 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 378 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-18 07:42:29,168 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [274 Valid, 937 Invalid, 394 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 378 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-18 07:42:29,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2023-02-18 07:42:29,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 140. [2023-02-18 07:42:29,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 124 states have (on average 1.3629032258064515) internal successors, (169), 131 states have internal predecessors, (169), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-18 07:42:29,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 177 transitions. [2023-02-18 07:42:29,180 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 177 transitions. Word has length 37 [2023-02-18 07:42:29,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 07:42:29,182 INFO L495 AbstractCegarLoop]: Abstraction has 140 states and 177 transitions. [2023-02-18 07:42:29,182 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.4444444444444446) internal successors, (44), 16 states have internal predecessors, (44), 4 states have call successors, (7), 1 states have call predecessors, (7), 5 states have return successors, (10), 6 states have call predecessors, (10), 4 states have call successors, (10) [2023-02-18 07:42:29,182 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 177 transitions. [2023-02-18 07:42:29,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2023-02-18 07:42:29,184 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 07:42:29,184 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 07:42:29,195 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-02-18 07:42:29,395 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-02-18 07:42:29,396 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-18 07:42:29,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 07:42:29,396 INFO L85 PathProgramCache]: Analyzing trace with hash 1347360979, now seen corresponding path program 1 times [2023-02-18 07:42:29,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 07:42:29,397 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367190296] [2023-02-18 07:42:29,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 07:42:29,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 07:42:29,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:29,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-18 07:42:29,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:29,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-18 07:42:29,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:29,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-02-18 07:42:29,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:29,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-18 07:42:29,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:29,519 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-02-18 07:42:29,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 07:42:29,519 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367190296] [2023-02-18 07:42:29,519 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1367190296] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 07:42:29,519 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 07:42:29,520 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-02-18 07:42:29,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639617259] [2023-02-18 07:42:29,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 07:42:29,520 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-18 07:42:29,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 07:42:29,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-18 07:42:29,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-02-18 07:42:29,522 INFO L87 Difference]: Start difference. First operand 140 states and 177 transitions. Second operand has 8 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2023-02-18 07:42:29,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 07:42:29,610 INFO L93 Difference]: Finished difference Result 266 states and 315 transitions. [2023-02-18 07:42:29,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-18 07:42:29,611 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 54 [2023-02-18 07:42:29,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 07:42:29,613 INFO L225 Difference]: With dead ends: 266 [2023-02-18 07:42:29,613 INFO L226 Difference]: Without dead ends: 214 [2023-02-18 07:42:29,613 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2023-02-18 07:42:29,614 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 108 mSDsluCounter, 487 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 572 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 07:42:29,614 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 572 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 07:42:29,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2023-02-18 07:42:29,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 140. [2023-02-18 07:42:29,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 124 states have (on average 1.346774193548387) internal successors, (167), 131 states have internal predecessors, (167), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-18 07:42:29,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 175 transitions. [2023-02-18 07:42:29,623 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 175 transitions. Word has length 54 [2023-02-18 07:42:29,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 07:42:29,623 INFO L495 AbstractCegarLoop]: Abstraction has 140 states and 175 transitions. [2023-02-18 07:42:29,623 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2023-02-18 07:42:29,624 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 175 transitions. [2023-02-18 07:42:29,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-02-18 07:42:29,625 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 07:42:29,625 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 07:42:29,625 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-02-18 07:42:29,625 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-18 07:42:29,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 07:42:29,626 INFO L85 PathProgramCache]: Analyzing trace with hash 264007364, now seen corresponding path program 2 times [2023-02-18 07:42:29,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 07:42:29,626 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421372390] [2023-02-18 07:42:29,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 07:42:29,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 07:42:29,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:29,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-18 07:42:29,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:29,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-18 07:42:29,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:29,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-02-18 07:42:29,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:29,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-18 07:42:29,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:29,743 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2023-02-18 07:42:29,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 07:42:29,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421372390] [2023-02-18 07:42:29,744 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1421372390] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 07:42:29,744 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 07:42:29,744 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-02-18 07:42:29,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882504932] [2023-02-18 07:42:29,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 07:42:29,745 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-18 07:42:29,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 07:42:29,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-18 07:42:29,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-02-18 07:42:29,746 INFO L87 Difference]: Start difference. First operand 140 states and 175 transitions. Second operand has 8 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2023-02-18 07:42:29,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 07:42:29,858 INFO L93 Difference]: Finished difference Result 262 states and 313 transitions. [2023-02-18 07:42:29,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-18 07:42:29,859 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 58 [2023-02-18 07:42:29,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 07:42:29,860 INFO L225 Difference]: With dead ends: 262 [2023-02-18 07:42:29,860 INFO L226 Difference]: Without dead ends: 226 [2023-02-18 07:42:29,860 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2023-02-18 07:42:29,861 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 160 mSDsluCounter, 566 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 679 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 07:42:29,861 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 679 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 07:42:29,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2023-02-18 07:42:29,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 165. [2023-02-18 07:42:29,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 148 states have (on average 1.337837837837838) internal successors, (198), 155 states have internal predecessors, (198), 4 states have call successors, (4), 4 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2023-02-18 07:42:29,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 207 transitions. [2023-02-18 07:42:29,869 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 207 transitions. Word has length 58 [2023-02-18 07:42:29,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 07:42:29,869 INFO L495 AbstractCegarLoop]: Abstraction has 165 states and 207 transitions. [2023-02-18 07:42:29,869 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2023-02-18 07:42:29,870 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 207 transitions. [2023-02-18 07:42:29,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-02-18 07:42:29,870 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 07:42:29,870 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 07:42:29,870 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-02-18 07:42:29,871 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-18 07:42:29,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 07:42:29,871 INFO L85 PathProgramCache]: Analyzing trace with hash 264009286, now seen corresponding path program 1 times [2023-02-18 07:42:29,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 07:42:29,871 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969564363] [2023-02-18 07:42:29,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 07:42:29,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 07:42:29,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:29,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-18 07:42:29,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:29,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-18 07:42:29,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:29,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-02-18 07:42:29,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:30,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-18 07:42:30,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:30,006 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-02-18 07:42:30,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 07:42:30,006 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969564363] [2023-02-18 07:42:30,006 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1969564363] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 07:42:30,007 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [29388877] [2023-02-18 07:42:30,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 07:42:30,007 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 07:42:30,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 07:42:30,009 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 07:42:30,033 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-02-18 07:42:30,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:30,077 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 25 conjunts are in the unsatisfiable core [2023-02-18 07:42:30,079 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 07:42:30,136 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-02-18 07:42:30,136 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 07:42:30,136 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [29388877] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 07:42:30,137 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-18 07:42:30,137 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [5] total 12 [2023-02-18 07:42:30,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831569088] [2023-02-18 07:42:30,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 07:42:30,137 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-02-18 07:42:30,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 07:42:30,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-02-18 07:42:30,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2023-02-18 07:42:30,138 INFO L87 Difference]: Start difference. First operand 165 states and 207 transitions. Second operand has 9 states, 8 states have (on average 4.625) internal successors, (37), 7 states have internal predecessors, (37), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-18 07:42:30,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 07:42:30,261 INFO L93 Difference]: Finished difference Result 306 states and 374 transitions. [2023-02-18 07:42:30,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-18 07:42:30,262 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.625) internal successors, (37), 7 states have internal predecessors, (37), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 58 [2023-02-18 07:42:30,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 07:42:30,263 INFO L225 Difference]: With dead ends: 306 [2023-02-18 07:42:30,263 INFO L226 Difference]: Without dead ends: 254 [2023-02-18 07:42:30,264 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2023-02-18 07:42:30,264 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 166 mSDsluCounter, 518 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 599 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 07:42:30,265 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 599 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 07:42:30,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2023-02-18 07:42:30,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 187. [2023-02-18 07:42:30,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 168 states have (on average 1.3095238095238095) internal successors, (220), 175 states have internal predecessors, (220), 5 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (8), 7 states have call predecessors, (8), 5 states have call successors, (8) [2023-02-18 07:42:30,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 233 transitions. [2023-02-18 07:42:30,276 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 233 transitions. Word has length 58 [2023-02-18 07:42:30,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 07:42:30,276 INFO L495 AbstractCegarLoop]: Abstraction has 187 states and 233 transitions. [2023-02-18 07:42:30,276 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.625) internal successors, (37), 7 states have internal predecessors, (37), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-18 07:42:30,276 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 233 transitions. [2023-02-18 07:42:30,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2023-02-18 07:42:30,277 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 07:42:30,277 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 07:42:30,286 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-02-18 07:42:30,483 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 07:42:30,484 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-18 07:42:30,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 07:42:30,484 INFO L85 PathProgramCache]: Analyzing trace with hash -1694284065, now seen corresponding path program 1 times [2023-02-18 07:42:30,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 07:42:30,484 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315346907] [2023-02-18 07:42:30,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 07:42:30,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 07:42:30,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:30,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-18 07:42:30,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:30,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-18 07:42:30,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:30,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-02-18 07:42:30,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:30,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-18 07:42:30,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:30,641 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2023-02-18 07:42:30,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 07:42:30,641 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315346907] [2023-02-18 07:42:30,642 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315346907] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 07:42:30,642 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 07:42:30,642 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-02-18 07:42:30,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66867063] [2023-02-18 07:42:30,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 07:42:30,642 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-02-18 07:42:30,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 07:42:30,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-02-18 07:42:30,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2023-02-18 07:42:30,643 INFO L87 Difference]: Start difference. First operand 187 states and 233 transitions. Second operand has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 8 states have internal predecessors, (40), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2023-02-18 07:42:30,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 07:42:30,819 INFO L93 Difference]: Finished difference Result 432 states and 508 transitions. [2023-02-18 07:42:30,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-02-18 07:42:30,820 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 8 states have internal predecessors, (40), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 63 [2023-02-18 07:42:30,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 07:42:30,822 INFO L225 Difference]: With dead ends: 432 [2023-02-18 07:42:30,822 INFO L226 Difference]: Without dead ends: 398 [2023-02-18 07:42:30,824 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2023-02-18 07:42:30,824 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 357 mSDsluCounter, 528 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 357 SdHoareTripleChecker+Valid, 607 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 07:42:30,824 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [357 Valid, 607 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 07:42:30,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2023-02-18 07:42:30,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 211. [2023-02-18 07:42:30,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 191 states have (on average 1.3193717277486912) internal successors, (252), 198 states have internal predecessors, (252), 5 states have call successors, (5), 4 states have call predecessors, (5), 7 states have return successors, (10), 8 states have call predecessors, (10), 5 states have call successors, (10) [2023-02-18 07:42:30,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 267 transitions. [2023-02-18 07:42:30,839 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 267 transitions. Word has length 63 [2023-02-18 07:42:30,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 07:42:30,840 INFO L495 AbstractCegarLoop]: Abstraction has 211 states and 267 transitions. [2023-02-18 07:42:30,840 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 8 states have internal predecessors, (40), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2023-02-18 07:42:30,840 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 267 transitions. [2023-02-18 07:42:30,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2023-02-18 07:42:30,841 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 07:42:30,841 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 07:42:30,841 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-02-18 07:42:30,841 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-18 07:42:30,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 07:42:30,842 INFO L85 PathProgramCache]: Analyzing trace with hash -1694282143, now seen corresponding path program 1 times [2023-02-18 07:42:30,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 07:42:30,842 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426514730] [2023-02-18 07:42:30,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 07:42:30,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 07:42:30,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:30,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-18 07:42:30,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:30,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-18 07:42:30,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:30,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-02-18 07:42:30,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:30,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-18 07:42:30,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:30,941 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 4 proven. 16 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-02-18 07:42:30,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 07:42:30,941 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426514730] [2023-02-18 07:42:30,941 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426514730] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 07:42:30,941 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [574483477] [2023-02-18 07:42:30,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 07:42:30,942 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 07:42:30,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 07:42:30,943 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 07:42:30,945 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-02-18 07:42:31,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:31,004 INFO L263 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 14 conjunts are in the unsatisfiable core [2023-02-18 07:42:31,005 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 07:42:31,036 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2023-02-18 07:42:31,036 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 07:42:31,104 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2023-02-18 07:42:31,105 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [574483477] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 07:42:31,105 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-18 07:42:31,105 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 6] total 14 [2023-02-18 07:42:31,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367470141] [2023-02-18 07:42:31,106 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-18 07:42:31,106 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-02-18 07:42:31,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 07:42:31,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-02-18 07:42:31,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2023-02-18 07:42:31,107 INFO L87 Difference]: Start difference. First operand 211 states and 267 transitions. Second operand has 14 states, 14 states have (on average 4.928571428571429) internal successors, (69), 12 states have internal predecessors, (69), 4 states have call successors, (10), 1 states have call predecessors, (10), 4 states have return successors, (12), 6 states have call predecessors, (12), 4 states have call successors, (12) [2023-02-18 07:42:31,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 07:42:31,452 INFO L93 Difference]: Finished difference Result 455 states and 577 transitions. [2023-02-18 07:42:31,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-02-18 07:42:31,453 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.928571428571429) internal successors, (69), 12 states have internal predecessors, (69), 4 states have call successors, (10), 1 states have call predecessors, (10), 4 states have return successors, (12), 6 states have call predecessors, (12), 4 states have call successors, (12) Word has length 63 [2023-02-18 07:42:31,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 07:42:31,454 INFO L225 Difference]: With dead ends: 455 [2023-02-18 07:42:31,454 INFO L226 Difference]: Without dead ends: 275 [2023-02-18 07:42:31,455 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 126 SyntacticMatches, 3 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=159, Invalid=491, Unknown=0, NotChecked=0, Total=650 [2023-02-18 07:42:31,456 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 223 mSDsluCounter, 525 mSDsCounter, 0 mSdLazyCounter, 335 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 593 SdHoareTripleChecker+Invalid, 346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 335 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-18 07:42:31,456 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [223 Valid, 593 Invalid, 346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 335 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-18 07:42:31,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2023-02-18 07:42:31,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 204. [2023-02-18 07:42:31,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 184 states have (on average 1.2880434782608696) internal successors, (237), 191 states have internal predecessors, (237), 5 states have call successors, (5), 4 states have call predecessors, (5), 7 states have return successors, (10), 8 states have call predecessors, (10), 5 states have call successors, (10) [2023-02-18 07:42:31,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 252 transitions. [2023-02-18 07:42:31,469 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 252 transitions. Word has length 63 [2023-02-18 07:42:31,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 07:42:31,469 INFO L495 AbstractCegarLoop]: Abstraction has 204 states and 252 transitions. [2023-02-18 07:42:31,470 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.928571428571429) internal successors, (69), 12 states have internal predecessors, (69), 4 states have call successors, (10), 1 states have call predecessors, (10), 4 states have return successors, (12), 6 states have call predecessors, (12), 4 states have call successors, (12) [2023-02-18 07:42:31,470 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 252 transitions. [2023-02-18 07:42:31,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2023-02-18 07:42:31,471 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 07:42:31,471 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 07:42:31,481 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-02-18 07:42:31,677 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-02-18 07:42:31,677 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-18 07:42:31,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 07:42:31,678 INFO L85 PathProgramCache]: Analyzing trace with hash 1797395163, now seen corresponding path program 1 times [2023-02-18 07:42:31,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 07:42:31,678 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262666102] [2023-02-18 07:42:31,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 07:42:31,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 07:42:31,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:31,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-18 07:42:31,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:31,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-18 07:42:31,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:31,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-02-18 07:42:31,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:31,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-02-18 07:42:31,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:31,756 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 4 proven. 19 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-02-18 07:42:31,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 07:42:31,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262666102] [2023-02-18 07:42:31,756 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1262666102] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 07:42:31,757 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1055643346] [2023-02-18 07:42:31,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 07:42:31,757 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 07:42:31,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 07:42:31,758 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 07:42:31,782 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-02-18 07:42:31,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:31,823 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-18 07:42:31,825 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 07:42:31,847 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 26 proven. 9 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-02-18 07:42:31,847 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 07:42:31,890 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 4 proven. 19 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-02-18 07:42:31,890 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1055643346] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 07:42:31,891 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-18 07:42:31,891 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2023-02-18 07:42:31,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043964230] [2023-02-18 07:42:31,891 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-18 07:42:31,892 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-02-18 07:42:31,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 07:42:31,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-02-18 07:42:31,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2023-02-18 07:42:31,893 INFO L87 Difference]: Start difference. First operand 204 states and 252 transitions. Second operand has 14 states, 14 states have (on average 7.0) internal successors, (98), 14 states have internal predecessors, (98), 2 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-02-18 07:42:32,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 07:42:32,100 INFO L93 Difference]: Finished difference Result 708 states and 905 transitions. [2023-02-18 07:42:32,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-02-18 07:42:32,101 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 7.0) internal successors, (98), 14 states have internal predecessors, (98), 2 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 66 [2023-02-18 07:42:32,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 07:42:32,103 INFO L225 Difference]: With dead ends: 708 [2023-02-18 07:42:32,103 INFO L226 Difference]: Without dead ends: 532 [2023-02-18 07:42:32,104 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 135 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=148, Invalid=232, Unknown=0, NotChecked=0, Total=380 [2023-02-18 07:42:32,105 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 221 mSDsluCounter, 466 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 557 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 07:42:32,105 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [221 Valid, 557 Invalid, 215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 07:42:32,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2023-02-18 07:42:32,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 231. [2023-02-18 07:42:32,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 211 states have (on average 1.2843601895734598) internal successors, (271), 218 states have internal predecessors, (271), 5 states have call successors, (5), 4 states have call predecessors, (5), 7 states have return successors, (10), 8 states have call predecessors, (10), 5 states have call successors, (10) [2023-02-18 07:42:32,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 286 transitions. [2023-02-18 07:42:32,139 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 286 transitions. Word has length 66 [2023-02-18 07:42:32,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 07:42:32,139 INFO L495 AbstractCegarLoop]: Abstraction has 231 states and 286 transitions. [2023-02-18 07:42:32,140 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 7.0) internal successors, (98), 14 states have internal predecessors, (98), 2 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-02-18 07:42:32,140 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 286 transitions. [2023-02-18 07:42:32,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2023-02-18 07:42:32,141 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 07:42:32,141 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 07:42:32,149 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-02-18 07:42:32,347 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-02-18 07:42:32,347 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-18 07:42:32,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 07:42:32,347 INFO L85 PathProgramCache]: Analyzing trace with hash -1155393431, now seen corresponding path program 1 times [2023-02-18 07:42:32,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 07:42:32,348 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772654079] [2023-02-18 07:42:32,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 07:42:32,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 07:42:32,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:32,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-18 07:42:32,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:32,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-18 07:42:32,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:32,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-02-18 07:42:32,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:32,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-02-18 07:42:32,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:32,475 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 4 proven. 21 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-02-18 07:42:32,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 07:42:32,475 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772654079] [2023-02-18 07:42:32,476 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [772654079] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 07:42:32,476 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [339301872] [2023-02-18 07:42:32,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 07:42:32,476 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 07:42:32,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 07:42:32,477 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 07:42:32,480 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-02-18 07:42:32,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:32,543 INFO L263 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 9 conjunts are in the unsatisfiable core [2023-02-18 07:42:32,546 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 07:42:32,575 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 32 proven. 5 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-02-18 07:42:32,576 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 07:42:32,795 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 4 proven. 21 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-02-18 07:42:32,795 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [339301872] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 07:42:32,795 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-18 07:42:32,796 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2023-02-18 07:42:32,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646060241] [2023-02-18 07:42:32,796 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-18 07:42:32,797 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-02-18 07:42:32,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 07:42:32,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-02-18 07:42:32,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2023-02-18 07:42:32,798 INFO L87 Difference]: Start difference. First operand 231 states and 286 transitions. Second operand has 13 states, 13 states have (on average 7.846153846153846) internal successors, (102), 13 states have internal predecessors, (102), 2 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-02-18 07:42:33,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 07:42:33,081 INFO L93 Difference]: Finished difference Result 547 states and 690 transitions. [2023-02-18 07:42:33,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-02-18 07:42:33,082 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 7.846153846153846) internal successors, (102), 13 states have internal predecessors, (102), 2 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 70 [2023-02-18 07:42:33,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 07:42:33,084 INFO L225 Difference]: With dead ends: 547 [2023-02-18 07:42:33,084 INFO L226 Difference]: Without dead ends: 357 [2023-02-18 07:42:33,085 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 131 SyntacticMatches, 13 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=186, Unknown=0, NotChecked=0, Total=306 [2023-02-18 07:42:33,085 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 161 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-18 07:42:33,085 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 350 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-18 07:42:33,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2023-02-18 07:42:33,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 224. [2023-02-18 07:42:33,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 204 states have (on average 1.2598039215686274) internal successors, (257), 211 states have internal predecessors, (257), 5 states have call successors, (5), 4 states have call predecessors, (5), 7 states have return successors, (10), 8 states have call predecessors, (10), 5 states have call successors, (10) [2023-02-18 07:42:33,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 272 transitions. [2023-02-18 07:42:33,103 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 272 transitions. Word has length 70 [2023-02-18 07:42:33,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 07:42:33,103 INFO L495 AbstractCegarLoop]: Abstraction has 224 states and 272 transitions. [2023-02-18 07:42:33,103 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 7.846153846153846) internal successors, (102), 13 states have internal predecessors, (102), 2 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-02-18 07:42:33,103 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 272 transitions. [2023-02-18 07:42:33,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2023-02-18 07:42:33,109 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 07:42:33,109 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 6, 6, 4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 07:42:33,120 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-02-18 07:42:33,320 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-02-18 07:42:33,321 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-18 07:42:33,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 07:42:33,321 INFO L85 PathProgramCache]: Analyzing trace with hash 216023387, now seen corresponding path program 2 times [2023-02-18 07:42:33,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 07:42:33,322 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341334711] [2023-02-18 07:42:33,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 07:42:33,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 07:42:33,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:33,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-18 07:42:33,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:33,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-18 07:42:33,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:33,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-02-18 07:42:33,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:33,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-02-18 07:42:33,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:33,507 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 4 proven. 97 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-02-18 07:42:33,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 07:42:33,507 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341334711] [2023-02-18 07:42:33,507 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [341334711] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 07:42:33,508 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1285613136] [2023-02-18 07:42:33,508 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-18 07:42:33,508 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 07:42:33,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 07:42:33,509 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 07:42:33,512 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-02-18 07:42:33,600 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-18 07:42:33,600 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 07:42:33,602 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 9 conjunts are in the unsatisfiable core [2023-02-18 07:42:33,604 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 07:42:33,663 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 26 proven. 87 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-02-18 07:42:33,664 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 07:42:33,787 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 4 proven. 97 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-02-18 07:42:33,788 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1285613136] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 07:42:33,788 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-18 07:42:33,788 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 26 [2023-02-18 07:42:33,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792984518] [2023-02-18 07:42:33,788 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-18 07:42:33,791 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-02-18 07:42:33,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 07:42:33,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-02-18 07:42:33,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=230, Invalid=420, Unknown=0, NotChecked=0, Total=650 [2023-02-18 07:42:33,793 INFO L87 Difference]: Start difference. First operand 224 states and 272 transitions. Second operand has 26 states, 26 states have (on average 6.076923076923077) internal successors, (158), 26 states have internal predecessors, (158), 2 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-02-18 07:42:34,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 07:42:34,227 INFO L93 Difference]: Finished difference Result 1080 states and 1393 transitions. [2023-02-18 07:42:34,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-02-18 07:42:34,228 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 6.076923076923077) internal successors, (158), 26 states have internal predecessors, (158), 2 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 86 [2023-02-18 07:42:34,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 07:42:34,232 INFO L225 Difference]: With dead ends: 1080 [2023-02-18 07:42:34,232 INFO L226 Difference]: Without dead ends: 904 [2023-02-18 07:42:34,233 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 171 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 297 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=488, Invalid=772, Unknown=0, NotChecked=0, Total=1260 [2023-02-18 07:42:34,233 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 621 mSDsluCounter, 613 mSDsCounter, 0 mSdLazyCounter, 299 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 621 SdHoareTripleChecker+Valid, 704 SdHoareTripleChecker+Invalid, 335 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 299 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-18 07:42:34,234 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [621 Valid, 704 Invalid, 335 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 299 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-18 07:42:34,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 904 states. [2023-02-18 07:42:34,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 904 to 271. [2023-02-18 07:42:34,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 251 states have (on average 1.254980079681275) internal successors, (315), 258 states have internal predecessors, (315), 5 states have call successors, (5), 4 states have call predecessors, (5), 7 states have return successors, (10), 8 states have call predecessors, (10), 5 states have call successors, (10) [2023-02-18 07:42:34,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 330 transitions. [2023-02-18 07:42:34,262 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 330 transitions. Word has length 86 [2023-02-18 07:42:34,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 07:42:34,262 INFO L495 AbstractCegarLoop]: Abstraction has 271 states and 330 transitions. [2023-02-18 07:42:34,262 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 6.076923076923077) internal successors, (158), 26 states have internal predecessors, (158), 2 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-02-18 07:42:34,263 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 330 transitions. [2023-02-18 07:42:34,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2023-02-18 07:42:34,264 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 07:42:34,264 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 5, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 07:42:34,272 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-02-18 07:42:34,469 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 07:42:34,470 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-18 07:42:34,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 07:42:34,471 INFO L85 PathProgramCache]: Analyzing trace with hash -584775959, now seen corresponding path program 2 times [2023-02-18 07:42:34,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 07:42:34,471 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520407731] [2023-02-18 07:42:34,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 07:42:34,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 07:42:34,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:34,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-18 07:42:34,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:34,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-18 07:42:34,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:34,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-02-18 07:42:34,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:34,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-02-18 07:42:34,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:34,691 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 4 proven. 91 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-02-18 07:42:34,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 07:42:34,692 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520407731] [2023-02-18 07:42:34,692 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520407731] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 07:42:34,692 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [376095392] [2023-02-18 07:42:34,692 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-18 07:42:34,693 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 07:42:34,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 07:42:34,697 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 07:42:34,720 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-02-18 07:42:34,823 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-18 07:42:34,823 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 07:42:34,825 INFO L263 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 25 conjunts are in the unsatisfiable core [2023-02-18 07:42:34,827 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 07:42:35,062 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2023-02-18 07:42:35,063 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 07:42:35,063 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [376095392] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 07:42:35,063 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-18 07:42:35,063 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [10] total 21 [2023-02-18 07:42:35,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799108806] [2023-02-18 07:42:35,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 07:42:35,064 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-02-18 07:42:35,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 07:42:35,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-02-18 07:42:35,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=367, Unknown=0, NotChecked=0, Total=420 [2023-02-18 07:42:35,065 INFO L87 Difference]: Start difference. First operand 271 states and 330 transitions. Second operand has 13 states, 12 states have (on average 4.25) internal successors, (51), 12 states have internal predecessors, (51), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2023-02-18 07:42:35,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 07:42:35,597 INFO L93 Difference]: Finished difference Result 561 states and 654 transitions. [2023-02-18 07:42:35,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-02-18 07:42:35,598 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 4.25) internal successors, (51), 12 states have internal predecessors, (51), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 90 [2023-02-18 07:42:35,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 07:42:35,600 INFO L225 Difference]: With dead ends: 561 [2023-02-18 07:42:35,600 INFO L226 Difference]: Without dead ends: 527 [2023-02-18 07:42:35,601 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 86 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=133, Invalid=923, Unknown=0, NotChecked=0, Total=1056 [2023-02-18 07:42:35,602 INFO L413 NwaCegarLoop]: 144 mSDtfsCounter, 496 mSDsluCounter, 1062 mSDsCounter, 0 mSdLazyCounter, 421 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 498 SdHoareTripleChecker+Valid, 1206 SdHoareTripleChecker+Invalid, 432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 421 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-18 07:42:35,602 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [498 Valid, 1206 Invalid, 432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 421 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-18 07:42:35,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 527 states. [2023-02-18 07:42:35,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 527 to 302. [2023-02-18 07:42:35,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 302 states, 281 states have (on average 1.2633451957295374) internal successors, (355), 288 states have internal predecessors, (355), 5 states have call successors, (5), 4 states have call predecessors, (5), 8 states have return successors, (12), 9 states have call predecessors, (12), 5 states have call successors, (12) [2023-02-18 07:42:35,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 372 transitions. [2023-02-18 07:42:35,628 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 372 transitions. Word has length 90 [2023-02-18 07:42:35,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 07:42:35,629 INFO L495 AbstractCegarLoop]: Abstraction has 302 states and 372 transitions. [2023-02-18 07:42:35,629 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 4.25) internal successors, (51), 12 states have internal predecessors, (51), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2023-02-18 07:42:35,629 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 372 transitions. [2023-02-18 07:42:35,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2023-02-18 07:42:35,630 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 07:42:35,630 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 5, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 07:42:35,637 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-02-18 07:42:35,836 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 07:42:35,836 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-18 07:42:35,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 07:42:35,837 INFO L85 PathProgramCache]: Analyzing trace with hash -527519579, now seen corresponding path program 1 times [2023-02-18 07:42:35,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 07:42:35,837 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229795355] [2023-02-18 07:42:35,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 07:42:35,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 07:42:35,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:35,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-18 07:42:35,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:35,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-18 07:42:35,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:35,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-02-18 07:42:35,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:35,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-02-18 07:42:35,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:35,958 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2023-02-18 07:42:35,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 07:42:35,958 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229795355] [2023-02-18 07:42:35,958 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1229795355] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 07:42:35,958 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1777713201] [2023-02-18 07:42:35,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 07:42:35,959 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 07:42:35,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 07:42:35,960 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 07:42:35,983 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-02-18 07:42:36,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:36,030 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 7 conjunts are in the unsatisfiable core [2023-02-18 07:42:36,032 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 07:42:36,052 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2023-02-18 07:42:36,053 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 07:42:36,089 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2023-02-18 07:42:36,090 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1777713201] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 07:42:36,090 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-18 07:42:36,090 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2023-02-18 07:42:36,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700713206] [2023-02-18 07:42:36,090 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-18 07:42:36,091 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-18 07:42:36,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 07:42:36,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-18 07:42:36,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2023-02-18 07:42:36,092 INFO L87 Difference]: Start difference. First operand 302 states and 372 transitions. Second operand has 12 states, 12 states have (on average 4.5) internal successors, (54), 10 states have internal predecessors, (54), 3 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2023-02-18 07:42:36,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 07:42:36,162 INFO L93 Difference]: Finished difference Result 480 states and 586 transitions. [2023-02-18 07:42:36,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-18 07:42:36,163 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.5) internal successors, (54), 10 states have internal predecessors, (54), 3 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) Word has length 90 [2023-02-18 07:42:36,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 07:42:36,164 INFO L225 Difference]: With dead ends: 480 [2023-02-18 07:42:36,164 INFO L226 Difference]: Without dead ends: 424 [2023-02-18 07:42:36,165 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 178 SyntacticMatches, 5 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2023-02-18 07:42:36,166 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 232 mSDsluCounter, 517 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 232 SdHoareTripleChecker+Valid, 607 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-18 07:42:36,166 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [232 Valid, 607 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-18 07:42:36,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2023-02-18 07:42:36,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 326. [2023-02-18 07:42:36,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 326 states, 305 states have (on average 1.2622950819672132) internal successors, (385), 309 states have internal predecessors, (385), 5 states have call successors, (5), 4 states have call predecessors, (5), 8 states have return successors, (12), 12 states have call predecessors, (12), 5 states have call successors, (12) [2023-02-18 07:42:36,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 402 transitions. [2023-02-18 07:42:36,187 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 402 transitions. Word has length 90 [2023-02-18 07:42:36,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 07:42:36,187 INFO L495 AbstractCegarLoop]: Abstraction has 326 states and 402 transitions. [2023-02-18 07:42:36,187 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.5) internal successors, (54), 10 states have internal predecessors, (54), 3 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2023-02-18 07:42:36,188 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 402 transitions. [2023-02-18 07:42:36,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2023-02-18 07:42:36,189 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 07:42:36,190 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 5, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 07:42:36,199 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-02-18 07:42:36,396 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 07:42:36,397 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-18 07:42:36,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 07:42:36,397 INFO L85 PathProgramCache]: Analyzing trace with hash -527517657, now seen corresponding path program 1 times [2023-02-18 07:42:36,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 07:42:36,398 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015432249] [2023-02-18 07:42:36,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 07:42:36,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 07:42:36,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:36,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-18 07:42:36,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:36,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-18 07:42:36,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:36,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-02-18 07:42:36,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:36,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-02-18 07:42:36,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:36,626 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 4 proven. 91 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-02-18 07:42:36,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 07:42:36,627 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015432249] [2023-02-18 07:42:36,627 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2015432249] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 07:42:36,627 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1591824571] [2023-02-18 07:42:36,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 07:42:36,627 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 07:42:36,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 07:42:36,629 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 07:42:36,646 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-02-18 07:42:36,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:36,739 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 17 conjunts are in the unsatisfiable core [2023-02-18 07:42:36,741 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 07:42:36,827 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 32 proven. 75 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-02-18 07:42:36,828 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 07:42:37,250 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 4 proven. 91 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-02-18 07:42:37,250 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1591824571] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 07:42:37,250 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-18 07:42:37,251 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 25 [2023-02-18 07:42:37,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167898045] [2023-02-18 07:42:37,251 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-18 07:42:37,251 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-02-18 07:42:37,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 07:42:37,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-02-18 07:42:37,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=191, Invalid=409, Unknown=0, NotChecked=0, Total=600 [2023-02-18 07:42:37,253 INFO L87 Difference]: Start difference. First operand 326 states and 402 transitions. Second operand has 25 states, 25 states have (on average 6.48) internal successors, (162), 25 states have internal predecessors, (162), 2 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-02-18 07:42:39,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 07:42:39,039 INFO L93 Difference]: Finished difference Result 801 states and 1014 transitions. [2023-02-18 07:42:39,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-02-18 07:42:39,040 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 6.48) internal successors, (162), 25 states have internal predecessors, (162), 2 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 90 [2023-02-18 07:42:39,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 07:42:39,042 INFO L225 Difference]: With dead ends: 801 [2023-02-18 07:42:39,042 INFO L226 Difference]: Without dead ends: 556 [2023-02-18 07:42:39,043 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 167 SyntacticMatches, 13 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 389 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=504, Invalid=902, Unknown=0, NotChecked=0, Total=1406 [2023-02-18 07:42:39,044 INFO L413 NwaCegarLoop]: 102 mSDtfsCounter, 330 mSDsluCounter, 848 mSDsCounter, 0 mSdLazyCounter, 774 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 330 SdHoareTripleChecker+Valid, 950 SdHoareTripleChecker+Invalid, 816 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 774 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-02-18 07:42:39,044 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [330 Valid, 950 Invalid, 816 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 774 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-02-18 07:42:39,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2023-02-18 07:42:39,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 319. [2023-02-18 07:42:39,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 319 states, 298 states have (on average 1.2315436241610738) internal successors, (367), 302 states have internal predecessors, (367), 5 states have call successors, (5), 4 states have call predecessors, (5), 8 states have return successors, (12), 12 states have call predecessors, (12), 5 states have call successors, (12) [2023-02-18 07:42:39,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 384 transitions. [2023-02-18 07:42:39,069 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 384 transitions. Word has length 90 [2023-02-18 07:42:39,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 07:42:39,069 INFO L495 AbstractCegarLoop]: Abstraction has 319 states and 384 transitions. [2023-02-18 07:42:39,069 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 6.48) internal successors, (162), 25 states have internal predecessors, (162), 2 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-02-18 07:42:39,070 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 384 transitions. [2023-02-18 07:42:39,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2023-02-18 07:42:39,071 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 07:42:39,071 INFO L195 NwaCegarLoop]: trace histogram [15, 14, 14, 14, 14, 4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 07:42:39,081 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-02-18 07:42:39,277 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2023-02-18 07:42:39,277 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-18 07:42:39,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 07:42:39,278 INFO L85 PathProgramCache]: Analyzing trace with hash -751988839, now seen corresponding path program 1 times [2023-02-18 07:42:39,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 07:42:39,278 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947026637] [2023-02-18 07:42:39,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 07:42:39,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 07:42:39,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:39,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-18 07:42:39,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:39,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-18 07:42:39,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:39,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-02-18 07:42:39,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:39,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2023-02-18 07:42:39,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:39,686 INFO L134 CoverageAnalysis]: Checked inductivity of 518 backedges. 4 proven. 493 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-02-18 07:42:39,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 07:42:39,686 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947026637] [2023-02-18 07:42:39,687 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [947026637] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 07:42:39,687 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [874496916] [2023-02-18 07:42:39,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 07:42:39,687 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 07:42:39,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 07:42:39,688 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 07:42:39,691 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-02-18 07:42:39,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:39,760 INFO L263 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 17 conjunts are in the unsatisfiable core [2023-02-18 07:42:39,762 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 07:42:39,890 INFO L134 CoverageAnalysis]: Checked inductivity of 518 backedges. 26 proven. 483 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-02-18 07:42:39,890 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 07:42:40,281 INFO L134 CoverageAnalysis]: Checked inductivity of 518 backedges. 4 proven. 493 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-02-18 07:42:40,282 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [874496916] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 07:42:40,282 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-18 07:42:40,282 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 50 [2023-02-18 07:42:40,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579292845] [2023-02-18 07:42:40,282 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-18 07:42:40,282 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2023-02-18 07:42:40,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 07:42:40,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2023-02-18 07:42:40,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=846, Invalid=1604, Unknown=0, NotChecked=0, Total=2450 [2023-02-18 07:42:40,285 INFO L87 Difference]: Start difference. First operand 319 states and 384 transitions. Second operand has 50 states, 50 states have (on average 5.56) internal successors, (278), 50 states have internal predecessors, (278), 2 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-02-18 07:42:41,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 07:42:41,361 INFO L93 Difference]: Finished difference Result 1932 states and 2509 transitions. [2023-02-18 07:42:41,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2023-02-18 07:42:41,361 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 5.56) internal successors, (278), 50 states have internal predecessors, (278), 2 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 126 [2023-02-18 07:42:41,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 07:42:41,367 INFO L225 Difference]: With dead ends: 1932 [2023-02-18 07:42:41,368 INFO L226 Difference]: Without dead ends: 1701 [2023-02-18 07:42:41,371 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 310 GetRequests, 243 SyntacticMatches, 1 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1257 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1744, Invalid=2812, Unknown=0, NotChecked=0, Total=4556 [2023-02-18 07:42:41,372 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 1271 mSDsluCounter, 943 mSDsCounter, 0 mSdLazyCounter, 497 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1271 SdHoareTripleChecker+Valid, 1034 SdHoareTripleChecker+Invalid, 612 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 497 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-18 07:42:41,373 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1271 Valid, 1034 Invalid, 612 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 497 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-18 07:42:41,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1701 states. [2023-02-18 07:42:41,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1701 to 406. [2023-02-18 07:42:41,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 406 states, 385 states have (on average 1.2285714285714286) internal successors, (473), 389 states have internal predecessors, (473), 5 states have call successors, (5), 4 states have call predecessors, (5), 8 states have return successors, (12), 12 states have call predecessors, (12), 5 states have call successors, (12) [2023-02-18 07:42:41,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 490 transitions. [2023-02-18 07:42:41,435 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 490 transitions. Word has length 126 [2023-02-18 07:42:41,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 07:42:41,435 INFO L495 AbstractCegarLoop]: Abstraction has 406 states and 490 transitions. [2023-02-18 07:42:41,436 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 5.56) internal successors, (278), 50 states have internal predecessors, (278), 2 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-02-18 07:42:41,436 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 490 transitions. [2023-02-18 07:42:41,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2023-02-18 07:42:41,437 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 07:42:41,437 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 14, 13, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 07:42:41,449 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-02-18 07:42:41,644 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2023-02-18 07:42:41,645 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-18 07:42:41,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 07:42:41,645 INFO L85 PathProgramCache]: Analyzing trace with hash 509334823, now seen corresponding path program 2 times [2023-02-18 07:42:41,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 07:42:41,646 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422914524] [2023-02-18 07:42:41,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 07:42:41,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 07:42:41,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:41,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-18 07:42:41,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:41,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-18 07:42:41,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:42,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-02-18 07:42:42,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:42,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-02-18 07:42:42,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:42,171 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 4 proven. 471 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-02-18 07:42:42,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 07:42:42,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422914524] [2023-02-18 07:42:42,171 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1422914524] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 07:42:42,172 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [87510100] [2023-02-18 07:42:42,172 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-18 07:42:42,172 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 07:42:42,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 07:42:42,173 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 07:42:42,176 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-02-18 07:42:42,280 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-18 07:42:42,281 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 07:42:42,283 INFO L263 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 13 conjunts are in the unsatisfiable core [2023-02-18 07:42:42,285 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 07:42:42,374 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 487 trivial. 0 not checked. [2023-02-18 07:42:42,374 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 07:42:42,556 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 487 trivial. 0 not checked. [2023-02-18 07:42:42,556 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [87510100] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 07:42:42,556 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-18 07:42:42,556 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 6, 6] total 28 [2023-02-18 07:42:42,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195808229] [2023-02-18 07:42:42,557 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-18 07:42:42,557 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-02-18 07:42:42,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 07:42:42,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-02-18 07:42:42,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=670, Unknown=0, NotChecked=0, Total=756 [2023-02-18 07:42:42,558 INFO L87 Difference]: Start difference. First operand 406 states and 490 transitions. Second operand has 28 states, 28 states have (on average 5.392857142857143) internal successors, (151), 26 states have internal predecessors, (151), 4 states have call successors, (7), 1 states have call predecessors, (7), 4 states have return successors, (9), 6 states have call predecessors, (9), 4 states have call successors, (9) [2023-02-18 07:42:43,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 07:42:43,383 INFO L93 Difference]: Finished difference Result 901 states and 1108 transitions. [2023-02-18 07:42:43,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2023-02-18 07:42:43,383 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 5.392857142857143) internal successors, (151), 26 states have internal predecessors, (151), 4 states have call successors, (7), 1 states have call predecessors, (7), 4 states have return successors, (9), 6 states have call predecessors, (9), 4 states have call successors, (9) Word has length 130 [2023-02-18 07:42:43,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 07:42:43,386 INFO L225 Difference]: With dead ends: 901 [2023-02-18 07:42:43,386 INFO L226 Difference]: Without dead ends: 667 [2023-02-18 07:42:43,387 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 294 GetRequests, 256 SyntacticMatches, 3 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=251, Invalid=1081, Unknown=0, NotChecked=0, Total=1332 [2023-02-18 07:42:43,387 INFO L413 NwaCegarLoop]: 106 mSDtfsCounter, 281 mSDsluCounter, 1508 mSDsCounter, 0 mSdLazyCounter, 1082 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 281 SdHoareTripleChecker+Valid, 1614 SdHoareTripleChecker+Invalid, 1108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 1082 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-02-18 07:42:43,388 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [281 Valid, 1614 Invalid, 1108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 1082 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-02-18 07:42:43,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 667 states. [2023-02-18 07:42:43,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 667 to 406. [2023-02-18 07:42:43,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 406 states, 385 states have (on average 1.2181818181818183) internal successors, (469), 389 states have internal predecessors, (469), 5 states have call successors, (5), 4 states have call predecessors, (5), 8 states have return successors, (12), 12 states have call predecessors, (12), 5 states have call successors, (12) [2023-02-18 07:42:43,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 486 transitions. [2023-02-18 07:42:43,426 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 486 transitions. Word has length 130 [2023-02-18 07:42:43,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 07:42:43,426 INFO L495 AbstractCegarLoop]: Abstraction has 406 states and 486 transitions. [2023-02-18 07:42:43,427 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 5.392857142857143) internal successors, (151), 26 states have internal predecessors, (151), 4 states have call successors, (7), 1 states have call predecessors, (7), 4 states have return successors, (9), 6 states have call predecessors, (9), 4 states have call successors, (9) [2023-02-18 07:42:43,427 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 486 transitions. [2023-02-18 07:42:43,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2023-02-18 07:42:43,428 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 07:42:43,428 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 15, 14, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 07:42:43,434 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-02-18 07:42:43,634 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2023-02-18 07:42:43,635 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-18 07:42:43,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 07:42:43,636 INFO L85 PathProgramCache]: Analyzing trace with hash -719449455, now seen corresponding path program 3 times [2023-02-18 07:42:43,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 07:42:43,636 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149049344] [2023-02-18 07:42:43,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 07:42:43,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 07:42:43,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:43,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-18 07:42:43,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:43,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-18 07:42:43,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:44,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-02-18 07:42:44,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:44,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2023-02-18 07:42:44,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:44,133 INFO L134 CoverageAnalysis]: Checked inductivity of 566 backedges. 4 proven. 541 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-02-18 07:42:44,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 07:42:44,134 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149049344] [2023-02-18 07:42:44,134 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1149049344] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 07:42:44,134 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [339486444] [2023-02-18 07:42:44,134 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-18 07:42:44,134 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 07:42:44,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 07:42:44,137 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 07:42:44,156 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-02-18 07:42:44,203 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2023-02-18 07:42:44,204 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 07:42:44,204 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 15 conjunts are in the unsatisfiable core [2023-02-18 07:42:44,206 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 07:42:44,315 INFO L134 CoverageAnalysis]: Checked inductivity of 566 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 557 trivial. 0 not checked. [2023-02-18 07:42:44,315 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 07:42:44,315 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [339486444] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 07:42:44,315 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-18 07:42:44,315 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [19] total 25 [2023-02-18 07:42:44,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416806525] [2023-02-18 07:42:44,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 07:42:44,315 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-18 07:42:44,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 07:42:44,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-18 07:42:44,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=523, Unknown=0, NotChecked=0, Total=600 [2023-02-18 07:42:44,316 INFO L87 Difference]: Start difference. First operand 406 states and 486 transitions. Second operand has 8 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2023-02-18 07:42:44,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 07:42:44,462 INFO L93 Difference]: Finished difference Result 469 states and 551 transitions. [2023-02-18 07:42:44,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-18 07:42:44,464 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 135 [2023-02-18 07:42:44,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 07:42:44,465 INFO L225 Difference]: With dead ends: 469 [2023-02-18 07:42:44,465 INFO L226 Difference]: Without dead ends: 467 [2023-02-18 07:42:44,466 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 137 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=89, Invalid=667, Unknown=0, NotChecked=0, Total=756 [2023-02-18 07:42:44,466 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 151 mSDsluCounter, 606 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 722 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 07:42:44,466 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 722 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 07:42:44,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 467 states. [2023-02-18 07:42:44,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 467 to 397. [2023-02-18 07:42:44,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 397 states, 376 states have (on average 1.2207446808510638) internal successors, (459), 380 states have internal predecessors, (459), 5 states have call successors, (5), 4 states have call predecessors, (5), 8 states have return successors, (12), 12 states have call predecessors, (12), 5 states have call successors, (12) [2023-02-18 07:42:44,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 476 transitions. [2023-02-18 07:42:44,504 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 476 transitions. Word has length 135 [2023-02-18 07:42:44,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 07:42:44,505 INFO L495 AbstractCegarLoop]: Abstraction has 397 states and 476 transitions. [2023-02-18 07:42:44,505 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2023-02-18 07:42:44,505 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 476 transitions. [2023-02-18 07:42:44,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2023-02-18 07:42:44,507 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 07:42:44,507 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 15, 14, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 07:42:44,515 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2023-02-18 07:42:44,713 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2023-02-18 07:42:44,713 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-18 07:42:44,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 07:42:44,713 INFO L85 PathProgramCache]: Analyzing trace with hash -662191153, now seen corresponding path program 3 times [2023-02-18 07:42:44,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 07:42:44,714 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120472589] [2023-02-18 07:42:44,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 07:42:44,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 07:42:44,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:44,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-18 07:42:44,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:44,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-18 07:42:44,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:45,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-02-18 07:42:45,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:45,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2023-02-18 07:42:45,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:45,222 INFO L134 CoverageAnalysis]: Checked inductivity of 566 backedges. 4 proven. 541 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-02-18 07:42:45,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 07:42:45,222 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120472589] [2023-02-18 07:42:45,222 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2120472589] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 07:42:45,223 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2116229642] [2023-02-18 07:42:45,223 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-18 07:42:45,223 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 07:42:45,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 07:42:45,224 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 07:42:45,228 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-02-18 07:42:45,319 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2023-02-18 07:42:45,319 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 07:42:45,320 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 15 conjunts are in the unsatisfiable core [2023-02-18 07:42:45,322 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 07:42:45,456 INFO L134 CoverageAnalysis]: Checked inductivity of 566 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 557 trivial. 0 not checked. [2023-02-18 07:42:45,456 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 07:42:45,457 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2116229642] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 07:42:45,457 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-18 07:42:45,457 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [19] total 25 [2023-02-18 07:42:45,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259306576] [2023-02-18 07:42:45,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 07:42:45,457 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-18 07:42:45,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 07:42:45,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-18 07:42:45,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=523, Unknown=0, NotChecked=0, Total=600 [2023-02-18 07:42:45,458 INFO L87 Difference]: Start difference. First operand 397 states and 476 transitions. Second operand has 8 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2023-02-18 07:42:45,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 07:42:45,628 INFO L93 Difference]: Finished difference Result 487 states and 569 transitions. [2023-02-18 07:42:45,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-18 07:42:45,628 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 135 [2023-02-18 07:42:45,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 07:42:45,630 INFO L225 Difference]: With dead ends: 487 [2023-02-18 07:42:45,630 INFO L226 Difference]: Without dead ends: 456 [2023-02-18 07:42:45,631 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 136 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=96, Invalid=716, Unknown=0, NotChecked=0, Total=812 [2023-02-18 07:42:45,631 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 175 mSDsluCounter, 509 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 591 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 07:42:45,632 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 591 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 07:42:45,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2023-02-18 07:42:45,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 392. [2023-02-18 07:42:45,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 371 states have (on average 1.215633423180593) internal successors, (451), 375 states have internal predecessors, (451), 5 states have call successors, (5), 4 states have call predecessors, (5), 8 states have return successors, (12), 12 states have call predecessors, (12), 5 states have call successors, (12) [2023-02-18 07:42:45,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 468 transitions. [2023-02-18 07:42:45,665 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 468 transitions. Word has length 135 [2023-02-18 07:42:45,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 07:42:45,666 INFO L495 AbstractCegarLoop]: Abstraction has 392 states and 468 transitions. [2023-02-18 07:42:45,666 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2023-02-18 07:42:45,666 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 468 transitions. [2023-02-18 07:42:45,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2023-02-18 07:42:45,668 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 07:42:45,668 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 15, 14, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 07:42:45,676 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2023-02-18 07:42:45,874 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 07:42:45,874 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-18 07:42:45,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 07:42:45,875 INFO L85 PathProgramCache]: Analyzing trace with hash 539531944, now seen corresponding path program 1 times [2023-02-18 07:42:45,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 07:42:45,875 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954303194] [2023-02-18 07:42:45,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 07:42:45,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 07:42:45,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:46,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-18 07:42:46,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:46,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-18 07:42:46,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:46,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-02-18 07:42:46,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:46,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2023-02-18 07:42:46,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:46,327 INFO L134 CoverageAnalysis]: Checked inductivity of 578 backedges. 4 proven. 547 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2023-02-18 07:42:46,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 07:42:46,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954303194] [2023-02-18 07:42:46,328 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [954303194] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 07:42:46,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1714852354] [2023-02-18 07:42:46,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 07:42:46,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 07:42:46,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 07:42:46,333 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 07:42:46,336 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2023-02-18 07:42:46,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:46,460 INFO L263 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 24 conjunts are in the unsatisfiable core [2023-02-18 07:42:46,461 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 07:42:46,700 INFO L134 CoverageAnalysis]: Checked inductivity of 578 backedges. 15 proven. 13 refuted. 0 times theorem prover too weak. 550 trivial. 0 not checked. [2023-02-18 07:42:46,700 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 07:42:47,160 INFO L134 CoverageAnalysis]: Checked inductivity of 578 backedges. 15 proven. 13 refuted. 0 times theorem prover too weak. 550 trivial. 0 not checked. [2023-02-18 07:42:47,160 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1714852354] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 07:42:47,160 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-18 07:42:47,162 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 10, 9] total 36 [2023-02-18 07:42:47,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075707469] [2023-02-18 07:42:47,162 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-18 07:42:47,163 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2023-02-18 07:42:47,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 07:42:47,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2023-02-18 07:42:47,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=1151, Unknown=0, NotChecked=0, Total=1260 [2023-02-18 07:42:47,165 INFO L87 Difference]: Start difference. First operand 392 states and 468 transitions. Second operand has 36 states, 36 states have (on average 4.972222222222222) internal successors, (179), 34 states have internal predecessors, (179), 6 states have call successors, (12), 1 states have call predecessors, (12), 4 states have return successors, (12), 8 states have call predecessors, (12), 6 states have call successors, (12) [2023-02-18 07:42:49,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 07:42:49,106 INFO L93 Difference]: Finished difference Result 1164 states and 1414 transitions. [2023-02-18 07:42:49,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2023-02-18 07:42:49,106 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 4.972222222222222) internal successors, (179), 34 states have internal predecessors, (179), 6 states have call successors, (12), 1 states have call predecessors, (12), 4 states have return successors, (12), 8 states have call predecessors, (12), 6 states have call successors, (12) Word has length 140 [2023-02-18 07:42:49,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 07:42:49,110 INFO L225 Difference]: With dead ends: 1164 [2023-02-18 07:42:49,110 INFO L226 Difference]: Without dead ends: 944 [2023-02-18 07:42:49,111 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 331 GetRequests, 271 SyntacticMatches, 4 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 331 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=446, Invalid=2860, Unknown=0, NotChecked=0, Total=3306 [2023-02-18 07:42:49,112 INFO L413 NwaCegarLoop]: 186 mSDtfsCounter, 771 mSDsluCounter, 3459 mSDsCounter, 0 mSdLazyCounter, 2134 mSolverCounterSat, 111 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 781 SdHoareTripleChecker+Valid, 3645 SdHoareTripleChecker+Invalid, 2245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 2134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-02-18 07:42:49,112 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [781 Valid, 3645 Invalid, 2245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 2134 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2023-02-18 07:42:49,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 944 states. [2023-02-18 07:42:49,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 944 to 430. [2023-02-18 07:42:49,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 430 states, 407 states have (on average 1.2260442260442261) internal successors, (499), 409 states have internal predecessors, (499), 6 states have call successors, (6), 4 states have call predecessors, (6), 9 states have return successors, (17), 16 states have call predecessors, (17), 6 states have call successors, (17) [2023-02-18 07:42:49,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 522 transitions. [2023-02-18 07:42:49,154 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 522 transitions. Word has length 140 [2023-02-18 07:42:49,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 07:42:49,155 INFO L495 AbstractCegarLoop]: Abstraction has 430 states and 522 transitions. [2023-02-18 07:42:49,155 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 4.972222222222222) internal successors, (179), 34 states have internal predecessors, (179), 6 states have call successors, (12), 1 states have call predecessors, (12), 4 states have return successors, (12), 8 states have call predecessors, (12), 6 states have call successors, (12) [2023-02-18 07:42:49,155 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 522 transitions. [2023-02-18 07:42:49,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2023-02-18 07:42:49,157 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 07:42:49,157 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 16, 15, 4, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 07:42:49,163 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2023-02-18 07:42:49,363 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2023-02-18 07:42:49,364 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-18 07:42:49,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 07:42:49,364 INFO L85 PathProgramCache]: Analyzing trace with hash 1057939384, now seen corresponding path program 1 times [2023-02-18 07:42:49,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 07:42:49,364 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301778213] [2023-02-18 07:42:49,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 07:42:49,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 07:42:49,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:49,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-18 07:42:49,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:49,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-18 07:42:49,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:49,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2023-02-18 07:42:49,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:49,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2023-02-18 07:42:49,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:49,863 INFO L134 CoverageAnalysis]: Checked inductivity of 636 backedges. 4 proven. 610 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-02-18 07:42:49,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 07:42:49,864 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301778213] [2023-02-18 07:42:49,864 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1301778213] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 07:42:49,864 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [501714874] [2023-02-18 07:42:49,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 07:42:49,864 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 07:42:49,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 07:42:49,869 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 07:42:49,872 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2023-02-18 07:42:49,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:49,953 INFO L263 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 27 conjunts are in the unsatisfiable core [2023-02-18 07:42:49,955 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 07:42:50,156 INFO L134 CoverageAnalysis]: Checked inductivity of 636 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 624 trivial. 0 not checked. [2023-02-18 07:42:50,156 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 07:42:50,156 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [501714874] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 07:42:50,156 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-18 07:42:50,156 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [20] total 29 [2023-02-18 07:42:50,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352177660] [2023-02-18 07:42:50,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 07:42:50,157 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-18 07:42:50,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 07:42:50,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-18 07:42:50,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=723, Unknown=0, NotChecked=0, Total=812 [2023-02-18 07:42:50,158 INFO L87 Difference]: Start difference. First operand 430 states and 522 transitions. Second operand has 11 states, 9 states have (on average 5.666666666666667) internal successors, (51), 9 states have internal predecessors, (51), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-18 07:42:50,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 07:42:50,395 INFO L93 Difference]: Finished difference Result 517 states and 617 transitions. [2023-02-18 07:42:50,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-18 07:42:50,395 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 5.666666666666667) internal successors, (51), 9 states have internal predecessors, (51), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 146 [2023-02-18 07:42:50,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 07:42:50,397 INFO L225 Difference]: With dead ends: 517 [2023-02-18 07:42:50,397 INFO L226 Difference]: Without dead ends: 514 [2023-02-18 07:42:50,398 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 145 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=114, Invalid=942, Unknown=0, NotChecked=0, Total=1056 [2023-02-18 07:42:50,399 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 135 mSDsluCounter, 641 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 710 SdHoareTripleChecker+Invalid, 260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 07:42:50,399 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 710 Invalid, 260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 07:42:50,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states. [2023-02-18 07:42:50,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 456. [2023-02-18 07:42:50,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 456 states, 433 states have (on average 1.2217090069284064) internal successors, (529), 435 states have internal predecessors, (529), 6 states have call successors, (6), 4 states have call predecessors, (6), 9 states have return successors, (17), 16 states have call predecessors, (17), 6 states have call successors, (17) [2023-02-18 07:42:50,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 552 transitions. [2023-02-18 07:42:50,438 INFO L78 Accepts]: Start accepts. Automaton has 456 states and 552 transitions. Word has length 146 [2023-02-18 07:42:50,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 07:42:50,439 INFO L495 AbstractCegarLoop]: Abstraction has 456 states and 552 transitions. [2023-02-18 07:42:50,439 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 5.666666666666667) internal successors, (51), 9 states have internal predecessors, (51), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-18 07:42:50,439 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 552 transitions. [2023-02-18 07:42:50,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2023-02-18 07:42:50,440 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 07:42:50,441 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 16, 15, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 07:42:50,449 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2023-02-18 07:42:50,647 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2023-02-18 07:42:50,647 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-18 07:42:50,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 07:42:50,647 INFO L85 PathProgramCache]: Analyzing trace with hash 1949952884, now seen corresponding path program 1 times [2023-02-18 07:42:50,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 07:42:50,648 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819208532] [2023-02-18 07:42:50,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 07:42:50,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 07:42:50,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:50,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-18 07:42:50,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:50,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-18 07:42:50,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:50,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2023-02-18 07:42:50,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:50,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-02-18 07:42:50,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:50,721 INFO L134 CoverageAnalysis]: Checked inductivity of 653 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 634 trivial. 0 not checked. [2023-02-18 07:42:50,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 07:42:50,722 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819208532] [2023-02-18 07:42:50,722 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1819208532] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 07:42:50,722 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 07:42:50,722 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-18 07:42:50,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827922181] [2023-02-18 07:42:50,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 07:42:50,723 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-18 07:42:50,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 07:42:50,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-18 07:42:50,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-18 07:42:50,724 INFO L87 Difference]: Start difference. First operand 456 states and 552 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2023-02-18 07:42:50,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 07:42:50,789 INFO L93 Difference]: Finished difference Result 779 states and 966 transitions. [2023-02-18 07:42:50,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-18 07:42:50,790 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 146 [2023-02-18 07:42:50,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 07:42:50,792 INFO L225 Difference]: With dead ends: 779 [2023-02-18 07:42:50,792 INFO L226 Difference]: Without dead ends: 500 [2023-02-18 07:42:50,793 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-18 07:42:50,793 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 4 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-18 07:42:50,794 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 265 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-18 07:42:50,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 500 states. [2023-02-18 07:42:50,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 500 to 476. [2023-02-18 07:42:50,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 476 states, 453 states have (on average 1.2119205298013245) internal successors, (549), 455 states have internal predecessors, (549), 6 states have call successors, (6), 4 states have call predecessors, (6), 9 states have return successors, (17), 16 states have call predecessors, (17), 6 states have call successors, (17) [2023-02-18 07:42:50,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 476 states to 476 states and 572 transitions. [2023-02-18 07:42:50,831 INFO L78 Accepts]: Start accepts. Automaton has 476 states and 572 transitions. Word has length 146 [2023-02-18 07:42:50,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 07:42:50,831 INFO L495 AbstractCegarLoop]: Abstraction has 476 states and 572 transitions. [2023-02-18 07:42:50,831 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2023-02-18 07:42:50,832 INFO L276 IsEmpty]: Start isEmpty. Operand 476 states and 572 transitions. [2023-02-18 07:42:50,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2023-02-18 07:42:50,833 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 07:42:50,833 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 16, 15, 4, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 07:42:50,834 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2023-02-18 07:42:50,834 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-18 07:42:50,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 07:42:50,834 INFO L85 PathProgramCache]: Analyzing trace with hash -1563617241, now seen corresponding path program 1 times [2023-02-18 07:42:50,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 07:42:50,835 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89965463] [2023-02-18 07:42:50,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 07:42:50,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 07:42:50,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:51,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-18 07:42:51,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:51,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-18 07:42:51,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:51,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2023-02-18 07:42:51,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:51,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2023-02-18 07:42:51,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:51,392 INFO L134 CoverageAnalysis]: Checked inductivity of 636 backedges. 4 proven. 610 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-02-18 07:42:51,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 07:42:51,393 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89965463] [2023-02-18 07:42:51,393 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [89965463] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 07:42:51,393 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1514229869] [2023-02-18 07:42:51,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 07:42:51,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 07:42:51,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 07:42:51,397 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 07:42:51,428 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2023-02-18 07:42:51,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:51,495 INFO L263 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 28 conjunts are in the unsatisfiable core [2023-02-18 07:42:51,497 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 07:42:51,704 INFO L134 CoverageAnalysis]: Checked inductivity of 636 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 624 trivial. 0 not checked. [2023-02-18 07:42:51,705 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 07:42:51,705 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1514229869] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 07:42:51,705 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-18 07:42:51,705 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [20] total 29 [2023-02-18 07:42:51,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331586062] [2023-02-18 07:42:51,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 07:42:51,706 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-18 07:42:51,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 07:42:51,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-18 07:42:51,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=723, Unknown=0, NotChecked=0, Total=812 [2023-02-18 07:42:51,707 INFO L87 Difference]: Start difference. First operand 476 states and 572 transitions. Second operand has 11 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-18 07:42:51,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 07:42:51,937 INFO L93 Difference]: Finished difference Result 534 states and 634 transitions. [2023-02-18 07:42:51,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-18 07:42:51,938 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 147 [2023-02-18 07:42:51,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 07:42:51,940 INFO L225 Difference]: With dead ends: 534 [2023-02-18 07:42:51,940 INFO L226 Difference]: Without dead ends: 526 [2023-02-18 07:42:51,941 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 146 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=114, Invalid=942, Unknown=0, NotChecked=0, Total=1056 [2023-02-18 07:42:51,941 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 148 mSDsluCounter, 568 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 643 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 07:42:51,941 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 643 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 219 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 07:42:51,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2023-02-18 07:42:51,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 471. [2023-02-18 07:42:52,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 471 states, 448 states have (on average 1.2098214285714286) internal successors, (542), 450 states have internal predecessors, (542), 6 states have call successors, (6), 4 states have call predecessors, (6), 9 states have return successors, (17), 16 states have call predecessors, (17), 6 states have call successors, (17) [2023-02-18 07:42:52,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 471 states and 565 transitions. [2023-02-18 07:42:52,002 INFO L78 Accepts]: Start accepts. Automaton has 471 states and 565 transitions. Word has length 147 [2023-02-18 07:42:52,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 07:42:52,003 INFO L495 AbstractCegarLoop]: Abstraction has 471 states and 565 transitions. [2023-02-18 07:42:52,003 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-18 07:42:52,003 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 565 transitions. [2023-02-18 07:42:52,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2023-02-18 07:42:52,005 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 07:42:52,005 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 16, 15, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 07:42:52,019 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2023-02-18 07:42:52,211 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 07:42:52,212 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-18 07:42:52,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 07:42:52,212 INFO L85 PathProgramCache]: Analyzing trace with hash -797200414, now seen corresponding path program 1 times [2023-02-18 07:42:52,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 07:42:52,212 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457016567] [2023-02-18 07:42:52,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 07:42:52,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 07:42:52,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:52,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-18 07:42:52,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:52,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-18 07:42:52,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:52,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2023-02-18 07:42:52,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:52,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-02-18 07:42:52,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:52,387 INFO L134 CoverageAnalysis]: Checked inductivity of 641 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 631 trivial. 0 not checked. [2023-02-18 07:42:52,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 07:42:52,388 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457016567] [2023-02-18 07:42:52,388 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [457016567] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 07:42:52,388 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [868422640] [2023-02-18 07:42:52,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 07:42:52,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 07:42:52,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 07:42:52,393 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 07:42:52,396 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2023-02-18 07:42:52,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:52,477 INFO L263 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 26 conjunts are in the unsatisfiable core [2023-02-18 07:42:52,479 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 07:42:52,580 INFO L134 CoverageAnalysis]: Checked inductivity of 641 backedges. 15 proven. 7 refuted. 0 times theorem prover too weak. 619 trivial. 0 not checked. [2023-02-18 07:42:52,581 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 07:42:52,675 INFO L134 CoverageAnalysis]: Checked inductivity of 641 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 631 trivial. 0 not checked. [2023-02-18 07:42:52,676 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [868422640] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 07:42:52,676 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-18 07:42:52,676 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 9] total 24 [2023-02-18 07:42:52,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117174422] [2023-02-18 07:42:52,676 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-18 07:42:52,677 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-02-18 07:42:52,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 07:42:52,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-02-18 07:42:52,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=486, Unknown=0, NotChecked=0, Total=552 [2023-02-18 07:42:52,678 INFO L87 Difference]: Start difference. First operand 471 states and 565 transitions. Second operand has 24 states, 24 states have (on average 4.208333333333333) internal successors, (101), 21 states have internal predecessors, (101), 4 states have call successors, (6), 1 states have call predecessors, (6), 4 states have return successors, (8), 7 states have call predecessors, (8), 4 states have call successors, (8) [2023-02-18 07:42:53,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 07:42:53,708 INFO L93 Difference]: Finished difference Result 1398 states and 1609 transitions. [2023-02-18 07:42:53,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2023-02-18 07:42:53,708 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 4.208333333333333) internal successors, (101), 21 states have internal predecessors, (101), 4 states have call successors, (6), 1 states have call predecessors, (6), 4 states have return successors, (8), 7 states have call predecessors, (8), 4 states have call successors, (8) Word has length 147 [2023-02-18 07:42:53,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 07:42:53,712 INFO L225 Difference]: With dead ends: 1398 [2023-02-18 07:42:53,712 INFO L226 Difference]: Without dead ends: 1349 [2023-02-18 07:42:53,713 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 341 GetRequests, 286 SyntacticMatches, 1 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 711 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=455, Invalid=2625, Unknown=0, NotChecked=0, Total=3080 [2023-02-18 07:42:53,713 INFO L413 NwaCegarLoop]: 210 mSDtfsCounter, 1029 mSDsluCounter, 2987 mSDsCounter, 0 mSdLazyCounter, 1364 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1029 SdHoareTripleChecker+Valid, 3197 SdHoareTripleChecker+Invalid, 1390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 1364 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-02-18 07:42:53,714 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1029 Valid, 3197 Invalid, 1390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 1364 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-02-18 07:42:53,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1349 states. [2023-02-18 07:42:53,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1349 to 507. [2023-02-18 07:42:53,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 507 states, 482 states have (on average 1.2157676348547717) internal successors, (586), 481 states have internal predecessors, (586), 7 states have call successors, (7), 4 states have call predecessors, (7), 10 states have return successors, (22), 21 states have call predecessors, (22), 7 states have call successors, (22) [2023-02-18 07:42:53,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 507 states to 507 states and 615 transitions. [2023-02-18 07:42:53,763 INFO L78 Accepts]: Start accepts. Automaton has 507 states and 615 transitions. Word has length 147 [2023-02-18 07:42:53,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 07:42:53,764 INFO L495 AbstractCegarLoop]: Abstraction has 507 states and 615 transitions. [2023-02-18 07:42:53,764 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 4.208333333333333) internal successors, (101), 21 states have internal predecessors, (101), 4 states have call successors, (6), 1 states have call predecessors, (6), 4 states have return successors, (8), 7 states have call predecessors, (8), 4 states have call successors, (8) [2023-02-18 07:42:53,764 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 615 transitions. [2023-02-18 07:42:53,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2023-02-18 07:42:53,766 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 07:42:53,766 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 16, 15, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 07:42:53,779 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2023-02-18 07:42:53,973 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 07:42:53,973 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-18 07:42:53,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 07:42:53,973 INFO L85 PathProgramCache]: Analyzing trace with hash -797198492, now seen corresponding path program 1 times [2023-02-18 07:42:53,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 07:42:53,974 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815564610] [2023-02-18 07:42:53,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 07:42:53,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 07:42:53,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:54,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-18 07:42:54,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:54,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-18 07:42:54,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:54,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2023-02-18 07:42:54,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:54,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-02-18 07:42:54,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:54,486 INFO L134 CoverageAnalysis]: Checked inductivity of 641 backedges. 4 proven. 616 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-02-18 07:42:54,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 07:42:54,486 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815564610] [2023-02-18 07:42:54,486 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1815564610] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 07:42:54,486 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [750254096] [2023-02-18 07:42:54,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 07:42:54,486 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 07:42:54,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 07:42:54,493 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 07:42:54,509 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2023-02-18 07:42:54,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:54,731 INFO L263 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 28 conjunts are in the unsatisfiable core [2023-02-18 07:42:54,733 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 07:42:55,006 INFO L134 CoverageAnalysis]: Checked inductivity of 641 backedges. 15 proven. 7 refuted. 0 times theorem prover too weak. 619 trivial. 0 not checked. [2023-02-18 07:42:55,006 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 07:42:55,554 INFO L134 CoverageAnalysis]: Checked inductivity of 641 backedges. 15 proven. 7 refuted. 0 times theorem prover too weak. 619 trivial. 0 not checked. [2023-02-18 07:42:55,554 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [750254096] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 07:42:55,554 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-18 07:42:55,555 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 11, 10] total 39 [2023-02-18 07:42:55,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502108908] [2023-02-18 07:42:55,555 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-18 07:42:55,556 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2023-02-18 07:42:55,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 07:42:55,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2023-02-18 07:42:55,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=1364, Unknown=0, NotChecked=0, Total=1482 [2023-02-18 07:42:55,558 INFO L87 Difference]: Start difference. First operand 507 states and 615 transitions. Second operand has 39 states, 39 states have (on average 5.3076923076923075) internal successors, (207), 37 states have internal predecessors, (207), 6 states have call successors, (12), 1 states have call predecessors, (12), 4 states have return successors, (12), 8 states have call predecessors, (12), 6 states have call successors, (12) [2023-02-18 07:42:58,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 07:42:58,803 INFO L93 Difference]: Finished difference Result 1447 states and 1746 transitions. [2023-02-18 07:42:58,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2023-02-18 07:42:58,803 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 5.3076923076923075) internal successors, (207), 37 states have internal predecessors, (207), 6 states have call successors, (12), 1 states have call predecessors, (12), 4 states have return successors, (12), 8 states have call predecessors, (12), 6 states have call successors, (12) Word has length 147 [2023-02-18 07:42:58,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 07:42:58,807 INFO L225 Difference]: With dead ends: 1447 [2023-02-18 07:42:58,808 INFO L226 Difference]: Without dead ends: 1112 [2023-02-18 07:42:58,810 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 355 GetRequests, 282 SyntacticMatches, 4 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 587 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=613, Invalid=4357, Unknown=0, NotChecked=0, Total=4970 [2023-02-18 07:42:58,811 INFO L413 NwaCegarLoop]: 226 mSDtfsCounter, 1087 mSDsluCounter, 6012 mSDsCounter, 0 mSdLazyCounter, 3429 mSolverCounterSat, 120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1097 SdHoareTripleChecker+Valid, 6238 SdHoareTripleChecker+Invalid, 3549 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 3429 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2023-02-18 07:42:58,811 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1097 Valid, 6238 Invalid, 3549 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [120 Valid, 3429 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2023-02-18 07:42:58,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1112 states. [2023-02-18 07:42:58,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1112 to 521. [2023-02-18 07:42:58,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 521 states, 496 states have (on average 1.219758064516129) internal successors, (605), 494 states have internal predecessors, (605), 7 states have call successors, (7), 4 states have call predecessors, (7), 10 states have return successors, (22), 22 states have call predecessors, (22), 7 states have call successors, (22) [2023-02-18 07:42:58,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 521 states to 521 states and 634 transitions. [2023-02-18 07:42:58,862 INFO L78 Accepts]: Start accepts. Automaton has 521 states and 634 transitions. Word has length 147 [2023-02-18 07:42:58,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 07:42:58,862 INFO L495 AbstractCegarLoop]: Abstraction has 521 states and 634 transitions. [2023-02-18 07:42:58,863 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 5.3076923076923075) internal successors, (207), 37 states have internal predecessors, (207), 6 states have call successors, (12), 1 states have call predecessors, (12), 4 states have return successors, (12), 8 states have call predecessors, (12), 6 states have call successors, (12) [2023-02-18 07:42:58,863 INFO L276 IsEmpty]: Start isEmpty. Operand 521 states and 634 transitions. [2023-02-18 07:42:58,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2023-02-18 07:42:58,865 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 07:42:58,865 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 17, 16, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 07:42:58,873 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2023-02-18 07:42:59,071 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 07:42:59,072 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-18 07:42:59,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 07:42:59,073 INFO L85 PathProgramCache]: Analyzing trace with hash 1752880772, now seen corresponding path program 1 times [2023-02-18 07:42:59,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 07:42:59,074 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337437936] [2023-02-18 07:42:59,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 07:42:59,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 07:42:59,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:59,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-18 07:42:59,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:59,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-18 07:42:59,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:59,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2023-02-18 07:42:59,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:59,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2023-02-18 07:42:59,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:59,619 INFO L134 CoverageAnalysis]: Checked inductivity of 733 backedges. 4 proven. 702 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2023-02-18 07:42:59,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-18 07:42:59,619 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337437936] [2023-02-18 07:42:59,620 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [337437936] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-18 07:42:59,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2101877956] [2023-02-18 07:42:59,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 07:42:59,621 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-18 07:42:59,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 07:42:59,623 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-18 07:42:59,652 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2023-02-18 07:42:59,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:42:59,746 INFO L263 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 39 conjunts are in the unsatisfiable core [2023-02-18 07:42:59,748 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 07:43:00,215 INFO L134 CoverageAnalysis]: Checked inductivity of 733 backedges. 38 proven. 680 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-02-18 07:43:00,215 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 07:43:01,184 INFO L134 CoverageAnalysis]: Checked inductivity of 733 backedges. 4 proven. 702 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2023-02-18 07:43:01,184 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2101877956] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 07:43:01,184 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-18 07:43:01,184 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 58 [2023-02-18 07:43:01,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582085723] [2023-02-18 07:43:01,185 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-18 07:43:01,185 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2023-02-18 07:43:01,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-18 07:43:01,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2023-02-18 07:43:01,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=761, Invalid=2545, Unknown=0, NotChecked=0, Total=3306 [2023-02-18 07:43:01,188 INFO L87 Difference]: Start difference. First operand 521 states and 634 transitions. Second operand has 58 states, 58 states have (on average 5.706896551724138) internal successors, (331), 58 states have internal predecessors, (331), 2 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-02-18 07:43:11,625 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-18 07:43:14,081 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.59s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-18 07:43:16,087 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-18 07:43:21,804 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-18 07:43:29,712 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-18 07:43:31,005 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-18 07:43:32,436 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-18 07:43:38,065 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-18 07:43:40,177 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.46s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-18 07:43:42,182 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-18 07:43:45,877 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-18 07:43:59,168 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-18 07:44:26,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 07:44:26,739 INFO L93 Difference]: Finished difference Result 1531 states and 1933 transitions. [2023-02-18 07:44:26,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2023-02-18 07:44:26,741 INFO L78 Accepts]: Start accepts. Automaton has has 58 states, 58 states have (on average 5.706896551724138) internal successors, (331), 58 states have internal predecessors, (331), 2 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 152 [2023-02-18 07:44:26,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 07:44:26,747 INFO L225 Difference]: With dead ends: 1531 [2023-02-18 07:44:26,747 INFO L226 Difference]: Without dead ends: 1160 [2023-02-18 07:44:26,753 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 393 GetRequests, 286 SyntacticMatches, 13 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2279 ImplicationChecksByTransitivity, 55.4s TimeCoverageRelationStatistics Valid=2683, Invalid=6433, Unknown=4, NotChecked=0, Total=9120 [2023-02-18 07:44:26,757 INFO L413 NwaCegarLoop]: 145 mSDtfsCounter, 529 mSDsluCounter, 2649 mSDsCounter, 0 mSdLazyCounter, 3637 mSolverCounterSat, 62 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 30.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 529 SdHoareTripleChecker+Valid, 2794 SdHoareTripleChecker+Invalid, 3703 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 3637 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 31.2s IncrementalHoareTripleChecker+Time [2023-02-18 07:44:26,757 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [529 Valid, 2794 Invalid, 3703 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 3637 Invalid, 4 Unknown, 0 Unchecked, 31.2s Time] [2023-02-18 07:44:26,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1160 states. [2023-02-18 07:44:26,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1160 to 549. [2023-02-18 07:44:26,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 549 states, 524 states have (on average 1.1946564885496183) internal successors, (626), 522 states have internal predecessors, (626), 7 states have call successors, (7), 4 states have call predecessors, (7), 10 states have return successors, (22), 22 states have call predecessors, (22), 7 states have call successors, (22) [2023-02-18 07:44:26,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 549 states and 655 transitions. [2023-02-18 07:44:26,832 INFO L78 Accepts]: Start accepts. Automaton has 549 states and 655 transitions. Word has length 152 [2023-02-18 07:44:26,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 07:44:26,833 INFO L495 AbstractCegarLoop]: Abstraction has 549 states and 655 transitions. [2023-02-18 07:44:26,833 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 58 states, 58 states have (on average 5.706896551724138) internal successors, (331), 58 states have internal predecessors, (331), 2 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-02-18 07:44:26,833 INFO L276 IsEmpty]: Start isEmpty. Operand 549 states and 655 transitions. [2023-02-18 07:44:26,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2023-02-18 07:44:26,835 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 07:44:26,836 INFO L195 NwaCegarLoop]: trace histogram [24, 24, 24, 24, 23, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 07:44:26,844 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2023-02-18 07:44:27,044 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2023-02-18 07:44:27,044 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-18 07:44:27,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 07:44:27,045 INFO L85 PathProgramCache]: Analyzing trace with hash 1056938998, now seen corresponding path program 2 times [2023-02-18 07:44:27,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-18 07:44:27,045 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678168626] [2023-02-18 07:44:27,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 07:44:27,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-18 07:44:27,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-18 07:44:27,089 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-18 07:44:27,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-18 07:44:27,157 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-18 07:44:27,158 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-02-18 07:44:27,159 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 16 remaining) [2023-02-18 07:44:27,160 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 16 remaining) [2023-02-18 07:44:27,160 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 16 remaining) [2023-02-18 07:44:27,161 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 16 remaining) [2023-02-18 07:44:27,161 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 16 remaining) [2023-02-18 07:44:27,161 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 16 remaining) [2023-02-18 07:44:27,161 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 16 remaining) [2023-02-18 07:44:27,161 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 16 remaining) [2023-02-18 07:44:27,162 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 16 remaining) [2023-02-18 07:44:27,162 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 16 remaining) [2023-02-18 07:44:27,162 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 16 remaining) [2023-02-18 07:44:27,162 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 16 remaining) [2023-02-18 07:44:27,162 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 16 remaining) [2023-02-18 07:44:27,162 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 16 remaining) [2023-02-18 07:44:27,163 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 16 remaining) [2023-02-18 07:44:27,163 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 16 remaining) [2023-02-18 07:44:27,163 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2023-02-18 07:44:27,166 INFO L445 BasicCegarLoop]: Path program histogram: [3, 3, 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] [2023-02-18 07:44:27,169 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-02-18 07:44:27,242 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.02 07:44:27 BoogieIcfgContainer [2023-02-18 07:44:27,242 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-02-18 07:44:27,243 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-18 07:44:27,243 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-18 07:44:27,243 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-18 07:44:27,244 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 07:42:25" (3/4) ... [2023-02-18 07:44:27,246 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-02-18 07:44:27,247 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-18 07:44:27,251 INFO L158 Benchmark]: Toolchain (without parser) took 122220.28ms. Allocated memory was 117.4MB in the beginning and 362.8MB in the end (delta: 245.4MB). Free memory was 71.7MB in the beginning and 185.3MB in the end (delta: -113.6MB). Peak memory consumption was 133.6MB. Max. memory is 16.1GB. [2023-02-18 07:44:27,251 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 117.4MB. Free memory is still 90.7MB. There was no memory consumed. Max. memory is 16.1GB. [2023-02-18 07:44:27,251 INFO L158 Benchmark]: CACSL2BoogieTranslator took 266.77ms. Allocated memory is still 117.4MB. Free memory was 71.5MB in the beginning and 57.8MB in the end (delta: 13.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-02-18 07:44:27,255 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.83ms. Allocated memory is still 117.4MB. Free memory was 57.8MB in the beginning and 55.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-18 07:44:27,255 INFO L158 Benchmark]: Boogie Preprocessor took 33.25ms. Allocated memory is still 117.4MB. Free memory was 55.7MB in the beginning and 53.9MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-18 07:44:27,256 INFO L158 Benchmark]: RCFGBuilder took 572.13ms. Allocated memory was 117.4MB in the beginning and 174.1MB in the end (delta: 56.6MB). Free memory was 53.9MB in the beginning and 130.5MB in the end (delta: -76.6MB). Peak memory consumption was 12.5MB. Max. memory is 16.1GB. [2023-02-18 07:44:27,256 INFO L158 Benchmark]: TraceAbstraction took 121295.54ms. Allocated memory was 174.1MB in the beginning and 362.8MB in the end (delta: 188.7MB). Free memory was 129.3MB in the beginning and 186.3MB in the end (delta: -57.0MB). Peak memory consumption was 131.6MB. Max. memory is 16.1GB. [2023-02-18 07:44:27,258 INFO L158 Benchmark]: Witness Printer took 3.82ms. Allocated memory is still 362.8MB. Free memory was 186.3MB in the beginning and 185.3MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-18 07:44:27,258 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 117.4MB. Free memory is still 90.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 266.77ms. Allocated memory is still 117.4MB. Free memory was 71.5MB in the beginning and 57.8MB in the end (delta: 13.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 39.83ms. Allocated memory is still 117.4MB. Free memory was 57.8MB in the beginning and 55.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 33.25ms. Allocated memory is still 117.4MB. Free memory was 55.7MB in the beginning and 53.9MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 572.13ms. Allocated memory was 117.4MB in the beginning and 174.1MB in the end (delta: 56.6MB). Free memory was 53.9MB in the beginning and 130.5MB in the end (delta: -76.6MB). Peak memory consumption was 12.5MB. Max. memory is 16.1GB. * TraceAbstraction took 121295.54ms. Allocated memory was 174.1MB in the beginning and 362.8MB in the end (delta: 188.7MB). Free memory was 129.3MB in the beginning and 186.3MB in the end (delta: -57.0MB). Peak memory consumption was 131.6MB. Max. memory is 16.1GB. * Witness Printer took 3.82ms. Allocated memory is still 362.8MB. Free memory was 186.3MB in the beginning and 185.3MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * 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 - UnprovableResult [Line: 172]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: overapproximation of bitwiseComplement at line 76, overapproximation of bitwiseAnd at line 171. Possible FailurePath: [L221] unsigned int a ; [L222] unsigned int ma = __VERIFIER_nondet_uint(); [L223] signed char ea = __VERIFIER_nondet_char(); [L224] unsigned int b ; [L225] unsigned int mb = __VERIFIER_nondet_uint(); [L226] signed char eb = __VERIFIER_nondet_char(); [L227] unsigned int r_mul ; [L228] unsigned int zero ; [L229] unsigned int one ; [L230] int sb ; [L231] int tmp ; [L232] int tmp___0 ; [L233] int tmp___1 ; [L234] int __retres16 ; VAL [ea=-127, eb=-128] [L238] CALL, EXPR base2flt(0, 0) VAL [\old(e)=0, \old(m)=0] [L25] unsigned int res ; [L26] unsigned int __retres4 ; VAL [\old(e)=0, \old(m)=0, e=0, m=0] [L29] COND TRUE ! m [L30] __retres4 = 0U VAL [\old(e)=0, \old(m)=0, __retres4=0, e=0, m=0] [L80] return (__retres4); VAL [\old(e)=0, \old(m)=0, \result=0, __retres4=0, e=0, m=0] [L238] RET, EXPR base2flt(0, 0) VAL [base2flt(0, 0)=0, ea=-127, eb=-128] [L238] zero = base2flt(0, 0) [L239] CALL, EXPR base2flt(1, 0) VAL [\old(e)=0, \old(m)=1] [L25] unsigned int res ; [L26] unsigned int __retres4 ; VAL [\old(e)=0, \old(m)=1, e=0, m=1] [L29] COND FALSE !(! m) VAL [\old(e)=0, \old(m)=1, e=0, m=1] [L35] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=0, m=1] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=0, m=1] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=0, m=1] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-1, m=2] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-1, m=2] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=-1, m=2] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-1, m=2] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-2, m=4] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-2, m=4] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=-2, m=4] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-2, m=4] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-3, m=8] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-3, m=8] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=-3, m=8] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-3, m=8] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-4, m=16] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-4, m=16] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=-4, m=16] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-4, m=16] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-5, m=32] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-5, m=32] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=-5, m=32] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-5, m=32] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-6, m=64] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-6, m=64] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=-6, m=64] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-6, m=64] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-7, m=128] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-7, m=128] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=-7, m=128] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-7, m=128] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-8, m=256] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-8, m=256] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=-8, m=256] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-8, m=256] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-9, m=512] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-9, m=512] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=-9, m=512] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-9, m=512] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-10, m=1024] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-10, m=1024] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=-10, m=1024] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-10, m=1024] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-11, m=2048] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-11, m=2048] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=-11, m=2048] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-11, m=2048] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-12, m=4096] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-12, m=4096] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=-12, m=4096] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-12, m=4096] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-13, m=8192] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-13, m=8192] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=-13, m=8192] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-13, m=8192] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-14, m=16384] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-14, m=16384] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=-14, m=16384] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-14, m=16384] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-15, m=32768] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-15, m=32768] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=-15, m=32768] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-15, m=32768] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-16, m=65536] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-16, m=65536] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=-16, m=65536] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-16, m=65536] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-17, m=131072] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-17, m=131072] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=-17, m=131072] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-17, m=131072] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-18, m=262144] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-18, m=262144] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=-18, m=262144] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-18, m=262144] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-19, m=524288] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-19, m=524288] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=-19, m=524288] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-19, m=524288] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-20, m=1048576] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-20, m=1048576] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=-20, m=1048576] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-20, m=1048576] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-21, m=2097152] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-21, m=2097152] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=-21, m=2097152] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-21, m=2097152] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-22, m=4194304] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-22, m=4194304] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=-22, m=4194304] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-22, m=4194304] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-23, m=8388608] [L47] COND TRUE m < 1U << 24U VAL [\old(e)=0, \old(m)=1, e=-23, m=8388608] [L37] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=-23, m=8388608] [L39] COND FALSE !(e <= -128) VAL [\old(e)=0, \old(m)=1, e=-23, m=8388608] [L45] EXPR e - 1 [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=0, \old(m)=1, e=-24, m=16777216] [L47] COND FALSE !(m < 1U << 24U) VAL [\old(e)=0, \old(m)=1, e=-24, m=16777216] [L76] m = m & ~ (1U << 24U) VAL [\old(e)=0, \old(m)=1, e=-24, m=0] [L77] EXPR e + 128 VAL [\old(e)=0, \old(m)=1, e=-24, m=0] [L77] res = m | ((unsigned int )(e + 128) << 24U) [L78] __retres4 = res VAL [\old(e)=0, \old(m)=1, __retres4=1744830464, e=-24, m=0, res=1744830464] [L80] return (__retres4); VAL [\old(e)=0, \old(m)=1, \result=1744830464, __retres4=1744830464, e=-24, m=0, res=1744830464] [L239] RET, EXPR base2flt(1, 0) VAL [base2flt(1, 0)=1744830464, ea=-127, eb=-128, zero=0] [L239] one = base2flt(1, 0) [L240] CALL, EXPR base2flt(ma, ea) VAL [\old(e)=-127, \old(m)=16777216] [L25] unsigned int res ; [L26] unsigned int __retres4 ; VAL [\old(e)=-127, \old(m)=16777216, e=-127, m=16777216] [L29] COND FALSE !(! m) VAL [\old(e)=-127, \old(m)=16777216, e=-127, m=16777216] [L35] COND FALSE !(m < 1U << 24U) VAL [\old(e)=-127, \old(m)=16777216, e=-127, m=16777216] [L57] COND TRUE 1 VAL [\old(e)=-127, \old(m)=16777216, e=-127, m=16777216] [L59] COND FALSE !(m >= 1U << 25U) VAL [\old(e)=-127, \old(m)=16777216, e=-127, m=16777216] [L76] m = m & ~ (1U << 24U) VAL [\old(e)=-127, \old(m)=16777216, e=-127, m=0] [L77] EXPR e + 128 VAL [\old(e)=-127, \old(m)=16777216, e=-127, m=0] [L77] res = m | ((unsigned int )(e + 128) << 24U) [L78] __retres4 = res VAL [\old(e)=-127, \old(m)=16777216, __retres4=16777216, e=-127, m=0, res=16777216] [L80] return (__retres4); VAL [\old(e)=-127, \old(m)=16777216, \result=16777216, __retres4=16777216, e=-127, m=0, res=16777216] [L240] RET, EXPR base2flt(ma, ea) VAL [base2flt(ma, ea)=16777216, ea=-127, eb=-128, ma=16777216, one=1744830464, zero=0] [L240] a = base2flt(ma, ea) [L241] CALL, EXPR base2flt(mb, eb) VAL [\old(e)=-128, \old(m)=16777217] [L25] unsigned int res ; [L26] unsigned int __retres4 ; VAL [\old(e)=-128, \old(m)=16777217, e=-128, m=16777217] [L29] COND FALSE !(! m) VAL [\old(e)=-128, \old(m)=16777217, e=-128, m=16777217] [L35] COND FALSE !(m < 1U << 24U) VAL [\old(e)=-128, \old(m)=16777217, e=-128, m=16777217] [L57] COND TRUE 1 VAL [\old(e)=-128, \old(m)=16777217, e=-128, m=16777217] [L59] COND FALSE !(m >= 1U << 25U) VAL [\old(e)=-128, \old(m)=16777217, e=-128, m=16777217] [L76] m = m & ~ (1U << 24U) VAL [\old(e)=-128, \old(m)=16777217, e=-128, m=16777217] [L77] EXPR e + 128 VAL [\old(e)=-128, \old(m)=16777217, e=-128, m=16777217] [L77] res = m | ((unsigned int )(e + 128) << 24U) [L78] __retres4 = res VAL [\old(e)=-128, \old(m)=16777217, __retres4=16777217, e=-128, m=16777217, res=16777217] [L80] return (__retres4); VAL [\old(e)=-128, \old(m)=16777217, \result=-36028797002186751, __retres4=16777217, e=-128, m=16777217, res=16777217] [L241] RET, EXPR base2flt(mb, eb) VAL [a=16777216, base2flt(mb, eb)=-36028797002186751, ea=-127, eb=-128, ma=16777216, mb=16777217, one=1744830464, zero=0] [L241] b = base2flt(mb, eb) [L243] COND FALSE !(b < zero) VAL [a=16777216, b=16777217, ea=-127, eb=-128, ma=16777216, mb=16777217, one=1744830464, zero=0] [L246] COND TRUE b > zero [L247] tmp = 1 VAL [a=16777216, b=16777217, ea=-127, eb=-128, ma=16777216, mb=16777217, one=1744830464, tmp=1, zero=0] [L251] sb = tmp VAL [a=16777216, b=16777217, ea=-127, eb=-128, ma=16777216, mb=16777217, one=1744830464, sb=1, tmp=1, zero=0] [L254] CALL mulflt(a, b) [L148] unsigned int res ; [L149] unsigned int ma ; [L150] unsigned int mb ; [L151] unsigned long long accu ; [L152] int ea ; [L153] int eb ; [L154] unsigned int tmp ; [L155] unsigned int __retres10 ; VAL [\old(a)=16777216, \old(b)=16777217, a=16777216, b=16777217] [L158] COND TRUE a < b [L159] tmp = a [L160] a = b [L161] b = tmp VAL [\old(a)=16777216, \old(b)=16777217, a=16777217, b=16777216, tmp=16777216] [L165] COND FALSE !(! b) VAL [\old(a)=16777216, \old(b)=16777217, a=16777217, b=16777216, tmp=16777216] [L171] ma = a & ((1U << 24U) - 1U) VAL [\old(a)=16777216, \old(b)=16777217, a=16777217, b=16777216, ma=0, tmp=16777216] [L172] (int )(a >> 24U) - 128 VAL [\old(a)=16777216, \old(b)=16777217, a=16777217, b=16777216, ma=0, tmp=16777216] - UnprovableResult [Line: 45]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 45]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 70]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 70]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 77]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 77]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 172]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 175]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 175]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 177]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 177]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 178]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 178]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 201]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 201]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 106 locations, 16 error locations. Started 1 CEGAR loops. OverallTime: 121.2s, OverallIterations: 34, TraceHistogramMax: 24, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.1s, AutomataDifference: 100.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 4 mSolverCounterUnknown, 9848 SdHoareTripleChecker+Valid, 40.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 9813 mSDsluCounter, 32662 SdHoareTripleChecker+Invalid, 38.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 29202 mSDsCounter, 745 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 16674 IncrementalHoareTripleChecker+Invalid, 17423 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 745 mSolverCounterUnsat, 3460 mSDtfsCounter, 16674 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 4237 GetRequests, 3398 SyntacticMatches, 71 SemanticMatches, 768 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6596 ImplicationChecksByTransitivity, 64.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=549occurred in iteration=33, InterpolantAutomatonStates: 565, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.9s AutomataMinimizationTime, 33 MinimizatonAttempts, 6842 StatesRemovedByMinimization, 33 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 13.1s InterpolantComputationTime, 4835 NumberOfCodeBlocks, 4611 NumberOfCodeBlocksAsserted, 57 NumberOfCheckSat, 5926 ConstructedInterpolants, 0 QuantifiedInterpolants, 40859 SizeOfPredicates, 103 NumberOfNonLiveVariables, 4494 ConjunctsInSsa, 368 ConjunctsInUnsatCore, 66 InterpolantComputations, 20 PerfectInterpolantSequences, 9958/18313 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-02-18 07:44:27,467 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/bitvector/soft_float_5a.c.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f6c91769726962c1478685c30d57ac239987d5f8a5f6832d1d60b9c031f35855 --- Real Ultimate output --- This is Ultimate 0.2.2-?-26d01a9 [2023-02-18 07:44:29,355 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-18 07:44:29,358 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-18 07:44:29,400 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-18 07:44:29,402 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-18 07:44:29,405 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-18 07:44:29,407 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-18 07:44:29,410 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-18 07:44:29,414 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-18 07:44:29,421 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-18 07:44:29,422 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-18 07:44:29,425 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-18 07:44:29,425 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-18 07:44:29,427 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-18 07:44:29,429 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-18 07:44:29,433 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-18 07:44:29,434 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-18 07:44:29,435 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-18 07:44:29,437 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-18 07:44:29,443 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-18 07:44:29,445 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-18 07:44:29,446 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-18 07:44:29,446 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-18 07:44:29,447 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-18 07:44:29,455 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-18 07:44:29,462 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-18 07:44:29,462 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-18 07:44:29,463 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-18 07:44:29,463 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-18 07:44:29,464 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-18 07:44:29,464 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-18 07:44:29,470 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-18 07:44:29,471 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-18 07:44:29,472 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-18 07:44:29,473 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-18 07:44:29,473 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-18 07:44:29,474 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-18 07:44:29,475 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-18 07:44:29,475 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-18 07:44:29,475 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-18 07:44:29,476 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-18 07:44:29,477 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Bitvector.epf [2023-02-18 07:44:29,507 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-18 07:44:29,507 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-18 07:44:29,508 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-18 07:44:29,508 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-18 07:44:29,509 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-18 07:44:29,509 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-18 07:44:29,510 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-18 07:44:29,510 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-18 07:44:29,510 INFO L138 SettingsManager]: * Use SBE=true [2023-02-18 07:44:29,511 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-18 07:44:29,512 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-18 07:44:29,512 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-18 07:44:29,512 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-18 07:44:29,512 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-18 07:44:29,512 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-18 07:44:29,512 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-18 07:44:29,513 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-18 07:44:29,513 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-18 07:44:29,513 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2023-02-18 07:44:29,513 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2023-02-18 07:44:29,513 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-02-18 07:44:29,514 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-18 07:44:29,514 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-18 07:44:29,514 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-18 07:44:29,514 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-18 07:44:29,514 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-18 07:44:29,515 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-18 07:44:29,515 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-18 07:44:29,515 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-18 07:44:29,515 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-18 07:44:29,515 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-18 07:44:29,515 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-18 07:44:29,516 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2023-02-18 07:44:29,516 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-02-18 07:44:29,516 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-18 07:44:29,516 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-18 07:44:29,517 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-18 07:44:29,517 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-18 07:44:29,517 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2023-02-18 07:44:29,517 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-18 07:44:29,517 INFO L138 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f6c91769726962c1478685c30d57ac239987d5f8a5f6832d1d60b9c031f35855 [2023-02-18 07:44:29,820 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-18 07:44:29,840 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-18 07:44:29,843 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-18 07:44:29,844 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-18 07:44:29,844 INFO L275 PluginConnector]: CDTParser initialized [2023-02-18 07:44:29,845 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/soft_float_5a.c.cil.c [2023-02-18 07:44:31,086 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-18 07:44:31,343 INFO L351 CDTParser]: Found 1 translation units. [2023-02-18 07:44:31,353 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_5a.c.cil.c [2023-02-18 07:44:31,361 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/088e32f5e/bcbbbab524794c2ca3df8d7170d46cf6/FLAG7bf52b684 [2023-02-18 07:44:31,385 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/088e32f5e/bcbbbab524794c2ca3df8d7170d46cf6 [2023-02-18 07:44:31,388 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-18 07:44:31,389 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-18 07:44:31,393 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-18 07:44:31,394 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-18 07:44:31,397 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-18 07:44:31,397 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.02 07:44:31" (1/1) ... [2023-02-18 07:44:31,400 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f64667f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 07:44:31, skipping insertion in model container [2023-02-18 07:44:31,400 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.02 07:44:31" (1/1) ... [2023-02-18 07:44:31,407 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-18 07:44:31,446 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-18 07:44:31,586 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_5a.c.cil.c[728,741] [2023-02-18 07:44:31,663 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-18 07:44:31,680 INFO L203 MainTranslator]: Completed pre-run [2023-02-18 07:44:31,702 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_5a.c.cil.c[728,741] [2023-02-18 07:44:31,741 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-18 07:44:31,762 INFO L208 MainTranslator]: Completed translation [2023-02-18 07:44:31,763 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 07:44:31 WrapperNode [2023-02-18 07:44:31,763 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-18 07:44:31,764 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-18 07:44:31,764 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-18 07:44:31,764 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-18 07:44:31,770 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 07:44:31" (1/1) ... [2023-02-18 07:44:31,789 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 07:44:31" (1/1) ... [2023-02-18 07:44:31,816 INFO L138 Inliner]: procedures = 17, calls = 15, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 120 [2023-02-18 07:44:31,816 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-18 07:44:31,818 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-18 07:44:31,818 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-18 07:44:31,818 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-18 07:44:31,826 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 07:44:31" (1/1) ... [2023-02-18 07:44:31,826 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 07:44:31" (1/1) ... [2023-02-18 07:44:31,841 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 07:44:31" (1/1) ... [2023-02-18 07:44:31,842 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 07:44:31" (1/1) ... [2023-02-18 07:44:31,849 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 07:44:31" (1/1) ... [2023-02-18 07:44:31,863 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 07:44:31" (1/1) ... [2023-02-18 07:44:31,864 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 07:44:31" (1/1) ... [2023-02-18 07:44:31,867 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 07:44:31" (1/1) ... [2023-02-18 07:44:31,870 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-18 07:44:31,874 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-18 07:44:31,874 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-18 07:44:31,874 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-18 07:44:31,875 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 07:44:31" (1/1) ... [2023-02-18 07:44:31,881 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-18 07:44:31,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-18 07:44:31,906 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-02-18 07:44:31,938 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-02-18 07:44:31,954 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-18 07:44:31,955 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-02-18 07:44:31,955 INFO L130 BoogieDeclarations]: Found specification of procedure base2flt [2023-02-18 07:44:31,955 INFO L138 BoogieDeclarations]: Found implementation of procedure base2flt [2023-02-18 07:44:31,956 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-18 07:44:31,956 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-18 07:44:31,956 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-02-18 07:44:31,956 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-02-18 07:44:32,042 INFO L235 CfgBuilder]: Building ICFG [2023-02-18 07:44:32,044 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-18 07:44:32,483 INFO L276 CfgBuilder]: Performing block encoding [2023-02-18 07:44:32,489 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-18 07:44:32,492 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2023-02-18 07:44:32,494 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 07:44:32 BoogieIcfgContainer [2023-02-18 07:44:32,495 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-18 07:44:32,496 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-18 07:44:32,496 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-18 07:44:32,499 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-18 07:44:32,505 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.02 07:44:31" (1/3) ... [2023-02-18 07:44:32,505 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@336e3419 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.02 07:44:32, skipping insertion in model container [2023-02-18 07:44:32,506 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.02 07:44:31" (2/3) ... [2023-02-18 07:44:32,506 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@336e3419 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.02 07:44:32, skipping insertion in model container [2023-02-18 07:44:32,506 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 07:44:32" (3/3) ... [2023-02-18 07:44:32,508 INFO L112 eAbstractionObserver]: Analyzing ICFG soft_float_5a.c.cil.c [2023-02-18 07:44:32,524 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-18 07:44:32,524 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 16 error locations. [2023-02-18 07:44:32,584 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-18 07:44:32,589 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=LoopsAndPotentialCycles, 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;@6f7ed9fa, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-18 07:44:32,590 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2023-02-18 07:44:32,594 INFO L276 IsEmpty]: Start isEmpty. Operand has 83 states, 59 states have (on average 1.6610169491525424) internal successors, (98), 76 states have internal predecessors, (98), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-02-18 07:44:32,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-02-18 07:44:32,601 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 07:44:32,601 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 07:44:32,602 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-18 07:44:32,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 07:44:32,610 INFO L85 PathProgramCache]: Analyzing trace with hash 598641474, now seen corresponding path program 1 times [2023-02-18 07:44:32,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 07:44:32,621 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1840151236] [2023-02-18 07:44:32,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 07:44:32,622 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-02-18 07:44:32,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 07:44:32,625 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-02-18 07:44:32,626 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-02-18 07:44:32,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:44:32,686 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 1 conjunts are in the unsatisfiable core [2023-02-18 07:44:32,689 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 07:44:32,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 07:44:32,704 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 07:44:32,705 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 07:44:32,705 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1840151236] [2023-02-18 07:44:32,705 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1840151236] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 07:44:32,706 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 07:44:32,706 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-02-18 07:44:32,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953017759] [2023-02-18 07:44:32,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 07:44:32,711 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-02-18 07:44:32,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 07:44:32,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-02-18 07:44:32,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-18 07:44:32,751 INFO L87 Difference]: Start difference. First operand has 83 states, 59 states have (on average 1.6610169491525424) internal successors, (98), 76 states have internal predecessors, (98), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 2 states, 1 states have (on average 8.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 07:44:32,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 07:44:32,776 INFO L93 Difference]: Finished difference Result 154 states and 217 transitions. [2023-02-18 07:44:32,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-02-18 07:44:32,777 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 8.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2023-02-18 07:44:32,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 07:44:32,784 INFO L225 Difference]: With dead ends: 154 [2023-02-18 07:44:32,784 INFO L226 Difference]: Without dead ends: 56 [2023-02-18 07:44:32,787 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 8 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-02-18 07:44:32,790 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-18 07:44:32,791 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-18 07:44:32,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2023-02-18 07:44:32,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2023-02-18 07:44:32,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 44 states have (on average 1.3409090909090908) internal successors, (59), 50 states have internal predecessors, (59), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-18 07:44:32,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 67 transitions. [2023-02-18 07:44:32,822 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 67 transitions. Word has length 9 [2023-02-18 07:44:32,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 07:44:32,823 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 67 transitions. [2023-02-18 07:44:32,823 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 8.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 07:44:32,823 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 67 transitions. [2023-02-18 07:44:32,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-02-18 07:44:32,824 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 07:44:32,825 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 07:44:32,840 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-02-18 07:44:33,033 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-02-18 07:44:33,033 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-18 07:44:33,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 07:44:33,034 INFO L85 PathProgramCache]: Analyzing trace with hash 597700208, now seen corresponding path program 1 times [2023-02-18 07:44:33,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 07:44:33,035 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [594137798] [2023-02-18 07:44:33,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 07:44:33,035 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-02-18 07:44:33,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 07:44:33,036 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-02-18 07:44:33,039 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-02-18 07:44:33,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:44:33,104 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-18 07:44:33,106 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 07:44:33,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 07:44:33,140 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 07:44:33,140 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 07:44:33,140 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [594137798] [2023-02-18 07:44:33,140 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [594137798] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 07:44:33,141 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 07:44:33,141 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-18 07:44:33,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948279099] [2023-02-18 07:44:33,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 07:44:33,142 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-18 07:44:33,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 07:44:33,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-18 07:44:33,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-18 07:44:33,144 INFO L87 Difference]: Start difference. First operand 56 states and 67 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 07:44:33,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 07:44:33,191 INFO L93 Difference]: Finished difference Result 117 states and 141 transitions. [2023-02-18 07:44:33,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-18 07:44:33,191 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2023-02-18 07:44:33,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 07:44:33,194 INFO L225 Difference]: With dead ends: 117 [2023-02-18 07:44:33,194 INFO L226 Difference]: Without dead ends: 64 [2023-02-18 07:44:33,195 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 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-02-18 07:44:33,196 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 9 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-18 07:44:33,196 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 178 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-18 07:44:33,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2023-02-18 07:44:33,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 61. [2023-02-18 07:44:33,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 48 states have (on average 1.3125) internal successors, (63), 54 states have internal predecessors, (63), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-18 07:44:33,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 71 transitions. [2023-02-18 07:44:33,206 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 71 transitions. Word has length 9 [2023-02-18 07:44:33,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 07:44:33,206 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 71 transitions. [2023-02-18 07:44:33,206 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-18 07:44:33,206 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 71 transitions. [2023-02-18 07:44:33,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-02-18 07:44:33,207 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 07:44:33,207 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 07:44:33,223 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-02-18 07:44:33,420 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-02-18 07:44:33,421 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-18 07:44:33,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 07:44:33,422 INFO L85 PathProgramCache]: Analyzing trace with hash -1774435898, now seen corresponding path program 1 times [2023-02-18 07:44:33,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 07:44:33,422 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [190677524] [2023-02-18 07:44:33,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 07:44:33,422 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-02-18 07:44:33,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 07:44:33,424 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-02-18 07:44:33,427 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-02-18 07:44:33,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:44:33,464 INFO L263 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-18 07:44:33,466 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 07:44:33,484 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 07:44:33,484 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 07:44:33,484 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 07:44:33,485 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [190677524] [2023-02-18 07:44:33,485 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [190677524] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 07:44:33,485 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 07:44:33,485 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-18 07:44:33,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902312120] [2023-02-18 07:44:33,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 07:44:33,486 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-18 07:44:33,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 07:44:33,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-18 07:44:33,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-18 07:44:33,491 INFO L87 Difference]: Start difference. First operand 61 states and 71 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-18 07:44:33,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 07:44:33,580 INFO L93 Difference]: Finished difference Result 149 states and 180 transitions. [2023-02-18 07:44:33,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-18 07:44:33,581 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2023-02-18 07:44:33,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 07:44:33,582 INFO L225 Difference]: With dead ends: 149 [2023-02-18 07:44:33,582 INFO L226 Difference]: Without dead ends: 98 [2023-02-18 07:44:33,583 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 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-02-18 07:44:33,584 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 55 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 07:44:33,584 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 169 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 07:44:33,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2023-02-18 07:44:33,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 91. [2023-02-18 07:44:33,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 77 states have (on average 1.3246753246753247) internal successors, (102), 83 states have internal predecessors, (102), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-18 07:44:33,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 110 transitions. [2023-02-18 07:44:33,597 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 110 transitions. Word has length 16 [2023-02-18 07:44:33,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 07:44:33,597 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 110 transitions. [2023-02-18 07:44:33,598 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-18 07:44:33,598 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 110 transitions. [2023-02-18 07:44:33,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-02-18 07:44:33,604 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 07:44:33,604 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 07:44:33,614 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-02-18 07:44:33,811 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-02-18 07:44:33,812 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-18 07:44:33,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 07:44:33,813 INFO L85 PathProgramCache]: Analyzing trace with hash 795135288, now seen corresponding path program 1 times [2023-02-18 07:44:33,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 07:44:33,813 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [129735091] [2023-02-18 07:44:33,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 07:44:33,814 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-02-18 07:44:33,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 07:44:33,815 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-02-18 07:44:33,818 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-02-18 07:44:33,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:44:33,851 INFO L263 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-18 07:44:33,853 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 07:44:33,870 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 07:44:33,870 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 07:44:33,870 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 07:44:33,871 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [129735091] [2023-02-18 07:44:33,871 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [129735091] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 07:44:33,871 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 07:44:33,871 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-18 07:44:33,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837425302] [2023-02-18 07:44:33,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 07:44:33,872 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-18 07:44:33,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 07:44:33,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-18 07:44:33,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-18 07:44:33,873 INFO L87 Difference]: Start difference. First operand 91 states and 110 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-18 07:44:33,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 07:44:33,937 INFO L93 Difference]: Finished difference Result 160 states and 189 transitions. [2023-02-18 07:44:33,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-18 07:44:33,938 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2023-02-18 07:44:33,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 07:44:33,939 INFO L225 Difference]: With dead ends: 160 [2023-02-18 07:44:33,939 INFO L226 Difference]: Without dead ends: 90 [2023-02-18 07:44:33,940 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 19 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-02-18 07:44:33,941 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 38 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-18 07:44:33,941 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 238 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-18 07:44:33,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2023-02-18 07:44:33,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 80. [2023-02-18 07:44:33,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 66 states have (on average 1.2878787878787878) internal successors, (85), 72 states have internal predecessors, (85), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-18 07:44:33,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 93 transitions. [2023-02-18 07:44:33,957 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 93 transitions. Word has length 21 [2023-02-18 07:44:33,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 07:44:33,957 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 93 transitions. [2023-02-18 07:44:33,957 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-18 07:44:33,957 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 93 transitions. [2023-02-18 07:44:33,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-02-18 07:44:33,958 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 07:44:33,958 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 07:44:33,969 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-02-18 07:44:34,166 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-02-18 07:44:34,167 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-18 07:44:34,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 07:44:34,168 INFO L85 PathProgramCache]: Analyzing trace with hash 795026184, now seen corresponding path program 1 times [2023-02-18 07:44:34,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 07:44:34,168 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [711304897] [2023-02-18 07:44:34,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 07:44:34,169 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-02-18 07:44:34,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 07:44:34,170 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-02-18 07:44:34,176 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-02-18 07:44:34,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:44:34,209 INFO L263 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-18 07:44:34,210 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 07:44:34,228 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 07:44:34,229 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 07:44:34,283 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 07:44:34,283 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 07:44:34,284 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [711304897] [2023-02-18 07:44:34,284 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [711304897] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 07:44:34,284 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 07:44:34,284 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2023-02-18 07:44:34,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787381804] [2023-02-18 07:44:34,284 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 07:44:34,285 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-18 07:44:34,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 07:44:34,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-18 07:44:34,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-02-18 07:44:34,286 INFO L87 Difference]: Start difference. First operand 80 states and 93 transitions. Second operand has 8 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 states have internal predecessors, (29), 1 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-18 07:44:34,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 07:44:34,703 INFO L93 Difference]: Finished difference Result 171 states and 209 transitions. [2023-02-18 07:44:34,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-18 07:44:34,704 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 states have internal predecessors, (29), 1 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2023-02-18 07:44:34,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 07:44:34,705 INFO L225 Difference]: With dead ends: 171 [2023-02-18 07:44:34,706 INFO L226 Difference]: Without dead ends: 117 [2023-02-18 07:44:34,706 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=137, Unknown=0, NotChecked=0, Total=210 [2023-02-18 07:44:34,708 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 189 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-18 07:44:34,708 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 228 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-18 07:44:34,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2023-02-18 07:44:34,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 81. [2023-02-18 07:44:34,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 68 states have (on average 1.25) internal successors, (85), 73 states have internal predecessors, (85), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-18 07:44:34,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 93 transitions. [2023-02-18 07:44:34,720 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 93 transitions. Word has length 21 [2023-02-18 07:44:34,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 07:44:34,720 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 93 transitions. [2023-02-18 07:44:34,721 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 states have internal predecessors, (29), 1 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-18 07:44:34,721 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 93 transitions. [2023-02-18 07:44:34,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-02-18 07:44:34,721 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 07:44:34,722 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 07:44:34,737 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-02-18 07:44:34,930 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-02-18 07:44:34,931 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-18 07:44:34,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 07:44:34,931 INFO L85 PathProgramCache]: Analyzing trace with hash -1056807626, now seen corresponding path program 1 times [2023-02-18 07:44:34,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 07:44:34,931 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1803509499] [2023-02-18 07:44:34,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 07:44:34,932 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-02-18 07:44:34,932 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 07:44:34,938 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-02-18 07:44:34,941 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-02-18 07:44:34,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:44:34,987 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-18 07:44:34,988 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 07:44:35,028 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 07:44:35,028 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 07:44:35,084 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 07:44:35,084 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 07:44:35,086 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1803509499] [2023-02-18 07:44:35,086 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1803509499] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 07:44:35,086 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 07:44:35,086 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2023-02-18 07:44:35,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787228583] [2023-02-18 07:44:35,086 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 07:44:35,087 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-02-18 07:44:35,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 07:44:35,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-02-18 07:44:35,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2023-02-18 07:44:35,089 INFO L87 Difference]: Start difference. First operand 81 states and 93 transitions. Second operand has 10 states, 10 states have (on average 3.6) internal successors, (36), 8 states have internal predecessors, (36), 1 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-18 07:44:35,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 07:44:35,291 INFO L93 Difference]: Finished difference Result 174 states and 204 transitions. [2023-02-18 07:44:35,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-02-18 07:44:35,293 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.6) internal successors, (36), 8 states have internal predecessors, (36), 1 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2023-02-18 07:44:35,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 07:44:35,294 INFO L225 Difference]: With dead ends: 174 [2023-02-18 07:44:35,294 INFO L226 Difference]: Without dead ends: 118 [2023-02-18 07:44:35,295 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=113, Invalid=229, Unknown=0, NotChecked=0, Total=342 [2023-02-18 07:44:35,296 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 94 mSDsluCounter, 411 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 482 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 07:44:35,296 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 482 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 07:44:35,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2023-02-18 07:44:35,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 99. [2023-02-18 07:44:35,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 86 states have (on average 1.2325581395348837) internal successors, (106), 91 states have internal predecessors, (106), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-18 07:44:35,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 114 transitions. [2023-02-18 07:44:35,326 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 114 transitions. Word has length 26 [2023-02-18 07:44:35,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 07:44:35,326 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 114 transitions. [2023-02-18 07:44:35,327 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.6) internal successors, (36), 8 states have internal predecessors, (36), 1 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-18 07:44:35,327 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 114 transitions. [2023-02-18 07:44:35,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-02-18 07:44:35,328 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 07:44:35,329 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 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-02-18 07:44:35,340 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-02-18 07:44:35,537 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-02-18 07:44:35,538 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting base2fltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-18 07:44:35,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 07:44:35,538 INFO L85 PathProgramCache]: Analyzing trace with hash -721090780, now seen corresponding path program 1 times [2023-02-18 07:44:35,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 07:44:35,538 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1559026937] [2023-02-18 07:44:35,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 07:44:35,539 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-02-18 07:44:35,539 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 07:44:35,540 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-02-18 07:44:35,541 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-02-18 07:44:35,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:44:35,574 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-18 07:44:35,576 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 07:44:35,609 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 9 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-18 07:44:35,609 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 07:44:35,691 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 9 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-18 07:44:35,691 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 07:44:35,691 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1559026937] [2023-02-18 07:44:35,692 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1559026937] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 07:44:35,692 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 07:44:35,692 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2023-02-18 07:44:35,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759167779] [2023-02-18 07:44:35,693 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 07:44:35,693 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-02-18 07:44:35,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 07:44:35,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-02-18 07:44:35,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2023-02-18 07:44:35,694 INFO L87 Difference]: Start difference. First operand 99 states and 114 transitions. Second operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 states have internal predecessors, (50), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-18 07:44:36,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 07:44:36,075 INFO L93 Difference]: Finished difference Result 241 states and 292 transitions. [2023-02-18 07:44:36,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-02-18 07:44:36,076 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 states have internal predecessors, (50), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 38 [2023-02-18 07:44:36,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 07:44:36,078 INFO L225 Difference]: With dead ends: 241 [2023-02-18 07:44:36,078 INFO L226 Difference]: Without dead ends: 185 [2023-02-18 07:44:36,078 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 68 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=149, Unknown=0, NotChecked=0, Total=240 [2023-02-18 07:44:36,079 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 148 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-18 07:44:36,079 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 278 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-18 07:44:36,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2023-02-18 07:44:36,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 101. [2023-02-18 07:44:36,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 88 states have (on average 1.1931818181818181) internal successors, (105), 93 states have internal predecessors, (105), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-18 07:44:36,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 113 transitions. [2023-02-18 07:44:36,096 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 113 transitions. Word has length 38 [2023-02-18 07:44:36,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 07:44:36,097 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 113 transitions. [2023-02-18 07:44:36,097 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 states have internal predecessors, (50), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-18 07:44:36,097 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 113 transitions. [2023-02-18 07:44:36,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-02-18 07:44:36,098 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 07:44:36,098 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 07:44:36,110 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2023-02-18 07:44:36,307 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-02-18 07:44:36,308 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-18 07:44:36,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 07:44:36,308 INFO L85 PathProgramCache]: Analyzing trace with hash 729524150, now seen corresponding path program 2 times [2023-02-18 07:44:36,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 07:44:36,309 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2052295793] [2023-02-18 07:44:36,309 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-18 07:44:36,309 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 07:44:36,309 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 07:44:36,312 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-02-18 07:44:36,313 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-02-18 07:44:36,353 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-18 07:44:36,353 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 07:44:36,355 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-18 07:44:36,356 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 07:44:36,425 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 2 proven. 75 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 07:44:36,425 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 07:44:36,563 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 2 proven. 75 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 07:44:36,564 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 07:44:36,564 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2052295793] [2023-02-18 07:44:36,564 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2052295793] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 07:44:36,564 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 07:44:36,564 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 19 [2023-02-18 07:44:36,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240892910] [2023-02-18 07:44:36,564 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 07:44:36,565 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-02-18 07:44:36,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 07:44:36,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-02-18 07:44:36,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=249, Unknown=0, NotChecked=0, Total=342 [2023-02-18 07:44:36,566 INFO L87 Difference]: Start difference. First operand 101 states and 113 transitions. Second operand has 19 states, 19 states have (on average 4.0) internal successors, (76), 17 states have internal predecessors, (76), 1 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-18 07:44:37,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 07:44:37,050 INFO L93 Difference]: Finished difference Result 232 states and 272 transitions. [2023-02-18 07:44:37,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-02-18 07:44:37,051 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 4.0) internal successors, (76), 17 states have internal predecessors, (76), 1 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 46 [2023-02-18 07:44:37,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 07:44:37,054 INFO L225 Difference]: With dead ends: 232 [2023-02-18 07:44:37,054 INFO L226 Difference]: Without dead ends: 176 [2023-02-18 07:44:37,056 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 81 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=383, Invalid=949, Unknown=0, NotChecked=0, Total=1332 [2023-02-18 07:44:37,057 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 223 mSDsluCounter, 780 mSDsCounter, 0 mSdLazyCounter, 307 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 858 SdHoareTripleChecker+Invalid, 330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-18 07:44:37,057 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [223 Valid, 858 Invalid, 330 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 307 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-18 07:44:37,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2023-02-18 07:44:37,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 139. [2023-02-18 07:44:37,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 126 states have (on average 1.1904761904761905) internal successors, (150), 131 states have internal predecessors, (150), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-18 07:44:37,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 158 transitions. [2023-02-18 07:44:37,081 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 158 transitions. Word has length 46 [2023-02-18 07:44:37,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 07:44:37,085 INFO L495 AbstractCegarLoop]: Abstraction has 139 states and 158 transitions. [2023-02-18 07:44:37,085 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 4.0) internal successors, (76), 17 states have internal predecessors, (76), 1 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-18 07:44:37,085 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 158 transitions. [2023-02-18 07:44:37,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-02-18 07:44:37,088 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 07:44:37,089 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 6, 6, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 07:44:37,101 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-02-18 07:44:37,299 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-02-18 07:44:37,301 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting base2fltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-18 07:44:37,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 07:44:37,301 INFO L85 PathProgramCache]: Analyzing trace with hash 1529776548, now seen corresponding path program 2 times [2023-02-18 07:44:37,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 07:44:37,302 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [573186634] [2023-02-18 07:44:37,302 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-18 07:44:37,302 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-02-18 07:44:37,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 07:44:37,304 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-02-18 07:44:37,306 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-02-18 07:44:37,335 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-02-18 07:44:37,336 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 07:44:37,336 INFO L263 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-18 07:44:37,338 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 07:44:37,342 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2023-02-18 07:44:37,343 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 07:44:37,343 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 07:44:37,343 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [573186634] [2023-02-18 07:44:37,343 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [573186634] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 07:44:37,343 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 07:44:37,343 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-18 07:44:37,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388375151] [2023-02-18 07:44:37,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 07:44:37,344 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-18 07:44:37,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 07:44:37,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-18 07:44:37,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-18 07:44:37,345 INFO L87 Difference]: Start difference. First operand 139 states and 158 transitions. Second operand has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-18 07:44:37,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 07:44:37,370 INFO L93 Difference]: Finished difference Result 145 states and 165 transitions. [2023-02-18 07:44:37,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-18 07:44:37,371 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 58 [2023-02-18 07:44:37,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 07:44:37,372 INFO L225 Difference]: With dead ends: 145 [2023-02-18 07:44:37,372 INFO L226 Difference]: Without dead ends: 144 [2023-02-18 07:44:37,373 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-18 07:44:37,373 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 2 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-18 07:44:37,374 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 122 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-18 07:44:37,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2023-02-18 07:44:37,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 138. [2023-02-18 07:44:37,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 126 states have (on average 1.1825396825396826) internal successors, (149), 130 states have internal predecessors, (149), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-18 07:44:37,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 157 transitions. [2023-02-18 07:44:37,385 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 157 transitions. Word has length 58 [2023-02-18 07:44:37,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 07:44:37,386 INFO L495 AbstractCegarLoop]: Abstraction has 138 states and 157 transitions. [2023-02-18 07:44:37,386 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-18 07:44:37,386 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 157 transitions. [2023-02-18 07:44:37,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-02-18 07:44:37,388 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 07:44:37,388 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 6, 6, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 07:44:37,397 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-02-18 07:44:37,596 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-02-18 07:44:37,597 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-18 07:44:37,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 07:44:37,597 INFO L85 PathProgramCache]: Analyzing trace with hash 1529844074, now seen corresponding path program 1 times [2023-02-18 07:44:37,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 07:44:37,598 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [423777482] [2023-02-18 07:44:37,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 07:44:37,598 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-02-18 07:44:37,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 07:44:37,601 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-02-18 07:44:37,614 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-02-18 07:44:37,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:44:37,662 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 9 conjunts are in the unsatisfiable core [2023-02-18 07:44:37,663 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 07:44:37,773 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 9 proven. 87 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-18 07:44:37,773 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 07:44:38,053 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 9 proven. 87 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-18 07:44:38,054 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 07:44:38,054 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [423777482] [2023-02-18 07:44:38,054 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [423777482] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 07:44:38,054 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 07:44:38,054 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2023-02-18 07:44:38,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559649506] [2023-02-18 07:44:38,054 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 07:44:38,055 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-02-18 07:44:38,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 07:44:38,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-02-18 07:44:38,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=209, Unknown=0, NotChecked=0, Total=306 [2023-02-18 07:44:38,055 INFO L87 Difference]: Start difference. First operand 138 states and 157 transitions. Second operand has 18 states, 18 states have (on average 5.0) internal successors, (90), 18 states have internal predecessors, (90), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-18 07:44:39,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 07:44:39,409 INFO L93 Difference]: Finished difference Result 382 states and 469 transitions. [2023-02-18 07:44:39,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-02-18 07:44:39,410 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 5.0) internal successors, (90), 18 states have internal predecessors, (90), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 58 [2023-02-18 07:44:39,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 07:44:39,411 INFO L225 Difference]: With dead ends: 382 [2023-02-18 07:44:39,411 INFO L226 Difference]: Without dead ends: 327 [2023-02-18 07:44:39,412 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 109 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=343, Invalid=649, Unknown=0, NotChecked=0, Total=992 [2023-02-18 07:44:39,413 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 326 mSDsluCounter, 658 mSDsCounter, 0 mSdLazyCounter, 662 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 326 SdHoareTripleChecker+Valid, 750 SdHoareTripleChecker+Invalid, 693 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 662 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-02-18 07:44:39,413 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [326 Valid, 750 Invalid, 693 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 662 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-02-18 07:44:39,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2023-02-18 07:44:39,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 140. [2023-02-18 07:44:39,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 128 states have (on average 1.125) internal successors, (144), 132 states have internal predecessors, (144), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-18 07:44:39,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 152 transitions. [2023-02-18 07:44:39,436 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 152 transitions. Word has length 58 [2023-02-18 07:44:39,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 07:44:39,436 INFO L495 AbstractCegarLoop]: Abstraction has 140 states and 152 transitions. [2023-02-18 07:44:39,436 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 5.0) internal successors, (90), 18 states have internal predecessors, (90), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-18 07:44:39,437 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 152 transitions. [2023-02-18 07:44:39,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2023-02-18 07:44:39,438 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 07:44:39,438 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 14, 13, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 07:44:39,447 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-02-18 07:44:39,646 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-02-18 07:44:39,647 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-18 07:44:39,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 07:44:39,647 INFO L85 PathProgramCache]: Analyzing trace with hash -1277203274, now seen corresponding path program 3 times [2023-02-18 07:44:39,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 07:44:39,648 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2076984947] [2023-02-18 07:44:39,648 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-18 07:44:39,648 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-02-18 07:44:39,648 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 07:44:39,649 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-02-18 07:44:39,651 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-02-18 07:44:39,711 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2023-02-18 07:44:39,711 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 07:44:39,713 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 18 conjunts are in the unsatisfiable core [2023-02-18 07:44:39,715 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 07:44:39,886 INFO L134 CoverageAnalysis]: Checked inductivity of 457 backedges. 2 proven. 455 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 07:44:39,886 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 07:44:40,386 INFO L134 CoverageAnalysis]: Checked inductivity of 457 backedges. 2 proven. 455 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 07:44:40,387 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 07:44:40,387 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2076984947] [2023-02-18 07:44:40,387 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2076984947] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 07:44:40,387 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 07:44:40,387 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 19] total 35 [2023-02-18 07:44:40,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082677184] [2023-02-18 07:44:40,387 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 07:44:40,387 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2023-02-18 07:44:40,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 07:44:40,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2023-02-18 07:44:40,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=304, Invalid=886, Unknown=0, NotChecked=0, Total=1190 [2023-02-18 07:44:40,389 INFO L87 Difference]: Start difference. First operand 140 states and 152 transitions. Second operand has 35 states, 35 states have (on average 4.457142857142857) internal successors, (156), 33 states have internal predecessors, (156), 1 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-18 07:44:43,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 07:44:43,796 INFO L93 Difference]: Finished difference Result 485 states and 585 transitions. [2023-02-18 07:44:43,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2023-02-18 07:44:43,796 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 4.457142857142857) internal successors, (156), 33 states have internal predecessors, (156), 1 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 86 [2023-02-18 07:44:43,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 07:44:43,801 INFO L225 Difference]: With dead ends: 485 [2023-02-18 07:44:43,801 INFO L226 Difference]: Without dead ends: 430 [2023-02-18 07:44:43,805 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 171 SyntacticMatches, 1 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2296 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=2711, Invalid=7189, Unknown=0, NotChecked=0, Total=9900 [2023-02-18 07:44:43,806 INFO L413 NwaCegarLoop]: 179 mSDtfsCounter, 894 mSDsluCounter, 2632 mSDsCounter, 0 mSdLazyCounter, 1619 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 894 SdHoareTripleChecker+Valid, 2811 SdHoareTripleChecker+Invalid, 1686 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 1619 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-02-18 07:44:43,806 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [894 Valid, 2811 Invalid, 1686 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 1619 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-02-18 07:44:43,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states. [2023-02-18 07:44:43,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 218. [2023-02-18 07:44:43,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 206 states have (on average 1.1553398058252426) internal successors, (238), 210 states have internal predecessors, (238), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-18 07:44:43,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 246 transitions. [2023-02-18 07:44:43,835 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 246 transitions. Word has length 86 [2023-02-18 07:44:43,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 07:44:43,836 INFO L495 AbstractCegarLoop]: Abstraction has 218 states and 246 transitions. [2023-02-18 07:44:43,836 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 4.457142857142857) internal successors, (156), 33 states have internal predecessors, (156), 1 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-18 07:44:43,837 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 246 transitions. [2023-02-18 07:44:43,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2023-02-18 07:44:43,838 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 07:44:43,838 INFO L195 NwaCegarLoop]: trace histogram [15, 14, 14, 14, 14, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 07:44:43,852 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-02-18 07:44:44,050 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-02-18 07:44:44,050 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-18 07:44:44,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 07:44:44,051 INFO L85 PathProgramCache]: Analyzing trace with hash 991155818, now seen corresponding path program 2 times [2023-02-18 07:44:44,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 07:44:44,051 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1765246826] [2023-02-18 07:44:44,052 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-18 07:44:44,052 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-02-18 07:44:44,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 07:44:44,053 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-02-18 07:44:44,060 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-02-18 07:44:44,111 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-18 07:44:44,112 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 07:44:44,114 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 17 conjunts are in the unsatisfiable core [2023-02-18 07:44:44,118 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 07:44:44,423 INFO L134 CoverageAnalysis]: Checked inductivity of 493 backedges. 9 proven. 483 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-18 07:44:44,424 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 07:44:45,280 INFO L134 CoverageAnalysis]: Checked inductivity of 493 backedges. 9 proven. 483 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-18 07:44:45,280 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 07:44:45,280 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1765246826] [2023-02-18 07:44:45,280 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1765246826] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 07:44:45,280 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 07:44:45,281 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 34 [2023-02-18 07:44:45,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041285622] [2023-02-18 07:44:45,281 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 07:44:45,281 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-02-18 07:44:45,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 07:44:45,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-02-18 07:44:45,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=321, Invalid=801, Unknown=0, NotChecked=0, Total=1122 [2023-02-18 07:44:45,282 INFO L87 Difference]: Start difference. First operand 218 states and 246 transitions. Second operand has 34 states, 34 states have (on average 5.0) internal successors, (170), 34 states have internal predecessors, (170), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-18 07:44:50,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 07:44:50,530 INFO L93 Difference]: Finished difference Result 676 states and 837 transitions. [2023-02-18 07:44:50,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2023-02-18 07:44:50,533 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 5.0) internal successors, (170), 34 states have internal predecessors, (170), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 98 [2023-02-18 07:44:50,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 07:44:50,536 INFO L225 Difference]: With dead ends: 676 [2023-02-18 07:44:50,536 INFO L226 Difference]: Without dead ends: 621 [2023-02-18 07:44:50,537 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 188 SyntacticMatches, 3 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 245 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=1327, Invalid=2705, Unknown=0, NotChecked=0, Total=4032 [2023-02-18 07:44:50,538 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 906 mSDsluCounter, 2179 mSDsCounter, 0 mSdLazyCounter, 2584 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 906 SdHoareTripleChecker+Valid, 2315 SdHoareTripleChecker+Invalid, 2656 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 2584 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2023-02-18 07:44:50,538 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [906 Valid, 2315 Invalid, 2656 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 2584 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2023-02-18 07:44:50,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 621 states. [2023-02-18 07:44:50,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 621 to 220. [2023-02-18 07:44:50,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 208 states have (on average 1.0817307692307692) internal successors, (225), 212 states have internal predecessors, (225), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-18 07:44:50,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 233 transitions. [2023-02-18 07:44:50,572 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 233 transitions. Word has length 98 [2023-02-18 07:44:50,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 07:44:50,573 INFO L495 AbstractCegarLoop]: Abstraction has 220 states and 233 transitions. [2023-02-18 07:44:50,573 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 5.0) internal successors, (170), 34 states have internal predecessors, (170), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-18 07:44:50,573 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 233 transitions. [2023-02-18 07:44:50,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2023-02-18 07:44:50,574 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 07:44:50,574 INFO L195 NwaCegarLoop]: trace histogram [24, 24, 24, 24, 23, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 07:44:50,586 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-02-18 07:44:50,783 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-02-18 07:44:50,784 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-18 07:44:50,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 07:44:50,784 INFO L85 PathProgramCache]: Analyzing trace with hash 634551030, now seen corresponding path program 4 times [2023-02-18 07:44:50,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 07:44:50,784 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1137642031] [2023-02-18 07:44:50,784 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-02-18 07:44:50,785 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-02-18 07:44:50,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 07:44:50,786 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-02-18 07:44:50,786 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-02-18 07:44:50,841 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-02-18 07:44:50,841 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 07:44:50,843 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 27 conjunts are in the unsatisfiable core [2023-02-18 07:44:50,845 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 07:44:51,185 INFO L134 CoverageAnalysis]: Checked inductivity of 1382 backedges. 2 proven. 1380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 07:44:51,185 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 07:44:53,228 INFO L134 CoverageAnalysis]: Checked inductivity of 1382 backedges. 2 proven. 1380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-18 07:44:53,229 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 07:44:53,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1137642031] [2023-02-18 07:44:53,229 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1137642031] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 07:44:53,229 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 07:44:53,229 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 53 [2023-02-18 07:44:53,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603605439] [2023-02-18 07:44:53,229 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 07:44:53,230 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2023-02-18 07:44:53,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 07:44:53,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2023-02-18 07:44:53,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=731, Invalid=2131, Unknown=0, NotChecked=0, Total=2862 [2023-02-18 07:44:53,232 INFO L87 Difference]: Start difference. First operand 220 states and 233 transitions. Second operand has 54 states, 53 states have (on average 4.886792452830188) internal successors, (259), 52 states have internal predecessors, (259), 1 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-18 07:45:18,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 07:45:18,580 INFO L93 Difference]: Finished difference Result 456 states and 523 transitions. [2023-02-18 07:45:18,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2023-02-18 07:45:18,584 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 53 states have (on average 4.886792452830188) internal successors, (259), 52 states have internal predecessors, (259), 1 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 136 [2023-02-18 07:45:18,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 07:45:18,586 INFO L225 Difference]: With dead ends: 456 [2023-02-18 07:45:18,586 INFO L226 Difference]: Without dead ends: 455 [2023-02-18 07:45:18,590 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 353 GetRequests, 224 SyntacticMatches, 1 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2112 ImplicationChecksByTransitivity, 22.0s TimeCoverageRelationStatistics Valid=4535, Invalid=12235, Unknown=0, NotChecked=0, Total=16770 [2023-02-18 07:45:18,591 INFO L413 NwaCegarLoop]: 101 mSDtfsCounter, 771 mSDsluCounter, 3966 mSDsCounter, 0 mSdLazyCounter, 3996 mSolverCounterSat, 149 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 771 SdHoareTripleChecker+Valid, 4067 SdHoareTripleChecker+Invalid, 4145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 149 IncrementalHoareTripleChecker+Valid, 3996 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.4s IncrementalHoareTripleChecker+Time [2023-02-18 07:45:18,591 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [771 Valid, 4067 Invalid, 4145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [149 Valid, 3996 Invalid, 0 Unknown, 0 Unchecked, 5.4s Time] [2023-02-18 07:45:18,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2023-02-18 07:45:18,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 338. [2023-02-18 07:45:18,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 338 states, 326 states have (on average 1.1901840490797546) internal successors, (388), 330 states have internal predecessors, (388), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-18 07:45:18,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 396 transitions. [2023-02-18 07:45:18,649 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 396 transitions. Word has length 136 [2023-02-18 07:45:18,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 07:45:18,649 INFO L495 AbstractCegarLoop]: Abstraction has 338 states and 396 transitions. [2023-02-18 07:45:18,650 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 53 states have (on average 4.886792452830188) internal successors, (259), 52 states have internal predecessors, (259), 1 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-18 07:45:18,650 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 396 transitions. [2023-02-18 07:45:18,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2023-02-18 07:45:18,651 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 07:45:18,651 INFO L195 NwaCegarLoop]: trace histogram [24, 24, 24, 24, 23, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 07:45:18,660 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-02-18 07:45:18,858 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-02-18 07:45:18,858 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-18 07:45:18,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 07:45:18,859 INFO L85 PathProgramCache]: Analyzing trace with hash 1706633891, now seen corresponding path program 1 times [2023-02-18 07:45:18,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 07:45:18,859 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1863206215] [2023-02-18 07:45:18,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 07:45:18,859 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-02-18 07:45:18,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 07:45:18,860 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-02-18 07:45:18,862 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-02-18 07:45:18,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:45:18,922 INFO L263 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-18 07:45:18,923 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 07:45:18,956 INFO L134 CoverageAnalysis]: Checked inductivity of 1393 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1385 trivial. 0 not checked. [2023-02-18 07:45:18,956 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 07:45:18,956 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 07:45:18,956 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1863206215] [2023-02-18 07:45:18,956 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1863206215] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 07:45:18,956 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 07:45:18,958 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-18 07:45:18,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431007857] [2023-02-18 07:45:18,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 07:45:18,959 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-18 07:45:18,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 07:45:18,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-18 07:45:18,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-18 07:45:18,960 INFO L87 Difference]: Start difference. First operand 338 states and 396 transitions. Second operand has 4 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-18 07:45:19,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 07:45:19,379 INFO L93 Difference]: Finished difference Result 350 states and 411 transitions. [2023-02-18 07:45:19,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-18 07:45:19,381 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 149 [2023-02-18 07:45:19,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 07:45:19,383 INFO L225 Difference]: With dead ends: 350 [2023-02-18 07:45:19,383 INFO L226 Difference]: Without dead ends: 349 [2023-02-18 07:45:19,383 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 147 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-02-18 07:45:19,384 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 52 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-18 07:45:19,384 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 130 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-18 07:45:19,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2023-02-18 07:45:19,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 340. [2023-02-18 07:45:19,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 340 states, 328 states have (on average 1.1920731707317074) internal successors, (391), 332 states have internal predecessors, (391), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-18 07:45:19,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 399 transitions. [2023-02-18 07:45:19,450 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 399 transitions. Word has length 149 [2023-02-18 07:45:19,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 07:45:19,450 INFO L495 AbstractCegarLoop]: Abstraction has 340 states and 399 transitions. [2023-02-18 07:45:19,451 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-18 07:45:19,451 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 399 transitions. [2023-02-18 07:45:19,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2023-02-18 07:45:19,452 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 07:45:19,452 INFO L195 NwaCegarLoop]: trace histogram [25, 25, 25, 25, 23, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 07:45:19,468 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-02-18 07:45:19,661 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-02-18 07:45:19,662 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-18 07:45:19,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 07:45:19,662 INFO L85 PathProgramCache]: Analyzing trace with hash -1650863767, now seen corresponding path program 1 times [2023-02-18 07:45:19,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 07:45:19,663 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [983031338] [2023-02-18 07:45:19,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 07:45:19,663 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 07:45:19,663 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 07:45:19,664 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-02-18 07:45:19,667 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-02-18 07:45:19,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:45:19,743 INFO L263 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-18 07:45:19,745 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 07:45:20,294 INFO L134 CoverageAnalysis]: Checked inductivity of 1513 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 1385 trivial. 0 not checked. [2023-02-18 07:45:20,294 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 07:45:20,295 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 07:45:20,295 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [983031338] [2023-02-18 07:45:20,295 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [983031338] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 07:45:20,295 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 07:45:20,295 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-18 07:45:20,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636616897] [2023-02-18 07:45:20,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 07:45:20,295 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-18 07:45:20,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 07:45:20,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-18 07:45:20,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-02-18 07:45:20,296 INFO L87 Difference]: Start difference. First operand 340 states and 399 transitions. Second operand has 6 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-18 07:45:22,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 07:45:22,038 INFO L93 Difference]: Finished difference Result 355 states and 418 transitions. [2023-02-18 07:45:22,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-18 07:45:22,038 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 152 [2023-02-18 07:45:22,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 07:45:22,040 INFO L225 Difference]: With dead ends: 355 [2023-02-18 07:45:22,040 INFO L226 Difference]: Without dead ends: 354 [2023-02-18 07:45:22,040 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 150 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2023-02-18 07:45:22,041 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 56 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-02-18 07:45:22,041 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 195 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2023-02-18 07:45:22,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2023-02-18 07:45:22,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 219. [2023-02-18 07:45:22,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 208 states have (on average 1.0721153846153846) internal successors, (223), 211 states have internal predecessors, (223), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-18 07:45:22,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 231 transitions. [2023-02-18 07:45:22,071 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 231 transitions. Word has length 152 [2023-02-18 07:45:22,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 07:45:22,072 INFO L495 AbstractCegarLoop]: Abstraction has 219 states and 231 transitions. [2023-02-18 07:45:22,072 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-18 07:45:22,072 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 231 transitions. [2023-02-18 07:45:22,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2023-02-18 07:45:22,073 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 07:45:22,074 INFO L195 NwaCegarLoop]: trace histogram [24, 24, 24, 24, 23, 4, 4, 4, 3, 1, 1, 1, 1, 1, 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-02-18 07:45:22,092 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2023-02-18 07:45:22,285 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-02-18 07:45:22,285 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-18 07:45:22,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 07:45:22,286 INFO L85 PathProgramCache]: Analyzing trace with hash 1043871996, now seen corresponding path program 1 times [2023-02-18 07:45:22,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 07:45:22,286 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [881056058] [2023-02-18 07:45:22,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 07:45:22,286 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-02-18 07:45:22,287 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 07:45:22,288 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-02-18 07:45:22,291 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-02-18 07:45:22,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:45:22,369 INFO L263 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-18 07:45:22,371 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 07:45:22,390 INFO L134 CoverageAnalysis]: Checked inductivity of 1410 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1401 trivial. 0 not checked. [2023-02-18 07:45:22,391 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 07:45:22,402 INFO L134 CoverageAnalysis]: Checked inductivity of 1410 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1401 trivial. 0 not checked. [2023-02-18 07:45:22,403 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 07:45:22,403 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [881056058] [2023-02-18 07:45:22,403 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [881056058] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 07:45:22,403 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 07:45:22,403 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2023-02-18 07:45:22,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196891653] [2023-02-18 07:45:22,404 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 07:45:22,404 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-18 07:45:22,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 07:45:22,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-18 07:45:22,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-18 07:45:22,405 INFO L87 Difference]: Start difference. First operand 219 states and 231 transitions. Second operand has 6 states, 6 states have (on average 5.5) internal successors, (33), 5 states have internal predecessors, (33), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-18 07:45:22,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 07:45:22,472 INFO L93 Difference]: Finished difference Result 246 states and 259 transitions. [2023-02-18 07:45:22,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-18 07:45:22,472 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 5 states have internal predecessors, (33), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 163 [2023-02-18 07:45:22,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 07:45:22,474 INFO L225 Difference]: With dead ends: 246 [2023-02-18 07:45:22,474 INFO L226 Difference]: Without dead ends: 225 [2023-02-18 07:45:22,474 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 325 GetRequests, 320 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-02-18 07:45:22,475 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 27 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-18 07:45:22,475 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 254 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-18 07:45:22,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2023-02-18 07:45:22,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 219. [2023-02-18 07:45:22,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 208 states have (on average 1.0673076923076923) internal successors, (222), 211 states have internal predecessors, (222), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-18 07:45:22,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 230 transitions. [2023-02-18 07:45:22,509 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 230 transitions. Word has length 163 [2023-02-18 07:45:22,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 07:45:22,509 INFO L495 AbstractCegarLoop]: Abstraction has 219 states and 230 transitions. [2023-02-18 07:45:22,510 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 5 states have internal predecessors, (33), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-18 07:45:22,510 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 230 transitions. [2023-02-18 07:45:22,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2023-02-18 07:45:22,511 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 07:45:22,511 INFO L195 NwaCegarLoop]: trace histogram [24, 24, 24, 24, 23, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 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-02-18 07:45:22,528 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-02-18 07:45:22,721 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 07:45:22,721 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-18 07:45:22,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 07:45:22,722 INFO L85 PathProgramCache]: Analyzing trace with hash -1928351454, now seen corresponding path program 1 times [2023-02-18 07:45:22,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 07:45:22,722 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [903513938] [2023-02-18 07:45:22,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 07:45:22,722 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-02-18 07:45:22,723 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 07:45:22,724 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-18 07:45:22,725 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2023-02-18 07:45:22,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:45:22,803 INFO L263 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-18 07:45:22,806 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 07:45:22,830 INFO L134 CoverageAnalysis]: Checked inductivity of 1410 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 1401 trivial. 0 not checked. [2023-02-18 07:45:22,830 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 07:45:22,831 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 07:45:22,831 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [903513938] [2023-02-18 07:45:22,831 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [903513938] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 07:45:22,832 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 07:45:22,832 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-18 07:45:22,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869589256] [2023-02-18 07:45:22,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 07:45:22,833 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-18 07:45:22,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 07:45:22,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-18 07:45:22,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-18 07:45:22,834 INFO L87 Difference]: Start difference. First operand 219 states and 230 transitions. Second operand has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2023-02-18 07:45:22,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 07:45:22,907 INFO L93 Difference]: Finished difference Result 272 states and 285 transitions. [2023-02-18 07:45:22,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-18 07:45:22,907 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 165 [2023-02-18 07:45:22,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 07:45:22,909 INFO L225 Difference]: With dead ends: 272 [2023-02-18 07:45:22,909 INFO L226 Difference]: Without dead ends: 250 [2023-02-18 07:45:22,909 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-02-18 07:45:22,910 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 25 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-18 07:45:22,911 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 283 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-18 07:45:22,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2023-02-18 07:45:22,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 225. [2023-02-18 07:45:22,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 213 states have (on average 1.0657276995305165) internal successors, (227), 216 states have internal predecessors, (227), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2023-02-18 07:45:22,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 237 transitions. [2023-02-18 07:45:22,951 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 237 transitions. Word has length 165 [2023-02-18 07:45:22,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 07:45:22,951 INFO L495 AbstractCegarLoop]: Abstraction has 225 states and 237 transitions. [2023-02-18 07:45:22,952 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2023-02-18 07:45:22,952 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 237 transitions. [2023-02-18 07:45:22,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2023-02-18 07:45:22,953 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 07:45:22,953 INFO L195 NwaCegarLoop]: trace histogram [24, 24, 24, 24, 23, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 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-02-18 07:45:22,968 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2023-02-18 07:45:23,163 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 07:45:23,163 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-18 07:45:23,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 07:45:23,164 INFO L85 PathProgramCache]: Analyzing trace with hash 1973588832, now seen corresponding path program 1 times [2023-02-18 07:45:23,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 07:45:23,165 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [244253302] [2023-02-18 07:45:23,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 07:45:23,165 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-02-18 07:45:23,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 07:45:23,166 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-02-18 07:45:23,171 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-02-18 07:45:23,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:45:23,251 INFO L263 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 7 conjunts are in the unsatisfiable core [2023-02-18 07:45:23,253 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 07:45:23,276 INFO L134 CoverageAnalysis]: Checked inductivity of 1410 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 1401 trivial. 0 not checked. [2023-02-18 07:45:23,276 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 07:45:23,276 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 07:45:23,276 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [244253302] [2023-02-18 07:45:23,276 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [244253302] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 07:45:23,277 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 07:45:23,277 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-18 07:45:23,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193271843] [2023-02-18 07:45:23,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 07:45:23,277 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-18 07:45:23,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 07:45:23,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-18 07:45:23,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-02-18 07:45:23,278 INFO L87 Difference]: Start difference. First operand 225 states and 237 transitions. Second operand has 7 states, 7 states have (on average 5.0) internal successors, (35), 6 states have internal predecessors, (35), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2023-02-18 07:45:23,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 07:45:23,364 INFO L93 Difference]: Finished difference Result 251 states and 263 transitions. [2023-02-18 07:45:23,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-18 07:45:23,364 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 6 states have internal predecessors, (35), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 165 [2023-02-18 07:45:23,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 07:45:23,366 INFO L225 Difference]: With dead ends: 251 [2023-02-18 07:45:23,366 INFO L226 Difference]: Without dead ends: 225 [2023-02-18 07:45:23,366 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-02-18 07:45:23,367 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 5 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-18 07:45:23,367 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 332 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-18 07:45:23,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2023-02-18 07:45:23,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 222. [2023-02-18 07:45:23,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 210 states have (on average 1.0666666666666667) internal successors, (224), 214 states have internal predecessors, (224), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2023-02-18 07:45:23,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 233 transitions. [2023-02-18 07:45:23,400 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 233 transitions. Word has length 165 [2023-02-18 07:45:23,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 07:45:23,400 INFO L495 AbstractCegarLoop]: Abstraction has 222 states and 233 transitions. [2023-02-18 07:45:23,400 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 6 states have internal predecessors, (35), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2023-02-18 07:45:23,400 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 233 transitions. [2023-02-18 07:45:23,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2023-02-18 07:45:23,402 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 07:45:23,402 INFO L195 NwaCegarLoop]: trace histogram [24, 24, 24, 24, 23, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 07:45:23,412 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-02-18 07:45:23,612 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-02-18 07:45:23,612 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-18 07:45:23,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 07:45:23,612 INFO L85 PathProgramCache]: Analyzing trace with hash 1102920081, now seen corresponding path program 1 times [2023-02-18 07:45:23,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 07:45:23,613 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1927478131] [2023-02-18 07:45:23,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 07:45:23,613 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-02-18 07:45:23,613 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 07:45:23,614 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-02-18 07:45:23,620 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-02-18 07:45:23,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:45:23,690 INFO L263 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 9 conjunts are in the unsatisfiable core [2023-02-18 07:45:23,692 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 07:45:23,721 INFO L134 CoverageAnalysis]: Checked inductivity of 1411 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 1402 trivial. 0 not checked. [2023-02-18 07:45:23,721 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 07:45:23,731 INFO L134 CoverageAnalysis]: Checked inductivity of 1411 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 1402 trivial. 0 not checked. [2023-02-18 07:45:23,731 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 07:45:23,731 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1927478131] [2023-02-18 07:45:23,731 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1927478131] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-18 07:45:23,732 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-18 07:45:23,732 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2023-02-18 07:45:23,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198251562] [2023-02-18 07:45:23,732 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-18 07:45:23,734 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-18 07:45:23,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 07:45:23,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-18 07:45:23,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-02-18 07:45:23,735 INFO L87 Difference]: Start difference. First operand 222 states and 233 transitions. Second operand has 8 states, 8 states have (on average 4.875) internal successors, (39), 7 states have internal predecessors, (39), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-18 07:45:23,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 07:45:23,823 INFO L93 Difference]: Finished difference Result 253 states and 266 transitions. [2023-02-18 07:45:23,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-18 07:45:23,824 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.875) internal successors, (39), 7 states have internal predecessors, (39), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 169 [2023-02-18 07:45:23,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 07:45:23,825 INFO L225 Difference]: With dead ends: 253 [2023-02-18 07:45:23,825 INFO L226 Difference]: Without dead ends: 222 [2023-02-18 07:45:23,825 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 340 GetRequests, 330 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2023-02-18 07:45:23,826 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 7 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 404 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-18 07:45:23,826 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 404 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-18 07:45:23,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2023-02-18 07:45:23,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 219. [2023-02-18 07:45:23,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 208 states have (on average 1.0576923076923077) internal successors, (220), 211 states have internal predecessors, (220), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-18 07:45:23,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 228 transitions. [2023-02-18 07:45:23,856 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 228 transitions. Word has length 169 [2023-02-18 07:45:23,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 07:45:23,856 INFO L495 AbstractCegarLoop]: Abstraction has 219 states and 228 transitions. [2023-02-18 07:45:23,856 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.875) internal successors, (39), 7 states have internal predecessors, (39), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-18 07:45:23,856 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 228 transitions. [2023-02-18 07:45:23,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2023-02-18 07:45:23,858 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 07:45:23,858 INFO L195 NwaCegarLoop]: trace histogram [24, 24, 24, 24, 23, 4, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 07:45:23,869 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-02-18 07:45:24,067 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-02-18 07:45:24,068 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-18 07:45:24,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 07:45:24,068 INFO L85 PathProgramCache]: Analyzing trace with hash 2085518786, now seen corresponding path program 2 times [2023-02-18 07:45:24,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 07:45:24,069 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2123399903] [2023-02-18 07:45:24,069 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-18 07:45:24,069 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-02-18 07:45:24,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 07:45:24,070 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-02-18 07:45:24,071 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-02-18 07:45:24,105 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-02-18 07:45:24,105 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-18 07:45:24,106 INFO L263 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-18 07:45:24,113 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 07:45:24,134 INFO L134 CoverageAnalysis]: Checked inductivity of 1416 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1416 trivial. 0 not checked. [2023-02-18 07:45:24,134 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 07:45:24,134 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 07:45:24,134 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2123399903] [2023-02-18 07:45:24,134 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2123399903] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 07:45:24,135 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 07:45:24,135 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-18 07:45:24,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863338035] [2023-02-18 07:45:24,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 07:45:24,136 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-18 07:45:24,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 07:45:24,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-18 07:45:24,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-02-18 07:45:24,136 INFO L87 Difference]: Start difference. First operand 219 states and 228 transitions. Second operand has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-02-18 07:45:24,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 07:45:24,270 INFO L93 Difference]: Finished difference Result 219 states and 228 transitions. [2023-02-18 07:45:24,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-18 07:45:24,271 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 173 [2023-02-18 07:45:24,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 07:45:24,272 INFO L225 Difference]: With dead ends: 219 [2023-02-18 07:45:24,272 INFO L226 Difference]: Without dead ends: 217 [2023-02-18 07:45:24,272 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-02-18 07:45:24,273 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 2 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 07:45:24,273 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 107 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 07:45:24,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2023-02-18 07:45:24,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 217. [2023-02-18 07:45:24,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 208 states have (on average 1.0480769230769231) internal successors, (218), 209 states have internal predecessors, (218), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-18 07:45:24,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 226 transitions. [2023-02-18 07:45:24,309 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 226 transitions. Word has length 173 [2023-02-18 07:45:24,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 07:45:24,309 INFO L495 AbstractCegarLoop]: Abstraction has 217 states and 226 transitions. [2023-02-18 07:45:24,309 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-02-18 07:45:24,309 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 226 transitions. [2023-02-18 07:45:24,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2023-02-18 07:45:24,311 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 07:45:24,311 INFO L195 NwaCegarLoop]: trace histogram [24, 24, 24, 24, 23, 4, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 07:45:24,322 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-02-18 07:45:24,520 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-02-18 07:45:24,520 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-18 07:45:24,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 07:45:24,520 INFO L85 PathProgramCache]: Analyzing trace with hash -1306599208, now seen corresponding path program 1 times [2023-02-18 07:45:24,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 07:45:24,521 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1196579370] [2023-02-18 07:45:24,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 07:45:24,521 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-02-18 07:45:24,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 07:45:24,522 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-02-18 07:45:24,524 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-02-18 07:45:24,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:45:24,595 INFO L263 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 13 conjunts are in the unsatisfiable core [2023-02-18 07:45:24,597 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 07:45:24,637 INFO L134 CoverageAnalysis]: Checked inductivity of 1416 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2023-02-18 07:45:24,638 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 07:45:24,638 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 07:45:24,638 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1196579370] [2023-02-18 07:45:24,638 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1196579370] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 07:45:24,638 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 07:45:24,639 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-02-18 07:45:24,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152223193] [2023-02-18 07:45:24,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 07:45:24,639 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-02-18 07:45:24,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 07:45:24,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-02-18 07:45:24,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-02-18 07:45:24,640 INFO L87 Difference]: Start difference. First operand 217 states and 226 transitions. Second operand has 9 states, 8 states have (on average 5.125) internal successors, (41), 7 states have internal predecessors, (41), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-18 07:45:24,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 07:45:24,765 INFO L93 Difference]: Finished difference Result 285 states and 298 transitions. [2023-02-18 07:45:24,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-18 07:45:24,766 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.125) internal successors, (41), 7 states have internal predecessors, (41), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 176 [2023-02-18 07:45:24,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 07:45:24,767 INFO L225 Difference]: With dead ends: 285 [2023-02-18 07:45:24,767 INFO L226 Difference]: Without dead ends: 268 [2023-02-18 07:45:24,768 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2023-02-18 07:45:24,768 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 81 mSDsluCounter, 369 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 444 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 07:45:24,769 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 444 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 07:45:24,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2023-02-18 07:45:24,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 228. [2023-02-18 07:45:24,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 217 states have (on average 1.0506912442396312) internal successors, (228), 218 states have internal predecessors, (228), 5 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (8), 6 states have call predecessors, (8), 5 states have call successors, (8) [2023-02-18 07:45:24,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 241 transitions. [2023-02-18 07:45:24,800 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 241 transitions. Word has length 176 [2023-02-18 07:45:24,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 07:45:24,801 INFO L495 AbstractCegarLoop]: Abstraction has 228 states and 241 transitions. [2023-02-18 07:45:24,801 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.125) internal successors, (41), 7 states have internal predecessors, (41), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-18 07:45:24,801 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 241 transitions. [2023-02-18 07:45:24,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2023-02-18 07:45:24,803 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 07:45:24,803 INFO L195 NwaCegarLoop]: trace histogram [24, 24, 24, 24, 23, 4, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 07:45:24,815 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-02-18 07:45:25,012 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 07:45:25,013 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-18 07:45:25,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 07:45:25,013 INFO L85 PathProgramCache]: Analyzing trace with hash -1699626218, now seen corresponding path program 1 times [2023-02-18 07:45:25,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 07:45:25,013 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [185785106] [2023-02-18 07:45:25,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 07:45:25,014 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-02-18 07:45:25,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 07:45:25,015 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-18 07:45:25,016 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2023-02-18 07:45:25,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:45:25,082 INFO L263 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 16 conjunts are in the unsatisfiable core [2023-02-18 07:45:25,085 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 07:45:25,157 INFO L134 CoverageAnalysis]: Checked inductivity of 1416 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2023-02-18 07:45:25,158 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-18 07:45:25,158 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 07:45:25,158 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [185785106] [2023-02-18 07:45:25,158 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [185785106] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-18 07:45:25,158 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-18 07:45:25,158 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-02-18 07:45:25,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589853481] [2023-02-18 07:45:25,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 07:45:25,159 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-18 07:45:25,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 07:45:25,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-18 07:45:25,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2023-02-18 07:45:25,160 INFO L87 Difference]: Start difference. First operand 228 states and 241 transitions. Second operand has 12 states, 10 states have (on average 4.1) internal successors, (41), 10 states have internal predecessors, (41), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-18 07:45:25,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 07:45:25,440 INFO L93 Difference]: Finished difference Result 268 states and 281 transitions. [2023-02-18 07:45:25,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-02-18 07:45:25,441 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 4.1) internal successors, (41), 10 states have internal predecessors, (41), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 176 [2023-02-18 07:45:25,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 07:45:25,442 INFO L225 Difference]: With dead ends: 268 [2023-02-18 07:45:25,442 INFO L226 Difference]: Without dead ends: 267 [2023-02-18 07:45:25,442 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2023-02-18 07:45:25,443 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 77 mSDsluCounter, 562 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 633 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-18 07:45:25,443 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 633 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 243 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-18 07:45:25,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2023-02-18 07:45:25,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 237. [2023-02-18 07:45:25,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 226 states have (on average 1.0486725663716814) internal successors, (237), 227 states have internal predecessors, (237), 5 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (8), 6 states have call predecessors, (8), 5 states have call successors, (8) [2023-02-18 07:45:25,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 250 transitions. [2023-02-18 07:45:25,476 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 250 transitions. Word has length 176 [2023-02-18 07:45:25,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 07:45:25,476 INFO L495 AbstractCegarLoop]: Abstraction has 237 states and 250 transitions. [2023-02-18 07:45:25,477 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 4.1) internal successors, (41), 10 states have internal predecessors, (41), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-18 07:45:25,477 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 250 transitions. [2023-02-18 07:45:25,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2023-02-18 07:45:25,478 INFO L187 NwaCegarLoop]: Found error trace [2023-02-18 07:45:25,478 INFO L195 NwaCegarLoop]: trace histogram [24, 24, 24, 24, 23, 4, 4, 4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 07:45:25,491 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Forceful destruction successful, exit code 0 [2023-02-18 07:45:25,688 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-18 07:45:25,688 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2023-02-18 07:45:25,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-18 07:45:25,689 INFO L85 PathProgramCache]: Analyzing trace with hash -66785534, now seen corresponding path program 1 times [2023-02-18 07:45:25,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-18 07:45:25,689 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [475772935] [2023-02-18 07:45:25,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-18 07:45:25,689 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-02-18 07:45:25,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-18 07:45:25,690 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-02-18 07:45:25,693 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-02-18 07:45:25,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-18 07:45:25,775 INFO L263 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 14 conjunts are in the unsatisfiable core [2023-02-18 07:45:25,778 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-18 07:45:25,800 INFO L134 CoverageAnalysis]: Checked inductivity of 1418 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 1409 trivial. 0 not checked. [2023-02-18 07:45:25,801 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-18 07:45:25,863 INFO L134 CoverageAnalysis]: Checked inductivity of 1418 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1418 trivial. 0 not checked. [2023-02-18 07:45:25,863 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-18 07:45:25,864 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [475772935] [2023-02-18 07:45:25,864 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [475772935] provided 1 perfect and 1 imperfect interpolant sequences [2023-02-18 07:45:25,864 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-18 07:45:25,864 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2023-02-18 07:45:25,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931327051] [2023-02-18 07:45:25,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-18 07:45:25,865 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-18 07:45:25,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-18 07:45:25,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-18 07:45:25,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2023-02-18 07:45:25,866 INFO L87 Difference]: Start difference. First operand 237 states and 250 transitions. Second operand has 5 states, 4 states have (on average 10.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-02-18 07:45:26,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-18 07:45:26,027 INFO L93 Difference]: Finished difference Result 237 states and 250 transitions. [2023-02-18 07:45:26,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-18 07:45:26,028 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 10.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 178 [2023-02-18 07:45:26,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-18 07:45:26,028 INFO L225 Difference]: With dead ends: 237 [2023-02-18 07:45:26,028 INFO L226 Difference]: Without dead ends: 0 [2023-02-18 07:45:26,029 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 356 GetRequests, 344 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2023-02-18 07:45:26,029 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 9 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-18 07:45:26,030 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 187 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-18 07:45:26,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-02-18 07:45:26,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-02-18 07:45:26,030 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-02-18 07:45:26,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-02-18 07:45:26,030 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 178 [2023-02-18 07:45:26,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-18 07:45:26,030 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-02-18 07:45:26,030 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 10.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-02-18 07:45:26,031 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-02-18 07:45:26,031 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-02-18 07:45:26,033 INFO L805 garLoopResultBuilder]: Registering result SAFE for location base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 16 remaining) [2023-02-18 07:45:26,033 INFO L805 garLoopResultBuilder]: Registering result SAFE for location base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 16 remaining) [2023-02-18 07:45:26,033 INFO L805 garLoopResultBuilder]: Registering result SAFE for location base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 16 remaining) [2023-02-18 07:45:26,033 INFO L805 garLoopResultBuilder]: Registering result SAFE for location base2fltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 16 remaining) [2023-02-18 07:45:26,033 INFO L805 garLoopResultBuilder]: Registering result SAFE for location base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 16 remaining) [2023-02-18 07:45:26,034 INFO L805 garLoopResultBuilder]: Registering result SAFE for location base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 16 remaining) [2023-02-18 07:45:26,034 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 16 remaining) [2023-02-18 07:45:26,034 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 16 remaining) [2023-02-18 07:45:26,034 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 16 remaining) [2023-02-18 07:45:26,034 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 16 remaining) [2023-02-18 07:45:26,034 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 16 remaining) [2023-02-18 07:45:26,034 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 16 remaining) [2023-02-18 07:45:26,034 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 16 remaining) [2023-02-18 07:45:26,034 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 16 remaining) [2023-02-18 07:45:26,034 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 16 remaining) [2023-02-18 07:45:26,035 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 16 remaining) [2023-02-18 07:45:26,045 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Forceful destruction successful, exit code 0 [2023-02-18 07:45:26,244 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-02-18 07:45:26,245 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-02-18 07:45:26,294 INFO L899 garLoopResultBuilder]: For program point base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 45) no Hoare annotation was computed. [2023-02-18 07:45:26,295 INFO L899 garLoopResultBuilder]: For program point base2fltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 70) no Hoare annotation was computed. [2023-02-18 07:45:26,295 INFO L899 garLoopResultBuilder]: For program point L77(line 77) no Hoare annotation was computed. [2023-02-18 07:45:26,295 INFO L899 garLoopResultBuilder]: For program point L77-1(line 77) no Hoare annotation was computed. [2023-02-18 07:45:26,302 INFO L895 garLoopResultBuilder]: At program point L73(lines 35 75) the Hoare annotation is: (let ((.cse150 (bvadd base2flt_~e (_ bv4294967295 32)))) (let ((.cse151 (bvadd (_ bv4294967295 32) .cse150))) (let ((.cse154 (bvadd (_ bv4294967295 32) .cse151))) (let ((.cse153 (bvadd (_ bv4294967295 32) .cse154))) (let ((.cse155 (bvadd (_ bv4294967295 32) .cse153))) (let ((.cse140 (bvadd (_ bv4294967295 32) .cse155))) (let ((.cse98 (bvadd (_ bv4294967295 32) .cse140))) (let ((.cse101 (bvadd (_ bv4294967295 32) .cse98))) (let ((.cse102 (bvadd (_ bv4294967295 32) .cse101))) (let ((.cse99 (bvadd (_ bv4294967295 32) .cse102))) (let ((.cse100 (bvadd .cse99 (_ bv4294967295 32)))) (let ((.cse103 (bvadd (_ bv4294967295 32) .cse100))) (let ((.cse104 (bvadd (_ bv4294967295 32) .cse103))) (let ((.cse81 (bvadd (_ bv4294967295 32) .cse104))) (let ((.cse161 (bvadd (_ bv4294967295 32) .cse81))) (let ((.cse164 (bvadd (_ bv4294967295 32) .cse161))) (let ((.cse168 (bvshl base2flt_~m (_ bv1 32))) (.cse160 (bvadd (_ bv4294967295 32) .cse164))) (let ((.cse163 (bvadd .cse160 (_ bv4294967295 32))) (.cse171 (bvshl .cse168 (_ bv1 32)))) (let ((.cse172 (bvshl .cse171 (_ bv1 32))) (.cse165 (bvadd (_ bv4294967295 32) .cse163))) (let ((.cse167 (bvadd (_ bv4294967295 32) .cse165)) (.cse170 (bvshl .cse172 (_ bv1 32)))) (let ((.cse169 (bvshl .cse170 (_ bv1 32))) (.cse162 (bvadd .cse167 (_ bv4294967295 32)))) (let ((.cse166 (bvadd (_ bv4294967295 32) .cse162)) (.cse26 (= |base2flt_#in~e| (_ bv0 32))) (.cse144 (bvshl .cse169 (_ bv1 32)))) (let ((.cse53 (not (bvsle base2flt_~e (_ bv4294967168 32)))) (.cse118 (bvult .cse144 (_ bv16777216 32))) (.cse49 (not .cse26)) (.cse157 (bvult .cse172 (_ bv16777216 32))) (.cse158 (bvult .cse171 (_ bv16777216 32))) (.cse156 (bvult .cse170 (_ bv16777216 32))) (.cse119 (bvult .cse169 (_ bv16777216 32))) (.cse159 (bvult .cse168 (_ bv16777216 32))) (.cse152 (not (bvult base2flt_~m (_ bv16777216 32)))) (.cse59 (bvadd (_ bv4294967295 32) .cse166)) (.cse148 ((_ sign_extend 1) .cse150)) (.cse149 ((_ sign_extend 1) base2flt_~e)) (.cse66 (bvadd base2flt_~e (_ bv1 32)))) (let ((.cse2 (exists ((|v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2|) .cse66))) (.cse47 (not (bvsle .cse66 (_ bv4294967168 32)))) (.cse48 (exists ((|v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2| (_ BitVec 8))) (= |base2flt_#in~e| ((_ sign_extend 24) |v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2|)))) (.cse27 (bvsle (bvadd .cse149 (_ bv128 33)) (_ bv2147483647 33))) (.cse1 (exists ((|v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1| (_ BitVec 8))) (= |base2flt_#in~e| ((_ sign_extend 24) |v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1|)))) (.cse12 (bvsle (bvadd ((_ sign_extend 1) .cse151) (_ bv128 33)) (_ bv2147483647 33))) (.cse18 (bvsle (bvadd .cse148 (_ bv128 33)) (_ bv2147483647 33))) (.cse20 (bvsle (bvadd ((_ sign_extend 1) .cse154) (_ bv128 33)) (_ bv2147483647 33))) (.cse4 (bvsle (bvadd ((_ sign_extend 1) .cse155) (_ bv128 33)) (_ bv2147483647 33))) (.cse6 (bvsle (bvadd ((_ sign_extend 1) .cse153) (_ bv128 33)) (_ bv2147483647 33))) (.cse7 (bvsle (bvadd ((_ sign_extend 1) .cse103) (_ bv128 33)) (_ bv2147483647 33))) (.cse10 (bvsle (bvadd ((_ sign_extend 1) .cse102) (_ bv128 33)) (_ bv2147483647 33))) (.cse14 (bvsle (bvadd ((_ sign_extend 1) .cse99) (_ bv128 33)) (_ bv2147483647 33))) (.cse15 (bvsle (bvadd ((_ sign_extend 1) .cse140) (_ bv128 33)) (_ bv2147483647 33))) (.cse19 (bvsle (bvadd ((_ sign_extend 1) .cse100) (_ bv128 33)) (_ bv2147483647 33))) (.cse21 (bvsle (bvadd ((_ sign_extend 1) .cse98) (_ bv128 33)) (_ bv2147483647 33))) (.cse22 (bvsle (bvadd ((_ sign_extend 1) .cse101) (_ bv128 33)) (_ bv2147483647 33))) (.cse3 (bvsle (bvadd ((_ sign_extend 1) .cse167) (_ bv128 33)) (_ bv2147483647 33))) (.cse5 (bvsle (bvadd ((_ sign_extend 1) .cse166) (_ bv128 33)) (_ bv2147483647 33))) (.cse8 (bvsle (bvadd ((_ sign_extend 1) .cse165) (_ bv128 33)) (_ bv2147483647 33))) (.cse9 (bvsle (bvadd ((_ sign_extend 1) .cse164) (_ bv128 33)) (_ bv2147483647 33))) (.cse11 (bvsle (bvadd ((_ sign_extend 1) .cse163) (_ bv128 33)) (_ bv2147483647 33))) (.cse13 (bvsle (bvadd ((_ sign_extend 1) .cse81) (_ bv128 33)) (_ bv2147483647 33))) (.cse16 (bvsle (bvadd ((_ sign_extend 1) .cse162) (_ bv128 33)) (_ bv2147483647 33))) (.cse17 (bvsle (bvadd ((_ sign_extend 1) .cse59) (_ bv128 33)) (_ bv2147483647 33))) (.cse24 (bvsle (bvadd ((_ sign_extend 1) .cse161) (_ bv128 33)) (_ bv2147483647 33))) (.cse25 (bvsle (bvadd ((_ sign_extend 1) .cse160) (_ bv128 33)) (_ bv2147483647 33))) (.cse28 (bvsle (bvadd ((_ sign_extend 1) .cse104) (_ bv128 33)) (_ bv2147483647 33))) (.cse41 (or .cse159 .cse152)) (.cse37 (or (not .cse156) .cse119)) (.cse39 (or (not .cse159) .cse158)) (.cse43 (or (not .cse158) .cse157)) (.cse44 (or .cse156 (not .cse157))) (.cse31 (or (not (bvsle .cse155 (_ bv4294967168 32))) .cse49)) (.cse32 (or (not (bvsle .cse154 (_ bv4294967168 32))) .cse49)) (.cse34 (or (not (bvsle .cse153 (_ bv4294967168 32))) .cse49)) (.cse42 (or .cse118 .cse152)) (.cse29 (or .cse49 (not (bvsle .cse151 (_ bv4294967168 32))))) (.cse30 (or .cse53 .cse49)) (.cse33 (or (not (bvsle .cse150 (_ bv4294967168 32))) .cse49)) (.cse45 (bvsle (_ bv6442450944 33) (bvadd (_ bv8589934591 33) .cse149))) (.cse46 (bvsle (_ bv6442450944 33) (bvadd .cse148 (_ bv8589934591 33)))) (.cse0 (forall ((|v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1| (_ BitVec 8))) (not (= |base2flt_#in~e| ((_ sign_extend 24) |v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1|))))) (.cse50 (forall ((|v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2| (_ BitVec 8))) (not (= |base2flt_#in~e| ((_ sign_extend 24) |v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2|)))))) (and (let ((.cse40 (= |base2flt_#in~m| (_ bv1 32)))) (or .cse0 (and .cse1 .cse2 (let ((.cse23 (let ((.cse38 (or (and .cse45 .cse40 .cse26) (and .cse45 .cse40 .cse46 .cse26)))) (let ((.cse35 (and .cse38 .cse40 .cse41 .cse42)) (.cse36 (and .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44))) (or (and .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 (or .cse35 .cse36)) .cse35 .cse36))))) (or (and .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28) (and .cse23 .cse26 (= base2flt_~e (bvadd (_ bv4294967295 32) (bvadd (bvadd (bvadd (_ bv4294967295 32) (_ bv4294967276 32)) (_ bv4294967295 32)) (_ bv4294967295 32))))))) .cse47 .cse48) .cse49 (not .cse40) .cse50)) (let ((.cse60 (bvadd (_ bv4294967295 32) |base2flt_#in~e|))) (let ((.cse56 (bvsle (_ bv6442450944 33) (bvadd ((_ sign_extend 1) .cse60) (_ bv8589934591 33))))) (let ((.cse57 (let ((.cse139 (bvshl .cse144 (_ bv1 32)))) (let ((.cse142 (bvshl .cse139 (_ bv1 32)))) (let ((.cse143 (bvshl .cse142 (_ bv1 32)))) (let ((.cse136 (bvshl .cse143 (_ bv1 32)))) (let ((.cse137 (bvshl .cse136 (_ bv1 32)))) (let ((.cse141 (bvadd (bvadd (_ bv4294967293 32) |base2flt_#in~e|) (_ bv4294967295 32))) (.cse138 (bvshl .cse137 (_ bv1 32)))) (let ((.cse115 (bvshl .cse138 (_ bv1 32))) (.cse97 (bvadd .cse141 (_ bv4294967295 32))) (.cse92 (bvadd (_ bv1 32) .cse66))) (let ((.cse117 (bvult .cse143 (_ bv16777216 32))) (.cse120 (bvult .cse142 (_ bv16777216 32))) (.cse78 (= (bvadd .cse92 (_ bv1 32)) |base2flt_#in~e|)) (.cse84 (= |base2flt_#in~e| .cse92)) (.cse82 (= base2flt_~e .cse141)) (.cse87 (= base2flt_~e .cse97)) (.cse85 (= |base2flt_#in~e| .cse66)) (.cse70 (or (not (bvsle .cse140 (_ bv4294967168 32))) .cse49)) (.cse96 (= base2flt_~e |base2flt_#in~e|)) (.cse121 (bvult .cse139 (_ bv16777216 32))) (.cse114 (bvult .cse115 (_ bv16777216 32))) (.cse134 (bvult .cse138 (_ bv16777216 32))) (.cse135 (bvult .cse137 (_ bv16777216 32))) (.cse116 (bvult .cse136 (_ bv16777216 32)))) (let ((.cse107 (or .cse135 (not .cse116))) (.cse112 (or .cse134 (not .cse135))) (.cse113 (or (not .cse134) .cse114)) (.cse106 (or (not .cse118) .cse121)) (.cse105 (let ((.cse123 (and .cse56 .cse46)) (.cse125 (and .cse56 .cse45)) (.cse132 (and .cse56 .cse45 .cse46))) (let ((.cse133 (or .cse123 .cse125 .cse132))) (let ((.cse124 (and .cse30 .cse33 .cse133)) (.cse127 (and .cse30 .cse133)) (.cse128 (and (= .cse60 .cse66) .cse133)) (.cse129 (and .cse96 .cse133)) (.cse130 (and (= base2flt_~e .cse60) .cse133)) (.cse131 (and .cse29 .cse30 .cse33 .cse133))) (let ((.cse126 (and .cse42 (or .cse123 .cse124 .cse125 .cse127 .cse128 .cse129 .cse130 .cse131 .cse132)))) (let ((.cse122 (or .cse123 .cse124 .cse125 .cse126 .cse127 .cse128 .cse129 .cse130 .cse131 .cse132))) (or (and .cse29 .cse30 .cse33 .cse122) .cse123 .cse124 (and .cse30 .cse122) (and .cse122 .cse78) (and .cse122 .cse96) .cse125 (and .cse84 .cse122) .cse126 .cse127 (and .cse122 .cse82) (and .cse122 .cse87) (and .cse122 .cse85) .cse128 .cse129 (and .cse29 .cse30 .cse32 .cse33 .cse122) .cse130 (and .cse29 .cse30 .cse31 .cse32 .cse33 .cse122 .cse34) .cse131 .cse132 (and .cse29 .cse30 .cse70 .cse31 .cse32 .cse33 .cse122 .cse34) (and .cse29 .cse30 .cse32 .cse33 .cse122 .cse34) (and .cse30 .cse33 .cse122) (and .cse122 (= .cse97 .cse66))))))))) (.cse108 (or .cse120 (not .cse121))) (.cse109 (or .cse117 (not .cse120))) (.cse110 (or .cse118 (not .cse119))) (.cse111 (or .cse116 (not .cse117)))) (let ((.cse61 (and .cse37 .cse106 .cse39 .cse105 .cse108 .cse43 .cse109 .cse110 .cse44 .cse111)) (.cse62 (and .cse39 .cse105 .cse43)) (.cse67 (and .cse39 .cse105 .cse43 .cse44)) (.cse76 (and .cse39 .cse105)) (.cse79 (and .cse37 .cse106 .cse39 .cse105 .cse43 .cse110 .cse44)) (.cse80 (and .cse37 .cse106 .cse39 .cse105 .cse108 .cse43 .cse109 .cse110 .cse44)) (.cse83 (and .cse37 .cse106 .cse39 .cse105 .cse108 .cse43 .cse110 .cse44)) (.cse86 (and .cse37 .cse106 .cse107 .cse39 .cse105 (or (not .cse114) (bvult (bvshl .cse115 (_ bv1 32)) (_ bv16777216 32))) .cse108 .cse43 .cse109 .cse112 .cse110 .cse44 .cse111 .cse113)) (.cse88 (and .cse37 .cse39 .cse105 .cse43 .cse110 .cse44)) (.cse90 (and .cse37 .cse106 .cse107 .cse39 .cse105 .cse108 .cse43 .cse109 .cse112 .cse110 .cse44 .cse111)) (.cse91 (and .cse41 .cse105)) (.cse93 (and .cse37 .cse106 .cse107 .cse39 .cse105 .cse108 .cse43 .cse109 .cse112 .cse110 .cse44 .cse111 .cse113)) (.cse94 (and .cse37 .cse106 .cse107 .cse39 .cse105 .cse108 .cse43 .cse109 .cse110 .cse44 .cse111)) (.cse95 (and .cse37 .cse39 .cse105 .cse43 .cse44)) (.cse77 (bvadd (bvadd (_ bv4294967289 32) |base2flt_#in~e|) (_ bv4294967295 32)))) (let ((.cse64 (bvadd (_ bv4294967295 32) (bvadd (_ bv4294967285 32) |base2flt_#in~e|))) (.cse73 (or (not (bvsle .cse104 (_ bv4294967168 32))) .cse49)) (.cse74 (or (not (bvsle .cse103 (_ bv4294967168 32))) .cse49)) (.cse68 (or (not (bvsle .cse102 (_ bv4294967168 32))) .cse49)) (.cse69 (or (not (bvsle .cse101 (_ bv4294967168 32))) .cse49)) (.cse71 (or (not (bvsle .cse100 (_ bv4294967168 32))) .cse49)) (.cse72 (or (not (bvsle .cse99 (_ bv4294967168 32))) .cse49)) (.cse75 (or (not (bvsle .cse98 (_ bv4294967168 32))) .cse49)) (.cse65 (bvadd (_ bv4294967295 32) .cse77)) (.cse89 (bvadd (_ bv4294967295 32) .cse97)) (.cse63 (or .cse61 .cse62 .cse67 .cse76 .cse79 .cse80 .cse83 .cse86 .cse88 .cse90 .cse91 .cse93 .cse94 .cse95))) (or .cse61 .cse62 (and .cse63 (= base2flt_~e (bvadd (_ bv4294967295 32) (bvadd |base2flt_#in~e| (_ bv4294967283 32))))) (and .cse63 (= base2flt_~e .cse64)) (and .cse63 (= .cse65 .cse66)) .cse67 (and .cse63 .cse68 .cse29 .cse30 .cse69 .cse70 .cse31 .cse32 .cse33 .cse71 .cse72 .cse73 .cse74 .cse34 .cse75) .cse76 (and .cse63 (= base2flt_~e .cse77)) (and .cse63 .cse68 .cse29 .cse30 .cse69 .cse70 .cse31 .cse32 .cse33 .cse72 .cse34 .cse75) (and .cse63 (= .cse66 .cse64)) (and .cse63 .cse29 .cse30 .cse32 .cse33) (and .cse63 .cse78) (and .cse63 .cse29 .cse30 .cse33) (and .cse63 .cse30 .cse33) .cse79 .cse80 (and .cse63 .cse68 .cse29 .cse30 (or (not (bvsle .cse81 (_ bv4294967168 32))) .cse49) .cse69 .cse70 .cse31 .cse32 .cse33 .cse71 .cse72 .cse73 .cse74 .cse34 .cse75) (and .cse63 .cse82) (and .cse63 .cse68 .cse29 .cse30 .cse69 .cse70 .cse31 .cse32 .cse33 .cse71 .cse72 .cse74 .cse34 .cse75) .cse83 (and .cse63 .cse68 .cse29 .cse30 .cse69 .cse70 .cse31 .cse32 .cse33 .cse34 .cse75) (and .cse63 (= base2flt_~e .cse65)) (and .cse63 .cse84) (and .cse63 .cse85) (and .cse63 .cse29 .cse30 .cse69 .cse70 .cse31 .cse32 .cse33 .cse34 .cse75) (and .cse63 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34) .cse86 (and .cse63 .cse29 .cse30 .cse70 .cse31 .cse32 .cse33 .cse34 .cse75) (and .cse63 .cse30) (and .cse63 .cse87) .cse88 (and .cse63 (= .cse89 .cse66)) .cse90 (and .cse63 .cse68 .cse29 .cse30 .cse69 .cse70 .cse31 .cse32 .cse33 .cse71 .cse72 .cse34 .cse75) .cse91 (and .cse63 .cse29 .cse30 .cse32 .cse33 .cse34) (and .cse63 (= .cse65 .cse92)) .cse93 (and .cse63 (= base2flt_~e .cse89)) .cse94 (and .cse63 .cse29 .cse30 .cse70 .cse31 .cse32 .cse33 .cse34) .cse95 (and .cse63 .cse96)))))))))))))) (.cse55 (bvsle (bvadd ((_ sign_extend 1) (bvadd (bvadd (bvadd (_ bv4294967295 32) (bvadd (_ bv4294967295 32) (bvadd (_ bv4294967295 32) (bvadd (_ bv4294967295 32) (bvadd (bvadd (_ bv4294967295 32) (bvadd (_ bv4294967295 32) (bvadd (bvadd (_ bv4294967295 32) (bvadd (_ bv4294967295 32) (bvadd (_ bv4294967295 32) (bvadd (_ bv4294967295 32) (bvadd (bvadd (_ bv4294967295 32) (bvadd (bvadd (_ bv4294967295 32) (bvadd (_ bv4294967295 32) (bvadd (_ bv4294967295 32) (bvadd (_ bv4294967295 32) (bvadd (_ bv4294967295 32) (bvadd (_ bv4294967295 32) .cse60)))))) (_ bv4294967295 32))) (_ bv4294967295 32)))))) (_ bv4294967295 32)))) (_ bv4294967295 32)))))) (_ bv4294967295 32)) (_ bv4294967295 32))) (_ bv128 33)) (_ bv2147483647 33)))) (let ((.cse51 (let ((.cse58 (bvsle (bvadd ((_ sign_extend 1) (bvadd .cse59 (_ bv4294967295 32))) (_ bv128 33)) (_ bv2147483647 33)))) (or (and .cse3 .cse5 .cse8 .cse57 .cse16 .cse17 .cse55) (and .cse5 .cse57 .cse16 .cse17 .cse55) (and .cse57 .cse17 .cse55) (and .cse3 .cse5 .cse7 .cse8 .cse9 .cse11 .cse57 .cse13 .cse16 .cse17 .cse24 .cse25 .cse55 .cse28) (and .cse3 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse57 .cse13 .cse14 .cse15 .cse16 .cse17 .cse19 .cse21 .cse22 .cse24 .cse25 .cse55 .cse28) (and .cse3 .cse5 .cse7 .cse8 .cse9 .cse11 .cse57 .cse13 .cse16 .cse17 .cse19 .cse24 .cse25 .cse55 .cse28) (and .cse3 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse57 .cse13 .cse14 .cse16 .cse17 .cse19 .cse22 .cse24 .cse25 .cse55 .cse28) (and .cse3 .cse5 .cse7 .cse8 .cse9 .cse11 .cse57 .cse13 .cse14 .cse16 .cse17 .cse19 .cse24 .cse25 .cse55 .cse28) (and .cse3 .cse5 .cse8 .cse11 .cse57 .cse16 .cse17 .cse55) (and .cse3 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse57 .cse13 .cse14 .cse16 .cse17 .cse19 .cse21 .cse22 .cse24 .cse25 .cse55 .cse28) (and .cse3 .cse5 .cse8 .cse11 .cse57 .cse16 .cse17 .cse25 .cse55) (and .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse57 .cse12 .cse13 .cse14 .cse58 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse24 .cse25 .cse55 .cse28) (and .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse57 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse19 .cse20 .cse21 .cse22 .cse24 .cse25 .cse55 .cse28) (and .cse3 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse57 .cse13 .cse14 .cse16 .cse17 .cse19 .cse24 .cse25 .cse55 .cse28) (and .cse3 .cse4 .cse5 .cse7 .cse8 .cse9 .cse10 .cse11 .cse57 .cse13 .cse14 .cse15 .cse16 .cse17 .cse19 .cse21 .cse22 .cse24 .cse25 .cse55 .cse28) (and .cse5 .cse57 .cse17 .cse55) (and .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse57 .cse13 .cse14 .cse15 .cse16 .cse17 .cse19 .cse20 .cse21 .cse22 .cse24 .cse25 .cse55 .cse28) (and .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse57 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse24 .cse25 .cse55 .cse28) (and .cse3 .cse5 .cse8 .cse9 .cse11 .cse57 .cse16 .cse17 .cse24 .cse25 .cse55) (and .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse57 .cse13 .cse14 .cse15 .cse16 .cse17 .cse19 .cse21 .cse22 .cse24 .cse25 .cse55 .cse28) (and .cse3 .cse5 .cse8 .cse9 .cse11 .cse57 .cse13 .cse16 .cse17 .cse24 .cse25 .cse55) (and .cse3 .cse5 .cse57 .cse16 .cse17 .cse55) (and .cse3 .cse5 .cse8 .cse9 .cse11 .cse57 .cse16 .cse17 .cse25 .cse55) (and .cse3 .cse5 .cse8 .cse9 .cse11 .cse57 .cse13 .cse16 .cse17 .cse24 .cse25 .cse55 .cse28) (and .cse57 .cse58 .cse55))))) (let ((.cse54 (or (and .cse3 .cse4 .cse1 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse57 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse24 .cse25 .cse55 .cse27 .cse28) (and (exists ((|v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1| (_ BitVec 8))) (= base2flt_~e ((_ sign_extend 24) |v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1|))) .cse1 .cse51))) (.cse52 (exists ((|v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2| (_ BitVec 8))) (= base2flt_~e ((_ sign_extend 24) |v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2|))))) (or (and .cse1 .cse51 .cse52 .cse53 .cse48) (and .cse2 .cse54 .cse47 .cse48) .cse0 (not .cse55) (and .cse1 .cse2 .cse51 .cse47 .cse48) (not .cse56) (and .cse54 .cse52 .cse48) .cse50)))))) (let ((.cse145 (bvshl (bvshl |base2flt_#in~m| (_ bv1 32)) (_ bv1 32)))) (let ((.cse146 (bvshl (bvshl (bvshl (bvshl .cse145 (_ bv1 32)) (_ bv1 32)) (_ bv1 32)) (_ bv1 32)))) (or (not (bvult .cse145 (_ bv16777216 32))) (and (not (bvult .cse146 (_ bv16777216 32))) (bvult |base2flt_#in~m| (_ bv16777216 32))) .cse0 (not (= |base2flt_#in~m| (_ bv0 32))) .cse49 (let ((.cse147 (bvshl (bvshl (bvshl (bvshl (bvshl (bvshl (bvshl .cse146 (_ bv1 32)) (_ bv1 32)) (_ bv1 32)) (_ bv1 32)) (_ bv1 32)) (_ bv1 32)) (_ bv1 32)))) (and (bvult .cse147 (_ bv16777216 32)) (not (bvult (bvshl .cse147 (_ bv1 32)) (_ bv16777216 32))))) .cse50)))))))))))))))))))))))))))) [2023-02-18 07:45:26,306 INFO L895 garLoopResultBuilder]: At program point L57-2(lines 57 72) the Hoare annotation is: (let ((.cse0 (forall ((|v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1| (_ BitVec 8))) (not (= |base2flt_#in~e| ((_ sign_extend 24) |v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1|))))) (.cse34 (not (= |base2flt_#in~e| (_ bv0 32)))) (.cse8 (forall ((|v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2| (_ BitVec 8))) (not (= |base2flt_#in~e| ((_ sign_extend 24) |v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2|)))))) (and (let ((.cse91 (bvadd (_ bv4294967295 32) |base2flt_#in~e|))) (let ((.cse6 (bvsle (bvadd ((_ sign_extend 1) (bvadd (bvadd (bvadd (_ bv4294967295 32) (bvadd (_ bv4294967295 32) (bvadd (_ bv4294967295 32) (bvadd (_ bv4294967295 32) (bvadd (bvadd (_ bv4294967295 32) (bvadd (_ bv4294967295 32) (bvadd (bvadd (_ bv4294967295 32) (bvadd (_ bv4294967295 32) (bvadd (_ bv4294967295 32) (bvadd (_ bv4294967295 32) (bvadd (bvadd (_ bv4294967295 32) (bvadd (bvadd (_ bv4294967295 32) (bvadd (_ bv4294967295 32) (bvadd (_ bv4294967295 32) (bvadd (_ bv4294967295 32) (bvadd (_ bv4294967295 32) (bvadd (_ bv4294967295 32) .cse91)))))) (_ bv4294967295 32))) (_ bv4294967295 32)))))) (_ bv4294967295 32)))) (_ bv4294967295 32)))))) (_ bv4294967295 32)) (_ bv4294967295 32))) (_ bv128 33)) (_ bv2147483647 33))) (.cse7 (bvsle (_ bv6442450944 33) (bvadd ((_ sign_extend 1) .cse91) (_ bv8589934591 33)))) (.cse5 (not (bvsle base2flt_~e (_ bv4294967168 32))))) (let ((.cse1 (exists ((|v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1| (_ BitVec 8))) (= |base2flt_#in~e| ((_ sign_extend 24) |v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1|)))) (.cse2 (exists ((|v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2| (_ BitVec 8))) (= base2flt_~e ((_ sign_extend 24) |v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2|)))) (.cse3 (let ((.cse90 (bvadd base2flt_~e (_ bv4294967295 32)))) (let ((.cse18 (bvadd (_ bv4294967295 32) .cse90))) (let ((.cse28 (bvadd (_ bv4294967295 32) .cse18))) (let ((.cse12 (bvadd (_ bv4294967295 32) .cse28))) (let ((.cse10 (bvadd (_ bv4294967295 32) .cse12))) (let ((.cse23 (bvadd (_ bv4294967295 32) .cse10))) (let ((.cse29 (bvadd (_ bv4294967295 32) .cse23))) (let ((.cse30 (bvadd (_ bv4294967295 32) .cse29))) (let ((.cse16 (bvadd (_ bv4294967295 32) .cse30))) (let ((.cse21 (bvadd (_ bv4294967295 32) .cse16))) (let ((.cse27 (bvadd .cse21 (_ bv4294967295 32)))) (let ((.cse13 (bvadd (_ bv4294967295 32) .cse27))) (let ((.cse33 (bvadd (_ bv4294967295 32) .cse13))) (let ((.cse19 (bvadd (_ bv4294967295 32) .cse33))) (let ((.cse31 (bvadd (_ bv4294967295 32) .cse19))) (let ((.cse15 (bvadd (_ bv4294967295 32) .cse31))) (let ((.cse32 (bvadd (_ bv4294967295 32) .cse15))) (let ((.cse17 (bvadd .cse32 (_ bv4294967295 32)))) (let ((.cse14 (bvadd (_ bv4294967295 32) .cse17))) (let ((.cse9 (bvadd (_ bv4294967295 32) .cse14))) (let ((.cse24 (bvadd .cse9 (_ bv4294967295 32)))) (let ((.cse11 (bvadd (_ bv4294967295 32) .cse24))) (let ((.cse25 (bvadd (_ bv4294967295 32) .cse11)) (.cse26 ((_ sign_extend 1) .cse90))) (let ((.cse20 (let ((.cse37 (or (not (bvsle .cse23 (_ bv4294967168 32))) .cse34)) (.cse38 (or (not (bvsle .cse10 (_ bv4294967168 32))) .cse34)) (.cse39 (or (not (bvsle .cse28 (_ bv4294967168 32))) .cse34)) (.cse42 (or (not (bvsle .cse12 (_ bv4294967168 32))) .cse34)) (.cse35 (or .cse34 (not (bvsle .cse18 (_ bv4294967168 32))))) (.cse36 (or .cse5 .cse34)) (.cse41 (or (not (bvsle .cse90 (_ bv4294967168 32))) .cse34)) (.cse43 (= base2flt_~e |base2flt_#in~e|))) (let ((.cse40 (let ((.cse86 (bvshl base2flt_~m (_ bv1 32)))) (let ((.cse85 (bvshl .cse86 (_ bv1 32)))) (let ((.cse88 (bvshl .cse85 (_ bv1 32)))) (let ((.cse82 (bvshl .cse88 (_ bv1 32)))) (let ((.cse81 (bvshl .cse82 (_ bv1 32)))) (let ((.cse84 (bvshl .cse81 (_ bv1 32)))) (let ((.cse83 (bvshl .cse84 (_ bv1 32)))) (let ((.cse87 (bvshl .cse83 (_ bv1 32)))) (let ((.cse89 (bvshl .cse87 (_ bv1 32)))) (let ((.cse80 (bvshl .cse89 (_ bv1 32)))) (let ((.cse78 (bvshl .cse80 (_ bv1 32)))) (let ((.cse79 (bvshl .cse78 (_ bv1 32)))) (let ((.cse58 (bvshl .cse79 (_ bv1 32)))) (let ((.cse60 (not (bvult base2flt_~m (_ bv16777216 32)))) (.cse62 (bvult .cse89 (_ bv16777216 32))) (.cse64 (bvult .cse88 (_ bv16777216 32))) (.cse73 (bvult .cse87 (_ bv16777216 32))) (.cse59 (bvult .cse86 (_ bv16777216 32))) (.cse74 (bvult .cse85 (_ bv16777216 32))) (.cse65 (bvult .cse84 (_ bv16777216 32))) (.cse75 (bvult .cse83 (_ bv16777216 32))) (.cse63 (bvult .cse82 (_ bv16777216 32))) (.cse66 (bvult .cse81 (_ bv16777216 32))) (.cse61 (bvult .cse80 (_ bv16777216 32))) (.cse57 (bvult .cse58 (_ bv16777216 32))) (.cse77 (bvult .cse79 (_ bv16777216 32))) (.cse76 (bvult .cse78 (_ bv16777216 32)))) (let ((.cse52 (or .cse77 (not .cse76))) (.cse56 (or (not .cse77) .cse57)) (.cse46 (or .cse76 (not .cse61))) (.cse44 (or (not .cse63) .cse66)) (.cse45 (or (not .cse65) .cse75)) (.cse47 (or (not .cse59) .cse74)) (.cse48 (or .cse73 (not .cse75))) (.cse49 (or (not .cse74) .cse64)) (.cse50 (or .cse62 (not .cse73))) (.cse51 (let ((.cse67 (let ((.cse70 (let ((.cse72 (bvsle (_ bv6442450944 33) (bvadd (_ bv8589934591 33) ((_ sign_extend 1) base2flt_~e)))) (.cse71 (bvsle (_ bv6442450944 33) (bvadd .cse26 (_ bv8589934591 33))))) (or (and .cse7 .cse71) (and .cse7 .cse72) (and .cse7 .cse72 .cse71))))) (let ((.cse68 (and .cse43 .cse70)) (.cse69 (and .cse35 .cse36 .cse41 .cse70))) (or .cse68 .cse69 (and (or .cse68 .cse69) (or .cse65 .cse60))))))) (or (and .cse43 .cse67) (and .cse35 .cse36 .cse37 .cse38 .cse39 .cse41 .cse42 .cse67)))) (.cse53 (or .cse65 (not .cse66))) (.cse54 (or .cse63 (not .cse64))) (.cse55 (or .cse61 (not .cse62)))) (or (and .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51 .cse52 .cse53 .cse54 .cse55 .cse56) (and .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51 .cse52 .cse53 .cse54 .cse55) (and .cse44 .cse47 .cse49 .cse51 .cse53 .cse54) (and .cse47 .cse49 .cse51) (and .cse44 .cse45 .cse46 .cse47 (or (not .cse57) (bvult (bvshl .cse58 (_ bv1 32)) (_ bv16777216 32))) .cse48 .cse49 .cse50 .cse51 .cse52 .cse53 .cse54 .cse55 .cse56) (and .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51 .cse53 .cse54 .cse55) (and .cse44 .cse45 .cse47 .cse48 .cse49 .cse50 .cse51 .cse53 .cse54) (and .cse44 .cse47 .cse49 .cse51 .cse54) (and (or .cse59 .cse60) .cse51) (and .cse44 .cse45 .cse47 .cse48 .cse49 .cse51 .cse53 .cse54) (and .cse47 .cse51) (and .cse44 .cse45 .cse47 .cse49 .cse51 .cse53 .cse54) (and .cse47 .cse49 .cse51 .cse54) (and .cse44 .cse45 .cse47 .cse48 .cse49 .cse50 .cse51 .cse53 .cse54 .cse55))))))))))))))))))) (or (and (or (not (bvsle .cse16 (_ bv4294967168 32))) .cse34) .cse35 .cse36 (or (not (bvsle .cse19 (_ bv4294967168 32))) .cse34) (or (not (bvsle .cse30 (_ bv4294967168 32))) .cse34) .cse37 .cse38 .cse39 .cse40 .cse41 (or (not (bvsle .cse27 (_ bv4294967168 32))) .cse34) (or (not (bvsle .cse21 (_ bv4294967168 32))) .cse34) (or (not (bvsle .cse33 (_ bv4294967168 32))) .cse34) (or (not (bvsle .cse13 (_ bv4294967168 32))) .cse34) .cse42 (or (not (bvsle .cse29 (_ bv4294967168 32))) .cse34)) (and .cse40 .cse43))))) (.cse22 (bvsle (bvadd ((_ sign_extend 1) (bvadd .cse25 (_ bv4294967295 32))) (_ bv128 33)) (_ bv2147483647 33)))) (or (and (bvsle (bvadd ((_ sign_extend 1) .cse9) (_ bv128 33)) (_ bv2147483647 33)) (bvsle (bvadd ((_ sign_extend 1) .cse10) (_ bv128 33)) (_ bv2147483647 33)) (bvsle (bvadd ((_ sign_extend 1) .cse11) (_ bv128 33)) (_ bv2147483647 33)) (bvsle (bvadd ((_ sign_extend 1) .cse12) (_ bv128 33)) (_ bv2147483647 33)) (bvsle (bvadd ((_ sign_extend 1) .cse13) (_ bv128 33)) (_ bv2147483647 33)) (bvsle (bvadd ((_ sign_extend 1) .cse14) (_ bv128 33)) (_ bv2147483647 33)) (bvsle (bvadd ((_ sign_extend 1) .cse15) (_ bv128 33)) (_ bv2147483647 33)) (bvsle (bvadd ((_ sign_extend 1) .cse16) (_ bv128 33)) (_ bv2147483647 33)) (bvsle (bvadd ((_ sign_extend 1) .cse17) (_ bv128 33)) (_ bv2147483647 33)) (bvsle (bvadd ((_ sign_extend 1) .cse18) (_ bv128 33)) (_ bv2147483647 33)) (bvsle (bvadd ((_ sign_extend 1) .cse19) (_ bv128 33)) (_ bv2147483647 33)) .cse20 (bvsle (bvadd ((_ sign_extend 1) .cse21) (_ bv128 33)) (_ bv2147483647 33)) .cse22 (bvsle (bvadd ((_ sign_extend 1) .cse23) (_ bv128 33)) (_ bv2147483647 33)) (bvsle (bvadd ((_ sign_extend 1) .cse24) (_ bv128 33)) (_ bv2147483647 33)) (bvsle (bvadd ((_ sign_extend 1) .cse25) (_ bv128 33)) (_ bv2147483647 33)) (bvsle (bvadd .cse26 (_ bv128 33)) (_ bv2147483647 33)) (bvsle (bvadd ((_ sign_extend 1) .cse27) (_ bv128 33)) (_ bv2147483647 33)) (bvsle (bvadd ((_ sign_extend 1) .cse28) (_ bv128 33)) (_ bv2147483647 33)) (bvsle (bvadd ((_ sign_extend 1) .cse29) (_ bv128 33)) (_ bv2147483647 33)) (bvsle (bvadd ((_ sign_extend 1) .cse30) (_ bv128 33)) (_ bv2147483647 33)) (bvsle (bvadd ((_ sign_extend 1) .cse31) (_ bv128 33)) (_ bv2147483647 33)) (bvsle (bvadd ((_ sign_extend 1) .cse32) (_ bv128 33)) (_ bv2147483647 33)) .cse6 (bvsle (bvadd ((_ sign_extend 1) .cse33) (_ bv128 33)) (_ bv2147483647 33))) (and .cse20 .cse22 .cse6))))))))))))))))))))))))))) (.cse4 (exists ((|v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2| (_ BitVec 8))) (= |base2flt_#in~e| ((_ sign_extend 24) |v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2|))))) (or .cse0 (and (exists ((|v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1| (_ BitVec 8))) (= base2flt_~e ((_ sign_extend 24) |v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1|))) .cse1 .cse2 .cse3 .cse4) (and .cse1 .cse2 .cse5 .cse3 .cse4) (not .cse6) (not .cse7) .cse8)))) (let ((.cse92 (bvshl (bvshl |base2flt_#in~m| (_ bv1 32)) (_ bv1 32)))) (let ((.cse93 (bvshl (bvshl (bvshl (bvshl .cse92 (_ bv1 32)) (_ bv1 32)) (_ bv1 32)) (_ bv1 32)))) (or (not (bvult .cse92 (_ bv16777216 32))) (and (not (bvult .cse93 (_ bv16777216 32))) (bvult |base2flt_#in~m| (_ bv16777216 32))) .cse0 (not (= |base2flt_#in~m| (_ bv0 32))) .cse34 (let ((.cse94 (bvshl (bvshl (bvshl (bvshl (bvshl (bvshl (bvshl .cse93 (_ bv1 32)) (_ bv1 32)) (_ bv1 32)) (_ bv1 32)) (_ bv1 32)) (_ bv1 32)) (_ bv1 32)))) (and (bvult .cse94 (_ bv16777216 32)) (not (bvult (bvshl .cse94 (_ bv1 32)) (_ bv16777216 32))))) .cse8))) (or .cse0 .cse34 (not (= |base2flt_#in~m| (_ bv1 32))) .cse8))) [2023-02-18 07:45:26,306 INFO L899 garLoopResultBuilder]: For program point base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 77) no Hoare annotation was computed. [2023-02-18 07:45:26,306 INFO L899 garLoopResultBuilder]: For program point L45(line 45) no Hoare annotation was computed. [2023-02-18 07:45:26,306 INFO L899 garLoopResultBuilder]: For program point L45-1(line 45) no Hoare annotation was computed. [2023-02-18 07:45:26,306 INFO L899 garLoopResultBuilder]: For program point L70(line 70) no Hoare annotation was computed. [2023-02-18 07:45:26,307 INFO L899 garLoopResultBuilder]: For program point L70-1(line 70) no Hoare annotation was computed. [2023-02-18 07:45:26,307 INFO L899 garLoopResultBuilder]: For program point L29(lines 29 34) no Hoare annotation was computed. [2023-02-18 07:45:26,307 INFO L899 garLoopResultBuilder]: For program point L58(lines 57 72) no Hoare annotation was computed. [2023-02-18 07:45:26,307 INFO L899 garLoopResultBuilder]: For program point base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 70) no Hoare annotation was computed. [2023-02-18 07:45:26,309 INFO L895 garLoopResultBuilder]: At program point L79(lines 28 81) the Hoare annotation is: (let ((.cse249 (bvadd base2flt_~e (_ bv4294967295 32)))) (let ((.cse250 (bvadd (_ bv4294967295 32) .cse249))) (let ((.cse252 (bvadd (_ bv4294967295 32) .cse250))) (let ((.cse251 (bvadd (_ bv4294967295 32) .cse252))) (let ((.cse253 (bvadd (_ bv4294967295 32) .cse251))) (let ((.cse241 (bvadd (_ bv4294967295 32) .cse253))) (let ((.cse222 (bvadd (_ bv4294967295 32) .cse241))) (let ((.cse226 (bvadd (_ bv4294967295 32) .cse222))) (let ((.cse227 (bvadd (_ bv4294967295 32) .cse226))) (let ((.cse224 (bvadd (_ bv4294967295 32) .cse227)) (.cse281 (bvshl base2flt_~m (_ bv1 32)))) (let ((.cse280 (bvshl .cse281 (_ bv1 32))) (.cse225 (bvadd .cse224 (_ bv4294967295 32)))) (let ((.cse223 (bvadd (_ bv4294967295 32) .cse225)) (.cse282 (bvshl .cse280 (_ bv1 32)))) (let ((.cse277 (bvshl .cse282 (_ bv1 32))) (.cse228 (bvadd (_ bv4294967295 32) .cse223))) (let ((.cse207 (bvadd (_ bv4294967295 32) .cse228)) (.cse276 (bvshl .cse277 (_ bv1 32)))) (let ((.cse279 (bvshl .cse276 (_ bv1 32))) (.cse264 (bvadd (_ bv4294967295 32) .cse207))) (let ((.cse267 (bvadd (_ bv4294967295 32) .cse264)) (.cse278 (bvshl .cse279 (_ bv1 32)))) (let ((.cse274 (bvshl .cse278 (_ bv1 32))) (.cse263 (bvadd (_ bv4294967295 32) .cse267))) (let ((.cse266 (bvadd .cse263 (_ bv4294967295 32))) (.cse275 (bvshl .cse274 (_ bv1 32)))) (let ((.cse272 (bvshl .cse275 (_ bv1 32))) (.cse268 (bvadd (_ bv4294967295 32) .cse266))) (let ((.cse270 (bvadd (_ bv4294967295 32) .cse268)) (.cse273 (bvshl .cse272 (_ bv1 32)))) (let ((.cse271 (bvshl .cse273 (_ bv1 32))) (.cse265 (bvadd .cse270 (_ bv4294967295 32)))) (let ((.cse269 (bvadd (_ bv4294967295 32) .cse265)) (.cse261 (bvshl .cse271 (_ bv1 32))) (.cse240 (bvadd (bvadd (_ bv4294967293 32) |base2flt_#in~e|) (_ bv4294967295 32))) (.cse35 (= |base2flt_#in~e| (_ bv0 32)))) (let ((.cse131 (not (bvsle base2flt_~e (_ bv4294967168 32)))) (.cse44 (not .cse35)) (.cse235 (bvadd .cse240 (_ bv4294967295 32))) (.cse229 (bvadd base2flt_~e (_ bv1 32))) (.cse39 (bvult .cse282 (_ bv16777216 32))) (.cse16 (bvult .cse281 (_ bv16777216 32))) (.cse24 (bvult .cse280 (_ bv16777216 32))) (.cse23 (bvult .cse279 (_ bv16777216 32))) (.cse255 (bvult .cse278 (_ bv16777216 32))) (.cse21 (bvult .cse277 (_ bv16777216 32))) (.cse22 (bvult .cse276 (_ bv16777216 32))) (.cse257 (bvult .cse275 (_ bv16777216 32))) (.cse254 (bvult .cse274 (_ bv16777216 32))) (.cse259 (bvult .cse273 (_ bv16777216 32))) (.cse256 (bvult .cse272 (_ bv16777216 32))) (.cse258 (bvult .cse271 (_ bv16777216 32))) (.cse260 (bvult .cse261 (_ bv16777216 32))) (.cse262 (bvadd (_ bv4294967295 32) (bvadd |base2flt_#in~e| (_ bv4294967283 32)))) (.cse245 (bvadd (_ bv4294967295 32) |base2flt_#in~e|)) (.cse248 ((_ sign_extend 1) base2flt_~e)) (.cse247 ((_ sign_extend 1) .cse249)) (.cse135 (bvadd (_ bv4294967295 32) .cse269))) (let ((.cse15 (exists ((|v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1| (_ BitVec 8))) (= base2flt_~e ((_ sign_extend 24) |v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1|)))) (.cse18 (exists ((|v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1| (_ BitVec 8))) (= |base2flt_#in~e| ((_ sign_extend 24) |v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1|)))) (.cse65 (bvsle (bvadd ((_ sign_extend 1) .cse270) (_ bv128 33)) (_ bv2147483647 33))) (.cse66 (bvsle (bvadd ((_ sign_extend 1) .cse253) (_ bv128 33)) (_ bv2147483647 33))) (.cse67 (bvsle (bvadd ((_ sign_extend 1) .cse269) (_ bv128 33)) (_ bv2147483647 33))) (.cse68 (bvsle (bvadd ((_ sign_extend 1) .cse251) (_ bv128 33)) (_ bv2147483647 33))) (.cse69 (bvsle (bvadd ((_ sign_extend 1) .cse223) (_ bv128 33)) (_ bv2147483647 33))) (.cse70 (bvsle (bvadd ((_ sign_extend 1) .cse268) (_ bv128 33)) (_ bv2147483647 33))) (.cse71 (bvsle (bvadd ((_ sign_extend 1) .cse267) (_ bv128 33)) (_ bv2147483647 33))) (.cse72 (bvsle (bvadd ((_ sign_extend 1) .cse227) (_ bv128 33)) (_ bv2147483647 33))) (.cse74 (bvsle (bvadd ((_ sign_extend 1) .cse266) (_ bv128 33)) (_ bv2147483647 33))) (.cse75 (bvsle (bvadd ((_ sign_extend 1) .cse250) (_ bv128 33)) (_ bv2147483647 33))) (.cse76 (bvsle (bvadd ((_ sign_extend 1) .cse207) (_ bv128 33)) (_ bv2147483647 33))) (.cse77 (bvsle (bvadd ((_ sign_extend 1) .cse224) (_ bv128 33)) (_ bv2147483647 33))) (.cse78 (bvsle (bvadd ((_ sign_extend 1) .cse241) (_ bv128 33)) (_ bv2147483647 33))) (.cse79 (bvsle (bvadd ((_ sign_extend 1) .cse265) (_ bv128 33)) (_ bv2147483647 33))) (.cse80 (bvsle (bvadd ((_ sign_extend 1) .cse135) (_ bv128 33)) (_ bv2147483647 33))) (.cse81 (bvsle (bvadd .cse247 (_ bv128 33)) (_ bv2147483647 33))) (.cse82 (bvsle (bvadd ((_ sign_extend 1) .cse225) (_ bv128 33)) (_ bv2147483647 33))) (.cse83 (bvsle (bvadd ((_ sign_extend 1) .cse252) (_ bv128 33)) (_ bv2147483647 33))) (.cse84 (bvsle (bvadd ((_ sign_extend 1) .cse222) (_ bv128 33)) (_ bv2147483647 33))) (.cse85 (bvsle (bvadd ((_ sign_extend 1) .cse226) (_ bv128 33)) (_ bv2147483647 33))) (.cse86 (bvsle (bvadd ((_ sign_extend 1) .cse264) (_ bv128 33)) (_ bv2147483647 33))) (.cse87 (bvsle (bvadd ((_ sign_extend 1) .cse263) (_ bv128 33)) (_ bv2147483647 33))) (.cse88 (bvsle (bvadd .cse248 (_ bv128 33)) (_ bv2147483647 33))) (.cse89 (bvsle (bvadd ((_ sign_extend 1) .cse228) (_ bv128 33)) (_ bv2147483647 33))) (.cse129 (bvsle (bvadd ((_ sign_extend 1) (bvadd (bvadd (bvadd (_ bv4294967295 32) (bvadd (_ bv4294967295 32) (bvadd (_ bv4294967295 32) (bvadd (_ bv4294967295 32) (bvadd (bvadd (_ bv4294967295 32) (bvadd (_ bv4294967295 32) (bvadd (bvadd (_ bv4294967295 32) (bvadd (_ bv4294967295 32) (bvadd (_ bv4294967295 32) (bvadd (_ bv4294967295 32) (bvadd (bvadd (_ bv4294967295 32) (bvadd (bvadd (_ bv4294967295 32) (bvadd (_ bv4294967295 32) (bvadd (_ bv4294967295 32) (bvadd (_ bv4294967295 32) (bvadd (_ bv4294967295 32) (bvadd (_ bv4294967295 32) .cse245)))))) (_ bv4294967295 32))) (_ bv4294967295 32)))))) (_ bv4294967295 32)))) (_ bv4294967295 32)))))) (_ bv4294967295 32)) (_ bv4294967295 32))) (_ bv128 33)) (_ bv2147483647 33))) (.cse60 (bvsle .cse262 (_ bv4294967168 32))) (.cse59 (= base2flt_~e .cse262)) (.cse29 (or (not .cse260) (bvult (bvshl .cse261 (_ bv1 32)) (_ bv16777216 32)))) (.cse43 (or (not .cse258) .cse260)) (.cse19 (or .cse259 (not .cse256))) (.cse34 (or .cse257 (not .cse254))) (.cse36 (or .cse258 (not .cse259))) (.cse42 (or .cse256 (not .cse257))) (.cse14 (or (not .cse21) .cse22)) (.cse17 (or (not .cse23) .cse255)) (.cse20 (or (not .cse16) .cse24)) (.cse30 (or .cse254 (not .cse255))) (.cse31 (or (not .cse24) .cse39)) (.cse37 (or .cse23 (not .cse22))) (.cse38 (or .cse21 (not .cse39))) (.cse57 (bvsle (bvadd (_ bv4294967290 32) |base2flt_#in~e|) (_ bv4294967168 32))) (.cse58 (= .cse235 .cse229)) (.cse101 (or (not (bvsle .cse253 (_ bv4294967168 32))) .cse44)) (.cse102 (or (not (bvsle .cse252 (_ bv4294967168 32))) .cse44)) (.cse104 (or (not (bvsle .cse251 (_ bv4294967168 32))) .cse44)) (.cse118 (not (bvsge base2flt_~e (_ bv127 32)))) (.cse52 (bvsle (bvadd |base2flt_#in~e| (_ bv4294967294 32)) (_ bv4294967168 32))) (.cse99 (or .cse44 (not (bvsle .cse250 (_ bv4294967168 32))))) (.cse103 (or (not (bvsle .cse249 (_ bv4294967168 32))) .cse44)) (.cse50 (= .cse245 .cse229)) (.cse100 (or .cse131 .cse44)) (.cse25 (= base2flt_~e |base2flt_#in~e|)) (.cse33 (bvult base2flt_~m (_ bv16777216 32))) (.cse124 (bvsle (_ bv6442450944 33) (bvadd (_ bv8589934591 33) .cse248))) (.cse128 (bvsle (_ bv6442450944 33) (bvadd ((_ sign_extend 1) .cse245) (_ bv8589934591 33)))) (.cse126 (bvsle (_ bv6442450944 33) (bvadd .cse247 (_ bv8589934591 33))))) (let ((.cse62 (exists ((|v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2|) .cse229))) (.cse64 (not (bvsle .cse229 (_ bv4294967168 32)))) (.cse130 (let ((.cse132 (let ((.cse133 (let ((.cse140 (and .cse128 .cse126)) (.cse160 (and .cse128 .cse124)) (.cse195 (and .cse128 .cse124 .cse126))) (let ((.cse246 (or .cse140 .cse160 .cse195))) (let ((.cse206 (and .cse246 .cse33)) (.cse213 (and .cse16 .cse24 .cse246 .cse33))) (let ((.cse244 (= base2flt_~e .cse245)) (.cse243 (or .cse140 .cse160 .cse195 .cse206 .cse213))) (let ((.cse143 (and .cse244 .cse243)) (.cse145 (and .cse243 .cse44)) (.cse146 (and .cse243 .cse25 .cse44)) (.cse162 (and .cse100 .cse243)) (.cse173 (and .cse50 .cse243)) (.cse179 (and .cse244 .cse243 .cse44)) (.cse184 (and .cse99 .cse100 .cse103 .cse243)) (.cse199 (and .cse100 .cse103 .cse243)) (.cse204 (and .cse50 .cse243 .cse52)) (.cse205 (and .cse243 .cse25))) (let ((.cse238 (not .cse33)) (.cse242 (or .cse140 .cse143 .cse145 .cse146 .cse160 .cse162 .cse173 .cse179 .cse184 .cse195 .cse199 .cse204 .cse205 .cse206 .cse213))) (let ((.cse177 (and .cse242 .cse33)) (.cse183 (and .cse16 .cse242 .cse21 .cse22 .cse23 .cse24 .cse33 .cse39)) (.cse211 (and .cse242 (or .cse23 .cse238)))) (let ((.cse197 (and .cse118 (or .cse140 .cse143 .cse145 .cse146 .cse160 .cse162 .cse173 .cse177 .cse179 .cse183 .cse184 .cse195 .cse199 .cse204 .cse205 .cse206 .cse211 .cse213))) (.cse234 (bvadd (_ bv1 32) .cse229))) (let ((.cse188 (= |base2flt_#in~e| .cse229)) (.cse150 (or (not (bvsle .cse241 (_ bv4294967168 32))) .cse44)) (.cse157 (= (bvadd .cse234 (_ bv1 32)) |base2flt_#in~e|)) (.cse186 (= base2flt_~e .cse235)) (.cse154 (= |base2flt_#in~e| .cse234)) (.cse239 (or .cse140 .cse143 .cse145 .cse146 .cse160 .cse162 .cse173 .cse177 .cse179 .cse183 .cse184 .cse195 .cse197 .cse199 .cse204 .cse205 .cse206 .cse211 .cse213)) (.cse193 (= base2flt_~e .cse240))) (let ((.cse144 (and .cse239 .cse193)) (.cse159 (and .cse154 .cse239 .cse44)) (.cse161 (and .cse100 .cse103 .cse239)) (.cse163 (and .cse239 .cse186)) (.cse166 (and .cse239 .cse157)) (.cse170 (and .cse239 .cse25)) (.cse174 (and .cse239 .cse186 .cse44)) (.cse176 (and .cse239 .cse157 .cse44)) (.cse180 (and .cse99 .cse100 .cse102 .cse103 .cse239 .cse104)) (.cse182 (and .cse99 .cse100 .cse103 .cse239)) (.cse189 (and .cse99 .cse100 .cse150 .cse101 .cse102 .cse103 .cse239 .cse104)) (.cse191 (and .cse239 .cse58)) (.cse192 (and .cse239 .cse25 .cse44)) (.cse194 (and .cse239 .cse188)) (.cse200 (and .cse99 .cse100 .cse101 .cse102 .cse103 .cse239 .cse104)) (.cse203 (and .cse100 .cse239)) (.cse212 (and .cse239 .cse188 .cse44)) (.cse214 (and .cse57 .cse239 .cse58)) (.cse215 (and .cse99 .cse100 .cse102 .cse103 .cse239)) (.cse217 (and .cse239 .cse193 .cse44)) (.cse218 (and .cse239 .cse44)) (.cse221 (and .cse154 .cse239))) (let ((.cse232 (bvadd (bvadd (_ bv4294967289 32) |base2flt_#in~e|) (_ bv4294967295 32))) (.cse237 (or .cse16 .cse238)) (.cse236 (or .cse140 .cse143 .cse144 .cse145 .cse146 .cse159 .cse160 .cse161 .cse162 .cse163 .cse166 .cse170 .cse173 .cse174 .cse176 .cse177 .cse179 .cse180 .cse182 .cse183 .cse184 .cse189 .cse191 .cse192 .cse194 .cse195 .cse197 .cse199 .cse200 .cse203 .cse204 .cse205 .cse206 .cse211 .cse212 .cse213 .cse214 .cse215 .cse217 .cse218 .cse221))) (let ((.cse136 (and .cse14 .cse17 .cse20 .cse237 .cse236 .cse30 .cse31 .cse37 .cse38)) (.cse139 (and .cse236 .cse33)) (.cse142 (and .cse20 .cse237 .cse236 .cse31)) (.cse147 (and .cse14 .cse17 .cse19 .cse20 .cse237 .cse236 .cse30 .cse31 .cse34 .cse36 .cse37 .cse38 .cse42)) (.cse153 (and .cse14 .cse17 .cse20 .cse237 .cse236 .cse30 .cse31 .cse34 .cse37 .cse38)) (.cse156 (and .cse20 .cse237 .cse236 .cse31 .cse38)) (.cse164 (and .cse14 .cse17 .cse20 .cse237 .cse236 .cse30 .cse31 .cse34 .cse37 .cse38 .cse42)) (.cse165 (and .cse14 .cse17 .cse20 .cse237 .cse236 .cse31 .cse37 .cse38)) (.cse167 (and .cse14 .cse20 .cse237 .cse236 .cse31 .cse38)) (.cse169 (and .cse20 .cse237 .cse236)) (.cse171 (and .cse14 .cse16 .cse17 .cse19 .cse20 .cse236 .cse29 .cse30 .cse31 .cse33 .cse34 .cse36 .cse37 .cse38 .cse42 .cse43)) (.cse175 (and .cse236 .cse34)) (.cse181 (and .cse14 .cse17 .cse19 .cse20 .cse237 .cse236 .cse30 .cse31 .cse34 .cse36 .cse37 .cse38 .cse42 .cse43)) (.cse187 (and .cse14 .cse20 .cse237 .cse236 .cse31 .cse37 .cse38)) (.cse190 (and .cse19 .cse236 .cse29 .cse34 .cse36 .cse42 .cse43)) (.cse198 (and .cse14 .cse17 .cse19 .cse20 .cse237 .cse236 .cse30 .cse31 .cse34 .cse37 .cse38 .cse42)) (.cse201 (and .cse236 .cse34 .cse42)) (.cse202 (and .cse19 .cse236 .cse34 .cse36 .cse42)) (.cse210 (and .cse14 .cse17 .cse19 .cse20 .cse237 .cse236 .cse29 .cse30 .cse31 .cse34 .cse36 .cse37 .cse38 .cse42 .cse43)) (.cse216 (and .cse237 .cse236)) (.cse219 (and .cse19 .cse236 .cse34 .cse42)) (.cse220 (and .cse19 .cse236 .cse34 .cse36 .cse42 .cse43)) (.cse231 (bvadd (_ bv4294967295 32) .cse235)) (.cse230 (bvadd (_ bv4294967295 32) (bvadd (_ bv4294967285 32) |base2flt_#in~e|))) (.cse233 (bvadd (_ bv4294967295 32) .cse232))) (let ((.cse141 (= .cse233 .cse229)) (.cse155 (= .cse233 .cse234)) (.cse172 (= base2flt_~e .cse233)) (.cse185 (= base2flt_~e .cse232)) (.cse138 (= base2flt_~e .cse230)) (.cse168 (= .cse231 .cse229)) (.cse178 (= base2flt_~e .cse231)) (.cse158 (= .cse229 .cse230)) (.cse208 (or (not (bvsle .cse228 (_ bv4294967168 32))) .cse44)) (.cse148 (or (not (bvsle .cse227 (_ bv4294967168 32))) .cse44)) (.cse149 (or (not (bvsle .cse226 (_ bv4294967168 32))) .cse44)) (.cse196 (or (not (bvsle .cse225 (_ bv4294967168 32))) .cse44)) (.cse151 (or (not (bvsle .cse224 (_ bv4294967168 32))) .cse44)) (.cse209 (or (not (bvsle .cse223 (_ bv4294967168 32))) .cse44)) (.cse152 (or (not (bvsle .cse222 (_ bv4294967168 32))) .cse44)) (.cse137 (or .cse136 .cse139 .cse140 .cse142 .cse143 .cse144 .cse145 .cse146 .cse147 .cse153 .cse156 .cse159 .cse160 .cse161 .cse162 .cse163 .cse164 .cse165 .cse166 .cse167 .cse169 .cse170 .cse171 .cse173 .cse174 .cse175 .cse176 .cse177 .cse179 .cse180 .cse181 .cse182 .cse183 .cse184 .cse187 .cse189 .cse190 .cse191 .cse192 .cse194 .cse195 .cse197 .cse198 .cse199 .cse200 .cse201 .cse202 .cse203 .cse204 .cse205 .cse206 .cse210 .cse211 .cse212 .cse213 .cse214 .cse215 .cse216 .cse217 .cse218 .cse219 .cse220 .cse221))) (or .cse136 (and .cse137 .cse138) .cse139 .cse140 (and .cse99 .cse100 .cse102 .cse103 .cse137) (and .cse141 .cse137 .cse44) .cse142 .cse143 .cse144 (and .cse99 .cse100 .cse103 .cse137) .cse145 (and .cse137 .cse44) (and .cse141 .cse137) .cse146 .cse147 (and .cse148 .cse99 .cse100 .cse149 .cse150 .cse101 .cse102 .cse103 .cse151 .cse137 .cse104 .cse152) .cse153 (and .cse154 .cse137) (and .cse155 .cse137) .cse156 (and .cse157 .cse137) (and .cse137 .cse158 .cse44) .cse159 .cse160 .cse161 (and .cse25 .cse137 .cse44) .cse162 .cse163 .cse164 (and .cse100 .cse137) .cse165 .cse166 (and .cse148 .cse99 .cse100 .cse149 .cse150 .cse101 .cse102 .cse103 .cse137 .cse104 .cse152) .cse167 (and .cse59 .cse137 .cse60) (and .cse137 .cse168) .cse169 .cse170 (and .cse99 .cse100 .cse150 .cse101 .cse102 .cse103 .cse137 .cse104 .cse152) .cse171 (and .cse155 .cse137 .cse44) (and .cse172 .cse137) .cse173 .cse174 .cse175 .cse176 .cse177 (and .cse178 .cse137 .cse44) .cse179 .cse180 (and .cse25 .cse137) (and .cse172 .cse137 .cse44) .cse181 .cse182 .cse183 .cse184 (and .cse137 .cse185 .cse44) (and .cse186 .cse137) (and .cse99 .cse100 .cse101 .cse102 .cse103 .cse137 .cse104) .cse187 (and .cse137 .cse188) .cse189 .cse190 (and .cse137 .cse185) (and .cse137 .cse44 .cse138) (and .cse99 .cse100 .cse150 .cse101 .cse102 .cse103 .cse137 .cse104) .cse191 .cse192 (and .cse137 .cse193) .cse194 .cse195 (and .cse137 .cse168 .cse44) (and .cse148 .cse99 .cse100 .cse149 .cse150 .cse101 .cse102 .cse103 .cse196 .cse151 .cse137 .cse104 .cse152) (and .cse99 .cse100 .cse149 .cse150 .cse101 .cse102 .cse103 .cse137 .cse104 .cse152) .cse197 (and .cse99 .cse100 .cse102 .cse103 .cse137 .cse104) .cse198 (and .cse157 .cse137 .cse44) (and .cse154 .cse137 .cse44) .cse199 .cse200 .cse201 .cse202 (and .cse178 .cse137) .cse203 .cse204 .cse205 (and .cse137 .cse158) .cse206 (and .cse148 .cse99 .cse100 (or (not (bvsle .cse207 (_ bv4294967168 32))) .cse44) .cse149 .cse150 .cse101 .cse102 .cse103 .cse196 .cse151 .cse208 .cse137 .cse209 .cse104 .cse152) .cse210 .cse211 (and .cse186 .cse137 .cse44) .cse212 .cse213 (and .cse148 .cse99 .cse100 .cse149 .cse150 .cse101 .cse102 .cse103 .cse196 .cse151 .cse208 .cse137 .cse209 .cse104 .cse152) (and .cse100 .cse103 .cse137) .cse214 .cse215 .cse216 (and .cse148 .cse99 .cse100 .cse149 .cse150 .cse101 .cse102 .cse103 .cse196 .cse151 .cse137 .cse209 .cse104 .cse152) (and .cse59 .cse137) .cse217 (and .cse137 .cse193 .cse44) (and .cse137 .cse188 .cse44) .cse218 .cse219 .cse220 .cse221))))))))))))))) (.cse134 (bvsle (bvadd ((_ sign_extend 1) (bvadd .cse135 (_ bv4294967295 32))) (_ bv128 33)) (_ bv2147483647 33)))) (or (and .cse65 .cse66 .cse133 .cse67 .cse68 .cse69 .cse70 .cse71 .cse72 .cse74 .cse75 .cse76 .cse77 .cse134 .cse78 .cse79 .cse80 .cse81 .cse82 .cse83 .cse84 .cse85 .cse86 .cse87 .cse129 .cse89) (and .cse65 .cse66 .cse133 .cse67 .cse68 .cse69 .cse70 .cse71 .cse72 .cse74 .cse75 .cse76 .cse77 .cse78 .cse79 .cse80 .cse81 .cse82 .cse83 .cse84 .cse85 .cse86 .cse87 .cse129 .cse88 .cse89) (and .cse65 .cse66 .cse133 .cse67 .cse68 .cse69 .cse70 .cse71 .cse72 .cse74 .cse75 .cse76 .cse77 .cse134 .cse78 .cse79 .cse80 .cse81 .cse82 .cse83 .cse84 .cse85 .cse86 .cse87 .cse129 .cse88 .cse89) (and .cse133 .cse134 .cse129))))) (or (and .cse15 .cse18 .cse132) (and .cse18 .cse132)))) (.cse27 (exists ((|v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2| (_ BitVec 8))) (= base2flt_~e ((_ sign_extend 24) |v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2|)))) (.cse32 (exists ((|v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2| (_ BitVec 8))) (= |base2flt_#in~e| ((_ sign_extend 24) |v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2|))))) (let ((.cse26 (= base2flt_~__retres4~0 (_ bv0 32))) (.cse0 (and .cse130 .cse27 .cse131 .cse32)) (.cse1 (and .cse62 .cse130 .cse64 .cse32)) (.cse3 (and .cse130 .cse27 .cse32))) (let ((.cse5 (and .cse26 (or .cse0 .cse1 .cse3)))) (let ((.cse7 (or .cse0 .cse1 .cse3 .cse5))) (let ((.cse4 (not .cse129)) (.cse6 (and .cse7 .cse26)) (.cse8 (not .cse128)) (.cse2 (forall ((|v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1| (_ BitVec 8))) (not (= |base2flt_#in~e| ((_ sign_extend 24) |v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1|))))) (.cse9 (forall ((|v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2| (_ BitVec 8))) (not (= |base2flt_#in~e| ((_ sign_extend 24) |v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2|))))) (.cse28 (= base2flt_~e (_ bv0 32)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (and .cse7 (= (_ bv4294967295 32) base2flt_~__retres4~0)) .cse8 .cse9) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9) (let ((.cse46 (bvshl (bvshl |base2flt_#in~m| (_ bv1 32)) (_ bv1 32)))) (let ((.cse47 (bvshl (bvshl (bvshl (bvshl .cse46 (_ bv1 32)) (_ bv1 32)) (_ bv1 32)) (_ bv1 32)))) (let ((.cse45 (bvshl (bvshl (bvshl (bvshl (bvshl (bvshl (bvshl .cse47 (_ bv1 32)) (_ bv1 32)) (_ bv1 32)) (_ bv1 32)) (_ bv1 32)) (_ bv1 32)) (_ bv1 32)))) (let ((.cse12 (bvult |base2flt_#in~m| (_ bv16777216 32))) (.cse11 (bvult .cse47 (_ bv16777216 32))) (.cse10 (bvult .cse46 (_ bv16777216 32))) (.cse13 (= |base2flt_#in~m| (_ bv0 32))) (.cse40 (bvult .cse45 (_ bv16777216 32))) (.cse41 (bvult (bvshl .cse45 (_ bv1 32)) (_ bv16777216 32)))) (or (not .cse10) (and (not .cse11) .cse12) .cse2 (not .cse13) (and .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 (= base2flt_~m (_ bv0 32)) .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 (or (not .cse12) .cse11) .cse27 .cse10 .cse13 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 (or (not .cse40) .cse41) .cse42 .cse43) .cse44 (and .cse40 (not .cse41)) .cse9))))) (let ((.cse61 (= |base2flt_#in~m| (_ bv1 32)))) (let ((.cse51 (let ((.cse123 (let ((.cse125 (let ((.cse127 (or (and .cse28 .cse35) .cse35))) (or (and (= base2flt_~m (_ bv2 32)) .cse61 .cse127) (and .cse61 .cse127))))) (or (and .cse124 .cse125 .cse35) (and .cse124 .cse125 .cse126 .cse35))))) (or (and .cse16 .cse61 .cse24 .cse33 .cse123) (and .cse16 .cse61 .cse33 .cse123) (and .cse61 .cse33 .cse123) (and .cse61 .cse123) (and (= base2flt_~m (_ bv4 32)) .cse61 .cse123))))) (let ((.cse54 (let ((.cse113 (and .cse61 .cse51 .cse33)) (.cse114 (and .cse61 .cse51)) (.cse115 (and .cse16 .cse21 .cse61 .cse24 .cse51 .cse33 .cse39)) (.cse116 (and .cse16 .cse21 .cse22 .cse23 .cse61 .cse24 .cse51 .cse33 .cse39)) (.cse117 (and .cse16 .cse21 .cse22 .cse61 .cse24 .cse51 .cse33 .cse39)) (.cse119 (and .cse16 .cse61 .cse51 .cse33)) (.cse120 (and (= base2flt_~m (_ bv64 32)) .cse61 .cse51)) (.cse121 (and .cse16 .cse61 .cse24 .cse51 .cse33 .cse39)) (.cse122 (and .cse16 .cse61 .cse24 .cse51 .cse33))) (or .cse113 .cse114 .cse115 .cse116 .cse117 (and .cse118 (or .cse113 .cse114 .cse115 .cse116 .cse117 .cse119 .cse120 .cse121 .cse122)) .cse119 .cse120 .cse121 .cse122)))) (let ((.cse90 (and .cse61 .cse54)) (.cse91 (and .cse14 .cse16 .cse17 .cse19 .cse20 .cse61 .cse29 .cse30 .cse31 .cse33 .cse36 .cse37 .cse38 .cse54 .cse42 .cse43)) (.cse92 (and .cse14 .cse16 .cse17 .cse19 .cse20 .cse61 .cse30 .cse31 .cse33 .cse34 .cse38 .cse54 .cse42)) (.cse93 (and .cse16 .cse20 .cse61 .cse33 .cse54)) (.cse94 (and .cse16 .cse61 .cse33 .cse54)) (.cse95 (and .cse14 .cse16 .cse17 .cse61 .cse31 .cse33 .cse37 .cse38 .cse54)) (.cse96 (and .cse16 .cse20 .cse61 .cse31 .cse33 .cse54)) (.cse97 (and .cse61 .cse33 .cse54)) (.cse98 (and .cse14 .cse20 .cse61 .cse31 .cse33 .cse37 .cse38 .cse54)) (.cse105 (and .cse14 .cse16 .cse17 .cse20 .cse61 .cse30 .cse33 .cse37 .cse38 .cse54)) (.cse106 (and .cse14 .cse16 .cse17 .cse20 .cse61 .cse30 .cse31 .cse33 .cse34 .cse37 .cse54)) (.cse107 (and .cse16 .cse17 .cse20 .cse61 .cse30 .cse31 .cse33 .cse34 .cse37 .cse38 .cse54 .cse42)) (.cse108 (and .cse16 .cse20 .cse61 .cse31 .cse33 .cse38 .cse54)) (.cse109 (and .cse14 .cse16 .cse20 .cse61 .cse31 .cse33 .cse38 .cse54)) (.cse110 (and .cse14 .cse16 .cse17 .cse19 .cse20 .cse61 .cse31 .cse33 .cse34 .cse36 .cse37 .cse38 .cse54 .cse42 .cse43)) (.cse111 (and .cse14 .cse16 .cse19 .cse20 .cse61 .cse30 .cse31 .cse33 .cse34 .cse36 .cse37 .cse38 .cse54 .cse42)) (.cse112 (and .cse61 .cse54 (= base2flt_~m (_ bv16384 32))))) (let ((.cse53 (or .cse90 .cse91 .cse92 .cse93 .cse94 .cse95 .cse96 .cse97 .cse98 .cse105 .cse106 .cse107 .cse108 .cse109 .cse110 .cse111 .cse112))) (let ((.cse63 (let ((.cse73 (or .cse90 .cse91 .cse92 .cse93 .cse94 .cse95 .cse96 .cse97 .cse98 (and .cse99 .cse100 .cse101 .cse102 .cse103 .cse53 .cse104) .cse105 .cse106 .cse107 .cse108 .cse109 .cse110 .cse111 .cse112))) (or (and .cse65 .cse66 .cse67 .cse68 .cse69 .cse70 .cse71 .cse72 .cse73 .cse74 .cse75 .cse76 .cse77 .cse78 .cse79 .cse80 .cse81 .cse82 .cse83 .cse84 .cse85 .cse86 .cse87 .cse35 .cse88 .cse89) (and .cse73 .cse35 (= base2flt_~e (bvadd (_ bv4294967295 32) (bvadd (bvadd (bvadd (_ bv4294967295 32) (_ bv4294967276 32)) (_ bv4294967295 32)) (_ bv4294967295 32))))))))) (let ((.cse49 (and .cse18 .cse62 .cse63 .cse64 .cse32)) (.cse56 (and .cse18 .cse62 .cse26 .cse63 .cse64 .cse32))) (let ((.cse55 (and .cse26 (or .cse49 .cse56)))) (let ((.cse48 (and (or .cse49 .cse55 .cse56) .cse26))) (or .cse48 .cse49 .cse2 (and .cse50 .cse51 .cse52) (and .cse53 .cse44) (and .cse44 .cse54) .cse55 (and (or .cse48 .cse49 .cse55 .cse56) .cse26) (and .cse57 .cse58 .cse54) (and .cse59 .cse53 .cse60) .cse44 (not .cse61) (and .cse51 .cse44) .cse56 .cse9)))))))))))))))))))))))))))))))))))))))) [2023-02-18 07:45:26,310 INFO L899 garLoopResultBuilder]: For program point base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 77) no Hoare annotation was computed. [2023-02-18 07:45:26,311 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 24 82) the Hoare annotation is: true [2023-02-18 07:45:26,311 INFO L899 garLoopResultBuilder]: For program point L38(lines 37 52) no Hoare annotation was computed. [2023-02-18 07:45:26,311 INFO L899 garLoopResultBuilder]: For program point base2fltFINAL(lines 24 82) no Hoare annotation was computed. [2023-02-18 07:45:26,311 INFO L899 garLoopResultBuilder]: For program point L59(lines 57 72) no Hoare annotation was computed. [2023-02-18 07:45:26,311 INFO L899 garLoopResultBuilder]: For program point base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 45) no Hoare annotation was computed. [2023-02-18 07:45:26,311 INFO L899 garLoopResultBuilder]: For program point base2fltEXIT(lines 24 82) no Hoare annotation was computed. [2023-02-18 07:45:26,311 INFO L899 garLoopResultBuilder]: For program point L47(lines 47 51) no Hoare annotation was computed. [2023-02-18 07:45:26,313 INFO L895 garLoopResultBuilder]: At program point L47-1(lines 37 52) the Hoare annotation is: (let ((.cse141 (bvadd base2flt_~e (_ bv4294967295 32)))) (let ((.cse144 (bvadd (_ bv4294967295 32) .cse141))) (let ((.cse142 (bvadd (_ bv4294967295 32) .cse144))) (let ((.cse140 (bvadd (_ bv4294967295 32) .cse142))) (let ((.cse162 (bvadd (_ bv4294967295 32) .cse140))) (let ((.cse153 (bvadd (_ bv4294967295 32) .cse162))) (let ((.cse149 (bvadd (_ bv4294967295 32) .cse153))) (let ((.cse148 (bvadd (_ bv4294967295 32) .cse149))) (let ((.cse157 (bvadd (_ bv4294967295 32) .cse148))) (let ((.cse154 (bvadd (_ bv4294967295 32) .cse157))) (let ((.cse150 (bvadd .cse154 (_ bv4294967295 32)))) (let ((.cse160 (bvadd (_ bv4294967295 32) .cse150))) (let ((.cse145 (bvadd (_ bv4294967295 32) .cse160))) (let ((.cse155 (bvadd (_ bv4294967295 32) .cse145))) (let ((.cse147 (bvadd (_ bv4294967295 32) .cse155))) (let ((.cse158 (bvadd (_ bv4294967295 32) .cse147))) (let ((.cse146 (bvadd (_ bv4294967295 32) .cse158))) (let ((.cse156 (bvadd .cse146 (_ bv4294967295 32)))) (let ((.cse159 (bvadd (_ bv4294967295 32) .cse156))) (let ((.cse163 (bvadd (_ bv4294967295 32) .cse159))) (let ((.cse152 (bvadd .cse163 (_ bv4294967295 32))) (.cse94 (bvadd base2flt_~e (_ bv1 32))) (.cse168 (bvadd (bvadd (_ bv4294967293 32) |base2flt_#in~e|) (_ bv4294967295 32)))) (let ((.cse164 (bvadd .cse168 (_ bv4294967295 32))) (.cse77 (bvadd (_ bv1 32) .cse94)) (.cse161 (bvadd (_ bv4294967295 32) .cse152)) (.cse80 (= |base2flt_#in~e| (_ bv0 32))) (.cse167 (bvadd (bvadd (_ bv4294967289 32) |base2flt_#in~e|) (_ bv4294967295 32)))) (let ((.cse138 ((_ sign_extend 1) base2flt_~e)) (.cse139 ((_ sign_extend 1) .cse141)) (.cse143 (bvadd (_ bv4294967295 32) .cse167)) (.cse166 (bvadd (_ bv4294967295 32) (bvadd (_ bv4294967285 32) |base2flt_#in~e|))) (.cse114 (not .cse80)) (.cse151 (bvadd (_ bv4294967295 32) .cse161)) (.cse99 (bvadd .cse77 (_ bv1 32))) (.cse36 (bvadd (_ bv4294967295 32) |base2flt_#in~e|)) (.cse165 (bvadd (_ bv4294967295 32) .cse164))) (let ((.cse68 (= base2flt_~e .cse165)) (.cse70 (= .cse164 .cse94)) (.cse66 (= base2flt_~e (bvadd (_ bv4294967295 32) (bvadd |base2flt_#in~e| (_ bv4294967283 32))))) (.cse53 (= |base2flt_#in~e| .cse77)) (.cse73 (= .cse36 .cse94)) (.cse54 (= .cse99 |base2flt_#in~e|)) (.cse30 (bvsle (bvadd ((_ sign_extend 1) (bvadd .cse151 (_ bv4294967295 32))) (_ bv128 33)) (_ bv2147483647 33))) (.cse61 (or (not (bvsle .cse155 (_ bv4294967168 32))) .cse114)) (.cse62 (or (not (bvsle .cse145 (_ bv4294967168 32))) .cse114)) (.cse63 (or (not (bvsle .cse160 (_ bv4294967168 32))) .cse114)) (.cse48 (= base2flt_~e .cse166)) (.cse56 (= base2flt_~e .cse168)) (.cse57 (or (not (bvsle .cse150 (_ bv4294967168 32))) .cse114)) (.cse49 (= .cse143 .cse94)) (.cse72 (= base2flt_~e .cse36)) (.cse59 (= |base2flt_#in~e| .cse94)) (.cse55 (= base2flt_~e .cse167)) (.cse52 (= .cse94 .cse166)) (.cse60 (= .cse165 .cse94)) (.cse50 (= .cse143 .cse77)) (.cse67 (= base2flt_~e .cse164)) (.cse29 (exists ((|v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1| (_ BitVec 8))) (= base2flt_~e ((_ sign_extend 24) |v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1|)))) (.cse65 (= base2flt_~e |base2flt_#in~e|)) (.cse31 (exists ((|v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2| (_ BitVec 8))) (= base2flt_~e ((_ sign_extend 24) |v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2|)))) (.cse58 (or (not (bvsle .cse154 (_ bv4294967168 32))) .cse114)) (.cse51 (or (not (bvsle .cse157 (_ bv4294967168 32))) .cse114)) (.cse39 (or (not (bvsle .cse148 (_ bv4294967168 32))) .cse114)) (.cse40 (or (not (bvsle .cse153 (_ bv4294967168 32))) .cse114)) (.cse41 (or (not (bvsle .cse162 (_ bv4294967168 32))) .cse114)) (.cse46 (or (not (bvsle .cse149 (_ bv4294967168 32))) .cse114)) (.cse0 (bvsle (bvadd ((_ sign_extend 1) .cse163) (_ bv128 33)) (_ bv2147483647 33))) (.cse22 (bvsle (bvadd ((_ sign_extend 1) .cse162) (_ bv128 33)) (_ bv2147483647 33))) (.cse2 (bvsle (bvadd ((_ sign_extend 1) .cse161) (_ bv128 33)) (_ bv2147483647 33))) (.cse23 (bvsle (bvadd ((_ sign_extend 1) .cse140) (_ bv128 33)) (_ bv2147483647 33))) (.cse3 (bvsle (bvadd ((_ sign_extend 1) .cse160) (_ bv128 33)) (_ bv2147483647 33))) (.cse4 (bvsle (bvadd ((_ sign_extend 1) .cse159) (_ bv128 33)) (_ bv2147483647 33))) (.cse6 (bvsle (bvadd ((_ sign_extend 1) .cse158) (_ bv128 33)) (_ bv2147483647 33))) (.cse20 (bvsle (bvadd ((_ sign_extend 1) .cse157) (_ bv128 33)) (_ bv2147483647 33))) (.cse7 (bvsle (bvadd ((_ sign_extend 1) .cse156) (_ bv128 33)) (_ bv2147483647 33))) (.cse24 (bvsle (bvadd ((_ sign_extend 1) .cse144) (_ bv128 33)) (_ bv2147483647 33))) (.cse8 (bvsle (bvadd ((_ sign_extend 1) .cse155) (_ bv128 33)) (_ bv2147483647 33))) (.cse9 (bvsle (bvadd ((_ sign_extend 1) .cse154) (_ bv128 33)) (_ bv2147483647 33))) (.cse25 (bvsle (bvadd ((_ sign_extend 1) .cse153) (_ bv128 33)) (_ bv2147483647 33))) (.cse10 (bvsle (bvadd ((_ sign_extend 1) .cse152) (_ bv128 33)) (_ bv2147483647 33))) (.cse11 (bvsle (bvadd ((_ sign_extend 1) .cse151) (_ bv128 33)) (_ bv2147483647 33))) (.cse32 (bvsle (bvadd .cse139 (_ bv128 33)) (_ bv2147483647 33))) (.cse12 (bvsle (bvadd ((_ sign_extend 1) .cse150) (_ bv128 33)) (_ bv2147483647 33))) (.cse26 (bvsle (bvadd ((_ sign_extend 1) .cse142) (_ bv128 33)) (_ bv2147483647 33))) (.cse27 (bvsle (bvadd ((_ sign_extend 1) .cse149) (_ bv128 33)) (_ bv2147483647 33))) (.cse21 (bvsle (bvadd ((_ sign_extend 1) .cse148) (_ bv128 33)) (_ bv2147483647 33))) (.cse13 (bvsle (bvadd ((_ sign_extend 1) .cse147) (_ bv128 33)) (_ bv2147483647 33))) (.cse17 (bvsle (bvadd ((_ sign_extend 1) .cse146) (_ bv128 33)) (_ bv2147483647 33))) (.cse33 (bvsle (bvadd .cse138 (_ bv128 33)) (_ bv2147483647 33))) (.cse19 (bvsle (bvadd ((_ sign_extend 1) .cse145) (_ bv128 33)) (_ bv2147483647 33))) (.cse37 (or .cse114 (not (bvsle .cse144 (_ bv4294967168 32))))) (.cse38 (or (not (bvsle base2flt_~e (_ bv4294967168 32))) .cse114)) (.cse64 (= base2flt_~e .cse143)) (.cse1 (exists ((|v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1| (_ BitVec 8))) (= |base2flt_#in~e| ((_ sign_extend 24) |v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1|)))) (.cse42 (or (not (bvsle .cse142 (_ bv4294967168 32))) .cse114)) (.cse43 (or (not (bvsle .cse141 (_ bv4294967168 32))) .cse114)) (.cse5 (exists ((|v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2| (_ BitVec 8))) (= ((_ sign_extend 24) |v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2|) .cse94))) (.cse44 (or (not (bvsle .cse140 (_ bv4294967168 32))) .cse114)) (.cse14 (not (bvsle .cse94 (_ bv4294967168 32)))) (.cse16 (exists ((|v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2| (_ BitVec 8))) (= |base2flt_#in~e| ((_ sign_extend 24) |v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2|)))) (.cse47 (bvult base2flt_~m (_ bv16777216 32))) (.cse74 (bvsle (_ bv6442450944 33) (bvadd .cse139 (_ bv8589934591 33)))) (.cse75 (bvsle (_ bv6442450944 33) (bvadd (_ bv8589934591 33) .cse138))) (.cse28 (forall ((|v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1| (_ BitVec 8))) (not (= |base2flt_#in~e| ((_ sign_extend 24) |v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1|))))) (.cse35 (forall ((|v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2| (_ BitVec 8))) (not (= |base2flt_#in~e| ((_ sign_extend 24) |v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2|)))))) (and (let ((.cse34 (bvsle (_ bv6442450944 33) (bvadd ((_ sign_extend 1) .cse36) (_ bv8589934591 33))))) (let ((.cse15 (let ((.cse45 (let ((.cse69 (let ((.cse71 (or (and .cse34 .cse74) (and .cse34 .cse75)))) (or (and .cse65 .cse71 .cse47) (and .cse38 .cse71 .cse47) (and .cse37 .cse38 .cse43 .cse71 .cse47) (and .cse72 .cse71 .cse47) (and .cse71 .cse47) (and .cse73 .cse71 .cse47) (and .cse38 .cse43 .cse71 .cse47))))) (or (and .cse38 .cse43 .cse69 .cse47) (and .cse38 .cse69 .cse47) (and .cse37 .cse38 .cse43 .cse69 .cse47) (and .cse69 .cse70 .cse47) (and .cse67 .cse69 .cse47) (and .cse37 .cse38 .cse40 .cse41 .cse42 .cse43 .cse44 .cse69 .cse47) (and .cse59 .cse69 .cse47) (and .cse69 .cse47) (and .cse54 .cse69 .cse47) (and .cse53 .cse69 .cse47) (and .cse37 .cse38 .cse42 .cse43 .cse44 .cse69 .cse47) (and .cse65 .cse69 .cse47) (and .cse37 .cse38 .cse42 .cse43 .cse69 .cse47) (and .cse56 .cse69 .cse47) (and .cse37 .cse38 .cse41 .cse42 .cse43 .cse44 .cse69 .cse47))))) (or (and .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47) (and .cse45 .cse47 .cse48) (and .cse49 .cse45 .cse47) (and .cse50 .cse45 .cse47) (and .cse37 .cse38 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse47) (and .cse51 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47) (and .cse37 .cse38 .cse42 .cse43 .cse45 .cse47) (and .cse52 .cse45 .cse47) (and .cse53 .cse45 .cse47) (and .cse54 .cse45 .cse47) (and .cse45 .cse55 .cse47) (and .cse56 .cse45 .cse47) (and .cse51 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse57 .cse58 .cse44 .cse45 .cse46 .cse47) (and .cse37 .cse38 .cse43 .cse45 .cse47) (and .cse59 .cse45 .cse47) (and .cse45 .cse60 .cse47) (and .cse38 .cse45 .cse47) (and .cse51 .cse37 .cse38 .cse61 .cse39 .cse40 .cse41 .cse42 .cse43 .cse57 .cse58 .cse62 .cse63 .cse44 .cse45 .cse46 .cse47) (and .cse37 .cse38 .cse41 .cse42 .cse43 .cse44 .cse45 .cse47) (and .cse64 .cse45 .cse47) (and .cse65 .cse45 .cse47) (and .cse66 .cse45 .cse47) (and .cse51 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse57 .cse58 .cse62 .cse63 .cse44 .cse45 .cse46 .cse47) (and .cse51 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse57 .cse58 .cse63 .cse44 .cse45 .cse46 .cse47) (and .cse67 .cse45 .cse47) (and .cse68 .cse45 .cse47) (and .cse38 .cse43 .cse45 .cse47) (and .cse37 .cse38 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47) (and .cse45 .cse47) (and .cse51 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse58 .cse44 .cse45 .cse46 .cse47) (and .cse37 .cse38 .cse42 .cse43 .cse44 .cse45 .cse47)))) (.cse18 (bvsle (bvadd ((_ sign_extend 1) (bvadd (bvadd (bvadd (_ bv4294967295 32) (bvadd (_ bv4294967295 32) (bvadd (_ bv4294967295 32) (bvadd (_ bv4294967295 32) (bvadd (bvadd (_ bv4294967295 32) (bvadd (_ bv4294967295 32) (bvadd (bvadd (_ bv4294967295 32) (bvadd (_ bv4294967295 32) (bvadd (_ bv4294967295 32) (bvadd (_ bv4294967295 32) (bvadd (bvadd (_ bv4294967295 32) (bvadd (bvadd (_ bv4294967295 32) (bvadd (_ bv4294967295 32) (bvadd (_ bv4294967295 32) (bvadd (_ bv4294967295 32) (bvadd (_ bv4294967295 32) (bvadd (_ bv4294967295 32) .cse36)))))) (_ bv4294967295 32))) (_ bv4294967295 32)))))) (_ bv4294967295 32)))) (_ bv4294967295 32)))))) (_ bv4294967295 32)) (_ bv4294967295 32))) (_ bv128 33)) (_ bv2147483647 33)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse10 .cse11 .cse14 .cse15 .cse16 .cse18) (and .cse0 .cse1 .cse2 .cse5 .cse10 .cse11 .cse14 .cse15 .cse16 .cse18) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse20 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse21 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (and .cse0 .cse22 .cse1 .cse2 .cse23 .cse3 .cse4 .cse5 .cse6 .cse20 .cse7 .cse24 .cse8 .cse9 .cse25 .cse10 .cse11 .cse12 .cse26 .cse27 .cse21 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (and .cse1 .cse2 .cse5 .cse10 .cse11 .cse14 .cse15 .cse16 .cse18) (and .cse0 .cse22 .cse1 .cse2 .cse23 .cse3 .cse4 .cse5 .cse6 .cse20 .cse7 .cse8 .cse9 .cse25 .cse10 .cse11 .cse12 .cse26 .cse27 .cse21 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (and .cse1 .cse5 .cse11 .cse14 .cse15 .cse16 .cse18) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse7 .cse10 .cse11 .cse14 .cse15 .cse16 .cse18) .cse28 (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse7 .cse10 .cse11 .cse14 .cse15 .cse16 .cse17 .cse18) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (and .cse29 .cse1 .cse30 .cse31 .cse15 .cse16 .cse18) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse20 .cse7 .cse8 .cse9 .cse25 .cse10 .cse11 .cse12 .cse27 .cse21 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse20 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse27 .cse21 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (and .cse0 .cse22 .cse1 .cse2 .cse23 .cse3 .cse4 .cse5 .cse6 .cse20 .cse7 .cse8 .cse9 .cse25 .cse10 .cse11 .cse12 .cse27 .cse21 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (and .cse1 .cse5 (or (and .cse0 .cse22 .cse2 .cse23 .cse3 .cse4 .cse6 .cse20 .cse7 .cse24 .cse8 .cse9 .cse25 .cse10 .cse11 .cse32 .cse12 .cse26 .cse27 .cse21 .cse13 .cse15 .cse17 .cse18 .cse33 .cse19) (and .cse0 .cse22 .cse2 .cse23 .cse3 .cse4 .cse6 .cse20 .cse7 .cse24 .cse8 .cse9 .cse25 .cse10 .cse11 .cse32 .cse12 .cse26 .cse27 .cse21 .cse13 .cse15 .cse17 .cse18 .cse19)) .cse14 .cse16) (not .cse18) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse20 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse10 .cse11 .cse14 .cse15 .cse16 .cse17 .cse18) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse11 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18) (and .cse1 .cse2 .cse5 .cse11 .cse14 .cse15 .cse16 .cse18) (not .cse34) (and .cse0 .cse22 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse20 .cse7 .cse8 .cse9 .cse25 .cse10 .cse11 .cse12 .cse27 .cse21 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) .cse35))) (let ((.cse134 (bvshl base2flt_~m (_ bv1 32)))) (let ((.cse128 (bvshl .cse134 (_ bv1 32)))) (let ((.cse127 (bvshl .cse128 (_ bv1 32)))) (let ((.cse131 (bvshl .cse127 (_ bv1 32)))) (let ((.cse130 (bvshl .cse131 (_ bv1 32)))) (let ((.cse133 (bvshl .cse130 (_ bv1 32)))) (let ((.cse132 (bvshl .cse133 (_ bv1 32)))) (let ((.cse129 (bvshl .cse132 (_ bv1 32)))) (let ((.cse126 (bvshl .cse129 (_ bv1 32)))) (let ((.cse125 (bvshl .cse126 (_ bv1 32)))) (let ((.cse123 (bvshl .cse125 (_ bv1 32)))) (let ((.cse124 (bvshl .cse123 (_ bv1 32)))) (let ((.cse101 (bvshl .cse124 (_ bv1 32))) (.cse116 (bvadd (_ bv4294967295 32) (_ bv4294967276 32))) (.cse106 (= base2flt_~m (_ bv2 32))) (.cse76 (= |base2flt_#in~m| (_ bv1 32)))) (let ((.cse105 (or (and .cse106 .cse76 .cse80) (and .cse76 .cse80))) (.cse111 (bvadd (_ bv4294967295 32) (_ bv4294967290 32))) (.cse82 (bvult .cse134 (_ bv16777216 32))) (.cse110 (bvult .cse133 (_ bv16777216 32))) (.cse118 (bvult .cse132 (_ bv16777216 32))) (.cse108 (bvult .cse131 (_ bv16777216 32))) (.cse109 (bvult .cse130 (_ bv16777216 32))) (.cse117 (bvult .cse129 (_ bv16777216 32))) (.cse98 (bvult .cse128 (_ bv16777216 32))) (.cse104 (bvult .cse127 (_ bv16777216 32))) (.cse119 (bvult .cse126 (_ bv16777216 32))) (.cse102 (bvadd .cse116 (_ bv4294967295 32))) (.cse112 (bvadd (_ bv4294967286 32) (_ bv4294967295 32))) (.cse120 (bvult .cse125 (_ bv16777216 32))) (.cse100 (bvult .cse101 (_ bv16777216 32))) (.cse122 (bvult .cse124 (_ bv16777216 32))) (.cse121 (bvult .cse123 (_ bv16777216 32))) (.cse107 (bvadd (_ bv4294967295 32) (_ bv0 32)))) (let ((.cse97 (bvadd (_ bv4294967295 32) .cse107)) (.cse89 (or .cse122 (not .cse121))) (.cse93 (or (not .cse122) .cse100)) (.cse84 (or .cse121 (not .cse120))) (.cse86 (bvadd (_ bv4294967295 32) (_ bv4294967281 32))) (.cse96 (bvadd .cse112 (_ bv4294967295 32))) (.cse78 (bvadd (_ bv4294967295 32) (_ bv4294967293 32))) (.cse113 (bvadd .cse102 (_ bv4294967295 32))) (.cse92 (or .cse120 (not .cse119))) (.cse115 (bvadd (_ bv4294967295 32) (_ bv4294967278 32))) (.cse87 (or (not .cse98) .cse104)) (.cse88 (or .cse119 (not .cse117))) (.cse81 (or (not .cse108) .cse109)) (.cse83 (or (not .cse110) .cse118)) (.cse95 (or .cse117 (not .cse118))) (.cse90 (or .cse110 (not .cse109))) (.cse91 (or .cse108 (not .cse104))) (.cse85 (or (not .cse82) .cse98)) (.cse103 (bvadd (_ bv4294967295 32) .cse111)) (.cse79 (or (and .cse105 .cse75 .cse74 .cse80) (and .cse105 .cse75 .cse80)))) (or (and (= base2flt_~m (_ bv64 32)) .cse1 .cse5 .cse76 .cse68 (= .cse77 .cse78) .cse79 .cse14 .cse16 .cse70 .cse47 .cse80) (and .cse81 .cse51 .cse37 .cse38 .cse82 .cse39 .cse83 .cse1 .cse84 .cse40 .cse85 .cse41 .cse42 .cse43 .cse5 .cse76 .cse57 .cse58 .cse62 .cse63 .cse44 .cse79 (= base2flt_~e .cse86) .cse14 .cse87 .cse16 .cse46 .cse47 .cse88 .cse80 .cse89 .cse90 .cse91 .cse92 .cse93) (and .cse81 .cse51 .cse37 .cse38 .cse82 .cse39 .cse1 .cse84 .cse40 .cse85 .cse41 .cse42 .cse43 .cse5 .cse76 .cse57 .cse58 .cse63 .cse44 (= .cse86 .cse94) .cse79 .cse95 .cse14 .cse87 .cse16 .cse46 .cse47 .cse88 .cse80 .cse89 .cse90 .cse91 .cse92) (and .cse66 .cse1 .cse5 .cse76 .cse79 .cse14 .cse16 .cse47 .cse80 (= .cse96 .cse77) (= base2flt_~m (_ bv16384 32))) (and (= base2flt_~m (_ bv4 32)) .cse53 .cse73 .cse1 .cse5 .cse76 .cse79 .cse14 .cse16 .cse80 (= base2flt_~e .cse97)) (and .cse37 (= .cse97 .cse94) .cse38 .cse82 .cse1 .cse43 .cse5 .cse76 .cse54 .cse98 (= base2flt_~m (_ bv8 32)) .cse79 .cse14 .cse16 .cse47 .cse80) (and .cse37 .cse0 .cse38 .cse82 .cse22 .cse1 .cse2 .cse23 .cse3 .cse85 .cse42 .cse43 .cse4 .cse5 .cse6 .cse20 .cse76 .cse7 .cse24 .cse8 .cse9 .cse30 .cse25 .cse10 .cse11 .cse32 .cse12 .cse26 .cse27 .cse44 .cse21 .cse79 .cse13 .cse14 .cse87 .cse16 .cse17 .cse47 .cse80 .cse33 .cse19 .cse91) (and .cse81 .cse51 .cse37 .cse38 .cse61 .cse82 .cse39 .cse83 .cse1 .cse84 .cse40 .cse85 .cse41 .cse42 .cse43 .cse5 .cse76 .cse57 .cse58 .cse62 .cse63 (= .cse99 .cse96) .cse44 .cse79 (or (not .cse100) (bvult (bvshl .cse101 (_ bv1 32)) (_ bv16777216 32))) .cse95 .cse14 .cse87 .cse16 .cse46 .cse47 .cse80 .cse89 .cse90 .cse91 .cse92 .cse93) (and .cse81 .cse37 .cse38 .cse82 .cse83 .cse1 .cse40 .cse41 .cse42 .cse43 .cse5 .cse76 .cse44 .cse79 .cse14 .cse87 .cse16 .cse46 .cse47 .cse80 (= base2flt_~e .cse102) .cse90 .cse91) .cse28 (and .cse38 .cse82 .cse1 (= base2flt_~m (_ bv4096 32)) .cse43 .cse5 .cse76 .cse79 .cse14 .cse16 .cse47 .cse80 (= base2flt_~e .cse96) .cse48) (and .cse38 .cse82 .cse1 .cse43 .cse5 .cse76 (= base2flt_~m (_ bv16 32)) (= base2flt_~e .cse78) .cse56 .cse79 .cse14 .cse16 .cse47 .cse80) (and .cse0 .cse22 .cse1 .cse2 .cse23 .cse3 .cse4 .cse5 .cse6 .cse20 .cse76 .cse7 .cse24 .cse8 .cse9 .cse25 .cse10 .cse11 .cse32 .cse12 .cse26 .cse27 .cse21 .cse79 .cse13 .cse14 .cse16 .cse17 .cse47 .cse80 .cse33 .cse19) (and .cse81 .cse51 .cse37 .cse38 .cse82 .cse39 .cse83 .cse1 .cse84 .cse40 (= .cse86 .cse77) .cse85 .cse41 .cse42 .cse43 .cse5 .cse76 .cse57 .cse58 .cse44 .cse79 .cse95 .cse14 .cse87 .cse16 .cse46 .cse47 .cse88 .cse80 .cse91 .cse92) (and .cse37 .cse38 .cse82 .cse49 (= .cse103 .cse77) .cse1 .cse42 .cse43 .cse5 .cse76 .cse98 (= base2flt_~m (_ bv1024 32)) .cse79 .cse14 .cse16 .cse47 .cse80 .cse104) (and .cse105 .cse1 .cse106 (= base2flt_~e .cse107) .cse5 .cse76 .cse72 .cse59 .cse14 .cse16 .cse80 (= .cse94 (_ bv0 32))) (and .cse37 (= base2flt_~m (_ bv256 32)) .cse38 (= base2flt_~e .cse103) .cse82 .cse1 .cse41 .cse42 .cse108 .cse109 .cse43 .cse5 .cse76 .cse98 .cse44 .cse55 .cse79 .cse14 .cse16 .cse47 .cse80 .cse104) (and .cse38 .cse1 (= base2flt_~m (_ bv8192 32)) .cse5 .cse76 .cse52 .cse79 .cse14 .cse16 .cse47 .cse80 (= .cse96 .cse94)) (and .cse0 .cse38 .cse82 .cse22 .cse1 .cse2 .cse23 .cse3 .cse43 .cse4 .cse5 .cse6 .cse20 .cse76 .cse7 .cse24 .cse8 .cse9 .cse25 .cse10 .cse11 .cse32 .cse12 .cse26 .cse27 .cse21 .cse79 .cse13 .cse14 .cse16 .cse17 .cse47 .cse80 .cse33 .cse19) (and .cse37 .cse38 .cse82 (= base2flt_~m (_ bv128 32)) .cse1 .cse40 .cse41 .cse42 .cse108 .cse109 .cse43 .cse110 .cse5 .cse76 .cse98 (= base2flt_~e .cse111) .cse44 .cse79 .cse14 .cse16 .cse60 .cse47 .cse80 .cse104) (and .cse37 .cse0 .cse38 .cse82 .cse22 .cse1 .cse2 .cse23 .cse3 .cse85 .cse42 .cse43 .cse4 .cse5 .cse6 .cse20 .cse76 .cse7 .cse24 .cse8 .cse9 .cse25 .cse10 .cse11 .cse32 .cse12 .cse26 .cse27 .cse21 .cse79 .cse13 .cse14 .cse87 .cse16 .cse17 .cse47 .cse80 .cse33 .cse19) (and .cse37 .cse38 .cse82 .cse50 .cse1 .cse43 .cse5 .cse76 (= base2flt_~e .cse112) .cse98 (= base2flt_~m (_ bv2048 32)) .cse79 .cse14 .cse16 .cse47 .cse80) (and .cse81 .cse37 .cse38 .cse82 .cse1 .cse85 .cse41 .cse42 .cse43 .cse5 .cse76 .cse44 .cse79 .cse14 .cse87 .cse16 .cse47 .cse80 .cse91 (= base2flt_~e (bvadd (_ bv4294967295 32) .cse113))) (and .cse38 .cse1 .cse5 .cse76 (= base2flt_~m (_ bv32 32)) .cse67 .cse79 .cse14 .cse16 (= .cse94 .cse78) .cse47 .cse80) (and .cse29 .cse1 (= base2flt_~m (_ bv1 32)) .cse76 .cse65 .cse31 (= base2flt_~e (_ bv0 32)) .cse16 .cse80) (and .cse81 .cse37 .cse38 .cse1 .cse40 .cse85 .cse41 .cse42 .cse43 .cse5 .cse76 (= base2flt_~e .cse113) .cse44 .cse79 .cse14 .cse87 .cse16 .cse47 .cse80 .cse90 .cse91) .cse114 (not .cse76) (and .cse51 .cse37 .cse38 .cse82 .cse39 .cse83 .cse1 .cse40 .cse85 .cse41 .cse42 .cse43 .cse5 .cse76 .cse58 (= base2flt_~e .cse115) .cse44 .cse79 .cse95 .cse14 .cse87 .cse16 .cse46 .cse47 .cse88 .cse80 .cse90 .cse91 .cse92) (and .cse81 .cse51 .cse37 .cse38 .cse82 .cse39 .cse83 .cse1 (= .cse115 .cse94) .cse40 .cse85 .cse41 .cse42 .cse43 .cse5 .cse76 .cse44 .cse79 .cse95 .cse14 .cse87 .cse16 .cse46 .cse47 .cse88 .cse80 .cse90) (and .cse0 .cse38 .cse22 .cse1 .cse2 .cse23 .cse3 .cse4 .cse5 .cse6 .cse20 .cse76 .cse7 .cse24 .cse8 .cse9 .cse25 .cse10 .cse11 .cse32 .cse12 .cse26 .cse27 .cse21 .cse79 .cse13 .cse14 .cse16 .cse17 .cse47 .cse80 .cse33 .cse19) (and .cse81 .cse37 .cse38 .cse82 .cse39 .cse83 .cse1 .cse40 .cse85 .cse41 .cse42 .cse43 .cse5 .cse76 (= .cse116 base2flt_~e) .cse44 .cse79 .cse95 .cse14 .cse16 .cse46 .cse47 .cse80 .cse90 .cse91) (and .cse37 .cse0 .cse38 .cse82 .cse22 .cse1 .cse2 .cse23 .cse3 .cse85 .cse43 .cse4 .cse5 .cse6 .cse20 .cse76 .cse7 .cse24 .cse8 .cse9 .cse25 .cse10 .cse11 .cse32 .cse12 .cse26 .cse27 .cse21 .cse79 .cse13 .cse14 .cse16 .cse17 .cse47 .cse80 .cse33 .cse19) .cse35 (and .cse37 .cse38 .cse82 .cse64 .cse1 (= .cse103 .cse94) .cse42 .cse108 .cse43 .cse5 (= base2flt_~m (_ bv512 32)) .cse76 .cse98 .cse44 .cse79 .cse14 .cse16 .cse47 .cse80 .cse104))))))))))))))))) (let ((.cse135 (bvshl (bvshl |base2flt_#in~m| (_ bv1 32)) (_ bv1 32)))) (let ((.cse136 (bvshl (bvshl (bvshl (bvshl .cse135 (_ bv1 32)) (_ bv1 32)) (_ bv1 32)) (_ bv1 32)))) (or (not (bvult .cse135 (_ bv16777216 32))) (and (not (bvult .cse136 (_ bv16777216 32))) (bvult |base2flt_#in~m| (_ bv16777216 32))) .cse28 (not (= |base2flt_#in~m| (_ bv0 32))) .cse114 (let ((.cse137 (bvshl (bvshl (bvshl (bvshl (bvshl (bvshl (bvshl .cse136 (_ bv1 32)) (_ bv1 32)) (_ bv1 32)) (_ bv1 32)) (_ bv1 32)) (_ bv1 32)) (_ bv1 32)))) (and (bvult .cse137 (_ bv16777216 32)) (not (bvult (bvshl .cse137 (_ bv1 32)) (_ bv16777216 32))))) .cse35)))))))))))))))))))))))))))) [2023-02-18 07:45:26,314 INFO L899 garLoopResultBuilder]: For program point L35(lines 35 75) no Hoare annotation was computed. [2023-02-18 07:45:26,315 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 175) no Hoare annotation was computed. [2023-02-18 07:45:26,315 INFO L899 garLoopResultBuilder]: For program point L201(line 201) no Hoare annotation was computed. [2023-02-18 07:45:26,316 INFO L902 garLoopResultBuilder]: At program point main_returnLabel#1(lines 220 276) the Hoare annotation is: true [2023-02-18 07:45:26,316 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW(line 178) no Hoare annotation was computed. [2023-02-18 07:45:26,316 INFO L899 garLoopResultBuilder]: For program point L201-1(line 201) no Hoare annotation was computed. [2023-02-18 07:45:26,316 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 172) no Hoare annotation was computed. [2023-02-18 07:45:26,316 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2023-02-18 07:45:26,316 INFO L899 garLoopResultBuilder]: For program point L185(lines 185 190) no Hoare annotation was computed. [2023-02-18 07:45:26,316 INFO L899 garLoopResultBuilder]: For program point L243(lines 243 252) no Hoare annotation was computed. [2023-02-18 07:45:26,317 INFO L899 garLoopResultBuilder]: For program point L243-2(lines 243 252) no Hoare annotation was computed. [2023-02-18 07:45:26,317 INFO L899 garLoopResultBuilder]: For program point L177(line 177) no Hoare annotation was computed. [2023-02-18 07:45:26,317 INFO L899 garLoopResultBuilder]: For program point L177-1(line 177) no Hoare annotation was computed. [2023-02-18 07:45:26,317 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW(line 201) no Hoare annotation was computed. [2023-02-18 07:45:26,317 INFO L899 garLoopResultBuilder]: For program point L260(lines 260 264) no Hoare annotation was computed. [2023-02-18 07:45:26,317 INFO L899 garLoopResultBuilder]: For program point L194(lines 194 211) no Hoare annotation was computed. [2023-02-18 07:45:26,317 INFO L899 garLoopResultBuilder]: For program point L260-2(lines 260 264) no Hoare annotation was computed. [2023-02-18 07:45:26,318 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 172) no Hoare annotation was computed. [2023-02-18 07:45:26,318 INFO L899 garLoopResultBuilder]: For program point L194-2(lines 194 211) no Hoare annotation was computed. [2023-02-18 07:45:26,318 INFO L902 garLoopResultBuilder]: At program point mulflt_returnLabel#1(lines 147 219) the Hoare annotation is: true [2023-02-18 07:45:26,318 INFO L899 garLoopResultBuilder]: For program point L178(line 178) no Hoare annotation was computed. [2023-02-18 07:45:26,319 INFO L899 garLoopResultBuilder]: For program point L178-1(line 178) no Hoare annotation was computed. [2023-02-18 07:45:26,319 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW(line 201) no Hoare annotation was computed. [2023-02-18 07:45:26,320 INFO L899 garLoopResultBuilder]: For program point L203(lines 203 208) no Hoare annotation was computed. [2023-02-18 07:45:26,320 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-02-18 07:45:26,320 INFO L899 garLoopResultBuilder]: For program point L195(lines 195 200) no Hoare annotation was computed. [2023-02-18 07:45:26,320 INFO L899 garLoopResultBuilder]: For program point L179(lines 179 184) no Hoare annotation was computed. [2023-02-18 07:45:26,320 INFO L899 garLoopResultBuilder]: For program point L246(lines 246 250) no Hoare annotation was computed. [2023-02-18 07:45:26,320 INFO L899 garLoopResultBuilder]: For program point L246-2(lines 246 250) no Hoare annotation was computed. [2023-02-18 07:45:26,321 INFO L902 garLoopResultBuilder]: At program point L238(line 238) the Hoare annotation is: true [2023-02-18 07:45:26,321 INFO L899 garLoopResultBuilder]: For program point L238-1(line 238) no Hoare annotation was computed. [2023-02-18 07:45:26,321 INFO L899 garLoopResultBuilder]: For program point L172(line 172) no Hoare annotation was computed. [2023-02-18 07:45:26,321 INFO L899 garLoopResultBuilder]: For program point L172-1(line 172) no Hoare annotation was computed. [2023-02-18 07:45:26,321 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2023-02-18 07:45:26,321 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 177) no Hoare annotation was computed. [2023-02-18 07:45:26,321 INFO L895 garLoopResultBuilder]: At program point L239(line 239) the Hoare annotation is: (= (_ bv0 32) |ULTIMATE.start_main_~zero~0#1|) [2023-02-18 07:45:26,321 INFO L899 garLoopResultBuilder]: For program point L239-1(line 239) no Hoare annotation was computed. [2023-02-18 07:45:26,322 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-02-18 07:45:26,322 INFO L899 garLoopResultBuilder]: For program point L256(lines 256 272) no Hoare annotation was computed. [2023-02-18 07:45:26,322 INFO L899 garLoopResultBuilder]: For program point L256-1(lines 256 272) no Hoare annotation was computed. [2023-02-18 07:45:26,322 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 177) no Hoare annotation was computed. [2023-02-18 07:45:26,322 INFO L895 garLoopResultBuilder]: At program point L240(line 240) the Hoare annotation is: (= (_ bv0 32) |ULTIMATE.start_main_~zero~0#1|) [2023-02-18 07:45:26,322 INFO L899 garLoopResultBuilder]: For program point L240-1(line 240) no Hoare annotation was computed. [2023-02-18 07:45:26,322 INFO L899 garLoopResultBuilder]: For program point L257(lines 257 266) no Hoare annotation was computed. [2023-02-18 07:45:26,323 INFO L902 garLoopResultBuilder]: At program point L257-2(lines 257 266) the Hoare annotation is: true [2023-02-18 07:45:26,323 INFO L899 garLoopResultBuilder]: For program point L158(lines 158 164) no Hoare annotation was computed. [2023-02-18 07:45:26,323 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 175) no Hoare annotation was computed. [2023-02-18 07:45:26,323 INFO L899 garLoopResultBuilder]: For program point L158-2(lines 157 218) no Hoare annotation was computed. [2023-02-18 07:45:26,323 INFO L902 garLoopResultBuilder]: At program point L216(lines 157 218) the Hoare annotation is: true [2023-02-18 07:45:26,323 INFO L895 garLoopResultBuilder]: At program point L241(line 241) the Hoare annotation is: (let ((.cse0 (= (_ bv0 32) |ULTIMATE.start_main_~zero~0#1|))) (or (and (= |ULTIMATE.start_main_~a~0#1| (_ bv0 32)) .cse0) (and (= (_ bv4294967295 32) |ULTIMATE.start_main_~a~0#1|) .cse0) .cse0)) [2023-02-18 07:45:26,323 INFO L899 garLoopResultBuilder]: For program point L241-1(line 241) no Hoare annotation was computed. [2023-02-18 07:45:26,324 INFO L899 garLoopResultBuilder]: For program point L175(line 175) no Hoare annotation was computed. [2023-02-18 07:45:26,324 INFO L899 garLoopResultBuilder]: For program point L175-1(line 175) no Hoare annotation was computed. [2023-02-18 07:45:26,324 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW(line 178) no Hoare annotation was computed. [2023-02-18 07:45:26,324 INFO L899 garLoopResultBuilder]: For program point L17(line 17) no Hoare annotation was computed. [2023-02-18 07:45:26,324 INFO L899 garLoopResultBuilder]: For program point L16(lines 16 18) no Hoare annotation was computed. [2023-02-18 07:45:26,324 INFO L899 garLoopResultBuilder]: For program point L16-2(lines 15 20) no Hoare annotation was computed. [2023-02-18 07:45:26,325 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 15 20) no Hoare annotation was computed. [2023-02-18 07:45:26,325 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 15 20) the Hoare annotation is: true [2023-02-18 07:45:26,328 INFO L445 BasicCegarLoop]: Path program histogram: [4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-18 07:45:26,331 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-02-18 07:45:26,353 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1,QUANTIFIED] [2023-02-18 07:45:26,356 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1,QUANTIFIED] [2023-02-18 07:45:26,356 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2,QUANTIFIED] [2023-02-18 07:45:26,359 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2,QUANTIFIED] [2023-02-18 07:45:26,360 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2,QUANTIFIED] [2023-02-18 07:45:26,361 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1,QUANTIFIED] [2023-02-18 07:45:38,949 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2,QUANTIFIED] [2023-02-18 07:45:38,949 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2,QUANTIFIED] [2023-02-18 07:45:38,949 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_2,QUANTIFIED] [2023-02-18 07:45:38,949 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1,QUANTIFIED] [2023-02-18 07:45:39,223 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1,QUANTIFIED] [2023-02-18 07:45:39,223 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1,QUANTIFIED]