./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/bitvector/soft_float_3a.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_3a.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 95f89ee6bcff8f17eb3e93b344abecdfb8ddea0894d1b25afafccf6235d7ced6 --- Real Ultimate output --- This is Ultimate 0.2.2-?-26d01a9 [2023-02-17 03:45:06,948 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-17 03:45:06,949 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-17 03:45:06,980 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-17 03:45:06,981 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-17 03:45:06,983 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-17 03:45:06,985 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-17 03:45:06,987 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-17 03:45:06,988 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-17 03:45:06,992 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-17 03:45:06,993 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-17 03:45:06,994 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-17 03:45:06,995 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-17 03:45:06,996 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-17 03:45:06,997 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-17 03:45:06,999 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-17 03:45:06,999 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-17 03:45:07,000 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-17 03:45:07,001 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-17 03:45:07,005 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-17 03:45:07,006 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-17 03:45:07,007 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-17 03:45:07,008 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-17 03:45:07,008 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-17 03:45:07,014 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-17 03:45:07,015 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-17 03:45:07,015 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-17 03:45:07,016 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-17 03:45:07,016 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-17 03:45:07,017 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-17 03:45:07,017 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-17 03:45:07,018 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-17 03:45:07,019 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-17 03:45:07,020 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-17 03:45:07,021 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-17 03:45:07,021 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-17 03:45:07,021 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-17 03:45:07,021 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-17 03:45:07,022 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-17 03:45:07,023 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-17 03:45:07,023 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-17 03:45:07,024 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2023-02-17 03:45:07,057 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-17 03:45:07,058 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-17 03:45:07,058 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-17 03:45:07,058 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-17 03:45:07,059 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-17 03:45:07,059 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-17 03:45:07,059 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-17 03:45:07,060 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-17 03:45:07,060 INFO L138 SettingsManager]: * Use SBE=true [2023-02-17 03:45:07,060 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-17 03:45:07,061 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-17 03:45:07,061 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-17 03:45:07,061 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-17 03:45:07,061 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-17 03:45:07,061 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-17 03:45:07,061 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-17 03:45:07,062 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-17 03:45:07,062 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-17 03:45:07,062 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2023-02-17 03:45:07,062 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-17 03:45:07,062 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-17 03:45:07,063 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-17 03:45:07,063 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-17 03:45:07,063 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-17 03:45:07,063 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-17 03:45:07,063 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-17 03:45:07,063 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-17 03:45:07,064 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-17 03:45:07,064 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-17 03:45:07,064 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-17 03:45:07,064 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-17 03:45:07,065 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-17 03:45:07,065 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-17 03:45:07,065 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-17 03:45:07,065 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-17 03:45:07,065 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-17 03:45:07,072 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-17 03:45:07,072 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 -> 95f89ee6bcff8f17eb3e93b344abecdfb8ddea0894d1b25afafccf6235d7ced6 [2023-02-17 03:45:07,266 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-17 03:45:07,291 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-17 03:45:07,293 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-17 03:45:07,294 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-17 03:45:07,294 INFO L275 PluginConnector]: CDTParser initialized [2023-02-17 03:45:07,295 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/soft_float_3a.c.cil.c [2023-02-17 03:45:08,467 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-17 03:45:08,615 INFO L351 CDTParser]: Found 1 translation units. [2023-02-17 03:45:08,615 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_3a.c.cil.c [2023-02-17 03:45:08,621 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/40db47216/95664f1b309f43eebbe2426434443a92/FLAG8d481f683 [2023-02-17 03:45:08,633 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/40db47216/95664f1b309f43eebbe2426434443a92 [2023-02-17 03:45:08,634 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-17 03:45:08,635 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-17 03:45:08,636 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-17 03:45:08,644 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-17 03:45:08,647 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-17 03:45:08,648 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.02 03:45:08" (1/1) ... [2023-02-17 03:45:08,649 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4de76d83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 03:45:08, skipping insertion in model container [2023-02-17 03:45:08,649 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.02 03:45:08" (1/1) ... [2023-02-17 03:45:08,653 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-17 03:45:08,681 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-17 03:45:08,790 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_3a.c.cil.c[728,741] [2023-02-17 03:45:08,832 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-17 03:45:08,842 INFO L203 MainTranslator]: Completed pre-run [2023-02-17 03:45:08,849 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_3a.c.cil.c[728,741] [2023-02-17 03:45:08,882 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-17 03:45:08,892 INFO L208 MainTranslator]: Completed translation [2023-02-17 03:45:08,892 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 03:45:08 WrapperNode [2023-02-17 03:45:08,892 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-17 03:45:08,894 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-17 03:45:08,894 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-17 03:45:08,894 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-17 03:45:08,899 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 03:45:08" (1/1) ... [2023-02-17 03:45:08,908 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 03:45:08" (1/1) ... [2023-02-17 03:45:08,928 INFO L138 Inliner]: procedures = 17, calls = 15, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 178 [2023-02-17 03:45:08,929 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-17 03:45:08,929 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-17 03:45:08,930 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-17 03:45:08,930 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-17 03:45:08,937 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 03:45:08" (1/1) ... [2023-02-17 03:45:08,937 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 03:45:08" (1/1) ... [2023-02-17 03:45:08,939 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 03:45:08" (1/1) ... [2023-02-17 03:45:08,940 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 03:45:08" (1/1) ... [2023-02-17 03:45:08,944 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 03:45:08" (1/1) ... [2023-02-17 03:45:08,947 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 03:45:08" (1/1) ... [2023-02-17 03:45:08,949 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 03:45:08" (1/1) ... [2023-02-17 03:45:08,950 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 03:45:08" (1/1) ... [2023-02-17 03:45:08,953 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-17 03:45:08,954 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-17 03:45:08,954 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-17 03:45:08,954 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-17 03:45:08,955 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 03:45:08" (1/1) ... [2023-02-17 03:45:08,967 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-17 03:45:08,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 03:45:09,009 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-17 03:45:09,033 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-17 03:45:09,047 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-17 03:45:09,047 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-17 03:45:09,048 INFO L130 BoogieDeclarations]: Found specification of procedure base2flt [2023-02-17 03:45:09,049 INFO L138 BoogieDeclarations]: Found implementation of procedure base2flt [2023-02-17 03:45:09,049 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-17 03:45:09,049 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-17 03:45:09,049 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-02-17 03:45:09,049 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-02-17 03:45:09,101 INFO L235 CfgBuilder]: Building ICFG [2023-02-17 03:45:09,102 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-17 03:45:09,496 INFO L276 CfgBuilder]: Performing block encoding [2023-02-17 03:45:09,501 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-17 03:45:09,501 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2023-02-17 03:45:09,503 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 03:45:09 BoogieIcfgContainer [2023-02-17 03:45:09,503 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-17 03:45:09,504 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-17 03:45:09,504 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-17 03:45:09,507 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-17 03:45:09,507 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.02 03:45:08" (1/3) ... [2023-02-17 03:45:09,507 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ff2f1db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.02 03:45:09, skipping insertion in model container [2023-02-17 03:45:09,507 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 03:45:08" (2/3) ... [2023-02-17 03:45:09,507 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ff2f1db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.02 03:45:09, skipping insertion in model container [2023-02-17 03:45:09,508 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 03:45:09" (3/3) ... [2023-02-17 03:45:09,513 INFO L112 eAbstractionObserver]: Analyzing ICFG soft_float_3a.c.cil.c [2023-02-17 03:45:09,526 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-17 03:45:09,526 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 18 error locations. [2023-02-17 03:45:09,583 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-17 03:45:09,591 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;@1374d596, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-17 03:45:09,591 INFO L358 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2023-02-17 03:45:09,595 INFO L276 IsEmpty]: Start isEmpty. Operand has 109 states, 83 states have (on average 1.6867469879518073) internal successors, (140), 102 states have internal predecessors, (140), 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-17 03:45:09,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-02-17 03:45:09,600 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 03:45:09,600 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 03:45:09,601 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2023-02-17 03:45:09,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 03:45:09,604 INFO L85 PathProgramCache]: Analyzing trace with hash 186900082, now seen corresponding path program 1 times [2023-02-17 03:45:09,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 03:45:09,611 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074012275] [2023-02-17 03:45:09,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 03:45:09,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 03:45:09,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:45:09,793 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-17 03:45:09,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 03:45:09,794 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074012275] [2023-02-17 03:45:09,794 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2074012275] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 03:45:09,795 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 03:45:09,795 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-17 03:45:09,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17641853] [2023-02-17 03:45:09,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 03:45:09,800 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-17 03:45:09,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 03:45:09,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-17 03:45:09,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-17 03:45:09,830 INFO L87 Difference]: Start difference. First operand has 109 states, 83 states have (on average 1.6867469879518073) internal successors, (140), 102 states have internal predecessors, (140), 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-17 03:45:09,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 03:45:09,966 INFO L93 Difference]: Finished difference Result 263 states and 382 transitions. [2023-02-17 03:45:09,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-17 03:45:09,968 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-17 03:45:09,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 03:45:09,975 INFO L225 Difference]: With dead ends: 263 [2023-02-17 03:45:09,975 INFO L226 Difference]: Without dead ends: 135 [2023-02-17 03:45:09,978 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-17 03:45:09,980 INFO L413 NwaCegarLoop]: 127 mSDtfsCounter, 83 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 379 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-17 03:45:09,981 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 379 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 03:45:09,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2023-02-17 03:45:10,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 125. [2023-02-17 03:45:10,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 103 states have (on average 1.5339805825242718) internal successors, (158), 118 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-17 03:45:10,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 166 transitions. [2023-02-17 03:45:10,031 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 166 transitions. Word has length 9 [2023-02-17 03:45:10,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 03:45:10,032 INFO L495 AbstractCegarLoop]: Abstraction has 125 states and 166 transitions. [2023-02-17 03:45:10,032 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-17 03:45:10,032 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 166 transitions. [2023-02-17 03:45:10,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-02-17 03:45:10,034 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 03:45:10,034 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 03:45:10,034 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-17 03:45:10,035 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2023-02-17 03:45:10,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 03:45:10,035 INFO L85 PathProgramCache]: Analyzing trace with hash 207635630, now seen corresponding path program 1 times [2023-02-17 03:45:10,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 03:45:10,036 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301021211] [2023-02-17 03:45:10,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 03:45:10,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 03:45:10,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:45:10,128 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-17 03:45:10,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 03:45:10,128 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301021211] [2023-02-17 03:45:10,128 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1301021211] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 03:45:10,130 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 03:45:10,130 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-17 03:45:10,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614294304] [2023-02-17 03:45:10,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 03:45:10,131 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-17 03:45:10,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 03:45:10,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-17 03:45:10,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-02-17 03:45:10,139 INFO L87 Difference]: Start difference. First operand 125 states and 166 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-17 03:45:10,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 03:45:10,243 INFO L93 Difference]: Finished difference Result 275 states and 366 transitions. [2023-02-17 03:45:10,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-17 03:45:10,251 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-17 03:45:10,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 03:45:10,252 INFO L225 Difference]: With dead ends: 275 [2023-02-17 03:45:10,252 INFO L226 Difference]: Without dead ends: 153 [2023-02-17 03:45:10,253 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-17 03:45:10,254 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 128 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 367 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-17 03:45:10,254 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 367 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 03:45:10,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2023-02-17 03:45:10,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 134. [2023-02-17 03:45:10,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 112 states have (on average 1.5178571428571428) internal successors, (170), 127 states have internal predecessors, (170), 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-17 03:45:10,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 178 transitions. [2023-02-17 03:45:10,266 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 178 transitions. Word has length 14 [2023-02-17 03:45:10,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 03:45:10,266 INFO L495 AbstractCegarLoop]: Abstraction has 134 states and 178 transitions. [2023-02-17 03:45:10,266 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-17 03:45:10,266 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 178 transitions. [2023-02-17 03:45:10,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-02-17 03:45:10,267 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 03:45:10,267 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 03:45:10,267 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-17 03:45:10,267 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2023-02-17 03:45:10,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 03:45:10,267 INFO L85 PathProgramCache]: Analyzing trace with hash 2141737346, now seen corresponding path program 1 times [2023-02-17 03:45:10,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 03:45:10,268 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450880985] [2023-02-17 03:45:10,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 03:45:10,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 03:45:10,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:45:10,315 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-17 03:45:10,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 03:45:10,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450880985] [2023-02-17 03:45:10,316 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1450880985] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 03:45:10,316 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 03:45:10,316 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-17 03:45:10,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433262388] [2023-02-17 03:45:10,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 03:45:10,316 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-17 03:45:10,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 03:45:10,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-17 03:45:10,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-17 03:45:10,317 INFO L87 Difference]: Start difference. First operand 134 states and 178 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-17 03:45:10,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 03:45:10,407 INFO L93 Difference]: Finished difference Result 161 states and 207 transitions. [2023-02-17 03:45:10,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-17 03:45:10,408 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-17 03:45:10,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 03:45:10,411 INFO L225 Difference]: With dead ends: 161 [2023-02-17 03:45:10,411 INFO L226 Difference]: Without dead ends: 159 [2023-02-17 03:45:10,415 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-17 03:45:10,417 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 112 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 379 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-17 03:45:10,418 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 379 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 03:45:10,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2023-02-17 03:45:10,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 134. [2023-02-17 03:45:10,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 112 states have (on average 1.5) internal successors, (168), 127 states have internal predecessors, (168), 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-17 03:45:10,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 176 transitions. [2023-02-17 03:45:10,438 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 176 transitions. Word has length 15 [2023-02-17 03:45:10,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 03:45:10,439 INFO L495 AbstractCegarLoop]: Abstraction has 134 states and 176 transitions. [2023-02-17 03:45:10,439 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-17 03:45:10,439 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 176 transitions. [2023-02-17 03:45:10,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-02-17 03:45:10,440 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 03:45:10,440 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 03:45:10,440 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-02-17 03:45:10,440 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting base2fltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2023-02-17 03:45:10,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 03:45:10,441 INFO L85 PathProgramCache]: Analyzing trace with hash -966415747, now seen corresponding path program 1 times [2023-02-17 03:45:10,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 03:45:10,441 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917507365] [2023-02-17 03:45:10,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 03:45:10,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 03:45:10,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:45:10,478 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-17 03:45:10,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 03:45:10,478 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917507365] [2023-02-17 03:45:10,478 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1917507365] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 03:45:10,478 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 03:45:10,479 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-17 03:45:10,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221955700] [2023-02-17 03:45:10,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 03:45:10,479 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-17 03:45:10,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 03:45:10,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-17 03:45:10,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-17 03:45:10,480 INFO L87 Difference]: Start difference. First operand 134 states and 176 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-17 03:45:10,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 03:45:10,501 INFO L93 Difference]: Finished difference Result 142 states and 186 transitions. [2023-02-17 03:45:10,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-17 03:45:10,501 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-17 03:45:10,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 03:45:10,503 INFO L225 Difference]: With dead ends: 142 [2023-02-17 03:45:10,503 INFO L226 Difference]: Without dead ends: 141 [2023-02-17 03:45:10,503 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-17 03:45:10,505 INFO L413 NwaCegarLoop]: 110 mSDtfsCounter, 4 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 200 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-17 03:45:10,507 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 200 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 03:45:10,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2023-02-17 03:45:10,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 131. [2023-02-17 03:45:10,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 110 states have (on average 1.490909090909091) internal successors, (164), 124 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-17 03:45:10,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 172 transitions. [2023-02-17 03:45:10,517 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 172 transitions. Word has length 16 [2023-02-17 03:45:10,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 03:45:10,517 INFO L495 AbstractCegarLoop]: Abstraction has 131 states and 172 transitions. [2023-02-17 03:45:10,517 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-17 03:45:10,518 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 172 transitions. [2023-02-17 03:45:10,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-02-17 03:45:10,518 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 03:45:10,518 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 03:45:10,519 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-02-17 03:45:10,519 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2023-02-17 03:45:10,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 03:45:10,519 INFO L85 PathProgramCache]: Analyzing trace with hash 108044843, now seen corresponding path program 1 times [2023-02-17 03:45:10,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 03:45:10,519 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942964550] [2023-02-17 03:45:10,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 03:45:10,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 03:45:10,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:45:10,560 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-17 03:45:10,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 03:45:10,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942964550] [2023-02-17 03:45:10,561 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [942964550] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 03:45:10,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [787294908] [2023-02-17 03:45:10,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 03:45:10,561 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 03:45:10,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 03:45:10,564 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-17 03:45:10,607 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-17 03:45:10,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:45:10,636 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-17 03:45:10,644 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 03:45:10,671 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-17 03:45:10,672 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 03:45:10,672 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [787294908] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 03:45:10,672 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-17 03:45:10,672 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2023-02-17 03:45:10,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500604969] [2023-02-17 03:45:10,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 03:45:10,673 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-17 03:45:10,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 03:45:10,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-17 03:45:10,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-02-17 03:45:10,674 INFO L87 Difference]: Start difference. First operand 131 states and 172 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-17 03:45:10,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 03:45:10,707 INFO L93 Difference]: Finished difference Result 160 states and 213 transitions. [2023-02-17 03:45:10,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-17 03:45:10,708 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-17 03:45:10,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 03:45:10,709 INFO L225 Difference]: With dead ends: 160 [2023-02-17 03:45:10,709 INFO L226 Difference]: Without dead ends: 159 [2023-02-17 03:45:10,709 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-17 03:45:10,710 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 16 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 317 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-17 03:45:10,710 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 317 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 03:45:10,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2023-02-17 03:45:10,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 133. [2023-02-17 03:45:10,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 112 states have (on average 1.4910714285714286) internal successors, (167), 126 states have internal predecessors, (167), 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-17 03:45:10,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 175 transitions. [2023-02-17 03:45:10,718 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 175 transitions. Word has length 17 [2023-02-17 03:45:10,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 03:45:10,718 INFO L495 AbstractCegarLoop]: Abstraction has 133 states and 175 transitions. [2023-02-17 03:45:10,719 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-17 03:45:10,719 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 175 transitions. [2023-02-17 03:45:10,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-02-17 03:45:10,719 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 03:45:10,720 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 03:45:10,728 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-02-17 03:45:10,930 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-17 03:45:10,935 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2023-02-17 03:45:10,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 03:45:10,935 INFO L85 PathProgramCache]: Analyzing trace with hash -406903932, now seen corresponding path program 1 times [2023-02-17 03:45:10,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 03:45:10,935 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063698129] [2023-02-17 03:45:10,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 03:45:10,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 03:45:10,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:45:11,003 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-17 03:45:11,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 03:45:11,004 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063698129] [2023-02-17 03:45:11,004 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1063698129] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 03:45:11,004 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 03:45:11,004 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-17 03:45:11,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573544379] [2023-02-17 03:45:11,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 03:45:11,005 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-17 03:45:11,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 03:45:11,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-17 03:45:11,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-02-17 03:45:11,006 INFO L87 Difference]: Start difference. First operand 133 states and 175 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-17 03:45:11,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 03:45:11,051 INFO L93 Difference]: Finished difference Result 166 states and 221 transitions. [2023-02-17 03:45:11,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-17 03:45:11,051 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-17 03:45:11,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 03:45:11,052 INFO L225 Difference]: With dead ends: 166 [2023-02-17 03:45:11,052 INFO L226 Difference]: Without dead ends: 164 [2023-02-17 03:45:11,053 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-17 03:45:11,053 INFO L413 NwaCegarLoop]: 114 mSDtfsCounter, 18 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-17 03:45:11,053 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 301 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 03:45:11,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2023-02-17 03:45:11,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 135. [2023-02-17 03:45:11,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 115 states have (on average 1.4695652173913043) internal successors, (169), 128 states have internal predecessors, (169), 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-17 03:45:11,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 177 transitions. [2023-02-17 03:45:11,061 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 177 transitions. Word has length 19 [2023-02-17 03:45:11,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 03:45:11,061 INFO L495 AbstractCegarLoop]: Abstraction has 135 states and 177 transitions. [2023-02-17 03:45:11,062 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-17 03:45:11,062 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 177 transitions. [2023-02-17 03:45:11,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-02-17 03:45:11,063 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 03:45:11,063 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-17 03:45:11,063 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-02-17 03:45:11,063 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2023-02-17 03:45:11,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 03:45:11,064 INFO L85 PathProgramCache]: Analyzing trace with hash 906124417, now seen corresponding path program 1 times [2023-02-17 03:45:11,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 03:45:11,064 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503209097] [2023-02-17 03:45:11,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 03:45:11,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 03:45:11,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:45:11,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-17 03:45:11,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:45:11,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-17 03:45:11,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:45:11,107 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-17 03:45:11,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 03:45:11,107 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503209097] [2023-02-17 03:45:11,108 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1503209097] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 03:45:11,108 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 03:45:11,108 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-17 03:45:11,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966895470] [2023-02-17 03:45:11,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 03:45:11,108 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-17 03:45:11,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 03:45:11,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-17 03:45:11,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-17 03:45:11,110 INFO L87 Difference]: Start difference. First operand 135 states and 177 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-17 03:45:11,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 03:45:11,159 INFO L93 Difference]: Finished difference Result 198 states and 263 transitions. [2023-02-17 03:45:11,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-17 03:45:11,160 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-17 03:45:11,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 03:45:11,161 INFO L225 Difference]: With dead ends: 198 [2023-02-17 03:45:11,161 INFO L226 Difference]: Without dead ends: 196 [2023-02-17 03:45:11,161 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-17 03:45:11,162 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 136 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 295 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.0s IncrementalHoareTripleChecker+Time [2023-02-17 03:45:11,162 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 295 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 03:45:11,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2023-02-17 03:45:11,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 166. [2023-02-17 03:45:11,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 145 states have (on average 1.4758620689655173) internal successors, (214), 158 states have internal predecessors, (214), 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-17 03:45:11,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 222 transitions. [2023-02-17 03:45:11,169 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 222 transitions. Word has length 24 [2023-02-17 03:45:11,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 03:45:11,169 INFO L495 AbstractCegarLoop]: Abstraction has 166 states and 222 transitions. [2023-02-17 03:45:11,169 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-17 03:45:11,169 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 222 transitions. [2023-02-17 03:45:11,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-02-17 03:45:11,170 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 03:45:11,170 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-17 03:45:11,170 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-02-17 03:45:11,171 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2023-02-17 03:45:11,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 03:45:11,171 INFO L85 PathProgramCache]: Analyzing trace with hash 877497061, now seen corresponding path program 1 times [2023-02-17 03:45:11,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 03:45:11,171 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653425881] [2023-02-17 03:45:11,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 03:45:11,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 03:45:11,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:45:11,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-17 03:45:11,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:45:11,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-17 03:45:11,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:45:11,205 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-17 03:45:11,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 03:45:11,205 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653425881] [2023-02-17 03:45:11,205 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [653425881] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 03:45:11,205 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 03:45:11,205 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-17 03:45:11,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982597041] [2023-02-17 03:45:11,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 03:45:11,206 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-17 03:45:11,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 03:45:11,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-17 03:45:11,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-17 03:45:11,207 INFO L87 Difference]: Start difference. First operand 166 states and 222 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-17 03:45:11,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 03:45:11,254 INFO L93 Difference]: Finished difference Result 190 states and 251 transitions. [2023-02-17 03:45:11,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-17 03:45:11,254 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-17 03:45:11,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 03:45:11,255 INFO L225 Difference]: With dead ends: 190 [2023-02-17 03:45:11,255 INFO L226 Difference]: Without dead ends: 188 [2023-02-17 03:45:11,255 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-17 03:45:11,256 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 137 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 295 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.0s IncrementalHoareTripleChecker+Time [2023-02-17 03:45:11,256 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 295 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 03:45:11,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2023-02-17 03:45:11,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 159. [2023-02-17 03:45:11,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 138 states have (on average 1.463768115942029) internal successors, (202), 151 states have internal predecessors, (202), 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-17 03:45:11,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 210 transitions. [2023-02-17 03:45:11,262 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 210 transitions. Word has length 24 [2023-02-17 03:45:11,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 03:45:11,263 INFO L495 AbstractCegarLoop]: Abstraction has 159 states and 210 transitions. [2023-02-17 03:45:11,263 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-17 03:45:11,263 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 210 transitions. [2023-02-17 03:45:11,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-02-17 03:45:11,264 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 03:45:11,264 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-17 03:45:11,264 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-02-17 03:45:11,281 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2023-02-17 03:45:11,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 03:45:11,281 INFO L85 PathProgramCache]: Analyzing trace with hash -339740318, now seen corresponding path program 1 times [2023-02-17 03:45:11,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 03:45:11,282 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271091109] [2023-02-17 03:45:11,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 03:45:11,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 03:45:11,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:45:11,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-17 03:45:11,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:45:11,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-17 03:45:11,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:45:11,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-17 03:45:11,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:45:11,358 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-17 03:45:11,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 03:45:11,359 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271091109] [2023-02-17 03:45:11,359 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [271091109] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 03:45:11,359 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 03:45:11,359 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-17 03:45:11,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389491510] [2023-02-17 03:45:11,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 03:45:11,359 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-17 03:45:11,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 03:45:11,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-17 03:45:11,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-17 03:45:11,360 INFO L87 Difference]: Start difference. First operand 159 states and 210 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-17 03:45:11,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 03:45:11,416 INFO L93 Difference]: Finished difference Result 183 states and 242 transitions. [2023-02-17 03:45:11,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-17 03:45:11,419 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-17 03:45:11,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 03:45:11,420 INFO L225 Difference]: With dead ends: 183 [2023-02-17 03:45:11,421 INFO L226 Difference]: Without dead ends: 181 [2023-02-17 03:45:11,421 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-17 03:45:11,423 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 134 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 288 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-17 03:45:11,424 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 288 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 03:45:11,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2023-02-17 03:45:11,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 153. [2023-02-17 03:45:11,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 134 states have (on average 1.4402985074626866) internal successors, (193), 145 states have internal predecessors, (193), 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-17 03:45:11,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 201 transitions. [2023-02-17 03:45:11,442 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 201 transitions. Word has length 31 [2023-02-17 03:45:11,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 03:45:11,442 INFO L495 AbstractCegarLoop]: Abstraction has 153 states and 201 transitions. [2023-02-17 03:45:11,442 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-17 03:45:11,442 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 201 transitions. [2023-02-17 03:45:11,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-02-17 03:45:11,444 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 03:45:11,444 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-17 03:45:11,444 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-02-17 03:45:11,444 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2023-02-17 03:45:11,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 03:45:11,444 INFO L85 PathProgramCache]: Analyzing trace with hash -368367674, now seen corresponding path program 1 times [2023-02-17 03:45:11,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 03:45:11,444 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121636116] [2023-02-17 03:45:11,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 03:45:11,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 03:45:11,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:45:11,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-17 03:45:11,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:45:11,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-17 03:45:11,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:45:11,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-17 03:45:11,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:45:11,514 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-17 03:45:11,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 03:45:11,515 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121636116] [2023-02-17 03:45:11,515 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2121636116] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 03:45:11,515 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 03:45:11,515 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-17 03:45:11,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564463060] [2023-02-17 03:45:11,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 03:45:11,516 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-17 03:45:11,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 03:45:11,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-17 03:45:11,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-17 03:45:11,517 INFO L87 Difference]: Start difference. First operand 153 states and 201 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-17 03:45:11,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 03:45:11,568 INFO L93 Difference]: Finished difference Result 175 states and 230 transitions. [2023-02-17 03:45:11,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-17 03:45:11,569 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-17 03:45:11,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 03:45:11,570 INFO L225 Difference]: With dead ends: 175 [2023-02-17 03:45:11,570 INFO L226 Difference]: Without dead ends: 173 [2023-02-17 03:45:11,571 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-17 03:45:11,571 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 135 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 286 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-17 03:45:11,573 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 286 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 03:45:11,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2023-02-17 03:45:11,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 144. [2023-02-17 03:45:11,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 127 states have (on average 1.4251968503937007) internal successors, (181), 136 states have internal predecessors, (181), 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-17 03:45:11,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 189 transitions. [2023-02-17 03:45:11,583 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 189 transitions. Word has length 31 [2023-02-17 03:45:11,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 03:45:11,584 INFO L495 AbstractCegarLoop]: Abstraction has 144 states and 189 transitions. [2023-02-17 03:45:11,584 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-17 03:45:11,584 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 189 transitions. [2023-02-17 03:45:11,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-02-17 03:45:11,585 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 03:45:11,585 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] [2023-02-17 03:45:11,590 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-02-17 03:45:11,590 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2023-02-17 03:45:11,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 03:45:11,591 INFO L85 PathProgramCache]: Analyzing trace with hash -1493195762, now seen corresponding path program 1 times [2023-02-17 03:45:11,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 03:45:11,591 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557099915] [2023-02-17 03:45:11,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 03:45:11,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 03:45:11,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:45:11,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-17 03:45:11,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:45:11,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-17 03:45:11,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:45:11,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-17 03:45:11,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:45:11,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-17 03:45:11,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:45:11,688 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-17 03:45:11,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 03:45:11,688 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557099915] [2023-02-17 03:45:11,689 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1557099915] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 03:45:11,689 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [292095772] [2023-02-17 03:45:11,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 03:45:11,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 03:45:11,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 03:45:11,691 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-17 03:45:11,707 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-17 03:45:11,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:45:11,760 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 20 conjunts are in the unsatisfiable core [2023-02-17 03:45:11,762 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 03:45:11,808 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-02-17 03:45:11,809 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 03:45:11,866 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-02-17 03:45:11,867 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [292095772] provided 1 perfect and 1 imperfect interpolant sequences [2023-02-17 03:45:11,867 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-02-17 03:45:11,867 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [4, 8] total 14 [2023-02-17 03:45:11,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234839063] [2023-02-17 03:45:11,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 03:45:11,868 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-17 03:45:11,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 03:45:11,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-17 03:45:11,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2023-02-17 03:45:11,870 INFO L87 Difference]: Start difference. First operand 144 states and 189 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 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-17 03:45:11,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 03:45:11,933 INFO L93 Difference]: Finished difference Result 232 states and 290 transitions. [2023-02-17 03:45:11,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-17 03:45:11,934 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 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 35 [2023-02-17 03:45:11,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 03:45:11,935 INFO L225 Difference]: With dead ends: 232 [2023-02-17 03:45:11,935 INFO L226 Difference]: Without dead ends: 182 [2023-02-17 03:45:11,936 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2023-02-17 03:45:11,937 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 37 mSDsluCounter, 364 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 459 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-17 03:45:11,937 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 459 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 03:45:11,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2023-02-17 03:45:11,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 144. [2023-02-17 03:45:11,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 127 states have (on average 1.4094488188976377) internal successors, (179), 136 states have internal predecessors, (179), 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-17 03:45:11,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 187 transitions. [2023-02-17 03:45:11,943 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 187 transitions. Word has length 35 [2023-02-17 03:45:11,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 03:45:11,944 INFO L495 AbstractCegarLoop]: Abstraction has 144 states and 187 transitions. [2023-02-17 03:45:11,944 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 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-17 03:45:11,945 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 187 transitions. [2023-02-17 03:45:11,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-02-17 03:45:11,946 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 03:45:11,946 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-02-17 03:45:11,951 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-02-17 03:45:12,150 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-17 03:45:12,151 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2023-02-17 03:45:12,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 03:45:12,151 INFO L85 PathProgramCache]: Analyzing trace with hash 1303876285, now seen corresponding path program 1 times [2023-02-17 03:45:12,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 03:45:12,152 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698973607] [2023-02-17 03:45:12,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 03:45:12,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 03:45:12,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:45:12,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-17 03:45:12,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:45:12,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-17 03:45:12,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:45:12,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-17 03:45:12,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:45:12,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-17 03:45:12,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:45:12,236 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-17 03:45:12,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 03:45:12,236 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698973607] [2023-02-17 03:45:12,236 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [698973607] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 03:45:12,236 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [233827757] [2023-02-17 03:45:12,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 03:45:12,236 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 03:45:12,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 03:45:12,239 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-17 03:45:12,241 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-17 03:45:12,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:45:12,281 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 9 conjunts are in the unsatisfiable core [2023-02-17 03:45:12,282 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 03:45:12,309 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-17 03:45:12,309 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 03:45:12,329 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-02-17 03:45:12,329 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [233827757] provided 1 perfect and 1 imperfect interpolant sequences [2023-02-17 03:45:12,329 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-02-17 03:45:12,329 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 6] total 10 [2023-02-17 03:45:12,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630752035] [2023-02-17 03:45:12,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 03:45:12,330 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-17 03:45:12,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 03:45:12,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-17 03:45:12,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2023-02-17 03:45:12,331 INFO L87 Difference]: Start difference. First operand 144 states and 187 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 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-17 03:45:12,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 03:45:12,344 INFO L93 Difference]: Finished difference Result 186 states and 235 transitions. [2023-02-17 03:45:12,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-17 03:45:12,345 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 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 39 [2023-02-17 03:45:12,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 03:45:12,346 INFO L225 Difference]: With dead ends: 186 [2023-02-17 03:45:12,346 INFO L226 Difference]: Without dead ends: 145 [2023-02-17 03:45:12,347 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 78 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2023-02-17 03:45:12,347 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 50 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-17 03:45:12,347 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 186 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 03:45:12,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2023-02-17 03:45:12,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 144. [2023-02-17 03:45:12,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 127 states have (on average 1.4015748031496063) internal successors, (178), 136 states have internal predecessors, (178), 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-17 03:45:12,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 186 transitions. [2023-02-17 03:45:12,353 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 186 transitions. Word has length 39 [2023-02-17 03:45:12,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 03:45:12,354 INFO L495 AbstractCegarLoop]: Abstraction has 144 states and 186 transitions. [2023-02-17 03:45:12,354 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 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-17 03:45:12,354 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 186 transitions. [2023-02-17 03:45:12,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-02-17 03:45:12,355 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 03:45:12,355 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-02-17 03:45:12,363 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-17 03:45:12,560 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 03:45:12,560 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2023-02-17 03:45:12,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 03:45:12,561 INFO L85 PathProgramCache]: Analyzing trace with hash 1765516932, now seen corresponding path program 1 times [2023-02-17 03:45:12,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 03:45:12,561 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050230029] [2023-02-17 03:45:12,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 03:45:12,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 03:45:12,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:45:12,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-17 03:45:12,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:45:12,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-17 03:45:12,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:45:12,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-17 03:45:12,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:45:12,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-17 03:45:12,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:45:12,627 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-17 03:45:12,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 03:45:12,627 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050230029] [2023-02-17 03:45:12,627 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1050230029] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 03:45:12,628 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1522060902] [2023-02-17 03:45:12,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 03:45:12,628 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 03:45:12,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 03:45:12,629 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-17 03:45:12,644 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-17 03:45:12,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:45:12,685 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 13 conjunts are in the unsatisfiable core [2023-02-17 03:45:12,688 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 03:45:12,702 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-17 03:45:12,702 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 03:45:12,713 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-17 03:45:12,713 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1522060902] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 03:45:12,713 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-17 03:45:12,713 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 7 [2023-02-17 03:45:12,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488780001] [2023-02-17 03:45:12,715 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-17 03:45:12,715 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-17 03:45:12,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 03:45:12,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-17 03:45:12,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-02-17 03:45:12,716 INFO L87 Difference]: Start difference. First operand 144 states and 186 transitions. Second operand has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 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-17 03:45:12,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 03:45:12,760 INFO L93 Difference]: Finished difference Result 242 states and 301 transitions. [2023-02-17 03:45:12,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-17 03:45:12,761 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 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 40 [2023-02-17 03:45:12,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 03:45:12,762 INFO L225 Difference]: With dead ends: 242 [2023-02-17 03:45:12,762 INFO L226 Difference]: Without dead ends: 198 [2023-02-17 03:45:12,762 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 85 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-02-17 03:45:12,763 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 57 mSDsluCounter, 465 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 561 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-17 03:45:12,763 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 561 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 03:45:12,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2023-02-17 03:45:12,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 151. [2023-02-17 03:45:12,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 132 states have (on average 1.3863636363636365) internal successors, (183), 141 states have internal predecessors, (183), 5 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-02-17 03:45:12,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 194 transitions. [2023-02-17 03:45:12,771 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 194 transitions. Word has length 40 [2023-02-17 03:45:12,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 03:45:12,771 INFO L495 AbstractCegarLoop]: Abstraction has 151 states and 194 transitions. [2023-02-17 03:45:12,771 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 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-17 03:45:12,771 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 194 transitions. [2023-02-17 03:45:12,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-02-17 03:45:12,772 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 03:45:12,772 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-02-17 03:45:12,795 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-17 03:45:12,996 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 03:45:12,996 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2023-02-17 03:45:12,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 03:45:12,996 INFO L85 PathProgramCache]: Analyzing trace with hash 1708258630, now seen corresponding path program 1 times [2023-02-17 03:45:12,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 03:45:12,996 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688132326] [2023-02-17 03:45:12,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 03:45:12,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 03:45:13,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:45:13,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-17 03:45:13,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:45:13,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-17 03:45:13,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:45:13,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-02-17 03:45:13,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:45:13,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-17 03:45:13,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:45:13,068 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-17 03:45:13,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 03:45:13,068 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688132326] [2023-02-17 03:45:13,068 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1688132326] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 03:45:13,068 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [92859886] [2023-02-17 03:45:13,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 03:45:13,068 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 03:45:13,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 03:45:13,083 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-17 03:45:13,124 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-17 03:45:13,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:45:13,141 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 22 conjunts are in the unsatisfiable core [2023-02-17 03:45:13,143 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 03:45:13,186 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-17 03:45:13,187 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 03:45:13,234 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-17 03:45:13,234 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [92859886] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 03:45:13,235 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-17 03:45:13,235 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 10, 8] total 18 [2023-02-17 03:45:13,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058827740] [2023-02-17 03:45:13,235 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-17 03:45:13,235 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-02-17 03:45:13,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 03:45:13,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-02-17 03:45:13,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2023-02-17 03:45:13,236 INFO L87 Difference]: Start difference. First operand 151 states and 194 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-17 03:45:13,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 03:45:13,432 INFO L93 Difference]: Finished difference Result 413 states and 528 transitions. [2023-02-17 03:45:13,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-02-17 03:45:13,432 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 40 [2023-02-17 03:45:13,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 03:45:13,433 INFO L225 Difference]: With dead ends: 413 [2023-02-17 03:45:13,433 INFO L226 Difference]: Without dead ends: 227 [2023-02-17 03:45:13,434 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=114, Invalid=588, Unknown=0, NotChecked=0, Total=702 [2023-02-17 03:45:13,434 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 97 mSDsluCounter, 1101 mSDsCounter, 0 mSdLazyCounter, 405 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 1183 SdHoareTripleChecker+Invalid, 412 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 405 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 03:45:13,435 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 1183 Invalid, 412 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 405 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 03:45:13,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2023-02-17 03:45:13,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 143. [2023-02-17 03:45:13,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 125 states have (on average 1.36) internal successors, (170), 134 states have internal predecessors, (170), 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-17 03:45:13,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 178 transitions. [2023-02-17 03:45:13,454 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 178 transitions. Word has length 40 [2023-02-17 03:45:13,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 03:45:13,454 INFO L495 AbstractCegarLoop]: Abstraction has 143 states and 178 transitions. [2023-02-17 03:45:13,454 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-17 03:45:13,454 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 178 transitions. [2023-02-17 03:45:13,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2023-02-17 03:45:13,455 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 03:45:13,455 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] [2023-02-17 03:45:13,475 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-17 03:45:13,655 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,SelfDestructingSolverStorable13 [2023-02-17 03:45:13,656 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2023-02-17 03:45:13,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 03:45:13,656 INFO L85 PathProgramCache]: Analyzing trace with hash 2065115993, now seen corresponding path program 1 times [2023-02-17 03:45:13,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 03:45:13,656 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033852547] [2023-02-17 03:45:13,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 03:45:13,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 03:45:13,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:45:13,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-17 03:45:13,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:45:13,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-17 03:45:13,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:45:13,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-02-17 03:45:13,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:45:13,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-02-17 03:45:13,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:45:13,731 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-17 03:45:13,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 03:45:13,731 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033852547] [2023-02-17 03:45:13,731 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033852547] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 03:45:13,731 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1526082068] [2023-02-17 03:45:13,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 03:45:13,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 03:45:13,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 03:45:13,733 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-17 03:45:13,735 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-17 03:45:13,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:45:13,780 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 7 conjunts are in the unsatisfiable core [2023-02-17 03:45:13,782 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 03:45:13,796 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-02-17 03:45:13,796 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 03:45:13,796 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1526082068] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 03:45:13,797 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-17 03:45:13,797 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2023-02-17 03:45:13,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468144915] [2023-02-17 03:45:13,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 03:45:13,797 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-17 03:45:13,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 03:45:13,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-17 03:45:13,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2023-02-17 03:45:13,798 INFO L87 Difference]: Start difference. First operand 143 states and 178 transitions. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-17 03:45:13,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 03:45:13,867 INFO L93 Difference]: Finished difference Result 311 states and 388 transitions. [2023-02-17 03:45:13,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-17 03:45:13,868 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 56 [2023-02-17 03:45:13,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 03:45:13,869 INFO L225 Difference]: With dead ends: 311 [2023-02-17 03:45:13,869 INFO L226 Difference]: Without dead ends: 200 [2023-02-17 03:45:13,869 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 60 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2023-02-17 03:45:13,870 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 29 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 03:45:13,870 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 325 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 03:45:13,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2023-02-17 03:45:13,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 136. [2023-02-17 03:45:13,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 118 states have (on average 1.347457627118644) internal successors, (159), 127 states have internal predecessors, (159), 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-17 03:45:13,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 167 transitions. [2023-02-17 03:45:13,876 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 167 transitions. Word has length 56 [2023-02-17 03:45:13,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 03:45:13,876 INFO L495 AbstractCegarLoop]: Abstraction has 136 states and 167 transitions. [2023-02-17 03:45:13,876 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-17 03:45:13,876 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 167 transitions. [2023-02-17 03:45:13,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2023-02-17 03:45:13,876 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 03:45:13,877 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 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] [2023-02-17 03:45:13,885 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-17 03:45:14,082 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,SelfDestructingSolverStorable14 [2023-02-17 03:45:14,082 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2023-02-17 03:45:14,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 03:45:14,083 INFO L85 PathProgramCache]: Analyzing trace with hash -699283725, now seen corresponding path program 1 times [2023-02-17 03:45:14,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 03:45:14,083 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446767664] [2023-02-17 03:45:14,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 03:45:14,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 03:45:14,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:45:14,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-17 03:45:14,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:45:14,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-17 03:45:14,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:45:14,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-02-17 03:45:14,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:45:14,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-02-17 03:45:14,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:45:14,168 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 4 proven. 19 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-02-17 03:45:14,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 03:45:14,168 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446767664] [2023-02-17 03:45:14,168 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1446767664] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 03:45:14,168 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1922923061] [2023-02-17 03:45:14,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 03:45:14,169 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 03:45:14,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 03:45:14,170 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-17 03:45:14,172 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-17 03:45:14,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:45:14,216 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-17 03:45:14,217 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 03:45:14,233 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 26 proven. 9 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-02-17 03:45:14,233 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 03:45:14,262 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 4 proven. 19 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-02-17 03:45:14,262 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1922923061] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 03:45:14,262 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-17 03:45:14,262 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2023-02-17 03:45:14,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123560450] [2023-02-17 03:45:14,262 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-17 03:45:14,263 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-02-17 03:45:14,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 03:45:14,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-02-17 03:45:14,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2023-02-17 03:45:14,263 INFO L87 Difference]: Start difference. First operand 136 states and 167 transitions. Second operand has 14 states, 14 states have (on average 5.714285714285714) internal successors, (80), 14 states have internal predecessors, (80), 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-17 03:45:14,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 03:45:14,419 INFO L93 Difference]: Finished difference Result 572 states and 721 transitions. [2023-02-17 03:45:14,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-02-17 03:45:14,419 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.714285714285714) internal successors, (80), 14 states have internal predecessors, (80), 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 57 [2023-02-17 03:45:14,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 03:45:14,421 INFO L225 Difference]: With dead ends: 572 [2023-02-17 03:45:14,421 INFO L226 Difference]: Without dead ends: 464 [2023-02-17 03:45:14,421 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 117 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-17 03:45:14,422 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 275 mSDsluCounter, 329 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 275 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 03:45:14,422 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [275 Valid, 426 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 03:45:14,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2023-02-17 03:45:14,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 163. [2023-02-17 03:45:14,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 145 states have (on average 1.3310344827586207) internal successors, (193), 154 states have internal predecessors, (193), 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-17 03:45:14,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 201 transitions. [2023-02-17 03:45:14,431 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 201 transitions. Word has length 57 [2023-02-17 03:45:14,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 03:45:14,431 INFO L495 AbstractCegarLoop]: Abstraction has 163 states and 201 transitions. [2023-02-17 03:45:14,432 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.714285714285714) internal successors, (80), 14 states have internal predecessors, (80), 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-17 03:45:14,432 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 201 transitions. [2023-02-17 03:45:14,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2023-02-17 03:45:14,432 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 03:45:14,432 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] [2023-02-17 03:45:14,439 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-17 03:45:14,637 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 03:45:14,638 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2023-02-17 03:45:14,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 03:45:14,638 INFO L85 PathProgramCache]: Analyzing trace with hash -1499167963, now seen corresponding path program 1 times [2023-02-17 03:45:14,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 03:45:14,639 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390837624] [2023-02-17 03:45:14,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 03:45:14,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 03:45:14,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:45:14,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-17 03:45:14,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:45:14,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-17 03:45:14,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:45:14,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-02-17 03:45:14,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:45:14,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-02-17 03:45:14,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:45:14,712 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 4 proven. 15 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-02-17 03:45:14,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 03:45:14,713 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390837624] [2023-02-17 03:45:14,713 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [390837624] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 03:45:14,713 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [46018240] [2023-02-17 03:45:14,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 03:45:14,713 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 03:45:14,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 03:45:14,714 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-17 03:45:14,729 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-17 03:45:14,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:45:14,788 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 9 conjunts are in the unsatisfiable core [2023-02-17 03:45:14,790 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 03:45:14,812 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 26 proven. 5 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-02-17 03:45:14,812 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 03:45:14,939 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 4 proven. 15 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-02-17 03:45:14,939 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [46018240] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 03:45:14,940 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-17 03:45:14,940 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2023-02-17 03:45:14,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333230266] [2023-02-17 03:45:14,940 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-17 03:45:14,940 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-02-17 03:45:14,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 03:45:14,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-02-17 03:45:14,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2023-02-17 03:45:14,941 INFO L87 Difference]: Start difference. First operand 163 states and 201 transitions. Second operand has 13 states, 13 states have (on average 6.461538461538462) internal successors, (84), 13 states have internal predecessors, (84), 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-17 03:45:15,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 03:45:15,175 INFO L93 Difference]: Finished difference Result 403 states and 506 transitions. [2023-02-17 03:45:15,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-02-17 03:45:15,176 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.461538461538462) internal successors, (84), 13 states have internal predecessors, (84), 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 61 [2023-02-17 03:45:15,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 03:45:15,177 INFO L225 Difference]: With dead ends: 403 [2023-02-17 03:45:15,177 INFO L226 Difference]: Without dead ends: 281 [2023-02-17 03:45:15,177 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 111 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-17 03:45:15,178 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 118 mSDsluCounter, 412 mSDsCounter, 0 mSdLazyCounter, 266 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 504 SdHoareTripleChecker+Invalid, 286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-17 03:45:15,178 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 504 Invalid, 286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 266 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-17 03:45:15,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2023-02-17 03:45:15,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 156. [2023-02-17 03:45:15,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 138 states have (on average 1.2971014492753623) internal successors, (179), 147 states have internal predecessors, (179), 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-17 03:45:15,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 187 transitions. [2023-02-17 03:45:15,190 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 187 transitions. Word has length 61 [2023-02-17 03:45:15,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 03:45:15,191 INFO L495 AbstractCegarLoop]: Abstraction has 156 states and 187 transitions. [2023-02-17 03:45:15,191 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.461538461538462) internal successors, (84), 13 states have internal predecessors, (84), 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-17 03:45:15,191 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 187 transitions. [2023-02-17 03:45:15,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2023-02-17 03:45:15,191 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 03:45:15,192 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 6, 6, 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] [2023-02-17 03:45:15,219 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2023-02-17 03:45:15,398 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-02-17 03:45:15,398 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2023-02-17 03:45:15,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 03:45:15,399 INFO L85 PathProgramCache]: Analyzing trace with hash 239667187, now seen corresponding path program 2 times [2023-02-17 03:45:15,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 03:45:15,399 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072212714] [2023-02-17 03:45:15,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 03:45:15,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 03:45:15,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:45:15,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-17 03:45:15,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:45:15,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-17 03:45:15,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:45:15,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-02-17 03:45:15,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:45:15,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-02-17 03:45:15,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:45:15,543 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 4 proven. 97 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-02-17 03:45:15,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 03:45:15,543 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072212714] [2023-02-17 03:45:15,544 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072212714] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 03:45:15,544 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1005222980] [2023-02-17 03:45:15,544 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-17 03:45:15,544 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 03:45:15,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 03:45:15,545 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-17 03:45:15,548 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-17 03:45:15,599 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-02-17 03:45:15,599 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 03:45:15,600 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 15 conjunts are in the unsatisfiable core [2023-02-17 03:45:15,601 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 03:45:15,657 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2023-02-17 03:45:15,657 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 03:45:15,657 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1005222980] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 03:45:15,658 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-17 03:45:15,658 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [10] total 16 [2023-02-17 03:45:15,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885210911] [2023-02-17 03:45:15,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 03:45:15,658 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-17 03:45:15,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 03:45:15,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-17 03:45:15,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2023-02-17 03:45:15,660 INFO L87 Difference]: Start difference. First operand 156 states and 187 transitions. Second operand has 8 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 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-17 03:45:15,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 03:45:15,797 INFO L93 Difference]: Finished difference Result 294 states and 349 transitions. [2023-02-17 03:45:15,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-17 03:45:15,798 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 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 77 [2023-02-17 03:45:15,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 03:45:15,799 INFO L225 Difference]: With dead ends: 294 [2023-02-17 03:45:15,799 INFO L226 Difference]: Without dead ends: 251 [2023-02-17 03:45:15,800 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2023-02-17 03:45:15,802 INFO L413 NwaCegarLoop]: 123 mSDtfsCounter, 94 mSDsluCounter, 619 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 742 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 03:45:15,802 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 742 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 03:45:15,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2023-02-17 03:45:15,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 177. [2023-02-17 03:45:15,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 158 states have (on average 1.2721518987341771) internal successors, (201), 167 states have internal predecessors, (201), 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-17 03:45:15,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 210 transitions. [2023-02-17 03:45:15,816 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 210 transitions. Word has length 77 [2023-02-17 03:45:15,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 03:45:15,817 INFO L495 AbstractCegarLoop]: Abstraction has 177 states and 210 transitions. [2023-02-17 03:45:15,817 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 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-17 03:45:15,817 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 210 transitions. [2023-02-17 03:45:15,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2023-02-17 03:45:15,818 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 03:45:15,818 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] [2023-02-17 03:45:15,833 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2023-02-17 03:45:16,024 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-02-17 03:45:16,025 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2023-02-17 03:45:16,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 03:45:16,025 INFO L85 PathProgramCache]: Analyzing trace with hash 2114891252, now seen corresponding path program 1 times [2023-02-17 03:45:16,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 03:45:16,025 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773856256] [2023-02-17 03:45:16,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 03:45:16,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 03:45:16,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:45:16,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-17 03:45:16,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:45:16,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-17 03:45:16,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:45:16,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-02-17 03:45:16,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:45:16,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-02-17 03:45:16,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:45:16,169 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-17 03:45:16,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 03:45:16,185 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773856256] [2023-02-17 03:45:16,185 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [773856256] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 03:45:16,185 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [657841673] [2023-02-17 03:45:16,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 03:45:16,186 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 03:45:16,186 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 03:45:16,187 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-17 03:45:16,213 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-17 03:45:16,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:45:16,266 INFO L263 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 9 conjunts are in the unsatisfiable core [2023-02-17 03:45:16,270 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 03:45:16,323 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-17 03:45:16,323 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 03:45:16,443 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-17 03:45:16,443 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [657841673] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 03:45:16,443 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-17 03:45:16,443 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 26 [2023-02-17 03:45:16,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434371413] [2023-02-17 03:45:16,444 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-17 03:45:16,445 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-02-17 03:45:16,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 03:45:16,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-02-17 03:45:16,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=230, Invalid=420, Unknown=0, NotChecked=0, Total=650 [2023-02-17 03:45:16,446 INFO L87 Difference]: Start difference. First operand 177 states and 210 transitions. Second operand has 26 states, 26 states have (on average 5.923076923076923) internal successors, (154), 26 states have internal predecessors, (154), 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-17 03:45:16,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 03:45:16,863 INFO L93 Difference]: Finished difference Result 986 states and 1243 transitions. [2023-02-17 03:45:16,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-02-17 03:45:16,864 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 5.923076923076923) internal successors, (154), 26 states have internal predecessors, (154), 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 82 [2023-02-17 03:45:16,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 03:45:16,867 INFO L225 Difference]: With dead ends: 986 [2023-02-17 03:45:16,867 INFO L226 Difference]: Without dead ends: 857 [2023-02-17 03:45:16,868 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 163 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-17 03:45:16,868 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 536 mSDsluCounter, 950 mSDsCounter, 0 mSdLazyCounter, 384 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 536 SdHoareTripleChecker+Valid, 1047 SdHoareTripleChecker+Invalid, 401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 384 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-17 03:45:16,868 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [536 Valid, 1047 Invalid, 401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 384 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-17 03:45:16,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 857 states. [2023-02-17 03:45:16,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 857 to 224. [2023-02-17 03:45:16,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 205 states have (on average 1.2634146341463415) internal successors, (259), 214 states have internal predecessors, (259), 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-17 03:45:16,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 268 transitions. [2023-02-17 03:45:16,885 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 268 transitions. Word has length 82 [2023-02-17 03:45:16,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 03:45:16,885 INFO L495 AbstractCegarLoop]: Abstraction has 224 states and 268 transitions. [2023-02-17 03:45:16,885 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 5.923076923076923) internal successors, (154), 26 states have internal predecessors, (154), 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-17 03:45:16,885 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 268 transitions. [2023-02-17 03:45:16,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2023-02-17 03:45:16,888 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 03:45:16,888 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] [2023-02-17 03:45:16,903 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-17 03:45:17,093 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 03:45:17,094 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2023-02-17 03:45:17,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 03:45:17,094 INFO L85 PathProgramCache]: Analyzing trace with hash -1818476286, now seen corresponding path program 1 times [2023-02-17 03:45:17,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 03:45:17,094 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966482200] [2023-02-17 03:45:17,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 03:45:17,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 03:45:17,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:45:17,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-17 03:45:17,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:45:17,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-17 03:45:17,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:45:17,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-02-17 03:45:17,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:45:17,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-02-17 03:45:17,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:45:17,396 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-17 03:45:17,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 03:45:17,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966482200] [2023-02-17 03:45:17,398 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [966482200] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 03:45:17,398 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [155764083] [2023-02-17 03:45:17,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 03:45:17,399 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 03:45:17,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 03:45:17,400 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-17 03:45:17,442 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-17 03:45:17,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:45:17,493 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 17 conjunts are in the unsatisfiable core [2023-02-17 03:45:17,494 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 03:45:17,573 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-17 03:45:17,573 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 03:45:18,258 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-17 03:45:18,258 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [155764083] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 03:45:18,258 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-17 03:45:18,258 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 25 [2023-02-17 03:45:18,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971970280] [2023-02-17 03:45:18,259 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-17 03:45:18,259 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-02-17 03:45:18,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 03:45:18,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-02-17 03:45:18,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=191, Invalid=409, Unknown=0, NotChecked=0, Total=600 [2023-02-17 03:45:18,260 INFO L87 Difference]: Start difference. First operand 224 states and 268 transitions. Second operand has 25 states, 25 states have (on average 6.32) internal successors, (158), 25 states have internal predecessors, (158), 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-17 03:45:19,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 03:45:19,143 INFO L93 Difference]: Finished difference Result 589 states and 732 transitions. [2023-02-17 03:45:19,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-02-17 03:45:19,153 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 6.32) internal successors, (158), 25 states have internal predecessors, (158), 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 86 [2023-02-17 03:45:19,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 03:45:19,155 INFO L225 Difference]: With dead ends: 589 [2023-02-17 03:45:19,155 INFO L226 Difference]: Without dead ends: 446 [2023-02-17 03:45:19,156 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 159 SyntacticMatches, 13 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 389 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=504, Invalid=902, Unknown=0, NotChecked=0, Total=1406 [2023-02-17 03:45:19,157 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 192 mSDsluCounter, 876 mSDsCounter, 0 mSdLazyCounter, 758 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 984 SdHoareTripleChecker+Invalid, 784 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 758 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-17 03:45:19,157 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 984 Invalid, 784 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 758 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-17 03:45:19,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states. [2023-02-17 03:45:19,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 217. [2023-02-17 03:45:19,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 198 states have (on average 1.2171717171717171) internal successors, (241), 207 states have internal predecessors, (241), 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-17 03:45:19,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 250 transitions. [2023-02-17 03:45:19,175 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 250 transitions. Word has length 86 [2023-02-17 03:45:19,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 03:45:19,175 INFO L495 AbstractCegarLoop]: Abstraction has 217 states and 250 transitions. [2023-02-17 03:45:19,175 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 6.32) internal successors, (158), 25 states have internal predecessors, (158), 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-17 03:45:19,175 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 250 transitions. [2023-02-17 03:45:19,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2023-02-17 03:45:19,176 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 03:45:19,176 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] [2023-02-17 03:45:19,197 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-17 03:45:19,381 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 03:45:19,382 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2023-02-17 03:45:19,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 03:45:19,382 INFO L85 PathProgramCache]: Analyzing trace with hash -1334776844, now seen corresponding path program 2 times [2023-02-17 03:45:19,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 03:45:19,382 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796834847] [2023-02-17 03:45:19,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 03:45:19,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 03:45:19,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:45:19,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-17 03:45:19,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:45:19,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-17 03:45:19,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:45:19,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-02-17 03:45:19,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:45:19,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2023-02-17 03:45:19,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:45:19,704 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-17 03:45:19,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 03:45:19,704 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796834847] [2023-02-17 03:45:19,704 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [796834847] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 03:45:19,704 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1530380212] [2023-02-17 03:45:19,704 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-17 03:45:19,704 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 03:45:19,704 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 03:45:19,705 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-17 03:45:19,707 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-17 03:45:19,773 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-17 03:45:19,773 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 03:45:19,775 INFO L263 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 17 conjunts are in the unsatisfiable core [2023-02-17 03:45:19,776 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 03:45:19,914 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-17 03:45:19,915 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 03:45:20,295 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-17 03:45:20,295 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1530380212] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 03:45:20,295 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-17 03:45:20,295 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 50 [2023-02-17 03:45:20,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023248327] [2023-02-17 03:45:20,296 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-17 03:45:20,296 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2023-02-17 03:45:20,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 03:45:20,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2023-02-17 03:45:20,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=846, Invalid=1604, Unknown=0, NotChecked=0, Total=2450 [2023-02-17 03:45:20,299 INFO L87 Difference]: Start difference. First operand 217 states and 250 transitions. Second operand has 50 states, 50 states have (on average 5.48) internal successors, (274), 50 states have internal predecessors, (274), 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-17 03:45:21,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 03:45:21,080 INFO L93 Difference]: Finished difference Result 1730 states and 2195 transitions. [2023-02-17 03:45:21,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2023-02-17 03:45:21,080 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 5.48) internal successors, (274), 50 states have internal predecessors, (274), 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 122 [2023-02-17 03:45:21,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 03:45:21,085 INFO L225 Difference]: With dead ends: 1730 [2023-02-17 03:45:21,085 INFO L226 Difference]: Without dead ends: 1601 [2023-02-17 03:45:21,087 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 302 GetRequests, 235 SyntacticMatches, 1 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1257 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1744, Invalid=2812, Unknown=0, NotChecked=0, Total=4556 [2023-02-17 03:45:21,087 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 1351 mSDsluCounter, 1038 mSDsCounter, 0 mSdLazyCounter, 511 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1351 SdHoareTripleChecker+Valid, 1135 SdHoareTripleChecker+Invalid, 569 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 511 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-17 03:45:21,087 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1351 Valid, 1135 Invalid, 569 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 511 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-17 03:45:21,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1601 states. [2023-02-17 03:45:21,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1601 to 304. [2023-02-17 03:45:21,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 304 states, 285 states have (on average 1.2175438596491228) internal successors, (347), 294 states have internal predecessors, (347), 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-17 03:45:21,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 356 transitions. [2023-02-17 03:45:21,112 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 356 transitions. Word has length 122 [2023-02-17 03:45:21,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 03:45:21,113 INFO L495 AbstractCegarLoop]: Abstraction has 304 states and 356 transitions. [2023-02-17 03:45:21,113 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 5.48) internal successors, (274), 50 states have internal predecessors, (274), 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-17 03:45:21,113 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 356 transitions. [2023-02-17 03:45:21,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2023-02-17 03:45:21,114 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 03:45:21,114 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] [2023-02-17 03:45:21,119 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-17 03:45:21,319 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,SelfDestructingSolverStorable20 [2023-02-17 03:45:21,320 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2023-02-17 03:45:21,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 03:45:21,320 INFO L85 PathProgramCache]: Analyzing trace with hash 783253250, now seen corresponding path program 2 times [2023-02-17 03:45:21,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 03:45:21,320 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520183144] [2023-02-17 03:45:21,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 03:45:21,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 03:45:21,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:45:21,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-17 03:45:21,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:45:21,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-17 03:45:21,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:45:21,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-02-17 03:45:21,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:45:21,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-02-17 03:45:21,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:45:21,869 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-17 03:45:21,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 03:45:21,869 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520183144] [2023-02-17 03:45:21,869 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520183144] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 03:45:21,869 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [45511370] [2023-02-17 03:45:21,869 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-17 03:45:21,869 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 03:45:21,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 03:45:21,895 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-17 03:45:21,909 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-17 03:45:22,009 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-17 03:45:22,009 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 03:45:22,010 INFO L263 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 13 conjunts are in the unsatisfiable core [2023-02-17 03:45:22,011 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 03:45:22,138 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-17 03:45:22,138 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 03:45:22,296 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-17 03:45:22,296 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [45511370] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 03:45:22,296 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-17 03:45:22,296 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 6, 6] total 28 [2023-02-17 03:45:22,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215223642] [2023-02-17 03:45:22,297 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-17 03:45:22,297 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-02-17 03:45:22,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 03:45:22,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-02-17 03:45:22,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=670, Unknown=0, NotChecked=0, Total=756 [2023-02-17 03:45:22,298 INFO L87 Difference]: Start difference. First operand 304 states and 356 transitions. Second operand has 28 states, 28 states have (on average 4.964285714285714) internal successors, (139), 26 states have internal predecessors, (139), 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-17 03:45:23,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 03:45:23,163 INFO L93 Difference]: Finished difference Result 698 states and 839 transitions. [2023-02-17 03:45:23,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2023-02-17 03:45:23,164 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 4.964285714285714) internal successors, (139), 26 states have internal predecessors, (139), 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 126 [2023-02-17 03:45:23,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 03:45:23,166 INFO L225 Difference]: With dead ends: 698 [2023-02-17 03:45:23,166 INFO L226 Difference]: Without dead ends: 566 [2023-02-17 03:45:23,167 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 286 GetRequests, 248 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-17 03:45:23,167 INFO L413 NwaCegarLoop]: 112 mSDtfsCounter, 364 mSDsluCounter, 2237 mSDsCounter, 0 mSdLazyCounter, 1403 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 364 SdHoareTripleChecker+Valid, 2349 SdHoareTripleChecker+Invalid, 1458 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 1403 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-02-17 03:45:23,167 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [364 Valid, 2349 Invalid, 1458 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 1403 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-02-17 03:45:23,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2023-02-17 03:45:23,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 313. [2023-02-17 03:45:23,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 313 states, 292 states have (on average 1.2089041095890412) internal successors, (353), 300 states have internal predecessors, (353), 5 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (8), 8 states have call predecessors, (8), 5 states have call successors, (8) [2023-02-17 03:45:23,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 366 transitions. [2023-02-17 03:45:23,188 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 366 transitions. Word has length 126 [2023-02-17 03:45:23,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 03:45:23,188 INFO L495 AbstractCegarLoop]: Abstraction has 313 states and 366 transitions. [2023-02-17 03:45:23,188 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 4.964285714285714) internal successors, (139), 26 states have internal predecessors, (139), 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-17 03:45:23,188 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 366 transitions. [2023-02-17 03:45:23,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2023-02-17 03:45:23,189 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 03:45:23,189 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] [2023-02-17 03:45:23,195 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2023-02-17 03:45:23,394 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,SelfDestructingSolverStorable21 [2023-02-17 03:45:23,394 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2023-02-17 03:45:23,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 03:45:23,395 INFO L85 PathProgramCache]: Analyzing trace with hash -303496585, now seen corresponding path program 1 times [2023-02-17 03:45:23,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 03:45:23,395 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842948673] [2023-02-17 03:45:23,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 03:45:23,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 03:45:23,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:45:23,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-17 03:45:23,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:45:23,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-17 03:45:23,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:45:23,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-02-17 03:45:23,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:45:23,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2023-02-17 03:45:23,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:45:23,884 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-17 03:45:23,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 03:45:23,884 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842948673] [2023-02-17 03:45:23,884 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842948673] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 03:45:23,884 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1984214861] [2023-02-17 03:45:23,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 03:45:23,885 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 03:45:23,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 03:45:23,903 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-17 03:45:23,943 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-17 03:45:23,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:45:23,984 INFO L263 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 24 conjunts are in the unsatisfiable core [2023-02-17 03:45:23,985 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 03:45:24,263 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-17 03:45:24,264 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 03:45:24,852 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-17 03:45:24,852 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1984214861] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 03:45:24,853 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-17 03:45:24,853 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 10, 9] total 36 [2023-02-17 03:45:24,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143042707] [2023-02-17 03:45:24,853 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-17 03:45:24,853 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2023-02-17 03:45:24,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 03:45:24,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2023-02-17 03:45:24,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=1151, Unknown=0, NotChecked=0, Total=1260 [2023-02-17 03:45:24,854 INFO L87 Difference]: Start difference. First operand 313 states and 366 transitions. Second operand has 36 states, 36 states have (on average 4.638888888888889) internal successors, (167), 34 states have internal predecessors, (167), 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-17 03:45:26,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 03:45:26,667 INFO L93 Difference]: Finished difference Result 876 states and 1049 transitions. [2023-02-17 03:45:26,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2023-02-17 03:45:26,667 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 4.638888888888889) internal successors, (167), 34 states have internal predecessors, (167), 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 136 [2023-02-17 03:45:26,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 03:45:26,670 INFO L225 Difference]: With dead ends: 876 [2023-02-17 03:45:26,670 INFO L226 Difference]: Without dead ends: 735 [2023-02-17 03:45:26,671 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 322 GetRequests, 263 SyntacticMatches, 4 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 309 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=437, Invalid=2755, Unknown=0, NotChecked=0, Total=3192 [2023-02-17 03:45:26,671 INFO L413 NwaCegarLoop]: 194 mSDtfsCounter, 736 mSDsluCounter, 2999 mSDsCounter, 0 mSdLazyCounter, 1914 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 746 SdHoareTripleChecker+Valid, 3193 SdHoareTripleChecker+Invalid, 2008 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 1914 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-02-17 03:45:26,671 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [746 Valid, 3193 Invalid, 2008 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 1914 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-02-17 03:45:26,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 735 states. [2023-02-17 03:45:26,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 735 to 329. [2023-02-17 03:45:26,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 329 states, 306 states have (on average 1.2124183006535947) internal successors, (371), 314 states have internal predecessors, (371), 6 states have call successors, (6), 4 states have call predecessors, (6), 7 states have return successors, (11), 10 states have call predecessors, (11), 6 states have call successors, (11) [2023-02-17 03:45:26,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 388 transitions. [2023-02-17 03:45:26,706 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 388 transitions. Word has length 136 [2023-02-17 03:45:26,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 03:45:26,706 INFO L495 AbstractCegarLoop]: Abstraction has 329 states and 388 transitions. [2023-02-17 03:45:26,706 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 4.638888888888889) internal successors, (167), 34 states have internal predecessors, (167), 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-17 03:45:26,706 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 388 transitions. [2023-02-17 03:45:26,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2023-02-17 03:45:26,707 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 03:45:26,707 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 16, 15, 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] [2023-02-17 03:45:26,727 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-17 03:45:26,912 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 03:45:26,912 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2023-02-17 03:45:26,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 03:45:26,913 INFO L85 PathProgramCache]: Analyzing trace with hash -1862848251, now seen corresponding path program 1 times [2023-02-17 03:45:26,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 03:45:26,913 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125019453] [2023-02-17 03:45:26,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 03:45:26,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 03:45:26,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:45:27,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-17 03:45:27,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:45:27,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-17 03:45:27,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:45:27,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2023-02-17 03:45:27,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:45:27,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-02-17 03:45:27,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:45:27,303 INFO L134 CoverageAnalysis]: Checked inductivity of 653 backedges. 4 proven. 622 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2023-02-17 03:45:27,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 03:45:27,304 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125019453] [2023-02-17 03:45:27,304 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1125019453] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 03:45:27,304 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1586785966] [2023-02-17 03:45:27,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 03:45:27,304 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 03:45:27,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 03:45:27,309 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-17 03:45:27,311 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-17 03:45:27,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:45:27,380 INFO L263 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 37 conjunts are in the unsatisfiable core [2023-02-17 03:45:27,382 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 03:45:27,727 INFO L134 CoverageAnalysis]: Checked inductivity of 653 backedges. 38 proven. 600 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-02-17 03:45:27,727 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 03:45:28,453 INFO L134 CoverageAnalysis]: Checked inductivity of 653 backedges. 4 proven. 622 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2023-02-17 03:45:28,453 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1586785966] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 03:45:28,453 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-17 03:45:28,453 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 55 [2023-02-17 03:45:28,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895510324] [2023-02-17 03:45:28,454 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-17 03:45:28,454 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2023-02-17 03:45:28,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 03:45:28,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2023-02-17 03:45:28,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=712, Invalid=2258, Unknown=0, NotChecked=0, Total=2970 [2023-02-17 03:45:28,456 INFO L87 Difference]: Start difference. First operand 329 states and 388 transitions. Second operand has 55 states, 55 states have (on average 5.527272727272727) internal successors, (304), 55 states have internal predecessors, (304), 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-17 03:45:33,252 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-17 03:45:40,717 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-17 03:45:44,164 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.00s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-17 03:45:45,204 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-17 03:45:47,223 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-17 03:45:50,924 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-02-17 03:45:54,695 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-17 03:45:56,744 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-17 03:45:58,781 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-17 03:46:35,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 03:46:35,787 INFO L93 Difference]: Finished difference Result 1033 states and 1303 transitions. [2023-02-17 03:46:35,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2023-02-17 03:46:35,788 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 55 states have (on average 5.527272727272727) internal successors, (304), 55 states have internal predecessors, (304), 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 141 [2023-02-17 03:46:35,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 03:46:35,790 INFO L225 Difference]: With dead ends: 1033 [2023-02-17 03:46:35,790 INFO L226 Difference]: Without dead ends: 858 [2023-02-17 03:46:35,792 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 365 GetRequests, 263 SyntacticMatches, 13 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2050 ImplicationChecksByTransitivity, 43.8s TimeCoverageRelationStatistics Valid=2450, Invalid=5728, Unknown=12, NotChecked=0, Total=8190 [2023-02-17 03:46:35,792 INFO L413 NwaCegarLoop]: 147 mSDtfsCounter, 524 mSDsluCounter, 2714 mSDsCounter, 0 mSdLazyCounter, 3416 mSolverCounterSat, 82 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 23.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 524 SdHoareTripleChecker+Valid, 2861 SdHoareTripleChecker+Invalid, 3502 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 3416 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 24.2s IncrementalHoareTripleChecker+Time [2023-02-17 03:46:35,793 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [524 Valid, 2861 Invalid, 3502 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 3416 Invalid, 4 Unknown, 0 Unchecked, 24.2s Time] [2023-02-17 03:46:35,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 858 states. [2023-02-17 03:46:35,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 858 to 347. [2023-02-17 03:46:35,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 347 states, 324 states have (on average 1.1697530864197532) internal successors, (379), 332 states have internal predecessors, (379), 6 states have call successors, (6), 4 states have call predecessors, (6), 7 states have return successors, (11), 10 states have call predecessors, (11), 6 states have call successors, (11) [2023-02-17 03:46:35,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 396 transitions. [2023-02-17 03:46:35,827 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 396 transitions. Word has length 141 [2023-02-17 03:46:35,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 03:46:35,828 INFO L495 AbstractCegarLoop]: Abstraction has 347 states and 396 transitions. [2023-02-17 03:46:35,828 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 55 states have (on average 5.527272727272727) internal successors, (304), 55 states have internal predecessors, (304), 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-17 03:46:35,828 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 396 transitions. [2023-02-17 03:46:35,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2023-02-17 03:46:35,829 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 03:46:35,829 INFO L195 NwaCegarLoop]: trace histogram [24, 24, 24, 24, 23, 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] [2023-02-17 03:46:35,835 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-17 03:46:36,034 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 03:46:36,035 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2023-02-17 03:46:36,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 03:46:36,035 INFO L85 PathProgramCache]: Analyzing trace with hash -459918587, now seen corresponding path program 2 times [2023-02-17 03:46:36,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 03:46:36,036 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115428041] [2023-02-17 03:46:36,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 03:46:36,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 03:46:36,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:46:36,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-17 03:46:36,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:46:36,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-17 03:46:36,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:46:36,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2023-02-17 03:46:36,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:46:36,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2023-02-17 03:46:36,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:46:36,343 INFO L134 CoverageAnalysis]: Checked inductivity of 1433 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 1405 trivial. 0 not checked. [2023-02-17 03:46:36,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 03:46:36,343 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115428041] [2023-02-17 03:46:36,343 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2115428041] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 03:46:36,343 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 03:46:36,344 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-02-17 03:46:36,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431235009] [2023-02-17 03:46:36,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 03:46:36,344 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-02-17 03:46:36,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 03:46:36,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-02-17 03:46:36,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2023-02-17 03:46:36,345 INFO L87 Difference]: Start difference. First operand 347 states and 396 transitions. Second operand has 10 states, 9 states have (on average 5.111111111111111) internal successors, (46), 9 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-17 03:46:36,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 03:46:36,627 INFO L93 Difference]: Finished difference Result 533 states and 619 transitions. [2023-02-17 03:46:36,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-17 03:46:36,627 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.111111111111111) internal successors, (46), 9 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 181 [2023-02-17 03:46:36,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 03:46:36,629 INFO L225 Difference]: With dead ends: 533 [2023-02-17 03:46:36,629 INFO L226 Difference]: Without dead ends: 531 [2023-02-17 03:46:36,629 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2023-02-17 03:46:36,629 INFO L413 NwaCegarLoop]: 173 mSDtfsCounter, 222 mSDsluCounter, 1090 mSDsCounter, 0 mSdLazyCounter, 371 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 1263 SdHoareTripleChecker+Invalid, 376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 371 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-17 03:46:36,630 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 1263 Invalid, 376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 371 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-17 03:46:36,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2023-02-17 03:46:36,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 384. [2023-02-17 03:46:36,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 384 states, 360 states have (on average 1.1861111111111111) internal successors, (427), 366 states have internal predecessors, (427), 6 states have call successors, (6), 4 states have call predecessors, (6), 8 states have return successors, (14), 13 states have call predecessors, (14), 6 states have call successors, (14) [2023-02-17 03:46:36,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 447 transitions. [2023-02-17 03:46:36,668 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 447 transitions. Word has length 181 [2023-02-17 03:46:36,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 03:46:36,668 INFO L495 AbstractCegarLoop]: Abstraction has 384 states and 447 transitions. [2023-02-17 03:46:36,668 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.111111111111111) internal successors, (46), 9 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-17 03:46:36,668 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 447 transitions. [2023-02-17 03:46:36,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2023-02-17 03:46:36,670 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 03:46:36,670 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, 1, 1, 1, 1, 1, 1] [2023-02-17 03:46:36,670 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2023-02-17 03:46:36,670 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2023-02-17 03:46:36,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 03:46:36,670 INFO L85 PathProgramCache]: Analyzing trace with hash 532704085, now seen corresponding path program 1 times [2023-02-17 03:46:36,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 03:46:36,671 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792191724] [2023-02-17 03:46:36,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 03:46:36,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 03:46:36,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:46:36,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-17 03:46:36,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:46:36,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-17 03:46:36,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:46:36,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2023-02-17 03:46:36,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:46:37,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2023-02-17 03:46:37,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:46:37,017 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-17 03:46:37,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 03:46:37,017 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792191724] [2023-02-17 03:46:37,017 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [792191724] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 03:46:37,017 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 03:46:37,018 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-02-17 03:46:37,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569797139] [2023-02-17 03:46:37,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 03:46:37,018 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-17 03:46:37,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 03:46:37,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-17 03:46:37,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2023-02-17 03:46:37,019 INFO L87 Difference]: Start difference. First operand 384 states and 447 transitions. Second operand has 12 states, 10 states have (on average 4.7) internal successors, (47), 10 states have internal predecessors, (47), 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-17 03:46:37,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 03:46:37,295 INFO L93 Difference]: Finished difference Result 482 states and 558 transitions. [2023-02-17 03:46:37,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-02-17 03:46:37,296 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 4.7) internal successors, (47), 10 states have internal predecessors, (47), 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 182 [2023-02-17 03:46:37,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 03:46:37,298 INFO L225 Difference]: With dead ends: 482 [2023-02-17 03:46:37,298 INFO L226 Difference]: Without dead ends: 479 [2023-02-17 03:46:37,298 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=244, Unknown=0, NotChecked=0, Total=306 [2023-02-17 03:46:37,299 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 188 mSDsluCounter, 667 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 748 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-17 03:46:37,299 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 748 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-17 03:46:37,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2023-02-17 03:46:37,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 417. [2023-02-17 03:46:37,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 417 states, 393 states have (on average 1.193384223918575) internal successors, (469), 399 states have internal predecessors, (469), 6 states have call successors, (6), 4 states have call predecessors, (6), 8 states have return successors, (14), 13 states have call predecessors, (14), 6 states have call successors, (14) [2023-02-17 03:46:37,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 489 transitions. [2023-02-17 03:46:37,340 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 489 transitions. Word has length 182 [2023-02-17 03:46:37,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 03:46:37,340 INFO L495 AbstractCegarLoop]: Abstraction has 417 states and 489 transitions. [2023-02-17 03:46:37,340 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 4.7) internal successors, (47), 10 states have internal predecessors, (47), 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-17 03:46:37,340 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 489 transitions. [2023-02-17 03:46:37,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2023-02-17 03:46:37,342 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 03:46:37,342 INFO L195 NwaCegarLoop]: trace histogram [24, 24, 24, 24, 23, 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] [2023-02-17 03:46:37,342 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2023-02-17 03:46:37,343 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2023-02-17 03:46:37,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 03:46:37,343 INFO L85 PathProgramCache]: Analyzing trace with hash -873139045, now seen corresponding path program 1 times [2023-02-17 03:46:37,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 03:46:37,344 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230377166] [2023-02-17 03:46:37,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 03:46:37,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 03:46:37,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:46:37,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-17 03:46:37,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:46:37,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-17 03:46:37,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:46:37,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2023-02-17 03:46:37,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:46:37,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2023-02-17 03:46:37,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:46:37,431 INFO L134 CoverageAnalysis]: Checked inductivity of 1433 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 1414 trivial. 0 not checked. [2023-02-17 03:46:37,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 03:46:37,431 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230377166] [2023-02-17 03:46:37,431 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230377166] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 03:46:37,431 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 03:46:37,432 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-17 03:46:37,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461164459] [2023-02-17 03:46:37,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 03:46:37,432 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-17 03:46:37,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 03:46:37,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-17 03:46:37,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-17 03:46:37,433 INFO L87 Difference]: Start difference. First operand 417 states and 489 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 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-17 03:46:37,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 03:46:37,511 INFO L93 Difference]: Finished difference Result 683 states and 828 transitions. [2023-02-17 03:46:37,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-17 03:46:37,512 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 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 182 [2023-02-17 03:46:37,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 03:46:37,514 INFO L225 Difference]: With dead ends: 683 [2023-02-17 03:46:37,514 INFO L226 Difference]: Without dead ends: 461 [2023-02-17 03:46:37,514 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-17 03:46:37,515 INFO L413 NwaCegarLoop]: 102 mSDtfsCounter, 4 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 283 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-17 03:46:37,515 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 283 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 03:46:37,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2023-02-17 03:46:37,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 437. [2023-02-17 03:46:37,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 437 states, 413 states have (on average 1.1840193704600483) internal successors, (489), 419 states have internal predecessors, (489), 6 states have call successors, (6), 4 states have call predecessors, (6), 8 states have return successors, (14), 13 states have call predecessors, (14), 6 states have call successors, (14) [2023-02-17 03:46:37,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 437 states and 509 transitions. [2023-02-17 03:46:37,557 INFO L78 Accepts]: Start accepts. Automaton has 437 states and 509 transitions. Word has length 182 [2023-02-17 03:46:37,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 03:46:37,558 INFO L495 AbstractCegarLoop]: Abstraction has 437 states and 509 transitions. [2023-02-17 03:46:37,558 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 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-17 03:46:37,558 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 509 transitions. [2023-02-17 03:46:37,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2023-02-17 03:46:37,559 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 03:46:37,559 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, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 03:46:37,560 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2023-02-17 03:46:37,560 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2023-02-17 03:46:37,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 03:46:37,560 INFO L85 PathProgramCache]: Analyzing trace with hash -666042340, now seen corresponding path program 1 times [2023-02-17 03:46:37,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 03:46:37,560 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398496769] [2023-02-17 03:46:37,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 03:46:37,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 03:46:37,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:46:37,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-17 03:46:37,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:46:37,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-17 03:46:37,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:46:37,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2023-02-17 03:46:37,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:46:37,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2023-02-17 03:46:37,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:46:37,788 INFO L134 CoverageAnalysis]: Checked inductivity of 1416 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 1407 trivial. 0 not checked. [2023-02-17 03:46:37,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 03:46:37,789 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398496769] [2023-02-17 03:46:37,789 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [398496769] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 03:46:37,789 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 03:46:37,789 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-02-17 03:46:37,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849160930] [2023-02-17 03:46:37,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 03:46:37,790 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-02-17 03:46:37,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 03:46:37,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-02-17 03:46:37,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2023-02-17 03:46:37,791 INFO L87 Difference]: Start difference. First operand 437 states and 509 transitions. Second operand has 10 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 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-17 03:46:38,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 03:46:38,015 INFO L93 Difference]: Finished difference Result 490 states and 570 transitions. [2023-02-17 03:46:38,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-02-17 03:46:38,015 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 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 183 [2023-02-17 03:46:38,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 03:46:38,017 INFO L225 Difference]: With dead ends: 490 [2023-02-17 03:46:38,017 INFO L226 Difference]: Without dead ends: 489 [2023-02-17 03:46:38,017 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2023-02-17 03:46:38,017 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 90 mSDsluCounter, 624 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 706 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-17 03:46:38,017 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 706 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-17 03:46:38,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 489 states. [2023-02-17 03:46:38,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 489 to 445. [2023-02-17 03:46:38,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 445 states, 421 states have (on average 1.182897862232779) internal successors, (498), 427 states have internal predecessors, (498), 6 states have call successors, (6), 4 states have call predecessors, (6), 8 states have return successors, (14), 13 states have call predecessors, (14), 6 states have call successors, (14) [2023-02-17 03:46:38,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 518 transitions. [2023-02-17 03:46:38,059 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 518 transitions. Word has length 183 [2023-02-17 03:46:38,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 03:46:38,059 INFO L495 AbstractCegarLoop]: Abstraction has 445 states and 518 transitions. [2023-02-17 03:46:38,059 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 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-17 03:46:38,059 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 518 transitions. [2023-02-17 03:46:38,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2023-02-17 03:46:38,060 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 03:46:38,060 INFO L195 NwaCegarLoop]: trace histogram [24, 24, 24, 24, 23, 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] [2023-02-17 03:46:38,061 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2023-02-17 03:46:38,061 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2023-02-17 03:46:38,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 03:46:38,061 INFO L85 PathProgramCache]: Analyzing trace with hash -685003569, now seen corresponding path program 1 times [2023-02-17 03:46:38,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 03:46:38,061 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077183957] [2023-02-17 03:46:38,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 03:46:38,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 03:46:38,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:46:38,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-17 03:46:38,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:46:38,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-17 03:46:38,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:46:38,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2023-02-17 03:46:38,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:46:38,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2023-02-17 03:46:38,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:46:38,318 INFO L134 CoverageAnalysis]: Checked inductivity of 1421 backedges. 15 proven. 7 refuted. 0 times theorem prover too weak. 1399 trivial. 0 not checked. [2023-02-17 03:46:38,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 03:46:38,319 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077183957] [2023-02-17 03:46:38,319 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2077183957] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 03:46:38,319 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1911753247] [2023-02-17 03:46:38,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 03:46:38,319 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 03:46:38,319 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 03:46:38,320 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-17 03:46:38,357 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-17 03:46:38,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:46:38,417 INFO L263 TraceCheckSpWp]: Trace formula consists of 398 conjuncts, 32 conjunts are in the unsatisfiable core [2023-02-17 03:46:38,418 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 03:46:38,566 INFO L134 CoverageAnalysis]: Checked inductivity of 1421 backedges. 11 proven. 19 refuted. 0 times theorem prover too weak. 1391 trivial. 0 not checked. [2023-02-17 03:46:38,566 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 03:46:38,867 INFO L134 CoverageAnalysis]: Checked inductivity of 1421 backedges. 15 proven. 7 refuted. 0 times theorem prover too weak. 1399 trivial. 0 not checked. [2023-02-17 03:46:38,867 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1911753247] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 03:46:38,867 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-17 03:46:38,868 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 10] total 30 [2023-02-17 03:46:38,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944974428] [2023-02-17 03:46:38,868 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-17 03:46:38,869 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-02-17 03:46:38,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 03:46:38,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-02-17 03:46:38,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=851, Unknown=0, NotChecked=0, Total=930 [2023-02-17 03:46:38,870 INFO L87 Difference]: Start difference. First operand 445 states and 518 transitions. Second operand has 31 states, 30 states have (on average 3.7333333333333334) internal successors, (112), 28 states have internal predecessors, (112), 6 states have call successors, (12), 1 states have call predecessors, (12), 5 states have return successors, (12), 9 states have call predecessors, (12), 6 states have call successors, (12) [2023-02-17 03:46:40,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 03:46:40,661 INFO L93 Difference]: Finished difference Result 1042 states and 1198 transitions. [2023-02-17 03:46:40,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2023-02-17 03:46:40,662 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 3.7333333333333334) internal successors, (112), 28 states have internal predecessors, (112), 6 states have call successors, (12), 1 states have call predecessors, (12), 5 states have return successors, (12), 9 states have call predecessors, (12), 6 states have call successors, (12) Word has length 183 [2023-02-17 03:46:40,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 03:46:40,679 INFO L225 Difference]: With dead ends: 1042 [2023-02-17 03:46:40,680 INFO L226 Difference]: Without dead ends: 1010 [2023-02-17 03:46:40,694 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 417 GetRequests, 352 SyntacticMatches, 2 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 772 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=504, Invalid=3656, Unknown=0, NotChecked=0, Total=4160 [2023-02-17 03:46:40,695 INFO L413 NwaCegarLoop]: 225 mSDtfsCounter, 1280 mSDsluCounter, 3610 mSDsCounter, 0 mSdLazyCounter, 1429 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1288 SdHoareTripleChecker+Valid, 3835 SdHoareTripleChecker+Invalid, 1476 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 1429 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-02-17 03:46:40,695 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1288 Valid, 3835 Invalid, 1476 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 1429 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-02-17 03:46:40,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1010 states. [2023-02-17 03:46:40,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1010 to 466. [2023-02-17 03:46:40,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 466 states, 442 states have (on average 1.1877828054298643) internal successors, (525), 447 states have internal predecessors, (525), 6 states have call successors, (6), 4 states have call predecessors, (6), 8 states have return successors, (14), 14 states have call predecessors, (14), 6 states have call successors, (14) [2023-02-17 03:46:40,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 545 transitions. [2023-02-17 03:46:40,751 INFO L78 Accepts]: Start accepts. Automaton has 466 states and 545 transitions. Word has length 183 [2023-02-17 03:46:40,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 03:46:40,752 INFO L495 AbstractCegarLoop]: Abstraction has 466 states and 545 transitions. [2023-02-17 03:46:40,752 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 3.7333333333333334) internal successors, (112), 28 states have internal predecessors, (112), 6 states have call successors, (12), 1 states have call predecessors, (12), 5 states have return successors, (12), 9 states have call predecessors, (12), 6 states have call successors, (12) [2023-02-17 03:46:40,752 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 545 transitions. [2023-02-17 03:46:40,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2023-02-17 03:46:40,753 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 03:46:40,753 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] [2023-02-17 03:46:40,773 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-17 03:46:40,959 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,SelfDestructingSolverStorable28 [2023-02-17 03:46:40,959 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2023-02-17 03:46:40,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 03:46:40,960 INFO L85 PathProgramCache]: Analyzing trace with hash -1909714657, now seen corresponding path program 1 times [2023-02-17 03:46:40,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 03:46:40,960 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611354518] [2023-02-17 03:46:40,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 03:46:40,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 03:46:40,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-17 03:46:40,997 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-17 03:46:41,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-17 03:46:41,072 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-17 03:46:41,072 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-02-17 03:46:41,073 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 18 remaining) [2023-02-17 03:46:41,074 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 18 remaining) [2023-02-17 03:46:41,074 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 18 remaining) [2023-02-17 03:46:41,074 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 18 remaining) [2023-02-17 03:46:41,074 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 18 remaining) [2023-02-17 03:46:41,074 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 18 remaining) [2023-02-17 03:46:41,075 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 18 remaining) [2023-02-17 03:46:41,075 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 18 remaining) [2023-02-17 03:46:41,075 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 18 remaining) [2023-02-17 03:46:41,075 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 18 remaining) [2023-02-17 03:46:41,075 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 18 remaining) [2023-02-17 03:46:41,075 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 18 remaining) [2023-02-17 03:46:41,075 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 18 remaining) [2023-02-17 03:46:41,075 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 18 remaining) [2023-02-17 03:46:41,076 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 18 remaining) [2023-02-17 03:46:41,076 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 18 remaining) [2023-02-17 03:46:41,076 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 18 remaining) [2023-02-17 03:46:41,076 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 18 remaining) [2023-02-17 03:46:41,076 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2023-02-17 03:46:41,078 INFO L445 BasicCegarLoop]: Path program histogram: [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] [2023-02-17 03:46:41,082 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-02-17 03:46:41,152 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.02 03:46:41 BoogieIcfgContainer [2023-02-17 03:46:41,152 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-02-17 03:46:41,153 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-17 03:46:41,153 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-17 03:46:41,153 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-17 03:46:41,153 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 03:45:09" (3/4) ... [2023-02-17 03:46:41,155 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-02-17 03:46:41,155 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-17 03:46:41,156 INFO L158 Benchmark]: Toolchain (without parser) took 92520.32ms. Allocated memory was 127.9MB in the beginning and 325.1MB in the end (delta: 197.1MB). Free memory was 85.1MB in the beginning and 213.4MB in the end (delta: -128.3MB). Peak memory consumption was 70.9MB. Max. memory is 16.1GB. [2023-02-17 03:46:41,156 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 127.9MB. Free memory is still 95.8MB. There was no memory consumed. Max. memory is 16.1GB. [2023-02-17 03:46:41,156 INFO L158 Benchmark]: CACSL2BoogieTranslator took 256.39ms. Allocated memory is still 127.9MB. Free memory was 85.1MB in the beginning and 71.6MB in the end (delta: 13.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-02-17 03:46:41,158 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.06ms. Allocated memory is still 127.9MB. Free memory was 71.6MB in the beginning and 69.2MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-17 03:46:41,158 INFO L158 Benchmark]: Boogie Preprocessor took 24.10ms. Allocated memory is still 127.9MB. Free memory was 69.2MB in the beginning and 67.6MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-17 03:46:41,159 INFO L158 Benchmark]: RCFGBuilder took 548.78ms. Allocated memory was 127.9MB in the beginning and 178.3MB in the end (delta: 50.3MB). Free memory was 67.6MB in the beginning and 144.2MB in the end (delta: -76.6MB). Peak memory consumption was 27.2MB. Max. memory is 16.1GB. [2023-02-17 03:46:41,164 INFO L158 Benchmark]: TraceAbstraction took 91648.06ms. Allocated memory was 178.3MB in the beginning and 325.1MB in the end (delta: 146.8MB). Free memory was 143.0MB in the beginning and 214.4MB in the end (delta: -71.4MB). Peak memory consumption was 75.2MB. Max. memory is 16.1GB. [2023-02-17 03:46:41,164 INFO L158 Benchmark]: Witness Printer took 2.70ms. Allocated memory is still 325.1MB. Free memory was 214.4MB in the beginning and 213.4MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-17 03:46:41,166 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.14ms. Allocated memory is still 127.9MB. Free memory is still 95.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 256.39ms. Allocated memory is still 127.9MB. Free memory was 85.1MB in the beginning and 71.6MB in the end (delta: 13.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.06ms. Allocated memory is still 127.9MB. Free memory was 71.6MB in the beginning and 69.2MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 24.10ms. Allocated memory is still 127.9MB. Free memory was 69.2MB in the beginning and 67.6MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 548.78ms. Allocated memory was 127.9MB in the beginning and 178.3MB in the end (delta: 50.3MB). Free memory was 67.6MB in the beginning and 144.2MB in the end (delta: -76.6MB). Peak memory consumption was 27.2MB. Max. memory is 16.1GB. * TraceAbstraction took 91648.06ms. Allocated memory was 178.3MB in the beginning and 325.1MB in the end (delta: 146.8MB). Free memory was 143.0MB in the beginning and 214.4MB in the end (delta: -71.4MB). Peak memory consumption was 75.2MB. Max. memory is 16.1GB. * Witness Printer took 2.70ms. Allocated memory is still 325.1MB. Free memory was 214.4MB in the beginning and 213.4MB 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=36028797035741185, __retres4=16777217, e=-128, m=16777217, res=16777217] [L241] RET, EXPR base2flt(mb, eb) VAL [a=16777216, base2flt(mb, eb)=36028797035741185, ea=-127, eb=-128, ma=16777216, mb=16777217, one=1744830464, zero=0] [L241] b = base2flt(mb, eb) [L242] 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. - UnprovableResult [Line: 214]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 214]: 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, 109 locations, 18 error locations. Started 1 CEGAR loops. OverallTime: 91.5s, OverallIterations: 30, TraceHistogramMax: 24, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 76.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 4 mSolverCounterUnknown, 7178 SdHoareTripleChecker+Valid, 29.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 7147 mSDsluCounter, 25897 SdHoareTripleChecker+Invalid, 28.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 22699 mSDsCounter, 555 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 12312 IncrementalHoareTripleChecker+Invalid, 12871 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 555 mSolverCounterUnsat, 3198 mSDtfsCounter, 12312 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3068 GetRequests, 2441 SyntacticMatches, 58 SemanticMatches, 569 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5557 ImplicationChecksByTransitivity, 49.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=466occurred in iteration=29, InterpolantAutomatonStates: 445, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 29 MinimizatonAttempts, 5119 StatesRemovedByMinimization, 29 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 9.1s InterpolantComputationTime, 3690 NumberOfCodeBlocks, 3632 NumberOfCodeBlocksAsserted, 48 NumberOfCheckSat, 4597 ConstructedInterpolants, 0 QuantifiedInterpolants, 30918 SizeOfPredicates, 69 NumberOfNonLiveVariables, 3154 ConjunctsInSsa, 252 ConjunctsInUnsatCore, 58 InterpolantComputations, 18 PerfectInterpolantSequences, 13220/18420 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-17 03:46:41,335 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_3a.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 95f89ee6bcff8f17eb3e93b344abecdfb8ddea0894d1b25afafccf6235d7ced6 --- Real Ultimate output --- This is Ultimate 0.2.2-?-26d01a9 [2023-02-17 03:46:43,108 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-17 03:46:43,109 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-17 03:46:43,141 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-17 03:46:43,141 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-17 03:46:43,144 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-17 03:46:43,145 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-17 03:46:43,147 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-17 03:46:43,150 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-17 03:46:43,154 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-17 03:46:43,154 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-17 03:46:43,156 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-17 03:46:43,156 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-17 03:46:43,158 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-17 03:46:43,159 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-17 03:46:43,161 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-17 03:46:43,161 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-17 03:46:43,162 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-17 03:46:43,163 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-17 03:46:43,167 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-17 03:46:43,168 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-17 03:46:43,168 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-17 03:46:43,169 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-17 03:46:43,169 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-17 03:46:43,174 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-17 03:46:43,174 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-17 03:46:43,174 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-17 03:46:43,175 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-17 03:46:43,176 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-17 03:46:43,176 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-17 03:46:43,176 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-17 03:46:43,178 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-17 03:46:43,183 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-17 03:46:43,183 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-17 03:46:43,184 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-17 03:46:43,184 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-17 03:46:43,185 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-17 03:46:43,185 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-17 03:46:43,185 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-17 03:46:43,185 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-17 03:46:43,186 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-17 03:46:43,189 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Bitvector.epf [2023-02-17 03:46:43,216 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-17 03:46:43,216 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-17 03:46:43,217 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-17 03:46:43,217 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-17 03:46:43,217 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-17 03:46:43,217 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-17 03:46:43,218 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-17 03:46:43,218 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-17 03:46:43,218 INFO L138 SettingsManager]: * Use SBE=true [2023-02-17 03:46:43,218 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-17 03:46:43,219 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-17 03:46:43,219 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-17 03:46:43,219 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-17 03:46:43,219 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-17 03:46:43,219 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-17 03:46:43,219 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-17 03:46:43,219 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-17 03:46:43,219 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-17 03:46:43,220 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2023-02-17 03:46:43,220 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2023-02-17 03:46:43,220 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-02-17 03:46:43,220 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-17 03:46:43,220 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-17 03:46:43,220 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-17 03:46:43,220 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-17 03:46:43,220 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-17 03:46:43,220 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-17 03:46:43,220 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-17 03:46:43,220 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-17 03:46:43,221 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-17 03:46:43,221 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-17 03:46:43,221 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-17 03:46:43,221 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2023-02-17 03:46:43,221 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-02-17 03:46:43,221 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-17 03:46:43,221 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-17 03:46:43,221 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-17 03:46:43,221 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-17 03:46:43,222 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2023-02-17 03:46:43,222 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-17 03:46:43,222 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 -> 95f89ee6bcff8f17eb3e93b344abecdfb8ddea0894d1b25afafccf6235d7ced6 [2023-02-17 03:46:43,449 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-17 03:46:43,464 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-17 03:46:43,465 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-17 03:46:43,466 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-17 03:46:43,466 INFO L275 PluginConnector]: CDTParser initialized [2023-02-17 03:46:43,467 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/soft_float_3a.c.cil.c [2023-02-17 03:46:44,663 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-17 03:46:44,861 INFO L351 CDTParser]: Found 1 translation units. [2023-02-17 03:46:44,866 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_3a.c.cil.c [2023-02-17 03:46:44,886 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/449641f8e/5742de76a96543559e10e88ebd7ea73b/FLAGf90f356a0 [2023-02-17 03:46:45,205 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/449641f8e/5742de76a96543559e10e88ebd7ea73b [2023-02-17 03:46:45,207 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-17 03:46:45,208 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-17 03:46:45,209 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-17 03:46:45,209 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-17 03:46:45,223 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-17 03:46:45,223 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.02 03:46:45" (1/1) ... [2023-02-17 03:46:45,224 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@18f5399d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 03:46:45, skipping insertion in model container [2023-02-17 03:46:45,224 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.02 03:46:45" (1/1) ... [2023-02-17 03:46:45,229 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-17 03:46:45,252 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-17 03:46:45,336 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_3a.c.cil.c[728,741] [2023-02-17 03:46:45,365 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-17 03:46:45,384 INFO L203 MainTranslator]: Completed pre-run [2023-02-17 03:46:45,392 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_3a.c.cil.c[728,741] [2023-02-17 03:46:45,433 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-17 03:46:45,441 INFO L208 MainTranslator]: Completed translation [2023-02-17 03:46:45,441 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 03:46:45 WrapperNode [2023-02-17 03:46:45,441 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-17 03:46:45,442 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-17 03:46:45,442 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-17 03:46:45,442 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-17 03:46:45,450 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 03:46:45" (1/1) ... [2023-02-17 03:46:45,463 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 03:46:45" (1/1) ... [2023-02-17 03:46:45,484 INFO L138 Inliner]: procedures = 17, calls = 15, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 122 [2023-02-17 03:46:45,484 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-17 03:46:45,485 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-17 03:46:45,486 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-17 03:46:45,486 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-17 03:46:45,491 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 03:46:45" (1/1) ... [2023-02-17 03:46:45,491 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 03:46:45" (1/1) ... [2023-02-17 03:46:45,504 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 03:46:45" (1/1) ... [2023-02-17 03:46:45,504 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 03:46:45" (1/1) ... [2023-02-17 03:46:45,508 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 03:46:45" (1/1) ... [2023-02-17 03:46:45,510 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 03:46:45" (1/1) ... [2023-02-17 03:46:45,511 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 03:46:45" (1/1) ... [2023-02-17 03:46:45,512 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 03:46:45" (1/1) ... [2023-02-17 03:46:45,523 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-17 03:46:45,526 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-17 03:46:45,526 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-17 03:46:45,526 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-17 03:46:45,526 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 03:46:45" (1/1) ... [2023-02-17 03:46:45,530 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-17 03:46:45,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 03:46:45,562 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-17 03:46:45,580 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-17 03:46:45,590 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-17 03:46:45,590 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-02-17 03:46:45,590 INFO L130 BoogieDeclarations]: Found specification of procedure base2flt [2023-02-17 03:46:45,590 INFO L138 BoogieDeclarations]: Found implementation of procedure base2flt [2023-02-17 03:46:45,591 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-17 03:46:45,591 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-17 03:46:45,591 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-02-17 03:46:45,591 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-02-17 03:46:45,666 INFO L235 CfgBuilder]: Building ICFG [2023-02-17 03:46:45,667 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-17 03:46:45,944 INFO L276 CfgBuilder]: Performing block encoding [2023-02-17 03:46:45,950 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-17 03:46:45,950 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2023-02-17 03:46:45,951 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 03:46:45 BoogieIcfgContainer [2023-02-17 03:46:45,951 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-17 03:46:45,953 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-17 03:46:45,953 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-17 03:46:45,956 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-17 03:46:45,956 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.02 03:46:45" (1/3) ... [2023-02-17 03:46:45,956 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c905934 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.02 03:46:45, skipping insertion in model container [2023-02-17 03:46:45,956 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 03:46:45" (2/3) ... [2023-02-17 03:46:45,957 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c905934 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.02 03:46:45, skipping insertion in model container [2023-02-17 03:46:45,957 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 03:46:45" (3/3) ... [2023-02-17 03:46:45,958 INFO L112 eAbstractionObserver]: Analyzing ICFG soft_float_3a.c.cil.c [2023-02-17 03:46:45,972 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-17 03:46:45,972 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 18 error locations. [2023-02-17 03:46:46,009 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-17 03:46:46,014 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;@ed77c0a, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-17 03:46:46,014 INFO L358 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2023-02-17 03:46:46,017 INFO L276 IsEmpty]: Start isEmpty. Operand has 86 states, 60 states have (on average 1.6833333333333333) internal successors, (101), 79 states have internal predecessors, (101), 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-17 03:46:46,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-02-17 03:46:46,022 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 03:46:46,023 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 03:46:46,023 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2023-02-17 03:46:46,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 03:46:46,027 INFO L85 PathProgramCache]: Analyzing trace with hash -1033814779, now seen corresponding path program 1 times [2023-02-17 03:46:46,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 03:46:46,036 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [245094157] [2023-02-17 03:46:46,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 03:46:46,036 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 03:46:46,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 03:46:46,040 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-17 03:46:46,041 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-17 03:46:46,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:46:46,134 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 1 conjunts are in the unsatisfiable core [2023-02-17 03:46:46,136 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 03:46:46,149 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-17 03:46:46,152 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 03:46:46,153 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 03:46:46,153 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [245094157] [2023-02-17 03:46:46,154 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [245094157] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 03:46:46,154 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 03:46:46,154 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-02-17 03:46:46,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624203886] [2023-02-17 03:46:46,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 03:46:46,161 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-02-17 03:46:46,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 03:46:46,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-02-17 03:46:46,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-17 03:46:46,190 INFO L87 Difference]: Start difference. First operand has 86 states, 60 states have (on average 1.6833333333333333) internal successors, (101), 79 states have internal predecessors, (101), 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-17 03:46:46,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 03:46:46,231 INFO L93 Difference]: Finished difference Result 159 states and 223 transitions. [2023-02-17 03:46:46,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-02-17 03:46:46,233 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-17 03:46:46,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 03:46:46,239 INFO L225 Difference]: With dead ends: 159 [2023-02-17 03:46:46,239 INFO L226 Difference]: Without dead ends: 57 [2023-02-17 03:46:46,242 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-17 03:46:46,245 INFO L413 NwaCegarLoop]: 96 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, 96 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-17 03:46:46,247 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 03:46:46,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2023-02-17 03:46:46,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2023-02-17 03:46:46,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 44 states have (on average 1.3409090909090908) internal successors, (59), 51 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-17 03:46:46,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 67 transitions. [2023-02-17 03:46:46,282 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 67 transitions. Word has length 9 [2023-02-17 03:46:46,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 03:46:46,282 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 67 transitions. [2023-02-17 03:46:46,283 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-17 03:46:46,283 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 67 transitions. [2023-02-17 03:46:46,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-02-17 03:46:46,285 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 03:46:46,285 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 03:46:46,292 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-17 03:46:46,492 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-17 03:46:46,513 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2023-02-17 03:46:46,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 03:46:46,514 INFO L85 PathProgramCache]: Analyzing trace with hash -1034756045, now seen corresponding path program 1 times [2023-02-17 03:46:46,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 03:46:46,514 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [765699434] [2023-02-17 03:46:46,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 03:46:46,515 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-17 03:46:46,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 03:46:46,516 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-17 03:46:46,517 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-17 03:46:46,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:46:46,542 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-17 03:46:46,543 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 03:46:46,573 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-17 03:46:46,574 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 03:46:46,574 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 03:46:46,574 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [765699434] [2023-02-17 03:46:46,574 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [765699434] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 03:46:46,574 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 03:46:46,574 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-17 03:46:46,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869951030] [2023-02-17 03:46:46,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 03:46:46,575 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-17 03:46:46,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 03:46:46,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-17 03:46:46,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-17 03:46:46,576 INFO L87 Difference]: Start difference. First operand 57 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-17 03:46:46,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 03:46:46,643 INFO L93 Difference]: Finished difference Result 119 states and 141 transitions. [2023-02-17 03:46:46,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-17 03:46:46,643 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-17 03:46:46,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 03:46:46,645 INFO L225 Difference]: With dead ends: 119 [2023-02-17 03:46:46,646 INFO L226 Difference]: Without dead ends: 65 [2023-02-17 03:46:46,646 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-17 03:46:46,647 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-17 03:46:46,648 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-17 03:46:46,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2023-02-17 03:46:46,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 62. [2023-02-17 03:46:46,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 48 states have (on average 1.3125) internal successors, (63), 55 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-17 03:46:46,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 71 transitions. [2023-02-17 03:46:46,658 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 71 transitions. Word has length 9 [2023-02-17 03:46:46,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 03:46:46,667 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 71 transitions. [2023-02-17 03:46:46,667 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-17 03:46:46,668 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 71 transitions. [2023-02-17 03:46:46,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-02-17 03:46:46,672 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 03:46:46,672 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 03:46:46,691 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2023-02-17 03:46:46,878 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-17 03:46:46,878 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2023-02-17 03:46:46,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 03:46:46,879 INFO L85 PathProgramCache]: Analyzing trace with hash -1755996823, now seen corresponding path program 1 times [2023-02-17 03:46:46,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 03:46:46,880 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [13944295] [2023-02-17 03:46:46,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 03:46:46,880 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-17 03:46:46,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 03:46:46,883 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-17 03:46:46,885 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-02-17 03:46:46,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:46:46,924 INFO L263 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-17 03:46:46,925 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 03:46:46,935 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-17 03:46:46,939 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 03:46:46,940 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 03:46:46,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [13944295] [2023-02-17 03:46:46,940 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [13944295] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 03:46:46,941 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 03:46:46,941 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-17 03:46:46,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487230533] [2023-02-17 03:46:46,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 03:46:46,942 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-17 03:46:46,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 03:46:46,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-17 03:46:46,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-17 03:46:46,946 INFO L87 Difference]: Start difference. First operand 62 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-17 03:46:47,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 03:46:47,037 INFO L93 Difference]: Finished difference Result 151 states and 180 transitions. [2023-02-17 03:46:47,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-17 03:46:47,038 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-17 03:46:47,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 03:46:47,039 INFO L225 Difference]: With dead ends: 151 [2023-02-17 03:46:47,039 INFO L226 Difference]: Without dead ends: 99 [2023-02-17 03:46:47,039 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-17 03:46:47,040 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 55 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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-17 03:46:47,040 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-17 03:46:47,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2023-02-17 03:46:47,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 92. [2023-02-17 03:46:47,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 77 states have (on average 1.3246753246753247) internal successors, (102), 84 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-17 03:46:47,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 110 transitions. [2023-02-17 03:46:47,057 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 110 transitions. Word has length 16 [2023-02-17 03:46:47,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 03:46:47,057 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 110 transitions. [2023-02-17 03:46:47,058 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-17 03:46:47,058 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 110 transitions. [2023-02-17 03:46:47,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-02-17 03:46:47,058 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 03:46:47,059 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-17 03:46:47,065 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-17 03:46:47,265 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-17 03:46:47,265 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2023-02-17 03:46:47,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 03:46:47,266 INFO L85 PathProgramCache]: Analyzing trace with hash 1427259253, now seen corresponding path program 1 times [2023-02-17 03:46:47,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 03:46:47,266 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1252521386] [2023-02-17 03:46:47,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 03:46:47,266 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-17 03:46:47,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 03:46:47,273 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-17 03:46:47,278 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-17 03:46:47,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:46:47,305 INFO L263 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-17 03:46:47,307 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 03:46:47,319 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-17 03:46:47,319 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 03:46:47,319 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 03:46:47,319 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1252521386] [2023-02-17 03:46:47,320 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1252521386] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 03:46:47,320 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 03:46:47,320 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-17 03:46:47,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371698515] [2023-02-17 03:46:47,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 03:46:47,320 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-17 03:46:47,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 03:46:47,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-17 03:46:47,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-17 03:46:47,321 INFO L87 Difference]: Start difference. First operand 92 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-17 03:46:47,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 03:46:47,366 INFO L93 Difference]: Finished difference Result 162 states and 189 transitions. [2023-02-17 03:46:47,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-17 03:46:47,366 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-17 03:46:47,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 03:46:47,367 INFO L225 Difference]: With dead ends: 162 [2023-02-17 03:46:47,367 INFO L226 Difference]: Without dead ends: 91 [2023-02-17 03:46:47,368 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-17 03:46:47,369 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-17 03:46:47,369 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-17 03:46:47,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2023-02-17 03:46:47,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 81. [2023-02-17 03:46:47,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 66 states have (on average 1.2878787878787878) 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-17 03:46:47,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 93 transitions. [2023-02-17 03:46:47,387 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 93 transitions. Word has length 21 [2023-02-17 03:46:47,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 03:46:47,387 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 93 transitions. [2023-02-17 03:46:47,387 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-17 03:46:47,387 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 93 transitions. [2023-02-17 03:46:47,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-02-17 03:46:47,388 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 03:46:47,388 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-17 03:46:47,396 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-17 03:46:47,594 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-17 03:46:47,595 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2023-02-17 03:46:47,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 03:46:47,595 INFO L85 PathProgramCache]: Analyzing trace with hash 1427150149, now seen corresponding path program 1 times [2023-02-17 03:46:47,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 03:46:47,596 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2049579579] [2023-02-17 03:46:47,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 03:46:47,596 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-17 03:46:47,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 03:46:47,597 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-17 03:46:47,604 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-17 03:46:47,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:46:47,628 INFO L263 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-17 03:46:47,629 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 03:46:47,646 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-17 03:46:47,646 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 03:46:47,690 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-17 03:46:47,691 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 03:46:47,691 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2049579579] [2023-02-17 03:46:47,691 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2049579579] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 03:46:47,691 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 03:46:47,691 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2023-02-17 03:46:47,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091642168] [2023-02-17 03:46:47,692 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 03:46:47,692 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-17 03:46:47,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 03:46:47,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-17 03:46:47,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-02-17 03:46:47,693 INFO L87 Difference]: Start difference. First operand 81 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-17 03:46:47,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 03:46:47,981 INFO L93 Difference]: Finished difference Result 173 states and 209 transitions. [2023-02-17 03:46:47,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-17 03:46:47,983 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-17 03:46:47,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 03:46:47,984 INFO L225 Difference]: With dead ends: 173 [2023-02-17 03:46:47,984 INFO L226 Difference]: Without dead ends: 118 [2023-02-17 03:46:47,985 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-17 03:46:47,985 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 186 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-17 03:46:47,986 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 271 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-17 03:46:47,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2023-02-17 03:46:47,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 82. [2023-02-17 03:46:47,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 68 states have (on average 1.25) internal successors, (85), 74 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-17 03:46:47,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 93 transitions. [2023-02-17 03:46:47,995 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 93 transitions. Word has length 21 [2023-02-17 03:46:47,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 03:46:47,996 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 93 transitions. [2023-02-17 03:46:47,996 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-17 03:46:47,996 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 93 transitions. [2023-02-17 03:46:47,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-02-17 03:46:47,997 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 03:46:47,997 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-17 03:46:48,008 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-17 03:46:48,204 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-17 03:46:48,205 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2023-02-17 03:46:48,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 03:46:48,206 INFO L85 PathProgramCache]: Analyzing trace with hash 268685593, now seen corresponding path program 1 times [2023-02-17 03:46:48,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 03:46:48,207 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1817491344] [2023-02-17 03:46:48,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 03:46:48,208 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-17 03:46:48,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 03:46:48,209 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-17 03:46:48,212 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-17 03:46:48,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:46:48,239 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-17 03:46:48,240 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 03:46:48,262 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-17 03:46:48,263 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 03:46:48,287 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-17 03:46:48,287 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 03:46:48,287 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1817491344] [2023-02-17 03:46:48,288 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1817491344] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 03:46:48,288 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 03:46:48,288 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2023-02-17 03:46:48,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820040133] [2023-02-17 03:46:48,288 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 03:46:48,289 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-02-17 03:46:48,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 03:46:48,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-02-17 03:46:48,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2023-02-17 03:46:48,290 INFO L87 Difference]: Start difference. First operand 82 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-17 03:46:48,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 03:46:48,451 INFO L93 Difference]: Finished difference Result 176 states and 204 transitions. [2023-02-17 03:46:48,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-02-17 03:46:48,451 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-17 03:46:48,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 03:46:48,452 INFO L225 Difference]: With dead ends: 176 [2023-02-17 03:46:48,453 INFO L226 Difference]: Without dead ends: 119 [2023-02-17 03:46:48,453 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-17 03:46:48,454 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 141 mSDsluCounter, 403 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 474 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 03:46:48,454 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 474 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 03:46:48,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2023-02-17 03:46:48,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 100. [2023-02-17 03:46:48,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 86 states have (on average 1.2325581395348837) internal successors, (106), 92 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-17 03:46:48,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 114 transitions. [2023-02-17 03:46:48,463 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 114 transitions. Word has length 26 [2023-02-17 03:46:48,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 03:46:48,463 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 114 transitions. [2023-02-17 03:46:48,463 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-17 03:46:48,463 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 114 transitions. [2023-02-17 03:46:48,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-02-17 03:46:48,464 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 03:46:48,464 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-17 03:46:48,471 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-17 03:46:48,670 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-17 03:46:48,671 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting base2fltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2023-02-17 03:46:48,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 03:46:48,672 INFO L85 PathProgramCache]: Analyzing trace with hash 1743264717, now seen corresponding path program 1 times [2023-02-17 03:46:48,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 03:46:48,672 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [121818564] [2023-02-17 03:46:48,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 03:46:48,672 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-17 03:46:48,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 03:46:48,689 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-17 03:46:48,713 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-17 03:46:48,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:46:48,740 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-17 03:46:48,742 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 03:46:48,762 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-17 03:46:48,762 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 03:46:48,825 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-17 03:46:48,826 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 03:46:48,826 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [121818564] [2023-02-17 03:46:48,826 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [121818564] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 03:46:48,826 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 03:46:48,826 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2023-02-17 03:46:48,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553814439] [2023-02-17 03:46:48,827 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 03:46:48,827 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-02-17 03:46:48,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 03:46:48,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-02-17 03:46:48,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2023-02-17 03:46:48,828 INFO L87 Difference]: Start difference. First operand 100 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-17 03:46:49,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 03:46:49,096 INFO L93 Difference]: Finished difference Result 243 states and 292 transitions. [2023-02-17 03:46:49,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-02-17 03:46:49,097 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-17 03:46:49,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 03:46:49,098 INFO L225 Difference]: With dead ends: 243 [2023-02-17 03:46:49,098 INFO L226 Difference]: Without dead ends: 186 [2023-02-17 03:46:49,099 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 68 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=149, Unknown=0, NotChecked=0, Total=240 [2023-02-17 03:46:49,099 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 114 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 348 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-17 03:46:49,099 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 348 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-17 03:46:49,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2023-02-17 03:46:49,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 102. [2023-02-17 03:46:49,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 88 states have (on average 1.1931818181818181) internal successors, (105), 94 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-17 03:46:49,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 113 transitions. [2023-02-17 03:46:49,110 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 113 transitions. Word has length 38 [2023-02-17 03:46:49,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 03:46:49,110 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 113 transitions. [2023-02-17 03:46:49,110 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-17 03:46:49,110 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 113 transitions. [2023-02-17 03:46:49,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-02-17 03:46:49,111 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 03:46:49,111 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-17 03:46:49,118 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-17 03:46:49,317 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-17 03:46:49,318 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2023-02-17 03:46:49,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 03:46:49,318 INFO L85 PathProgramCache]: Analyzing trace with hash 171656217, now seen corresponding path program 2 times [2023-02-17 03:46:49,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 03:46:49,319 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1311070666] [2023-02-17 03:46:49,319 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-17 03:46:49,319 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-17 03:46:49,319 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 03:46:49,320 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-17 03:46:49,322 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-17 03:46:49,358 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-17 03:46:49,358 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 03:46:49,359 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-17 03:46:49,361 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 03:46:49,395 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-17 03:46:49,396 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 03:46:49,506 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-17 03:46:49,506 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 03:46:49,506 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1311070666] [2023-02-17 03:46:49,506 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1311070666] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 03:46:49,506 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 03:46:49,506 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 19 [2023-02-17 03:46:49,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601846053] [2023-02-17 03:46:49,506 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 03:46:49,507 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-02-17 03:46:49,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 03:46:49,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-02-17 03:46:49,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=249, Unknown=0, NotChecked=0, Total=342 [2023-02-17 03:46:49,508 INFO L87 Difference]: Start difference. First operand 102 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-17 03:46:49,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 03:46:49,873 INFO L93 Difference]: Finished difference Result 234 states and 272 transitions. [2023-02-17 03:46:49,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-02-17 03:46:49,874 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-17 03:46:49,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 03:46:49,875 INFO L225 Difference]: With dead ends: 234 [2023-02-17 03:46:49,875 INFO L226 Difference]: Without dead ends: 177 [2023-02-17 03:46:49,876 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 81 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=383, Invalid=949, Unknown=0, NotChecked=0, Total=1332 [2023-02-17 03:46:49,876 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 320 mSDsluCounter, 736 mSDsCounter, 0 mSdLazyCounter, 296 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 320 SdHoareTripleChecker+Valid, 814 SdHoareTripleChecker+Invalid, 317 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-17 03:46:49,877 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [320 Valid, 814 Invalid, 317 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 296 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-17 03:46:49,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2023-02-17 03:46:49,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 140. [2023-02-17 03:46:49,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 126 states have (on average 1.1904761904761905) internal successors, (150), 132 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-17 03:46:49,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 158 transitions. [2023-02-17 03:46:49,899 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 158 transitions. Word has length 46 [2023-02-17 03:46:49,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 03:46:49,899 INFO L495 AbstractCegarLoop]: Abstraction has 140 states and 158 transitions. [2023-02-17 03:46:49,900 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-17 03:46:49,900 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 158 transitions. [2023-02-17 03:46:49,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-02-17 03:46:49,901 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 03:46:49,901 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-17 03:46:49,913 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-17 03:46:50,109 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-17 03:46:50,110 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting base2fltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2023-02-17 03:46:50,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 03:46:50,111 INFO L85 PathProgramCache]: Analyzing trace with hash -1551167795, now seen corresponding path program 2 times [2023-02-17 03:46:50,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 03:46:50,111 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1804238520] [2023-02-17 03:46:50,112 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-17 03:46:50,112 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-17 03:46:50,112 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 03:46:50,113 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-17 03:46:50,115 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-17 03:46:50,139 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-02-17 03:46:50,140 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 03:46:50,140 INFO L263 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-17 03:46:50,141 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 03:46:50,144 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-17 03:46:50,144 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 03:46:50,145 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 03:46:50,145 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1804238520] [2023-02-17 03:46:50,145 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1804238520] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 03:46:50,145 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 03:46:50,145 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-17 03:46:50,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610437557] [2023-02-17 03:46:50,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 03:46:50,146 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-17 03:46:50,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 03:46:50,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-17 03:46:50,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-17 03:46:50,146 INFO L87 Difference]: Start difference. First operand 140 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-17 03:46:50,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 03:46:50,165 INFO L93 Difference]: Finished difference Result 146 states and 165 transitions. [2023-02-17 03:46:50,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-17 03:46:50,166 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-17 03:46:50,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 03:46:50,167 INFO L225 Difference]: With dead ends: 146 [2023-02-17 03:46:50,167 INFO L226 Difference]: Without dead ends: 145 [2023-02-17 03:46:50,168 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-17 03:46:50,168 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-17 03:46:50,169 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-17 03:46:50,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2023-02-17 03:46:50,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 139. [2023-02-17 03:46:50,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 126 states have (on average 1.1825396825396826) internal successors, (149), 131 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-17 03:46:50,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 157 transitions. [2023-02-17 03:46:50,177 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 157 transitions. Word has length 58 [2023-02-17 03:46:50,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 03:46:50,177 INFO L495 AbstractCegarLoop]: Abstraction has 139 states and 157 transitions. [2023-02-17 03:46:50,177 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-17 03:46:50,177 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 157 transitions. [2023-02-17 03:46:50,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-02-17 03:46:50,178 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 03:46:50,178 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-17 03:46:50,184 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-17 03:46:50,384 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-17 03:46:50,385 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2023-02-17 03:46:50,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 03:46:50,385 INFO L85 PathProgramCache]: Analyzing trace with hash -1551100269, now seen corresponding path program 1 times [2023-02-17 03:46:50,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 03:46:50,386 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1977018511] [2023-02-17 03:46:50,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 03:46:50,386 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-17 03:46:50,386 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 03:46:50,387 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-17 03:46:50,401 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-17 03:46:50,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:46:50,431 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 9 conjunts are in the unsatisfiable core [2023-02-17 03:46:50,432 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 03:46:50,501 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-17 03:46:50,501 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 03:46:50,717 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-17 03:46:50,717 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 03:46:50,717 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1977018511] [2023-02-17 03:46:50,717 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1977018511] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 03:46:50,717 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 03:46:50,717 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2023-02-17 03:46:50,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424439102] [2023-02-17 03:46:50,717 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 03:46:50,718 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-02-17 03:46:50,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 03:46:50,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-02-17 03:46:50,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=209, Unknown=0, NotChecked=0, Total=306 [2023-02-17 03:46:50,718 INFO L87 Difference]: Start difference. First operand 139 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-17 03:46:51,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 03:46:51,792 INFO L93 Difference]: Finished difference Result 384 states and 469 transitions. [2023-02-17 03:46:51,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-02-17 03:46:51,793 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-17 03:46:51,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 03:46:51,794 INFO L225 Difference]: With dead ends: 384 [2023-02-17 03:46:51,794 INFO L226 Difference]: Without dead ends: 328 [2023-02-17 03:46:51,795 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 109 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=343, Invalid=649, Unknown=0, NotChecked=0, Total=992 [2023-02-17 03:46:51,795 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 367 mSDsluCounter, 696 mSDsCounter, 0 mSdLazyCounter, 701 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 367 SdHoareTripleChecker+Valid, 788 SdHoareTripleChecker+Invalid, 732 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 701 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-02-17 03:46:51,795 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [367 Valid, 788 Invalid, 732 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 701 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-02-17 03:46:51,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2023-02-17 03:46:51,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 141. [2023-02-17 03:46:51,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 128 states have (on average 1.125) internal successors, (144), 133 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-17 03:46:51,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 152 transitions. [2023-02-17 03:46:51,829 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 152 transitions. Word has length 58 [2023-02-17 03:46:51,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 03:46:51,829 INFO L495 AbstractCegarLoop]: Abstraction has 141 states and 152 transitions. [2023-02-17 03:46:51,829 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-17 03:46:51,829 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 152 transitions. [2023-02-17 03:46:51,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2023-02-17 03:46:51,831 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 03:46:51,831 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-17 03:46:51,851 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-17 03:46:52,037 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-17 03:46:52,038 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2023-02-17 03:46:52,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 03:46:52,039 INFO L85 PathProgramCache]: Analyzing trace with hash -1547458023, now seen corresponding path program 3 times [2023-02-17 03:46:52,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 03:46:52,039 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1691863036] [2023-02-17 03:46:52,039 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-17 03:46:52,039 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-17 03:46:52,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 03:46:52,062 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-17 03:46:52,076 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-17 03:46:52,149 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2023-02-17 03:46:52,149 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 03:46:52,151 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 18 conjunts are in the unsatisfiable core [2023-02-17 03:46:52,153 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 03:46:52,305 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-17 03:46:52,305 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 03:46:52,679 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-17 03:46:52,679 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 03:46:52,680 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1691863036] [2023-02-17 03:46:52,680 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1691863036] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 03:46:52,680 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 03:46:52,680 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 19] total 35 [2023-02-17 03:46:52,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368894965] [2023-02-17 03:46:52,680 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 03:46:52,680 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2023-02-17 03:46:52,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 03:46:52,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2023-02-17 03:46:52,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=304, Invalid=886, Unknown=0, NotChecked=0, Total=1190 [2023-02-17 03:46:52,681 INFO L87 Difference]: Start difference. First operand 141 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-17 03:46:55,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 03:46:55,563 INFO L93 Difference]: Finished difference Result 487 states and 585 transitions. [2023-02-17 03:46:55,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2023-02-17 03:46:55,564 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-17 03:46:55,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 03:46:55,572 INFO L225 Difference]: With dead ends: 487 [2023-02-17 03:46:55,572 INFO L226 Difference]: Without dead ends: 431 [2023-02-17 03:46:55,578 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 171 SyntacticMatches, 1 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2296 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2711, Invalid=7189, Unknown=0, NotChecked=0, Total=9900 [2023-02-17 03:46:55,593 INFO L413 NwaCegarLoop]: 179 mSDtfsCounter, 728 mSDsluCounter, 2814 mSDsCounter, 0 mSdLazyCounter, 1671 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 728 SdHoareTripleChecker+Valid, 2993 SdHoareTripleChecker+Invalid, 1740 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 1671 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-02-17 03:46:55,593 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [728 Valid, 2993 Invalid, 1740 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 1671 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-02-17 03:46:55,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2023-02-17 03:46:55,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 219. [2023-02-17 03:46:55,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 206 states have (on average 1.1553398058252426) internal successors, (238), 211 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-17 03:46:55,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 246 transitions. [2023-02-17 03:46:55,631 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 246 transitions. Word has length 86 [2023-02-17 03:46:55,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 03:46:55,632 INFO L495 AbstractCegarLoop]: Abstraction has 219 states and 246 transitions. [2023-02-17 03:46:55,633 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-17 03:46:55,633 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 246 transitions. [2023-02-17 03:46:55,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2023-02-17 03:46:55,634 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 03:46:55,634 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-17 03:46:55,653 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-17 03:46:55,842 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-17 03:46:55,843 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2023-02-17 03:46:55,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 03:46:55,843 INFO L85 PathProgramCache]: Analyzing trace with hash 1705737363, now seen corresponding path program 2 times [2023-02-17 03:46:55,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 03:46:55,844 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [611274185] [2023-02-17 03:46:55,844 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-17 03:46:55,844 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-17 03:46:55,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 03:46:55,846 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-17 03:46:55,850 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-17 03:46:55,944 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-17 03:46:55,945 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 03:46:55,947 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 17 conjunts are in the unsatisfiable core [2023-02-17 03:46:55,949 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 03:46:56,284 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-17 03:46:56,284 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 03:46:57,261 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-17 03:46:57,261 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 03:46:57,261 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [611274185] [2023-02-17 03:46:57,261 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [611274185] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 03:46:57,261 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 03:46:57,261 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 34 [2023-02-17 03:46:57,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182540531] [2023-02-17 03:46:57,262 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 03:46:57,262 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-02-17 03:46:57,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 03:46:57,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-02-17 03:46:57,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=321, Invalid=801, Unknown=0, NotChecked=0, Total=1122 [2023-02-17 03:46:57,263 INFO L87 Difference]: Start difference. First operand 219 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-17 03:47:02,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 03:47:02,256 INFO L93 Difference]: Finished difference Result 678 states and 837 transitions. [2023-02-17 03:47:02,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2023-02-17 03:47:02,257 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-17 03:47:02,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 03:47:02,259 INFO L225 Difference]: With dead ends: 678 [2023-02-17 03:47:02,259 INFO L226 Difference]: Without dead ends: 622 [2023-02-17 03:47:02,260 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 188 SyntacticMatches, 3 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 245 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=1327, Invalid=2705, Unknown=0, NotChecked=0, Total=4032 [2023-02-17 03:47:02,260 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 764 mSDsluCounter, 2281 mSDsCounter, 0 mSdLazyCounter, 2704 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 764 SdHoareTripleChecker+Valid, 2417 SdHoareTripleChecker+Invalid, 2776 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 2704 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2023-02-17 03:47:02,260 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [764 Valid, 2417 Invalid, 2776 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 2704 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2023-02-17 03:47:02,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 622 states. [2023-02-17 03:47:02,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 622 to 221. [2023-02-17 03:47:02,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 208 states have (on average 1.0817307692307692) internal successors, (225), 213 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-17 03:47:02,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 233 transitions. [2023-02-17 03:47:02,280 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 233 transitions. Word has length 98 [2023-02-17 03:47:02,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 03:47:02,281 INFO L495 AbstractCegarLoop]: Abstraction has 221 states and 233 transitions. [2023-02-17 03:47:02,281 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-17 03:47:02,281 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 233 transitions. [2023-02-17 03:47:02,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2023-02-17 03:47:02,282 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 03:47:02,282 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-17 03:47:02,289 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-17 03:47:02,487 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-17 03:47:02,488 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2023-02-17 03:47:02,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 03:47:02,491 INFO L85 PathProgramCache]: Analyzing trace with hash 429521305, now seen corresponding path program 4 times [2023-02-17 03:47:02,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 03:47:02,491 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1494699716] [2023-02-17 03:47:02,491 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-02-17 03:47:02,492 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-17 03:47:02,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 03:47:02,493 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-17 03:47:02,493 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2023-02-17 03:47:02,573 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-02-17 03:47:02,574 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 03:47:02,591 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 27 conjunts are in the unsatisfiable core [2023-02-17 03:47:02,593 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 03:47:02,946 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-17 03:47:02,946 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 03:47:04,881 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-17 03:47:04,881 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 03:47:04,881 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1494699716] [2023-02-17 03:47:04,881 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1494699716] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 03:47:04,881 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 03:47:04,881 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 53 [2023-02-17 03:47:04,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342284544] [2023-02-17 03:47:04,882 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 03:47:04,882 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2023-02-17 03:47:04,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 03:47:04,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2023-02-17 03:47:04,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=731, Invalid=2131, Unknown=0, NotChecked=0, Total=2862 [2023-02-17 03:47:04,883 INFO L87 Difference]: Start difference. First operand 221 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-17 03:47:30,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 03:47:30,077 INFO L93 Difference]: Finished difference Result 457 states and 523 transitions. [2023-02-17 03:47:30,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2023-02-17 03:47:30,082 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-17 03:47:30,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 03:47:30,084 INFO L225 Difference]: With dead ends: 457 [2023-02-17 03:47:30,084 INFO L226 Difference]: Without dead ends: 456 [2023-02-17 03:47:30,087 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 353 GetRequests, 224 SyntacticMatches, 1 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2112 ImplicationChecksByTransitivity, 21.6s TimeCoverageRelationStatistics Valid=4535, Invalid=12235, Unknown=0, NotChecked=0, Total=16770 [2023-02-17 03:47:30,087 INFO L413 NwaCegarLoop]: 101 mSDtfsCounter, 878 mSDsluCounter, 4039 mSDsCounter, 0 mSdLazyCounter, 3979 mSolverCounterSat, 150 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 878 SdHoareTripleChecker+Valid, 4140 SdHoareTripleChecker+Invalid, 4129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 150 IncrementalHoareTripleChecker+Valid, 3979 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2023-02-17 03:47:30,088 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [878 Valid, 4140 Invalid, 4129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [150 Valid, 3979 Invalid, 0 Unknown, 0 Unchecked, 5.5s Time] [2023-02-17 03:47:30,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2023-02-17 03:47:30,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 339. [2023-02-17 03:47:30,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 339 states, 326 states have (on average 1.1901840490797546) internal successors, (388), 331 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-17 03:47:30,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 396 transitions. [2023-02-17 03:47:30,142 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 396 transitions. Word has length 136 [2023-02-17 03:47:30,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 03:47:30,142 INFO L495 AbstractCegarLoop]: Abstraction has 339 states and 396 transitions. [2023-02-17 03:47:30,142 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-17 03:47:30,143 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 396 transitions. [2023-02-17 03:47:30,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2023-02-17 03:47:30,144 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 03:47:30,145 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-17 03:47:30,152 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-17 03:47:30,351 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-17 03:47:30,352 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2023-02-17 03:47:30,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 03:47:30,352 INFO L85 PathProgramCache]: Analyzing trace with hash -2109656538, now seen corresponding path program 1 times [2023-02-17 03:47:30,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 03:47:30,353 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1355380776] [2023-02-17 03:47:30,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 03:47:30,353 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-17 03:47:30,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 03:47:30,355 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-17 03:47:30,385 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2023-02-17 03:47:30,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:47:30,440 INFO L263 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-17 03:47:30,441 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 03:47:30,472 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-17 03:47:30,478 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 03:47:30,479 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 03:47:30,479 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1355380776] [2023-02-17 03:47:30,479 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1355380776] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 03:47:30,479 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 03:47:30,479 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-17 03:47:30,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632662951] [2023-02-17 03:47:30,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 03:47:30,480 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-17 03:47:30,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 03:47:30,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-17 03:47:30,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-17 03:47:30,480 INFO L87 Difference]: Start difference. First operand 339 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-17 03:47:30,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 03:47:30,636 INFO L93 Difference]: Finished difference Result 351 states and 411 transitions. [2023-02-17 03:47:30,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-17 03:47:30,637 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-17 03:47:30,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 03:47:30,638 INFO L225 Difference]: With dead ends: 351 [2023-02-17 03:47:30,638 INFO L226 Difference]: Without dead ends: 350 [2023-02-17 03:47:30,638 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-17 03:47:30,639 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 52 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2023-02-17 03:47:30,639 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.1s Time] [2023-02-17 03:47:30,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2023-02-17 03:47:30,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 341. [2023-02-17 03:47:30,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 328 states have (on average 1.1920731707317074) internal successors, (391), 333 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-17 03:47:30,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 399 transitions. [2023-02-17 03:47:30,691 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 399 transitions. Word has length 149 [2023-02-17 03:47:30,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 03:47:30,691 INFO L495 AbstractCegarLoop]: Abstraction has 341 states and 399 transitions. [2023-02-17 03:47:30,691 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-17 03:47:30,691 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 399 transitions. [2023-02-17 03:47:30,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2023-02-17 03:47:30,692 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 03:47:30,692 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-17 03:47:30,701 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2023-02-17 03:47:30,899 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-17 03:47:30,900 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2023-02-17 03:47:30,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 03:47:30,901 INFO L85 PathProgramCache]: Analyzing trace with hash -679741690, now seen corresponding path program 1 times [2023-02-17 03:47:30,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 03:47:30,901 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1575418213] [2023-02-17 03:47:30,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 03:47:30,902 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-17 03:47:30,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 03:47:30,903 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-17 03:47:30,905 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-17 03:47:30,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:47:30,974 INFO L263 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-17 03:47:30,975 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 03:47:31,655 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-17 03:47:31,656 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 03:47:31,656 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 03:47:31,656 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1575418213] [2023-02-17 03:47:31,656 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1575418213] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 03:47:31,657 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 03:47:31,658 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-17 03:47:31,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442615744] [2023-02-17 03:47:31,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 03:47:31,658 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-17 03:47:31,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 03:47:31,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-17 03:47:31,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-02-17 03:47:31,659 INFO L87 Difference]: Start difference. First operand 341 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-17 03:47:34,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 03:47:34,430 INFO L93 Difference]: Finished difference Result 356 states and 418 transitions. [2023-02-17 03:47:34,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-17 03:47:34,431 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-17 03:47:34,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 03:47:34,432 INFO L225 Difference]: With dead ends: 356 [2023-02-17 03:47:34,432 INFO L226 Difference]: Without dead ends: 355 [2023-02-17 03:47:34,434 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 150 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2023-02-17 03:47:34,435 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 60 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2023-02-17 03:47:34,436 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 195 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2023-02-17 03:47:34,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2023-02-17 03:47:34,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 220. [2023-02-17 03:47:34,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 208 states have (on average 1.0721153846153846) internal successors, (223), 212 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-17 03:47:34,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 231 transitions. [2023-02-17 03:47:34,473 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 231 transitions. Word has length 152 [2023-02-17 03:47:34,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 03:47:34,473 INFO L495 AbstractCegarLoop]: Abstraction has 220 states and 231 transitions. [2023-02-17 03:47:34,473 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-17 03:47:34,474 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 231 transitions. [2023-02-17 03:47:34,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2023-02-17 03:47:34,475 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 03:47:34,475 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] [2023-02-17 03:47:34,497 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Ended with exit code 0 [2023-02-17 03:47:34,685 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-17 03:47:34,685 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2023-02-17 03:47:34,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 03:47:34,686 INFO L85 PathProgramCache]: Analyzing trace with hash 765853977, now seen corresponding path program 1 times [2023-02-17 03:47:34,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 03:47:34,686 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1919875931] [2023-02-17 03:47:34,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 03:47:34,686 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-17 03:47:34,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 03:47:34,688 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-17 03:47:34,688 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-17 03:47:34,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:47:34,749 INFO L263 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 7 conjunts are in the unsatisfiable core [2023-02-17 03:47:34,750 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 03:47:34,765 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-17 03:47:34,765 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 03:47:34,765 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 03:47:34,765 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1919875931] [2023-02-17 03:47:34,766 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1919875931] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 03:47:34,766 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 03:47:34,766 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-17 03:47:34,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499157025] [2023-02-17 03:47:34,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 03:47:34,766 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-17 03:47:34,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 03:47:34,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-17 03:47:34,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-17 03:47:34,767 INFO L87 Difference]: Start difference. First operand 220 states and 231 transitions. Second operand has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 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-17 03:47:34,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 03:47:34,818 INFO L93 Difference]: Finished difference Result 253 states and 266 transitions. [2023-02-17 03:47:34,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-17 03:47:34,819 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 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 161 [2023-02-17 03:47:34,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 03:47:34,820 INFO L225 Difference]: With dead ends: 253 [2023-02-17 03:47:34,821 INFO L226 Difference]: Without dead ends: 226 [2023-02-17 03:47:34,821 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 156 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-17 03:47:34,821 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 3 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-17 03:47:34,821 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 295 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 03:47:34,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2023-02-17 03:47:34,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 223. [2023-02-17 03:47:34,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 210 states have (on average 1.0714285714285714) internal successors, (225), 215 states have internal predecessors, (225), 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-17 03:47:34,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 234 transitions. [2023-02-17 03:47:34,850 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 234 transitions. Word has length 161 [2023-02-17 03:47:34,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 03:47:34,850 INFO L495 AbstractCegarLoop]: Abstraction has 223 states and 234 transitions. [2023-02-17 03:47:34,851 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 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-17 03:47:34,851 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 234 transitions. [2023-02-17 03:47:34,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2023-02-17 03:47:34,852 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 03:47:34,852 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] [2023-02-17 03:47:34,863 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-17 03:47:35,059 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-17 03:47:35,061 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2023-02-17 03:47:35,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 03:47:35,061 INFO L85 PathProgramCache]: Analyzing trace with hash 765465224, now seen corresponding path program 1 times [2023-02-17 03:47:35,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 03:47:35,062 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [139253215] [2023-02-17 03:47:35,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 03:47:35,062 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-17 03:47:35,062 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 03:47:35,064 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-17 03:47:35,066 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-17 03:47:35,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:47:35,129 INFO L263 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 9 conjunts are in the unsatisfiable core [2023-02-17 03:47:35,131 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 03:47:35,160 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-17 03:47:35,161 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 03:47:35,167 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-17 03:47:35,167 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 03:47:35,167 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [139253215] [2023-02-17 03:47:35,168 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [139253215] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 03:47:35,168 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 03:47:35,168 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2023-02-17 03:47:35,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163196673] [2023-02-17 03:47:35,168 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 03:47:35,169 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-17 03:47:35,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 03:47:35,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-17 03:47:35,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-02-17 03:47:35,169 INFO L87 Difference]: Start difference. First operand 223 states and 234 transitions. Second operand has 8 states, 8 states have (on average 4.375) internal successors, (35), 7 states have internal predecessors, (35), 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-17 03:47:35,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 03:47:35,254 INFO L93 Difference]: Finished difference Result 255 states and 268 transitions. [2023-02-17 03:47:35,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-17 03:47:35,255 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 7 states have internal predecessors, (35), 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 165 [2023-02-17 03:47:35,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 03:47:35,256 INFO L225 Difference]: With dead ends: 255 [2023-02-17 03:47:35,256 INFO L226 Difference]: Without dead ends: 223 [2023-02-17 03:47:35,256 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 332 GetRequests, 322 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-17 03:47:35,257 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 6 mSDsluCounter, 359 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 423 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-17 03:47:35,257 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 423 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 03:47:35,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2023-02-17 03:47:35,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 220. [2023-02-17 03:47:35,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 208 states have (on average 1.0625) internal successors, (221), 212 states have internal predecessors, (221), 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-17 03:47:35,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 229 transitions. [2023-02-17 03:47:35,278 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 229 transitions. Word has length 165 [2023-02-17 03:47:35,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 03:47:35,278 INFO L495 AbstractCegarLoop]: Abstraction has 220 states and 229 transitions. [2023-02-17 03:47:35,279 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 7 states have internal predecessors, (35), 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-17 03:47:35,279 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 229 transitions. [2023-02-17 03:47:35,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2023-02-17 03:47:35,280 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 03:47:35,280 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] [2023-02-17 03:47:35,287 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-17 03:47:35,487 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-17 03:47:35,488 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2023-02-17 03:47:35,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 03:47:35,489 INFO L85 PathProgramCache]: Analyzing trace with hash -644702791, now seen corresponding path program 2 times [2023-02-17 03:47:35,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 03:47:35,489 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [408822213] [2023-02-17 03:47:35,489 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-17 03:47:35,489 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-17 03:47:35,490 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 03:47:35,491 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-17 03:47:35,494 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-17 03:47:35,528 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-02-17 03:47:35,528 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 03:47:35,529 INFO L263 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-17 03:47:35,531 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 03:47:35,546 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-17 03:47:35,547 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 03:47:35,547 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 03:47:35,547 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [408822213] [2023-02-17 03:47:35,547 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [408822213] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 03:47:35,547 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 03:47:35,548 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-17 03:47:35,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399329165] [2023-02-17 03:47:35,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 03:47:35,548 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-17 03:47:35,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 03:47:35,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-17 03:47:35,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-02-17 03:47:35,549 INFO L87 Difference]: Start difference. First operand 220 states and 229 transitions. Second operand has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 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-17 03:47:35,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 03:47:35,735 INFO L93 Difference]: Finished difference Result 220 states and 229 transitions. [2023-02-17 03:47:35,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-17 03:47:35,736 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 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 169 [2023-02-17 03:47:35,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 03:47:35,737 INFO L225 Difference]: With dead ends: 220 [2023-02-17 03:47:35,737 INFO L226 Difference]: Without dead ends: 218 [2023-02-17 03:47:35,737 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 166 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-17 03:47:35,738 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 1 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-17 03:47:35,738 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 151 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-17 03:47:35,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2023-02-17 03:47:35,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 218. [2023-02-17 03:47:35,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 208 states have (on average 1.0528846153846154) internal successors, (219), 210 states have internal predecessors, (219), 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-17 03:47:35,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 227 transitions. [2023-02-17 03:47:35,786 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 227 transitions. Word has length 169 [2023-02-17 03:47:35,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 03:47:35,786 INFO L495 AbstractCegarLoop]: Abstraction has 218 states and 227 transitions. [2023-02-17 03:47:35,786 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 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-17 03:47:35,786 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 227 transitions. [2023-02-17 03:47:35,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2023-02-17 03:47:35,788 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 03:47:35,788 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] [2023-02-17 03:47:35,813 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-17 03:47:35,998 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-17 03:47:35,998 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2023-02-17 03:47:35,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 03:47:35,999 INFO L85 PathProgramCache]: Analyzing trace with hash 753038131, now seen corresponding path program 1 times [2023-02-17 03:47:35,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 03:47:35,999 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [780147804] [2023-02-17 03:47:35,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 03:47:36,000 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-17 03:47:36,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 03:47:36,001 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-17 03:47:36,004 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2023-02-17 03:47:36,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:47:36,085 INFO L263 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 13 conjunts are in the unsatisfiable core [2023-02-17 03:47:36,097 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 03:47:36,138 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-17 03:47:36,138 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 03:47:36,138 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 03:47:36,138 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [780147804] [2023-02-17 03:47:36,138 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [780147804] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 03:47:36,138 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 03:47:36,138 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-02-17 03:47:36,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974069534] [2023-02-17 03:47:36,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 03:47:36,139 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-17 03:47:36,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 03:47:36,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-17 03:47:36,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-02-17 03:47:36,140 INFO L87 Difference]: Start difference. First operand 218 states and 227 transitions. Second operand has 8 states, 7 states have (on average 5.285714285714286) internal successors, (37), 6 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-17 03:47:36,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 03:47:36,245 INFO L93 Difference]: Finished difference Result 293 states and 307 transitions. [2023-02-17 03:47:36,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-17 03:47:36,246 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.285714285714286) internal successors, (37), 6 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 172 [2023-02-17 03:47:36,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 03:47:36,247 INFO L225 Difference]: With dead ends: 293 [2023-02-17 03:47:36,247 INFO L226 Difference]: Without dead ends: 271 [2023-02-17 03:47:36,247 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2023-02-17 03:47:36,248 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 74 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 401 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 03:47:36,248 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 401 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 03:47:36,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2023-02-17 03:47:36,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 225. [2023-02-17 03:47:36,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 213 states have (on average 1.051643192488263) internal successors, (224), 215 states have internal predecessors, (224), 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-17 03:47:36,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 237 transitions. [2023-02-17 03:47:36,282 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 237 transitions. Word has length 172 [2023-02-17 03:47:36,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 03:47:36,283 INFO L495 AbstractCegarLoop]: Abstraction has 225 states and 237 transitions. [2023-02-17 03:47:36,283 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.285714285714286) internal successors, (37), 6 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-17 03:47:36,283 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 237 transitions. [2023-02-17 03:47:36,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2023-02-17 03:47:36,287 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 03:47:36,287 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] [2023-02-17 03:47:36,307 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-17 03:47:36,495 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-17 03:47:36,495 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2023-02-17 03:47:36,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 03:47:36,496 INFO L85 PathProgramCache]: Analyzing trace with hash 360011121, now seen corresponding path program 1 times [2023-02-17 03:47:36,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 03:47:36,496 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [457702840] [2023-02-17 03:47:36,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 03:47:36,496 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-17 03:47:36,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 03:47:36,515 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-17 03:47:36,516 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-17 03:47:36,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:47:36,585 INFO L263 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 16 conjunts are in the unsatisfiable core [2023-02-17 03:47:36,587 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 03:47:36,650 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-17 03:47:36,650 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 03:47:36,650 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 03:47:36,650 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [457702840] [2023-02-17 03:47:36,650 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [457702840] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 03:47:36,651 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 03:47:36,651 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-02-17 03:47:36,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596961529] [2023-02-17 03:47:36,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 03:47:36,651 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-17 03:47:36,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 03:47:36,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-17 03:47:36,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2023-02-17 03:47:36,652 INFO L87 Difference]: Start difference. First operand 225 states and 237 transitions. Second operand has 11 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 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-17 03:47:36,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 03:47:36,887 INFO L93 Difference]: Finished difference Result 271 states and 284 transitions. [2023-02-17 03:47:36,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-17 03:47:36,888 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 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 172 [2023-02-17 03:47:36,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 03:47:36,889 INFO L225 Difference]: With dead ends: 271 [2023-02-17 03:47:36,889 INFO L226 Difference]: Without dead ends: 270 [2023-02-17 03:47:36,889 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2023-02-17 03:47:36,890 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 71 mSDsluCounter, 462 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 516 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-17 03:47:36,890 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 516 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-17 03:47:36,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2023-02-17 03:47:36,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 234. [2023-02-17 03:47:36,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 222 states have (on average 1.0495495495495495) internal successors, (233), 224 states have internal predecessors, (233), 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-17 03:47:36,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 246 transitions. [2023-02-17 03:47:36,925 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 246 transitions. Word has length 172 [2023-02-17 03:47:36,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 03:47:36,925 INFO L495 AbstractCegarLoop]: Abstraction has 234 states and 246 transitions. [2023-02-17 03:47:36,925 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 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-17 03:47:36,925 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 246 transitions. [2023-02-17 03:47:36,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2023-02-17 03:47:36,927 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 03:47:36,927 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] [2023-02-17 03:47:36,934 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-17 03:47:37,134 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-17 03:47:37,134 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2023-02-17 03:47:37,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 03:47:37,135 INFO L85 PathProgramCache]: Analyzing trace with hash -770221667, now seen corresponding path program 1 times [2023-02-17 03:47:37,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 03:47:37,135 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1335589885] [2023-02-17 03:47:37,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 03:47:37,136 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-17 03:47:37,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 03:47:37,137 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-17 03:47:37,140 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-17 03:47:37,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:47:37,220 INFO L263 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 14 conjunts are in the unsatisfiable core [2023-02-17 03:47:37,222 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 03:47:37,257 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-17 03:47:37,257 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 03:47:37,310 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-17 03:47:37,310 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 03:47:37,310 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1335589885] [2023-02-17 03:47:37,310 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1335589885] provided 1 perfect and 1 imperfect interpolant sequences [2023-02-17 03:47:37,310 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-17 03:47:37,310 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2023-02-17 03:47:37,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663125040] [2023-02-17 03:47:37,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 03:47:37,310 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-17 03:47:37,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 03:47:37,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-17 03:47:37,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2023-02-17 03:47:37,311 INFO L87 Difference]: Start difference. First operand 234 states and 246 transitions. Second operand has 5 states, 4 states have (on average 9.0) internal successors, (36), 5 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-17 03:47:37,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 03:47:37,467 INFO L93 Difference]: Finished difference Result 238 states and 249 transitions. [2023-02-17 03:47:37,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-17 03:47:37,467 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 9.0) internal successors, (36), 5 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 174 [2023-02-17 03:47:37,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 03:47:37,468 INFO L225 Difference]: With dead ends: 238 [2023-02-17 03:47:37,468 INFO L226 Difference]: Without dead ends: 236 [2023-02-17 03:47:37,468 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 348 GetRequests, 336 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-17 03:47:37,469 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 13 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 03:47:37,469 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 178 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 03:47:37,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2023-02-17 03:47:37,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 223. [2023-02-17 03:47:37,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 213 states have (on average 1.0422535211267605) internal successors, (222), 213 states have internal predecessors, (222), 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-17 03:47:37,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 235 transitions. [2023-02-17 03:47:37,498 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 235 transitions. Word has length 174 [2023-02-17 03:47:37,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 03:47:37,499 INFO L495 AbstractCegarLoop]: Abstraction has 223 states and 235 transitions. [2023-02-17 03:47:37,499 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 9.0) internal successors, (36), 5 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-17 03:47:37,499 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 235 transitions. [2023-02-17 03:47:37,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2023-02-17 03:47:37,500 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 03:47:37,500 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, 1, 1] [2023-02-17 03:47:37,521 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-17 03:47:37,720 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-17 03:47:37,721 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2023-02-17 03:47:37,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 03:47:37,722 INFO L85 PathProgramCache]: Analyzing trace with hash 948465498, now seen corresponding path program 1 times [2023-02-17 03:47:37,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 03:47:37,722 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1073484742] [2023-02-17 03:47:37,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 03:47:37,723 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-17 03:47:37,723 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 03:47:37,725 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-17 03:47:37,728 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2023-02-17 03:47:37,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:47:37,805 INFO L263 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 17 conjunts are in the unsatisfiable core [2023-02-17 03:47:37,807 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 03:47:37,862 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-17 03:47:37,862 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 03:47:37,862 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 03:47:37,863 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1073484742] [2023-02-17 03:47:37,863 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1073484742] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 03:47:37,863 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 03:47:37,863 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-02-17 03:47:37,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180297458] [2023-02-17 03:47:37,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 03:47:37,863 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-17 03:47:37,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 03:47:37,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-17 03:47:37,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2023-02-17 03:47:37,864 INFO L87 Difference]: Start difference. First operand 223 states and 235 transitions. Second operand has 12 states, 11 states have (on average 3.909090909090909) internal successors, (43), 10 states have internal predecessors, (43), 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-17 03:47:38,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 03:47:38,245 INFO L93 Difference]: Finished difference Result 265 states and 278 transitions. [2023-02-17 03:47:38,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-02-17 03:47:38,246 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.909090909090909) internal successors, (43), 10 states have internal predecessors, (43), 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 178 [2023-02-17 03:47:38,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 03:47:38,247 INFO L225 Difference]: With dead ends: 265 [2023-02-17 03:47:38,247 INFO L226 Difference]: Without dead ends: 243 [2023-02-17 03:47:38,247 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 166 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=250, Unknown=0, NotChecked=0, Total=306 [2023-02-17 03:47:38,247 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 45 mSDsluCounter, 549 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 622 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-17 03:47:38,248 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 622 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 234 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-17 03:47:38,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2023-02-17 03:47:38,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 221. [2023-02-17 03:47:38,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 211 states have (on average 1.042654028436019) internal successors, (220), 212 states have internal predecessors, (220), 5 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2023-02-17 03:47:38,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 232 transitions. [2023-02-17 03:47:38,273 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 232 transitions. Word has length 178 [2023-02-17 03:47:38,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 03:47:38,273 INFO L495 AbstractCegarLoop]: Abstraction has 221 states and 232 transitions. [2023-02-17 03:47:38,273 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.909090909090909) internal successors, (43), 10 states have internal predecessors, (43), 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-17 03:47:38,273 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 232 transitions. [2023-02-17 03:47:38,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2023-02-17 03:47:38,274 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 03:47:38,275 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, 1, 1] [2023-02-17 03:47:38,284 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-17 03:47:38,482 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-17 03:47:38,483 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2023-02-17 03:47:38,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 03:47:38,483 INFO L85 PathProgramCache]: Analyzing trace with hash 606708358, now seen corresponding path program 1 times [2023-02-17 03:47:38,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 03:47:38,484 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2065115788] [2023-02-17 03:47:38,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 03:47:38,485 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-17 03:47:38,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 03:47:38,501 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-17 03:47:38,517 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-17 03:47:38,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:47:38,607 INFO L263 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 15 conjunts are in the unsatisfiable core [2023-02-17 03:47:38,610 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 03:47:38,637 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-17 03:47:38,637 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 03:47:38,843 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 03:47:38,843 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2065115788] [2023-02-17 03:47:38,843 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2065115788] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 03:47:38,843 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1817176783] [2023-02-17 03:47:38,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 03:47:38,843 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-02-17 03:47:38,843 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-02-17 03:47:38,845 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-02-17 03:47:38,846 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (25)] Waiting until timeout for monitored process [2023-02-17 03:47:38,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:47:38,926 INFO L263 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 7 conjunts are in the unsatisfiable core [2023-02-17 03:47:38,938 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 03:47:38,942 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-17 03:47:38,942 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 03:47:38,956 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-17 03:47:38,956 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1817176783] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 03:47:38,956 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-17 03:47:38,956 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 7 [2023-02-17 03:47:38,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787538873] [2023-02-17 03:47:38,957 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-17 03:47:38,957 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-17 03:47:38,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 03:47:38,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-17 03:47:38,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2023-02-17 03:47:38,969 INFO L87 Difference]: Start difference. First operand 221 states and 232 transitions. Second operand has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 6 states have internal predecessors, (44), 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-17 03:47:39,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 03:47:39,034 INFO L93 Difference]: Finished difference Result 263 states and 275 transitions. [2023-02-17 03:47:39,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-17 03:47:39,035 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 6 states have internal predecessors, (44), 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 180 [2023-02-17 03:47:39,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 03:47:39,036 INFO L225 Difference]: With dead ends: 263 [2023-02-17 03:47:39,036 INFO L226 Difference]: Without dead ends: 243 [2023-02-17 03:47:39,036 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 557 GetRequests, 542 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2023-02-17 03:47:39,037 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 45 mSDsluCounter, 335 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 413 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-17 03:47:39,037 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 413 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 03:47:39,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2023-02-17 03:47:39,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 223. [2023-02-17 03:47:39,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 213 states have (on average 1.0422535211267605) internal successors, (222), 213 states have internal predecessors, (222), 5 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (7), 6 states have call predecessors, (7), 5 states have call successors, (7) [2023-02-17 03:47:39,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 234 transitions. [2023-02-17 03:47:39,059 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 234 transitions. Word has length 180 [2023-02-17 03:47:39,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 03:47:39,060 INFO L495 AbstractCegarLoop]: Abstraction has 223 states and 234 transitions. [2023-02-17 03:47:39,060 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 6 states have internal predecessors, (44), 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-17 03:47:39,060 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 234 transitions. [2023-02-17 03:47:39,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2023-02-17 03:47:39,061 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 03:47:39,061 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, 1, 1] [2023-02-17 03:47:39,069 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-17 03:47:39,271 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (25)] Forceful destruction successful, exit code 0 [2023-02-17 03:47:39,470 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,25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2023-02-17 03:47:39,471 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2023-02-17 03:47:39,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 03:47:39,472 INFO L85 PathProgramCache]: Analyzing trace with hash -414359996, now seen corresponding path program 1 times [2023-02-17 03:47:39,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 03:47:39,472 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [340985736] [2023-02-17 03:47:39,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 03:47:39,472 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-17 03:47:39,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 03:47:39,474 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 03:47:39,476 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Waiting until timeout for monitored process [2023-02-17 03:47:39,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:47:39,581 INFO L263 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-17 03:47:39,583 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 03:47:39,589 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-17 03:47:39,589 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 03:47:39,589 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 03:47:39,590 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [340985736] [2023-02-17 03:47:39,590 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [340985736] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 03:47:39,590 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 03:47:39,590 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-17 03:47:39,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60686549] [2023-02-17 03:47:39,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 03:47:39,590 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-17 03:47:39,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 03:47:39,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-17 03:47:39,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-02-17 03:47:39,591 INFO L87 Difference]: Start difference. First operand 223 states and 234 transitions. Second operand has 4 states, 3 states have (on average 14.0) internal successors, (42), 4 states have internal predecessors, (42), 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-17 03:47:39,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 03:47:39,660 INFO L93 Difference]: Finished difference Result 227 states and 237 transitions. [2023-02-17 03:47:39,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-17 03:47:39,661 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 14.0) internal successors, (42), 4 states have internal predecessors, (42), 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 180 [2023-02-17 03:47:39,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 03:47:39,661 INFO L225 Difference]: With dead ends: 227 [2023-02-17 03:47:39,662 INFO L226 Difference]: Without dead ends: 223 [2023-02-17 03:47:39,662 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 177 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-17 03:47:39,662 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 12 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-17 03:47:39,662 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 96 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 03:47:39,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2023-02-17 03:47:39,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 223. [2023-02-17 03:47:39,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 213 states have (on average 1.0375586854460095) internal successors, (221), 213 states have internal predecessors, (221), 5 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (7), 6 states have call predecessors, (7), 5 states have call successors, (7) [2023-02-17 03:47:39,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 233 transitions. [2023-02-17 03:47:39,685 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 233 transitions. Word has length 180 [2023-02-17 03:47:39,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 03:47:39,685 INFO L495 AbstractCegarLoop]: Abstraction has 223 states and 233 transitions. [2023-02-17 03:47:39,685 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 14.0) internal successors, (42), 4 states have internal predecessors, (42), 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-17 03:47:39,686 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 233 transitions. [2023-02-17 03:47:39,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2023-02-17 03:47:39,687 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 03:47:39,687 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, 1, 1, 1, 1, 1, 1] [2023-02-17 03:47:39,708 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Forceful destruction successful, exit code 0 [2023-02-17 03:47:39,895 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 03:47:39,895 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2023-02-17 03:47:39,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 03:47:39,896 INFO L85 PathProgramCache]: Analyzing trace with hash 1691487341, now seen corresponding path program 1 times [2023-02-17 03:47:39,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-17 03:47:39,896 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [138223263] [2023-02-17 03:47:39,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 03:47:39,896 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-17 03:47:39,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-17 03:47:39,898 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-17 03:47:39,900 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Waiting until timeout for monitored process [2023-02-17 03:47:39,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:47:39,973 INFO L263 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-17 03:47:39,975 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 03:47:39,992 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-17 03:47:39,992 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 03:47:39,992 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-17 03:47:39,992 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [138223263] [2023-02-17 03:47:39,993 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [138223263] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 03:47:39,993 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 03:47:39,993 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-17 03:47:39,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563317620] [2023-02-17 03:47:39,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 03:47:39,993 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-17 03:47:39,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-17 03:47:39,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-17 03:47:39,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-17 03:47:39,994 INFO L87 Difference]: Start difference. First operand 223 states and 233 transitions. Second operand has 4 states, 3 states have (on average 15.333333333333334) internal successors, (46), 4 states have internal predecessors, (46), 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-17 03:47:40,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 03:47:40,074 INFO L93 Difference]: Finished difference Result 223 states and 233 transitions. [2023-02-17 03:47:40,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-17 03:47:40,075 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 15.333333333333334) internal successors, (46), 4 states have internal predecessors, (46), 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 184 [2023-02-17 03:47:40,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 03:47:40,075 INFO L225 Difference]: With dead ends: 223 [2023-02-17 03:47:40,075 INFO L226 Difference]: Without dead ends: 0 [2023-02-17 03:47:40,075 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 181 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-17 03:47:40,076 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 9 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 03:47:40,076 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 135 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 03:47:40,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-02-17 03:47:40,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-02-17 03:47:40,076 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-17 03:47:40,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-02-17 03:47:40,076 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 184 [2023-02-17 03:47:40,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 03:47:40,077 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-02-17 03:47:40,077 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 15.333333333333334) internal successors, (46), 4 states have internal predecessors, (46), 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-17 03:47:40,077 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-02-17 03:47:40,077 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-02-17 03:47:40,079 INFO L805 garLoopResultBuilder]: Registering result SAFE for location base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 18 remaining) [2023-02-17 03:47:40,079 INFO L805 garLoopResultBuilder]: Registering result SAFE for location base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 18 remaining) [2023-02-17 03:47:40,079 INFO L805 garLoopResultBuilder]: Registering result SAFE for location base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 18 remaining) [2023-02-17 03:47:40,079 INFO L805 garLoopResultBuilder]: Registering result SAFE for location base2fltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 18 remaining) [2023-02-17 03:47:40,079 INFO L805 garLoopResultBuilder]: Registering result SAFE for location base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 18 remaining) [2023-02-17 03:47:40,079 INFO L805 garLoopResultBuilder]: Registering result SAFE for location base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 18 remaining) [2023-02-17 03:47:40,079 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 18 remaining) [2023-02-17 03:47:40,079 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 18 remaining) [2023-02-17 03:47:40,079 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 18 remaining) [2023-02-17 03:47:40,079 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 18 remaining) [2023-02-17 03:47:40,080 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 18 remaining) [2023-02-17 03:47:40,080 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 18 remaining) [2023-02-17 03:47:40,080 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 18 remaining) [2023-02-17 03:47:40,080 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 18 remaining) [2023-02-17 03:47:40,080 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 18 remaining) [2023-02-17 03:47:40,080 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 18 remaining) [2023-02-17 03:47:40,080 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 18 remaining) [2023-02-17 03:47:40,080 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 18 remaining) [2023-02-17 03:47:40,089 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Forceful destruction successful, exit code 0 [2023-02-17 03:47:40,285 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-17 03:47:40,287 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-02-17 03:47:40,332 INFO L899 garLoopResultBuilder]: For program point base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 45) no Hoare annotation was computed. [2023-02-17 03:47:40,333 INFO L899 garLoopResultBuilder]: For program point base2fltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 70) no Hoare annotation was computed. [2023-02-17 03:47:40,333 INFO L899 garLoopResultBuilder]: For program point L77(line 77) no Hoare annotation was computed. [2023-02-17 03:47:40,333 INFO L899 garLoopResultBuilder]: For program point L77-1(line 77) no Hoare annotation was computed. [2023-02-17 03:47:40,337 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-17 03:47:40,341 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-17 03:47:40,342 INFO L899 garLoopResultBuilder]: For program point base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 77) no Hoare annotation was computed. [2023-02-17 03:47:40,342 INFO L899 garLoopResultBuilder]: For program point L45(line 45) no Hoare annotation was computed. [2023-02-17 03:47:40,342 INFO L899 garLoopResultBuilder]: For program point L45-1(line 45) no Hoare annotation was computed. [2023-02-17 03:47:40,342 INFO L899 garLoopResultBuilder]: For program point L70(line 70) no Hoare annotation was computed. [2023-02-17 03:47:40,342 INFO L899 garLoopResultBuilder]: For program point L70-1(line 70) no Hoare annotation was computed. [2023-02-17 03:47:40,342 INFO L899 garLoopResultBuilder]: For program point L29(lines 29 34) no Hoare annotation was computed. [2023-02-17 03:47:40,342 INFO L899 garLoopResultBuilder]: For program point L58(lines 57 72) no Hoare annotation was computed. [2023-02-17 03:47:40,342 INFO L899 garLoopResultBuilder]: For program point base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 70) no Hoare annotation was computed. [2023-02-17 03:47:40,345 INFO L895 garLoopResultBuilder]: At program point L79(lines 28 81) the Hoare annotation is: (let ((.cse246 (bvadd base2flt_~e (_ bv4294967295 32)))) (let ((.cse247 (bvadd (_ bv4294967295 32) .cse246))) (let ((.cse249 (bvadd (_ bv4294967295 32) .cse247))) (let ((.cse248 (bvadd (_ bv4294967295 32) .cse249))) (let ((.cse250 (bvadd (_ bv4294967295 32) .cse248))) (let ((.cse238 (bvadd (_ bv4294967295 32) .cse250))) (let ((.cse219 (bvadd (_ bv4294967295 32) .cse238))) (let ((.cse223 (bvadd (_ bv4294967295 32) .cse219))) (let ((.cse224 (bvadd (_ bv4294967295 32) .cse223))) (let ((.cse221 (bvadd (_ bv4294967295 32) .cse224)) (.cse278 (bvshl base2flt_~m (_ bv1 32)))) (let ((.cse277 (bvshl .cse278 (_ bv1 32))) (.cse222 (bvadd .cse221 (_ bv4294967295 32)))) (let ((.cse220 (bvadd (_ bv4294967295 32) .cse222)) (.cse279 (bvshl .cse277 (_ bv1 32)))) (let ((.cse274 (bvshl .cse279 (_ bv1 32))) (.cse225 (bvadd (_ bv4294967295 32) .cse220))) (let ((.cse204 (bvadd (_ bv4294967295 32) .cse225)) (.cse273 (bvshl .cse274 (_ bv1 32)))) (let ((.cse276 (bvshl .cse273 (_ bv1 32))) (.cse261 (bvadd (_ bv4294967295 32) .cse204))) (let ((.cse264 (bvadd (_ bv4294967295 32) .cse261)) (.cse275 (bvshl .cse276 (_ bv1 32)))) (let ((.cse271 (bvshl .cse275 (_ bv1 32))) (.cse260 (bvadd (_ bv4294967295 32) .cse264))) (let ((.cse263 (bvadd .cse260 (_ bv4294967295 32))) (.cse272 (bvshl .cse271 (_ bv1 32)))) (let ((.cse269 (bvshl .cse272 (_ bv1 32))) (.cse265 (bvadd (_ bv4294967295 32) .cse263))) (let ((.cse267 (bvadd (_ bv4294967295 32) .cse265)) (.cse270 (bvshl .cse269 (_ bv1 32)))) (let ((.cse268 (bvshl .cse270 (_ bv1 32))) (.cse262 (bvadd .cse267 (_ bv4294967295 32)))) (let ((.cse266 (bvadd (_ bv4294967295 32) .cse262)) (.cse258 (bvshl .cse268 (_ bv1 32))) (.cse237 (bvadd (bvadd (_ bv4294967293 32) |base2flt_#in~e|) (_ bv4294967295 32))) (.cse51 (= |base2flt_#in~e| (_ bv0 32)))) (let ((.cse128 (not (bvsle base2flt_~e (_ bv4294967168 32)))) (.cse14 (not .cse51)) (.cse232 (bvadd .cse237 (_ bv4294967295 32))) (.cse226 (bvadd base2flt_~e (_ bv1 32))) (.cse103 (bvult .cse279 (_ bv16777216 32))) (.cse78 (bvult .cse278 (_ bv16777216 32))) (.cse102 (bvult .cse277 (_ bv16777216 32))) (.cse106 (bvult .cse276 (_ bv16777216 32))) (.cse252 (bvult .cse275 (_ bv16777216 32))) (.cse104 (bvult .cse274 (_ bv16777216 32))) (.cse105 (bvult .cse273 (_ bv16777216 32))) (.cse254 (bvult .cse272 (_ bv16777216 32))) (.cse251 (bvult .cse271 (_ bv16777216 32))) (.cse256 (bvult .cse270 (_ bv16777216 32))) (.cse253 (bvult .cse269 (_ bv16777216 32))) (.cse255 (bvult .cse268 (_ bv16777216 32))) (.cse257 (bvult .cse258 (_ bv16777216 32))) (.cse259 (bvadd (_ bv4294967295 32) (bvadd |base2flt_#in~e| (_ bv4294967283 32)))) (.cse242 (bvadd (_ bv4294967295 32) |base2flt_#in~e|)) (.cse245 ((_ sign_extend 1) base2flt_~e)) (.cse244 ((_ sign_extend 1) .cse246)) (.cse132 (bvadd (_ bv4294967295 32) .cse266))) (let ((.cse117 (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|)))) (.cse23 (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|)))) (.cse28 (bvsle (bvadd ((_ sign_extend 1) .cse267) (_ bv128 33)) (_ bv2147483647 33))) (.cse29 (bvsle (bvadd ((_ sign_extend 1) .cse250) (_ bv128 33)) (_ bv2147483647 33))) (.cse30 (bvsle (bvadd ((_ sign_extend 1) .cse266) (_ bv128 33)) (_ bv2147483647 33))) (.cse31 (bvsle (bvadd ((_ sign_extend 1) .cse248) (_ bv128 33)) (_ bv2147483647 33))) (.cse32 (bvsle (bvadd ((_ sign_extend 1) .cse220) (_ bv128 33)) (_ bv2147483647 33))) (.cse33 (bvsle (bvadd ((_ sign_extend 1) .cse265) (_ bv128 33)) (_ bv2147483647 33))) (.cse34 (bvsle (bvadd ((_ sign_extend 1) .cse264) (_ bv128 33)) (_ bv2147483647 33))) (.cse35 (bvsle (bvadd ((_ sign_extend 1) .cse224) (_ bv128 33)) (_ bv2147483647 33))) (.cse37 (bvsle (bvadd ((_ sign_extend 1) .cse263) (_ bv128 33)) (_ bv2147483647 33))) (.cse38 (bvsle (bvadd ((_ sign_extend 1) .cse247) (_ bv128 33)) (_ bv2147483647 33))) (.cse39 (bvsle (bvadd ((_ sign_extend 1) .cse204) (_ bv128 33)) (_ bv2147483647 33))) (.cse40 (bvsle (bvadd ((_ sign_extend 1) .cse221) (_ bv128 33)) (_ bv2147483647 33))) (.cse41 (bvsle (bvadd ((_ sign_extend 1) .cse238) (_ bv128 33)) (_ bv2147483647 33))) (.cse42 (bvsle (bvadd ((_ sign_extend 1) .cse262) (_ bv128 33)) (_ bv2147483647 33))) (.cse43 (bvsle (bvadd ((_ sign_extend 1) .cse132) (_ bv128 33)) (_ bv2147483647 33))) (.cse44 (bvsle (bvadd .cse244 (_ bv128 33)) (_ bv2147483647 33))) (.cse45 (bvsle (bvadd ((_ sign_extend 1) .cse222) (_ bv128 33)) (_ bv2147483647 33))) (.cse46 (bvsle (bvadd ((_ sign_extend 1) .cse249) (_ bv128 33)) (_ bv2147483647 33))) (.cse47 (bvsle (bvadd ((_ sign_extend 1) .cse219) (_ bv128 33)) (_ bv2147483647 33))) (.cse48 (bvsle (bvadd ((_ sign_extend 1) .cse223) (_ bv128 33)) (_ bv2147483647 33))) (.cse49 (bvsle (bvadd ((_ sign_extend 1) .cse261) (_ bv128 33)) (_ bv2147483647 33))) (.cse50 (bvsle (bvadd ((_ sign_extend 1) .cse260) (_ bv128 33)) (_ bv2147483647 33))) (.cse52 (bvsle (bvadd .cse245 (_ bv128 33)) (_ bv2147483647 33))) (.cse53 (bvsle (bvadd ((_ sign_extend 1) .cse225) (_ bv128 33)) (_ bv2147483647 33))) (.cse126 (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) .cse242)))))) (_ bv4294967295 32))) (_ bv4294967295 32)))))) (_ bv4294967295 32)))) (_ bv4294967295 32)))))) (_ bv4294967295 32)) (_ bv4294967295 32))) (_ bv128 33)) (_ bv2147483647 33))) (.cse21 (bvsle .cse259 (_ bv4294967168 32))) (.cse20 (= base2flt_~e .cse259)) (.cse91 (or (not .cse257) (bvult (bvshl .cse258 (_ bv1 32)) (_ bv16777216 32)))) (.cse90 (or (not .cse255) .cse257)) (.cse79 (or .cse256 (not .cse253))) (.cse84 (or .cse254 (not .cse251))) (.cse85 (or .cse255 (not .cse256))) (.cse88 (or .cse253 (not .cse254))) (.cse77 (or (not .cse104) .cse105)) (.cse89 (or (not .cse106) .cse252)) (.cse80 (or (not .cse78) .cse102)) (.cse81 (or .cse251 (not .cse252))) (.cse82 (or (not .cse102) .cse103)) (.cse86 (or .cse106 (not .cse105))) (.cse87 (or .cse104 (not .cse103))) (.cse18 (bvsle (bvadd (_ bv4294967290 32) |base2flt_#in~e|) (_ bv4294967168 32))) (.cse19 (= .cse232 .cse226)) (.cse65 (or (not (bvsle .cse250 (_ bv4294967168 32))) .cse14)) (.cse66 (or (not (bvsle .cse249 (_ bv4294967168 32))) .cse14)) (.cse68 (or (not (bvsle .cse248 (_ bv4294967168 32))) .cse14)) (.cse97 (not (bvsge base2flt_~e (_ bv127 32)))) (.cse12 (bvsle (bvadd |base2flt_#in~e| (_ bv4294967294 32)) (_ bv4294967168 32))) (.cse63 (or .cse14 (not (bvsle .cse247 (_ bv4294967168 32))))) (.cse67 (or (not (bvsle .cse246 (_ bv4294967168 32))) .cse14)) (.cse10 (= .cse242 .cse226)) (.cse64 (or .cse128 .cse14)) (.cse118 (= base2flt_~e |base2flt_#in~e|)) (.cse83 (bvult base2flt_~m (_ bv16777216 32))) (.cse108 (bvsle (_ bv6442450944 33) (bvadd (_ bv8589934591 33) .cse245))) (.cse125 (bvsle (_ bv6442450944 33) (bvadd ((_ sign_extend 1) .cse242) (_ bv8589934591 33)))) (.cse110 (bvsle (_ bv6442450944 33) (bvadd .cse244 (_ bv8589934591 33))))) (let ((.cse24 (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|) .cse226))) (.cse26 (not (bvsle .cse226 (_ bv4294967168 32)))) (.cse127 (let ((.cse129 (let ((.cse130 (let ((.cse137 (and .cse125 .cse110)) (.cse157 (and .cse125 .cse108)) (.cse192 (and .cse125 .cse108 .cse110))) (let ((.cse243 (or .cse137 .cse157 .cse192))) (let ((.cse203 (and .cse243 .cse83)) (.cse210 (and .cse78 .cse102 .cse243 .cse83))) (let ((.cse241 (= base2flt_~e .cse242)) (.cse240 (or .cse137 .cse157 .cse192 .cse203 .cse210))) (let ((.cse140 (and .cse241 .cse240)) (.cse142 (and .cse240 .cse14)) (.cse143 (and .cse240 .cse118 .cse14)) (.cse159 (and .cse64 .cse240)) (.cse170 (and .cse10 .cse240)) (.cse176 (and .cse241 .cse240 .cse14)) (.cse181 (and .cse63 .cse64 .cse67 .cse240)) (.cse196 (and .cse64 .cse67 .cse240)) (.cse201 (and .cse10 .cse240 .cse12)) (.cse202 (and .cse240 .cse118))) (let ((.cse235 (not .cse83)) (.cse239 (or .cse137 .cse140 .cse142 .cse143 .cse157 .cse159 .cse170 .cse176 .cse181 .cse192 .cse196 .cse201 .cse202 .cse203 .cse210))) (let ((.cse174 (and .cse239 .cse83)) (.cse180 (and .cse78 .cse239 .cse104 .cse105 .cse106 .cse102 .cse83 .cse103)) (.cse208 (and .cse239 (or .cse106 .cse235)))) (let ((.cse194 (and .cse97 (or .cse137 .cse140 .cse142 .cse143 .cse157 .cse159 .cse170 .cse174 .cse176 .cse180 .cse181 .cse192 .cse196 .cse201 .cse202 .cse203 .cse208 .cse210))) (.cse231 (bvadd (_ bv1 32) .cse226))) (let ((.cse185 (= |base2flt_#in~e| .cse226)) (.cse147 (or (not (bvsle .cse238 (_ bv4294967168 32))) .cse14)) (.cse154 (= (bvadd .cse231 (_ bv1 32)) |base2flt_#in~e|)) (.cse183 (= base2flt_~e .cse232)) (.cse151 (= |base2flt_#in~e| .cse231)) (.cse236 (or .cse137 .cse140 .cse142 .cse143 .cse157 .cse159 .cse170 .cse174 .cse176 .cse180 .cse181 .cse192 .cse194 .cse196 .cse201 .cse202 .cse203 .cse208 .cse210)) (.cse190 (= base2flt_~e .cse237))) (let ((.cse141 (and .cse236 .cse190)) (.cse156 (and .cse151 .cse236 .cse14)) (.cse158 (and .cse64 .cse67 .cse236)) (.cse160 (and .cse236 .cse183)) (.cse163 (and .cse236 .cse154)) (.cse167 (and .cse236 .cse118)) (.cse171 (and .cse236 .cse183 .cse14)) (.cse173 (and .cse236 .cse154 .cse14)) (.cse177 (and .cse63 .cse64 .cse66 .cse67 .cse236 .cse68)) (.cse179 (and .cse63 .cse64 .cse67 .cse236)) (.cse186 (and .cse63 .cse64 .cse147 .cse65 .cse66 .cse67 .cse236 .cse68)) (.cse188 (and .cse236 .cse19)) (.cse189 (and .cse236 .cse118 .cse14)) (.cse191 (and .cse236 .cse185)) (.cse197 (and .cse63 .cse64 .cse65 .cse66 .cse67 .cse236 .cse68)) (.cse200 (and .cse64 .cse236)) (.cse209 (and .cse236 .cse185 .cse14)) (.cse211 (and .cse18 .cse236 .cse19)) (.cse212 (and .cse63 .cse64 .cse66 .cse67 .cse236)) (.cse214 (and .cse236 .cse190 .cse14)) (.cse215 (and .cse236 .cse14)) (.cse218 (and .cse151 .cse236))) (let ((.cse229 (bvadd (bvadd (_ bv4294967289 32) |base2flt_#in~e|) (_ bv4294967295 32))) (.cse234 (or .cse78 .cse235)) (.cse233 (or .cse137 .cse140 .cse141 .cse142 .cse143 .cse156 .cse157 .cse158 .cse159 .cse160 .cse163 .cse167 .cse170 .cse171 .cse173 .cse174 .cse176 .cse177 .cse179 .cse180 .cse181 .cse186 .cse188 .cse189 .cse191 .cse192 .cse194 .cse196 .cse197 .cse200 .cse201 .cse202 .cse203 .cse208 .cse209 .cse210 .cse211 .cse212 .cse214 .cse215 .cse218))) (let ((.cse133 (and .cse77 .cse89 .cse80 .cse234 .cse233 .cse81 .cse82 .cse86 .cse87)) (.cse136 (and .cse233 .cse83)) (.cse139 (and .cse80 .cse234 .cse233 .cse82)) (.cse144 (and .cse77 .cse89 .cse79 .cse80 .cse234 .cse233 .cse81 .cse82 .cse84 .cse85 .cse86 .cse87 .cse88)) (.cse150 (and .cse77 .cse89 .cse80 .cse234 .cse233 .cse81 .cse82 .cse84 .cse86 .cse87)) (.cse153 (and .cse80 .cse234 .cse233 .cse82 .cse87)) (.cse161 (and .cse77 .cse89 .cse80 .cse234 .cse233 .cse81 .cse82 .cse84 .cse86 .cse87 .cse88)) (.cse162 (and .cse77 .cse89 .cse80 .cse234 .cse233 .cse82 .cse86 .cse87)) (.cse164 (and .cse77 .cse80 .cse234 .cse233 .cse82 .cse87)) (.cse166 (and .cse80 .cse234 .cse233)) (.cse168 (and .cse77 .cse78 .cse89 .cse79 .cse80 .cse233 .cse91 .cse81 .cse82 .cse83 .cse84 .cse85 .cse86 .cse87 .cse88 .cse90)) (.cse172 (and .cse233 .cse84)) (.cse178 (and .cse77 .cse89 .cse79 .cse80 .cse234 .cse233 .cse81 .cse82 .cse84 .cse85 .cse86 .cse87 .cse88 .cse90)) (.cse184 (and .cse77 .cse80 .cse234 .cse233 .cse82 .cse86 .cse87)) (.cse187 (and .cse79 .cse233 .cse91 .cse84 .cse85 .cse88 .cse90)) (.cse195 (and .cse77 .cse89 .cse79 .cse80 .cse234 .cse233 .cse81 .cse82 .cse84 .cse86 .cse87 .cse88)) (.cse198 (and .cse233 .cse84 .cse88)) (.cse199 (and .cse79 .cse233 .cse84 .cse85 .cse88)) (.cse207 (and .cse77 .cse89 .cse79 .cse80 .cse234 .cse233 .cse91 .cse81 .cse82 .cse84 .cse85 .cse86 .cse87 .cse88 .cse90)) (.cse213 (and .cse234 .cse233)) (.cse216 (and .cse79 .cse233 .cse84 .cse88)) (.cse217 (and .cse79 .cse233 .cse84 .cse85 .cse88 .cse90)) (.cse228 (bvadd (_ bv4294967295 32) .cse232)) (.cse227 (bvadd (_ bv4294967295 32) (bvadd (_ bv4294967285 32) |base2flt_#in~e|))) (.cse230 (bvadd (_ bv4294967295 32) .cse229))) (let ((.cse138 (= .cse230 .cse226)) (.cse152 (= .cse230 .cse231)) (.cse169 (= base2flt_~e .cse230)) (.cse182 (= base2flt_~e .cse229)) (.cse135 (= base2flt_~e .cse227)) (.cse165 (= .cse228 .cse226)) (.cse175 (= base2flt_~e .cse228)) (.cse155 (= .cse226 .cse227)) (.cse205 (or (not (bvsle .cse225 (_ bv4294967168 32))) .cse14)) (.cse145 (or (not (bvsle .cse224 (_ bv4294967168 32))) .cse14)) (.cse146 (or (not (bvsle .cse223 (_ bv4294967168 32))) .cse14)) (.cse193 (or (not (bvsle .cse222 (_ bv4294967168 32))) .cse14)) (.cse148 (or (not (bvsle .cse221 (_ bv4294967168 32))) .cse14)) (.cse206 (or (not (bvsle .cse220 (_ bv4294967168 32))) .cse14)) (.cse149 (or (not (bvsle .cse219 (_ bv4294967168 32))) .cse14)) (.cse134 (or .cse133 .cse136 .cse137 .cse139 .cse140 .cse141 .cse142 .cse143 .cse144 .cse150 .cse153 .cse156 .cse157 .cse158 .cse159 .cse160 .cse161 .cse162 .cse163 .cse164 .cse166 .cse167 .cse168 .cse170 .cse171 .cse172 .cse173 .cse174 .cse176 .cse177 .cse178 .cse179 .cse180 .cse181 .cse184 .cse186 .cse187 .cse188 .cse189 .cse191 .cse192 .cse194 .cse195 .cse196 .cse197 .cse198 .cse199 .cse200 .cse201 .cse202 .cse203 .cse207 .cse208 .cse209 .cse210 .cse211 .cse212 .cse213 .cse214 .cse215 .cse216 .cse217 .cse218))) (or .cse133 (and .cse134 .cse135) .cse136 .cse137 (and .cse63 .cse64 .cse66 .cse67 .cse134) (and .cse138 .cse134 .cse14) .cse139 .cse140 .cse141 (and .cse63 .cse64 .cse67 .cse134) .cse142 (and .cse134 .cse14) (and .cse138 .cse134) .cse143 .cse144 (and .cse145 .cse63 .cse64 .cse146 .cse147 .cse65 .cse66 .cse67 .cse148 .cse134 .cse68 .cse149) .cse150 (and .cse151 .cse134) (and .cse152 .cse134) .cse153 (and .cse154 .cse134) (and .cse134 .cse155 .cse14) .cse156 .cse157 .cse158 (and .cse118 .cse134 .cse14) .cse159 .cse160 .cse161 (and .cse64 .cse134) .cse162 .cse163 (and .cse145 .cse63 .cse64 .cse146 .cse147 .cse65 .cse66 .cse67 .cse134 .cse68 .cse149) .cse164 (and .cse20 .cse134 .cse21) (and .cse134 .cse165) .cse166 .cse167 (and .cse63 .cse64 .cse147 .cse65 .cse66 .cse67 .cse134 .cse68 .cse149) .cse168 (and .cse152 .cse134 .cse14) (and .cse169 .cse134) .cse170 .cse171 .cse172 .cse173 .cse174 (and .cse175 .cse134 .cse14) .cse176 .cse177 (and .cse118 .cse134) (and .cse169 .cse134 .cse14) .cse178 .cse179 .cse180 .cse181 (and .cse134 .cse182 .cse14) (and .cse183 .cse134) (and .cse63 .cse64 .cse65 .cse66 .cse67 .cse134 .cse68) .cse184 (and .cse134 .cse185) .cse186 .cse187 (and .cse134 .cse182) (and .cse134 .cse14 .cse135) (and .cse63 .cse64 .cse147 .cse65 .cse66 .cse67 .cse134 .cse68) .cse188 .cse189 (and .cse134 .cse190) .cse191 .cse192 (and .cse134 .cse165 .cse14) (and .cse145 .cse63 .cse64 .cse146 .cse147 .cse65 .cse66 .cse67 .cse193 .cse148 .cse134 .cse68 .cse149) (and .cse63 .cse64 .cse146 .cse147 .cse65 .cse66 .cse67 .cse134 .cse68 .cse149) .cse194 (and .cse63 .cse64 .cse66 .cse67 .cse134 .cse68) .cse195 (and .cse154 .cse134 .cse14) (and .cse151 .cse134 .cse14) .cse196 .cse197 .cse198 .cse199 (and .cse175 .cse134) .cse200 .cse201 .cse202 (and .cse134 .cse155) .cse203 (and .cse145 .cse63 .cse64 (or (not (bvsle .cse204 (_ bv4294967168 32))) .cse14) .cse146 .cse147 .cse65 .cse66 .cse67 .cse193 .cse148 .cse205 .cse134 .cse206 .cse68 .cse149) .cse207 .cse208 (and .cse183 .cse134 .cse14) .cse209 .cse210 (and .cse145 .cse63 .cse64 .cse146 .cse147 .cse65 .cse66 .cse67 .cse193 .cse148 .cse205 .cse134 .cse206 .cse68 .cse149) (and .cse64 .cse67 .cse134) .cse211 .cse212 .cse213 (and .cse145 .cse63 .cse64 .cse146 .cse147 .cse65 .cse66 .cse67 .cse193 .cse148 .cse134 .cse206 .cse68 .cse149) (and .cse20 .cse134) .cse214 (and .cse134 .cse190 .cse14) (and .cse134 .cse185 .cse14) .cse215 .cse216 .cse217 .cse218))))))))))))))) (.cse131 (bvsle (bvadd ((_ sign_extend 1) (bvadd .cse132 (_ bv4294967295 32))) (_ bv128 33)) (_ bv2147483647 33)))) (or (and .cse28 .cse29 .cse130 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse37 .cse38 .cse39 .cse40 .cse131 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse126 .cse53) (and .cse28 .cse29 .cse130 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse126 .cse52 .cse53) (and .cse28 .cse29 .cse130 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse37 .cse38 .cse39 .cse40 .cse131 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse126 .cse52 .cse53) (and .cse130 .cse131 .cse126))))) (or (and .cse117 .cse23 .cse129) (and .cse23 .cse129)))) (.cse119 (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|)))) (.cse27 (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 ((.cse1 (and .cse127 .cse119 .cse128 .cse27)) (.cse2 (and .cse24 .cse127 .cse26 .cse27)) (.cse4 (and .cse127 .cse119 .cse27))) (let ((.cse16 (= base2flt_~__retres4~0 (_ bv0 32))) (.cse0 (or .cse1 .cse2 .cse4))) (let ((.cse5 (not .cse126)) (.cse6 (and .cse16 .cse0)) (.cse7 (not .cse125)) (.cse3 (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|))))) (.cse112 (= base2flt_~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 (or (and (= (_ bv4294967295 32) base2flt_~__retres4~0) .cse0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (let ((.cse22 (= |base2flt_#in~m| (_ bv1 32)))) (let ((.cse11 (let ((.cse107 (let ((.cse109 (let ((.cse111 (or (and .cse112 .cse51) .cse51))) (or (and (= base2flt_~m (_ bv2 32)) .cse22 .cse111) (and .cse22 .cse111))))) (or (and .cse108 .cse109 .cse51) (and .cse108 .cse109 .cse110 .cse51))))) (or (and .cse78 .cse22 .cse102 .cse83 .cse107) (and .cse78 .cse22 .cse83 .cse107) (and .cse22 .cse83 .cse107) (and .cse22 .cse107) (and (= base2flt_~m (_ bv4 32)) .cse22 .cse107))))) (let ((.cse15 (let ((.cse92 (and .cse22 .cse11 .cse83)) (.cse93 (and .cse22 .cse11)) (.cse94 (and .cse78 .cse104 .cse22 .cse102 .cse11 .cse83 .cse103)) (.cse95 (and .cse78 .cse104 .cse105 .cse106 .cse22 .cse102 .cse11 .cse83 .cse103)) (.cse96 (and .cse78 .cse104 .cse105 .cse22 .cse102 .cse11 .cse83 .cse103)) (.cse98 (and .cse78 .cse22 .cse11 .cse83)) (.cse99 (and (= base2flt_~m (_ bv64 32)) .cse22 .cse11)) (.cse100 (and .cse78 .cse22 .cse102 .cse11 .cse83 .cse103)) (.cse101 (and .cse78 .cse22 .cse102 .cse11 .cse83))) (or .cse92 .cse93 .cse94 .cse95 .cse96 (and .cse97 (or .cse92 .cse93 .cse94 .cse95 .cse96 .cse98 .cse99 .cse100 .cse101)) .cse98 .cse99 .cse100 .cse101)))) (let ((.cse54 (and .cse22 .cse15)) (.cse55 (and .cse77 .cse78 .cse89 .cse79 .cse80 .cse22 .cse91 .cse81 .cse82 .cse83 .cse85 .cse86 .cse87 .cse15 .cse88 .cse90)) (.cse56 (and .cse77 .cse78 .cse89 .cse79 .cse80 .cse22 .cse81 .cse82 .cse83 .cse84 .cse87 .cse15 .cse88)) (.cse57 (and .cse78 .cse80 .cse22 .cse83 .cse15)) (.cse58 (and .cse78 .cse22 .cse83 .cse15)) (.cse59 (and .cse77 .cse78 .cse89 .cse22 .cse82 .cse83 .cse86 .cse87 .cse15)) (.cse60 (and .cse78 .cse80 .cse22 .cse82 .cse83 .cse15)) (.cse61 (and .cse22 .cse83 .cse15)) (.cse62 (and .cse77 .cse80 .cse22 .cse82 .cse83 .cse86 .cse87 .cse15)) (.cse69 (and .cse77 .cse78 .cse89 .cse80 .cse22 .cse81 .cse83 .cse86 .cse87 .cse15)) (.cse70 (and .cse77 .cse78 .cse89 .cse80 .cse22 .cse81 .cse82 .cse83 .cse84 .cse86 .cse15)) (.cse71 (and .cse78 .cse89 .cse80 .cse22 .cse81 .cse82 .cse83 .cse84 .cse86 .cse87 .cse15 .cse88)) (.cse72 (and .cse78 .cse80 .cse22 .cse82 .cse83 .cse87 .cse15)) (.cse73 (and .cse77 .cse78 .cse80 .cse22 .cse82 .cse83 .cse87 .cse15)) (.cse74 (and .cse77 .cse78 .cse89 .cse79 .cse80 .cse22 .cse82 .cse83 .cse84 .cse85 .cse86 .cse87 .cse15 .cse88 .cse90)) (.cse75 (and .cse77 .cse78 .cse79 .cse80 .cse22 .cse81 .cse82 .cse83 .cse84 .cse85 .cse86 .cse87 .cse15 .cse88)) (.cse76 (and .cse22 .cse15 (= base2flt_~m (_ bv16384 32))))) (let ((.cse13 (or .cse54 .cse55 .cse56 .cse57 .cse58 .cse59 .cse60 .cse61 .cse62 .cse69 .cse70 .cse71 .cse72 .cse73 .cse74 .cse75 .cse76))) (let ((.cse25 (let ((.cse36 (or .cse54 .cse55 .cse56 .cse57 .cse58 .cse59 .cse60 .cse61 .cse62 (and .cse63 .cse64 .cse65 .cse66 .cse67 .cse13 .cse68) .cse69 .cse70 .cse71 .cse72 .cse73 .cse74 .cse75 .cse76))) (or (and .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51 .cse52 .cse53) (and .cse36 .cse51 (= base2flt_~e (bvadd (_ bv4294967295 32) (bvadd (bvadd (bvadd (_ bv4294967295 32) (_ bv4294967276 32)) (_ bv4294967295 32)) (_ bv4294967295 32))))))))) (let ((.cse9 (and .cse23 .cse24 .cse25 .cse26 .cse27)) (.cse17 (and .cse23 .cse24 .cse16 .cse25 .cse26 .cse27))) (or .cse9 .cse3 (and .cse10 .cse11 .cse12) (and .cse13 .cse14) (and .cse14 .cse15) (and .cse16 (or .cse9 .cse17)) (and .cse18 .cse19 .cse15) (and .cse20 .cse13 .cse21) .cse14 (not .cse22) (and .cse11 .cse14) .cse17 .cse8)))))))) (or .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (let ((.cse123 (bvshl (bvshl |base2flt_#in~m| (_ bv1 32)) (_ bv1 32)))) (let ((.cse124 (bvshl (bvshl (bvshl (bvshl .cse123 (_ bv1 32)) (_ bv1 32)) (_ bv1 32)) (_ bv1 32)))) (let ((.cse122 (bvshl (bvshl (bvshl (bvshl (bvshl (bvshl (bvshl .cse124 (_ bv1 32)) (_ bv1 32)) (_ bv1 32)) (_ bv1 32)) (_ bv1 32)) (_ bv1 32)) (_ bv1 32)))) (let ((.cse115 (bvult |base2flt_#in~m| (_ bv16777216 32))) (.cse114 (bvult .cse124 (_ bv16777216 32))) (.cse113 (bvult .cse123 (_ bv16777216 32))) (.cse116 (= |base2flt_#in~m| (_ bv0 32))) (.cse120 (bvult .cse122 (_ bv16777216 32))) (.cse121 (bvult (bvshl .cse122 (_ bv1 32)) (_ bv16777216 32)))) (or (not .cse113) (and (not .cse114) .cse115) .cse3 (not .cse116) (and .cse77 .cse117 .cse78 .cse89 .cse23 .cse79 (= base2flt_~m (_ bv0 32)) .cse80 .cse104 .cse105 .cse106 .cse102 .cse118 .cse16 (or (not .cse115) .cse114) .cse119 .cse113 .cse116 .cse112 .cse91 .cse81 .cse82 .cse27 .cse83 .cse84 .cse51 .cse85 .cse86 .cse87 .cse103 (or (not .cse120) .cse121) .cse88 .cse90) .cse14 (and .cse120 (not .cse121)) .cse8)))))))))))))))))))))))))))))))))) [2023-02-17 03:47:40,345 INFO L899 garLoopResultBuilder]: For program point base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 77) no Hoare annotation was computed. [2023-02-17 03:47:40,345 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 24 82) the Hoare annotation is: true [2023-02-17 03:47:40,346 INFO L899 garLoopResultBuilder]: For program point L38(lines 37 52) no Hoare annotation was computed. [2023-02-17 03:47:40,346 INFO L899 garLoopResultBuilder]: For program point base2fltFINAL(lines 24 82) no Hoare annotation was computed. [2023-02-17 03:47:40,346 INFO L899 garLoopResultBuilder]: For program point L59(lines 57 72) no Hoare annotation was computed. [2023-02-17 03:47:40,346 INFO L899 garLoopResultBuilder]: For program point base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 45) no Hoare annotation was computed. [2023-02-17 03:47:40,346 INFO L899 garLoopResultBuilder]: For program point base2fltEXIT(lines 24 82) no Hoare annotation was computed. [2023-02-17 03:47:40,346 INFO L899 garLoopResultBuilder]: For program point L47(lines 47 51) no Hoare annotation was computed. [2023-02-17 03:47:40,348 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-17 03:47:40,348 INFO L899 garLoopResultBuilder]: For program point L35(lines 35 75) no Hoare annotation was computed. [2023-02-17 03:47:40,348 INFO L899 garLoopResultBuilder]: For program point L258-2(lines 258 262) no Hoare annotation was computed. [2023-02-17 03:47:40,348 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 175) no Hoare annotation was computed. [2023-02-17 03:47:40,348 INFO L899 garLoopResultBuilder]: For program point L201(line 201) no Hoare annotation was computed. [2023-02-17 03:47:40,348 INFO L902 garLoopResultBuilder]: At program point main_returnLabel#1(lines 220 274) the Hoare annotation is: true [2023-02-17 03:47:40,348 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW(line 178) no Hoare annotation was computed. [2023-02-17 03:47:40,349 INFO L899 garLoopResultBuilder]: For program point L201-1(line 201) no Hoare annotation was computed. [2023-02-17 03:47:40,349 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 172) no Hoare annotation was computed. [2023-02-17 03:47:40,349 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2023-02-17 03:47:40,349 INFO L899 garLoopResultBuilder]: For program point L185(lines 185 190) no Hoare annotation was computed. [2023-02-17 03:47:40,349 INFO L899 garLoopResultBuilder]: For program point L177(line 177) no Hoare annotation was computed. [2023-02-17 03:47:40,349 INFO L899 garLoopResultBuilder]: For program point L177-1(line 177) no Hoare annotation was computed. [2023-02-17 03:47:40,349 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW(line 201) no Hoare annotation was computed. [2023-02-17 03:47:40,349 INFO L899 garLoopResultBuilder]: For program point L194(lines 194 211) no Hoare annotation was computed. [2023-02-17 03:47:40,349 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 172) no Hoare annotation was computed. [2023-02-17 03:47:40,350 INFO L899 garLoopResultBuilder]: For program point L194-2(lines 194 211) no Hoare annotation was computed. [2023-02-17 03:47:40,350 INFO L902 garLoopResultBuilder]: At program point mulflt_returnLabel#1(lines 147 219) the Hoare annotation is: true [2023-02-17 03:47:40,350 INFO L899 garLoopResultBuilder]: For program point L244(lines 244 253) no Hoare annotation was computed. [2023-02-17 03:47:40,350 INFO L899 garLoopResultBuilder]: For program point L178(line 178) no Hoare annotation was computed. [2023-02-17 03:47:40,350 INFO L899 garLoopResultBuilder]: For program point L244-2(lines 236 273) no Hoare annotation was computed. [2023-02-17 03:47:40,350 INFO L899 garLoopResultBuilder]: For program point L178-1(line 178) no Hoare annotation was computed. [2023-02-17 03:47:40,350 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW(line 201) no Hoare annotation was computed. [2023-02-17 03:47:40,350 INFO L899 garLoopResultBuilder]: For program point L203(lines 203 208) no Hoare annotation was computed. [2023-02-17 03:47:40,350 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-02-17 03:47:40,351 INFO L899 garLoopResultBuilder]: For program point L195(lines 195 200) no Hoare annotation was computed. [2023-02-17 03:47:40,351 INFO L899 garLoopResultBuilder]: For program point L179(lines 179 184) no Hoare annotation was computed. [2023-02-17 03:47:40,351 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW(line 214) no Hoare annotation was computed. [2023-02-17 03:47:40,351 INFO L899 garLoopResultBuilder]: For program point L254(lines 254 270) no Hoare annotation was computed. [2023-02-17 03:47:40,351 INFO L902 garLoopResultBuilder]: At program point L238(line 238) the Hoare annotation is: true [2023-02-17 03:47:40,351 INFO L899 garLoopResultBuilder]: For program point L238-1(line 238) no Hoare annotation was computed. [2023-02-17 03:47:40,351 INFO L899 garLoopResultBuilder]: For program point L172(line 172) no Hoare annotation was computed. [2023-02-17 03:47:40,351 INFO L899 garLoopResultBuilder]: For program point L172-1(line 172) no Hoare annotation was computed. [2023-02-17 03:47:40,351 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW(line 214) no Hoare annotation was computed. [2023-02-17 03:47:40,352 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2023-02-17 03:47:40,352 INFO L899 garLoopResultBuilder]: For program point L255(lines 255 264) no Hoare annotation was computed. [2023-02-17 03:47:40,352 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 177) no Hoare annotation was computed. [2023-02-17 03:47:40,352 INFO L902 garLoopResultBuilder]: At program point L255-2(lines 255 264) the Hoare annotation is: true [2023-02-17 03:47:40,352 INFO L899 garLoopResultBuilder]: For program point L247(lines 247 251) no Hoare annotation was computed. [2023-02-17 03:47:40,352 INFO L899 garLoopResultBuilder]: For program point L214(line 214) no Hoare annotation was computed. [2023-02-17 03:47:40,352 INFO L899 garLoopResultBuilder]: For program point L214-1(line 214) no Hoare annotation was computed. [2023-02-17 03:47:40,352 INFO L899 garLoopResultBuilder]: For program point L247-2(lines 247 251) no Hoare annotation was computed. [2023-02-17 03:47:40,352 INFO L902 garLoopResultBuilder]: At program point L239(line 239) the Hoare annotation is: true [2023-02-17 03:47:40,353 INFO L899 garLoopResultBuilder]: For program point L239-1(line 239) no Hoare annotation was computed. [2023-02-17 03:47:40,353 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-02-17 03:47:40,353 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 177) no Hoare annotation was computed. [2023-02-17 03:47:40,353 INFO L902 garLoopResultBuilder]: At program point L240(line 240) the Hoare annotation is: true [2023-02-17 03:47:40,353 INFO L899 garLoopResultBuilder]: For program point L240-1(line 240) no Hoare annotation was computed. [2023-02-17 03:47:40,353 INFO L899 garLoopResultBuilder]: For program point L158(lines 158 164) no Hoare annotation was computed. [2023-02-17 03:47:40,353 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 175) no Hoare annotation was computed. [2023-02-17 03:47:40,353 INFO L899 garLoopResultBuilder]: For program point L158-2(lines 157 218) no Hoare annotation was computed. [2023-02-17 03:47:40,353 INFO L902 garLoopResultBuilder]: At program point L216(lines 157 218) the Hoare annotation is: true [2023-02-17 03:47:40,354 INFO L902 garLoopResultBuilder]: At program point L241(line 241) the Hoare annotation is: true [2023-02-17 03:47:40,354 INFO L899 garLoopResultBuilder]: For program point L241-1(line 241) no Hoare annotation was computed. [2023-02-17 03:47:40,354 INFO L899 garLoopResultBuilder]: For program point L175(line 175) no Hoare annotation was computed. [2023-02-17 03:47:40,354 INFO L899 garLoopResultBuilder]: For program point L175-1(line 175) no Hoare annotation was computed. [2023-02-17 03:47:40,354 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW(line 178) no Hoare annotation was computed. [2023-02-17 03:47:40,354 INFO L899 garLoopResultBuilder]: For program point L258(lines 258 262) no Hoare annotation was computed. [2023-02-17 03:47:40,354 INFO L899 garLoopResultBuilder]: For program point L17(line 17) no Hoare annotation was computed. [2023-02-17 03:47:40,355 INFO L899 garLoopResultBuilder]: For program point L16(lines 16 18) no Hoare annotation was computed. [2023-02-17 03:47:40,355 INFO L899 garLoopResultBuilder]: For program point L16-2(lines 15 20) no Hoare annotation was computed. [2023-02-17 03:47:40,355 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 15 20) no Hoare annotation was computed. [2023-02-17 03:47:40,355 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 15 20) the Hoare annotation is: true [2023-02-17 03:47:40,358 INFO L445 BasicCegarLoop]: Path program histogram: [4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 03:47:40,360 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-02-17 03:47:40,380 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-17 03:47:40,381 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-17 03:47:40,381 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-17 03:47:40,384 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-17 03:47:40,385 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-17 03:47:40,385 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-17 03:47:51,994 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-17 03:47:51,994 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-17 03:47:51,994 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-17 03:47:51,996 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-17 03:47:52,687 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-17 03:47:52,688 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~ea~2#1_BEFORE_CALL_1,QUANTIFIED]