./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/bitvector/soft_float_5.c.cil.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -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_5.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 dd739e073fd22ceb2879e867de327b334b7eea402e53d4a8f9e32eed7e4110d8 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-21 03:10:08,483 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-21 03:10:08,485 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-21 03:10:08,528 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-21 03:10:08,528 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-21 03:10:08,532 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-21 03:10:08,536 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-21 03:10:08,542 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-21 03:10:08,544 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-21 03:10:08,550 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-21 03:10:08,550 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-21 03:10:08,552 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-21 03:10:08,552 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-21 03:10:08,554 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-21 03:10:08,555 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-21 03:10:08,559 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-21 03:10:08,560 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-21 03:10:08,561 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-21 03:10:08,562 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-21 03:10:08,566 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-21 03:10:08,569 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-21 03:10:08,570 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-21 03:10:08,571 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-21 03:10:08,571 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-21 03:10:08,573 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-21 03:10:08,574 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-21 03:10:08,574 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-21 03:10:08,575 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-21 03:10:08,575 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-21 03:10:08,576 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-21 03:10:08,576 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-21 03:10:08,577 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-21 03:10:08,578 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-21 03:10:08,578 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-21 03:10:08,579 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-21 03:10:08,579 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-21 03:10:08,580 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-21 03:10:08,580 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-21 03:10:08,580 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-21 03:10:08,581 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-21 03:10:08,582 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-21 03:10:08,583 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2022-02-21 03:10:08,601 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-21 03:10:08,601 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-21 03:10:08,601 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-21 03:10:08,602 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-21 03:10:08,602 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-21 03:10:08,603 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-21 03:10:08,603 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-21 03:10:08,603 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-21 03:10:08,604 INFO L138 SettingsManager]: * Use SBE=true [2022-02-21 03:10:08,604 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-21 03:10:08,604 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-21 03:10:08,604 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-21 03:10:08,605 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-21 03:10:08,605 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-21 03:10:08,605 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-21 03:10:08,605 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-21 03:10:08,606 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-21 03:10:08,606 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-21 03:10:08,606 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-02-21 03:10:08,606 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-21 03:10:08,607 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-21 03:10:08,607 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-21 03:10:08,607 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-21 03:10:08,607 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-21 03:10:08,608 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-21 03:10:08,608 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-21 03:10:08,608 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-21 03:10:08,608 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-21 03:10:08,609 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-21 03:10:08,609 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-21 03:10:08,609 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-21 03:10:08,609 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-21 03:10:08,610 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-21 03:10:08,610 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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 -> dd739e073fd22ceb2879e867de327b334b7eea402e53d4a8f9e32eed7e4110d8 [2022-02-21 03:10:08,817 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-21 03:10:08,836 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-21 03:10:08,840 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-21 03:10:08,841 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-21 03:10:08,841 INFO L275 PluginConnector]: CDTParser initialized [2022-02-21 03:10:08,842 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/soft_float_5.c.cil.c [2022-02-21 03:10:08,906 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/24f97e4ca/366e90befb974d0fb59384485d097af8/FLAGdf2b62a76 [2022-02-21 03:10:09,314 INFO L306 CDTParser]: Found 1 translation units. [2022-02-21 03:10:09,319 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_5.c.cil.c [2022-02-21 03:10:09,334 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/24f97e4ca/366e90befb974d0fb59384485d097af8/FLAGdf2b62a76 [2022-02-21 03:10:09,350 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/24f97e4ca/366e90befb974d0fb59384485d097af8 [2022-02-21 03:10:09,356 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-21 03:10:09,357 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-21 03:10:09,362 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-21 03:10:09,362 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-21 03:10:09,365 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-21 03:10:09,366 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:10:09" (1/1) ... [2022-02-21 03:10:09,367 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b5be297 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:10:09, skipping insertion in model container [2022-02-21 03:10:09,367 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:10:09" (1/1) ... [2022-02-21 03:10:09,374 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-21 03:10:09,411 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 03:10:09,551 WARN L230 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_5.c.cil.c[727,740] [2022-02-21 03:10:09,619 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:10:09,627 INFO L203 MainTranslator]: Completed pre-run [2022-02-21 03:10:09,651 WARN L230 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_5.c.cil.c[727,740] [2022-02-21 03:10:09,707 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:10:09,722 INFO L208 MainTranslator]: Completed translation [2022-02-21 03:10:09,723 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:10:09 WrapperNode [2022-02-21 03:10:09,723 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-21 03:10:09,724 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-21 03:10:09,724 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-21 03:10:09,724 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-21 03:10:09,730 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:10:09" (1/1) ... [2022-02-21 03:10:09,737 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:10:09" (1/1) ... [2022-02-21 03:10:09,774 INFO L137 Inliner]: procedures = 17, calls = 15, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 196 [2022-02-21 03:10:09,774 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-21 03:10:09,777 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-21 03:10:09,777 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-21 03:10:09,777 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-21 03:10:09,785 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:10:09" (1/1) ... [2022-02-21 03:10:09,785 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:10:09" (1/1) ... [2022-02-21 03:10:09,788 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:10:09" (1/1) ... [2022-02-21 03:10:09,788 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:10:09" (1/1) ... [2022-02-21 03:10:09,807 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:10:09" (1/1) ... [2022-02-21 03:10:09,819 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:10:09" (1/1) ... [2022-02-21 03:10:09,825 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:10:09" (1/1) ... [2022-02-21 03:10:09,827 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-21 03:10:09,828 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-21 03:10:09,828 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-21 03:10:09,828 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-21 03:10:09,834 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:10:09" (1/1) ... [2022-02-21 03:10:09,841 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-21 03:10:09,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:10:09,864 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) [2022-02-21 03:10:09,866 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 [2022-02-21 03:10:09,891 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-21 03:10:09,891 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-21 03:10:09,891 INFO L130 BoogieDeclarations]: Found specification of procedure base2flt [2022-02-21 03:10:09,891 INFO L138 BoogieDeclarations]: Found implementation of procedure base2flt [2022-02-21 03:10:09,891 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-21 03:10:09,891 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-21 03:10:09,891 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-02-21 03:10:09,892 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-02-21 03:10:09,952 INFO L234 CfgBuilder]: Building ICFG [2022-02-21 03:10:09,953 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-21 03:10:10,591 INFO L275 CfgBuilder]: Performing block encoding [2022-02-21 03:10:10,599 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-21 03:10:10,602 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-02-21 03:10:10,604 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:10:10 BoogieIcfgContainer [2022-02-21 03:10:10,605 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-21 03:10:10,606 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-21 03:10:10,606 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-21 03:10:10,610 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-21 03:10:10,610 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.02 03:10:09" (1/3) ... [2022-02-21 03:10:10,611 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c4c30db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.02 03:10:10, skipping insertion in model container [2022-02-21 03:10:10,611 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:10:09" (2/3) ... [2022-02-21 03:10:10,611 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c4c30db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.02 03:10:10, skipping insertion in model container [2022-02-21 03:10:10,612 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:10:10" (3/3) ... [2022-02-21 03:10:10,616 INFO L111 eAbstractionObserver]: Analyzing ICFG soft_float_5.c.cil.c [2022-02-21 03:10:10,623 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-21 03:10:10,623 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 30 error locations. [2022-02-21 03:10:10,681 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-21 03:10:10,694 INFO L339 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=FINITE_AUTOMATA, 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, mLoopAccelerationTechnique=FAST_UPR [2022-02-21 03:10:10,694 INFO L340 AbstractCegarLoop]: Starting to check reachability of 30 error locations. [2022-02-21 03:10:10,722 INFO L276 IsEmpty]: Start isEmpty. Operand has 144 states, 106 states have (on average 1.8018867924528301) internal successors, (191), 137 states have internal predecessors, (191), 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) [2022-02-21 03:10:10,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-02-21 03:10:10,727 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:10:10,727 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:10:10,728 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2022-02-21 03:10:10,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:10:10,738 INFO L85 PathProgramCache]: Analyzing trace with hash 147391961, now seen corresponding path program 1 times [2022-02-21 03:10:10,748 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:10:10,749 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141196879] [2022-02-21 03:10:10,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:10:10,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:10:10,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:10,908 INFO L290 TraceCheckUtils]: 0: Hoare triple {147#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(21, 2);call #Ultimate.allocInit(12, 3); {147#true} is VALID [2022-02-21 03:10:10,909 INFO L290 TraceCheckUtils]: 1: Hoare triple {147#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~ret22#1, main_#t~ret23#1, main_#t~ret24#1, main_#t~ret25#1, main_#t~ret26#1, main_~a~0#1, main_~ma~2#1, main_~ea~2#1, main_~b~0#1, main_~mb~2#1, main_~eb~2#1, main_~r_mul~0#1, main_~zero~0#1, main_~one~0#1, main_~sb~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~tmp___1~0#1, main_~__retres16~0#1;havoc main_~a~0#1;main_~ma~2#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;main_~ea~2#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1;havoc main_~b~0#1;main_~mb~2#1 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;main_~eb~2#1 := main_#t~nondet21#1;havoc main_#t~nondet21#1;havoc main_~r_mul~0#1;havoc main_~zero~0#1;havoc main_~one~0#1;havoc main_~sb~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~tmp___1~0#1;havoc main_~__retres16~0#1; {147#true} is VALID [2022-02-21 03:10:10,909 INFO L272 TraceCheckUtils]: 2: Hoare triple {147#true} call main_#t~ret22#1 := base2flt(0, 0); {147#true} is VALID [2022-02-21 03:10:10,910 INFO L290 TraceCheckUtils]: 3: Hoare triple {147#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {147#true} is VALID [2022-02-21 03:10:10,910 INFO L290 TraceCheckUtils]: 4: Hoare triple {147#true} assume !(0 == ~m % 4294967296); {147#true} is VALID [2022-02-21 03:10:10,910 INFO L290 TraceCheckUtils]: 5: Hoare triple {147#true} assume !(~m % 4294967296 < 16777216); {147#true} is VALID [2022-02-21 03:10:10,911 INFO L290 TraceCheckUtils]: 6: Hoare triple {147#true} assume !true; {148#false} is VALID [2022-02-21 03:10:10,911 INFO L290 TraceCheckUtils]: 7: Hoare triple {148#false} assume 0 == ~m || 0 == ~bitwiseComplement(16777216);~m := 0; {148#false} is VALID [2022-02-21 03:10:10,911 INFO L290 TraceCheckUtils]: 8: Hoare triple {148#false} assume !(128 + ~e <= 2147483647); {148#false} is VALID [2022-02-21 03:10:10,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:10:10,913 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:10:10,913 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141196879] [2022-02-21 03:10:10,914 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [141196879] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:10:10,914 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:10:10,915 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-21 03:10:10,916 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814438766] [2022-02-21 03:10:10,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:10:10,924 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.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 [2022-02-21 03:10:10,935 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:10:10,938 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 4.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) [2022-02-21 03:10:10,950 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:10:10,951 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-21 03:10:10,951 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:10:10,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-21 03:10:10,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-21 03:10:10,989 INFO L87 Difference]: Start difference. First operand has 144 states, 106 states have (on average 1.8018867924528301) internal successors, (191), 137 states have internal predecessors, (191), 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, 2 states have (on average 4.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) [2022-02-21 03:10:11,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:11,188 INFO L93 Difference]: Finished difference Result 283 states and 403 transitions. [2022-02-21 03:10:11,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-21 03:10:11,188 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.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 [2022-02-21 03:10:11,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:10:11,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 4.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) [2022-02-21 03:10:11,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 403 transitions. [2022-02-21 03:10:11,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 4.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) [2022-02-21 03:10:11,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 403 transitions. [2022-02-21 03:10:11,216 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 403 transitions. [2022-02-21 03:10:11,616 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 403 edges. 403 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:10:11,631 INFO L225 Difference]: With dead ends: 283 [2022-02-21 03:10:11,632 INFO L226 Difference]: Without dead ends: 121 [2022-02-21 03:10:11,636 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-21 03:10:11,639 INFO L933 BasicCegarLoop]: 184 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, 184 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 [2022-02-21 03:10:11,640 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:10:11,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2022-02-21 03:10:11,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2022-02-21 03:10:11,671 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:10:11,672 INFO L82 GeneralOperation]: Start isEquivalent. First operand 121 states. Second operand has 121 states, 88 states have (on average 1.625) internal successors, (143), 115 states have internal predecessors, (143), 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) [2022-02-21 03:10:11,673 INFO L74 IsIncluded]: Start isIncluded. First operand 121 states. Second operand has 121 states, 88 states have (on average 1.625) internal successors, (143), 115 states have internal predecessors, (143), 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) [2022-02-21 03:10:11,674 INFO L87 Difference]: Start difference. First operand 121 states. Second operand has 121 states, 88 states have (on average 1.625) internal successors, (143), 115 states have internal predecessors, (143), 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) [2022-02-21 03:10:11,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:11,681 INFO L93 Difference]: Finished difference Result 121 states and 151 transitions. [2022-02-21 03:10:11,682 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 151 transitions. [2022-02-21 03:10:11,683 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:10:11,684 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:10:11,685 INFO L74 IsIncluded]: Start isIncluded. First operand has 121 states, 88 states have (on average 1.625) internal successors, (143), 115 states have internal predecessors, (143), 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) Second operand 121 states. [2022-02-21 03:10:11,685 INFO L87 Difference]: Start difference. First operand has 121 states, 88 states have (on average 1.625) internal successors, (143), 115 states have internal predecessors, (143), 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) Second operand 121 states. [2022-02-21 03:10:11,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:11,692 INFO L93 Difference]: Finished difference Result 121 states and 151 transitions. [2022-02-21 03:10:11,692 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 151 transitions. [2022-02-21 03:10:11,694 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:10:11,694 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:10:11,694 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:10:11,694 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:10:11,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 88 states have (on average 1.625) internal successors, (143), 115 states have internal predecessors, (143), 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) [2022-02-21 03:10:11,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 151 transitions. [2022-02-21 03:10:11,702 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 151 transitions. Word has length 9 [2022-02-21 03:10:11,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:10:11,702 INFO L470 AbstractCegarLoop]: Abstraction has 121 states and 151 transitions. [2022-02-21 03:10:11,703 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.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) [2022-02-21 03:10:11,703 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 151 transitions. [2022-02-21 03:10:11,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-02-21 03:10:11,704 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:10:11,704 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:10:11,704 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-21 03:10:11,704 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2022-02-21 03:10:11,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:10:11,705 INFO L85 PathProgramCache]: Analyzing trace with hash 146450613, now seen corresponding path program 1 times [2022-02-21 03:10:11,706 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:10:11,706 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942922645] [2022-02-21 03:10:11,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:10:11,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:10:11,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:11,791 INFO L290 TraceCheckUtils]: 0: Hoare triple {833#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(21, 2);call #Ultimate.allocInit(12, 3); {833#true} is VALID [2022-02-21 03:10:11,791 INFO L290 TraceCheckUtils]: 1: Hoare triple {833#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~ret22#1, main_#t~ret23#1, main_#t~ret24#1, main_#t~ret25#1, main_#t~ret26#1, main_~a~0#1, main_~ma~2#1, main_~ea~2#1, main_~b~0#1, main_~mb~2#1, main_~eb~2#1, main_~r_mul~0#1, main_~zero~0#1, main_~one~0#1, main_~sb~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~tmp___1~0#1, main_~__retres16~0#1;havoc main_~a~0#1;main_~ma~2#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;main_~ea~2#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1;havoc main_~b~0#1;main_~mb~2#1 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;main_~eb~2#1 := main_#t~nondet21#1;havoc main_#t~nondet21#1;havoc main_~r_mul~0#1;havoc main_~zero~0#1;havoc main_~one~0#1;havoc main_~sb~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~tmp___1~0#1;havoc main_~__retres16~0#1; {833#true} is VALID [2022-02-21 03:10:11,792 INFO L272 TraceCheckUtils]: 2: Hoare triple {833#true} call main_#t~ret22#1 := base2flt(0, 0); {835#(= |base2flt_#in~e| 0)} is VALID [2022-02-21 03:10:11,792 INFO L290 TraceCheckUtils]: 3: Hoare triple {835#(= |base2flt_#in~e| 0)} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {836#(= base2flt_~e 0)} is VALID [2022-02-21 03:10:11,793 INFO L290 TraceCheckUtils]: 4: Hoare triple {836#(= base2flt_~e 0)} assume !(0 == ~m % 4294967296); {836#(= base2flt_~e 0)} is VALID [2022-02-21 03:10:11,793 INFO L290 TraceCheckUtils]: 5: Hoare triple {836#(= base2flt_~e 0)} assume ~m % 4294967296 < 16777216; {836#(= base2flt_~e 0)} is VALID [2022-02-21 03:10:11,794 INFO L290 TraceCheckUtils]: 6: Hoare triple {836#(= base2flt_~e 0)} assume !false; {836#(= base2flt_~e 0)} is VALID [2022-02-21 03:10:11,794 INFO L290 TraceCheckUtils]: 7: Hoare triple {836#(= base2flt_~e 0)} assume !(~e <= -128); {836#(= base2flt_~e 0)} is VALID [2022-02-21 03:10:11,795 INFO L290 TraceCheckUtils]: 8: Hoare triple {836#(= base2flt_~e 0)} assume !(~e - 1 <= 2147483647); {834#false} is VALID [2022-02-21 03:10:11,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:10:11,795 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:10:11,796 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942922645] [2022-02-21 03:10:11,796 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [942922645] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:10:11,796 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:10:11,796 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 03:10:11,796 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770355500] [2022-02-21 03:10:11,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:10:11,797 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 [2022-02-21 03:10:11,798 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:10:11,798 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 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) [2022-02-21 03:10:11,807 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:10:11,807 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-21 03:10:11,808 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:10:11,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-21 03:10:11,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-21 03:10:11,809 INFO L87 Difference]: Start difference. First operand 121 states and 151 transitions. 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) [2022-02-21 03:10:12,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:12,173 INFO L93 Difference]: Finished difference Result 304 states and 392 transitions. [2022-02-21 03:10:12,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-21 03:10:12,173 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 [2022-02-21 03:10:12,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:10:12,174 INFO L82 GeneralOperation]: Start removeUnreachable. 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) [2022-02-21 03:10:12,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 392 transitions. [2022-02-21 03:10:12,179 INFO L82 GeneralOperation]: Start removeUnreachable. 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) [2022-02-21 03:10:12,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 392 transitions. [2022-02-21 03:10:12,185 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 392 transitions. [2022-02-21 03:10:12,485 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 392 edges. 392 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:10:12,491 INFO L225 Difference]: With dead ends: 304 [2022-02-21 03:10:12,492 INFO L226 Difference]: Without dead ends: 186 [2022-02-21 03:10:12,493 INFO L932 BasicCegarLoop]: 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 [2022-02-21 03:10:12,494 INFO L933 BasicCegarLoop]: 139 mSDtfsCounter, 100 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 395 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:10:12,495 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [100 Valid, 395 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:10:12,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2022-02-21 03:10:12,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 170. [2022-02-21 03:10:12,505 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:10:12,506 INFO L82 GeneralOperation]: Start isEquivalent. First operand 186 states. Second operand has 170 states, 136 states have (on average 1.6323529411764706) internal successors, (222), 163 states have internal predecessors, (222), 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) [2022-02-21 03:10:12,506 INFO L74 IsIncluded]: Start isIncluded. First operand 186 states. Second operand has 170 states, 136 states have (on average 1.6323529411764706) internal successors, (222), 163 states have internal predecessors, (222), 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) [2022-02-21 03:10:12,507 INFO L87 Difference]: Start difference. First operand 186 states. Second operand has 170 states, 136 states have (on average 1.6323529411764706) internal successors, (222), 163 states have internal predecessors, (222), 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) [2022-02-21 03:10:12,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:12,514 INFO L93 Difference]: Finished difference Result 186 states and 234 transitions. [2022-02-21 03:10:12,514 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 234 transitions. [2022-02-21 03:10:12,516 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:10:12,516 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:10:12,517 INFO L74 IsIncluded]: Start isIncluded. First operand has 170 states, 136 states have (on average 1.6323529411764706) internal successors, (222), 163 states have internal predecessors, (222), 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) Second operand 186 states. [2022-02-21 03:10:12,517 INFO L87 Difference]: Start difference. First operand has 170 states, 136 states have (on average 1.6323529411764706) internal successors, (222), 163 states have internal predecessors, (222), 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) Second operand 186 states. [2022-02-21 03:10:12,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:12,524 INFO L93 Difference]: Finished difference Result 186 states and 234 transitions. [2022-02-21 03:10:12,524 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 234 transitions. [2022-02-21 03:10:12,525 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:10:12,525 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:10:12,526 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:10:12,526 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:10:12,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 136 states have (on average 1.6323529411764706) internal successors, (222), 163 states have internal predecessors, (222), 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) [2022-02-21 03:10:12,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 230 transitions. [2022-02-21 03:10:12,532 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 230 transitions. Word has length 9 [2022-02-21 03:10:12,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:10:12,532 INFO L470 AbstractCegarLoop]: Abstraction has 170 states and 230 transitions. [2022-02-21 03:10:12,533 INFO L471 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) [2022-02-21 03:10:12,533 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 230 transitions. [2022-02-21 03:10:12,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-02-21 03:10:12,534 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:10:12,534 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:10:12,534 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-21 03:10:12,534 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting base2fltErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2022-02-21 03:10:12,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:10:12,535 INFO L85 PathProgramCache]: Analyzing trace with hash 966754998, now seen corresponding path program 1 times [2022-02-21 03:10:12,535 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:10:12,536 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982075165] [2022-02-21 03:10:12,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:10:12,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:10:12,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:12,617 INFO L290 TraceCheckUtils]: 0: Hoare triple {1730#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(21, 2);call #Ultimate.allocInit(12, 3); {1730#true} is VALID [2022-02-21 03:10:12,617 INFO L290 TraceCheckUtils]: 1: Hoare triple {1730#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~ret22#1, main_#t~ret23#1, main_#t~ret24#1, main_#t~ret25#1, main_#t~ret26#1, main_~a~0#1, main_~ma~2#1, main_~ea~2#1, main_~b~0#1, main_~mb~2#1, main_~eb~2#1, main_~r_mul~0#1, main_~zero~0#1, main_~one~0#1, main_~sb~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~tmp___1~0#1, main_~__retres16~0#1;havoc main_~a~0#1;main_~ma~2#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;main_~ea~2#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1;havoc main_~b~0#1;main_~mb~2#1 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;main_~eb~2#1 := main_#t~nondet21#1;havoc main_#t~nondet21#1;havoc main_~r_mul~0#1;havoc main_~zero~0#1;havoc main_~one~0#1;havoc main_~sb~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~tmp___1~0#1;havoc main_~__retres16~0#1; {1730#true} is VALID [2022-02-21 03:10:12,618 INFO L272 TraceCheckUtils]: 2: Hoare triple {1730#true} call main_#t~ret22#1 := base2flt(0, 0); {1732#(= |base2flt_#in~m| 0)} is VALID [2022-02-21 03:10:12,618 INFO L290 TraceCheckUtils]: 3: Hoare triple {1732#(= |base2flt_#in~m| 0)} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {1733#(= base2flt_~m 0)} is VALID [2022-02-21 03:10:12,619 INFO L290 TraceCheckUtils]: 4: Hoare triple {1733#(= base2flt_~m 0)} assume !(0 == ~m % 4294967296); {1733#(= base2flt_~m 0)} is VALID [2022-02-21 03:10:12,619 INFO L290 TraceCheckUtils]: 5: Hoare triple {1733#(= base2flt_~m 0)} assume !(~m % 4294967296 < 16777216); {1731#false} is VALID [2022-02-21 03:10:12,620 INFO L290 TraceCheckUtils]: 6: Hoare triple {1731#false} assume !false; {1731#false} is VALID [2022-02-21 03:10:12,620 INFO L290 TraceCheckUtils]: 7: Hoare triple {1731#false} assume !(~m % 4294967296 >= 33554432); {1731#false} is VALID [2022-02-21 03:10:12,620 INFO L290 TraceCheckUtils]: 8: Hoare triple {1731#false} assume 0 == ~m || 0 == ~bitwiseComplement(16777216);~m := 0; {1731#false} is VALID [2022-02-21 03:10:12,620 INFO L290 TraceCheckUtils]: 9: Hoare triple {1731#false} assume 128 + ~e <= 2147483647; {1731#false} is VALID [2022-02-21 03:10:12,621 INFO L290 TraceCheckUtils]: 10: Hoare triple {1731#false} assume 128 + ~e >= -2147483648; {1731#false} is VALID [2022-02-21 03:10:12,621 INFO L290 TraceCheckUtils]: 11: Hoare triple {1731#false} assume !(16777216 * (128 + ~e) <= 2147483647); {1731#false} is VALID [2022-02-21 03:10:12,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:10:12,621 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:10:12,622 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982075165] [2022-02-21 03:10:12,622 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [982075165] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:10:12,622 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:10:12,622 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-21 03:10:12,622 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472318433] [2022-02-21 03:10:12,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:10:12,623 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 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 12 [2022-02-21 03:10:12,623 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:10:12,624 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 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) [2022-02-21 03:10:12,632 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:10:12,632 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-21 03:10:12,633 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:10:12,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-21 03:10:12,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-21 03:10:12,634 INFO L87 Difference]: Start difference. First operand 170 states and 230 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 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) [2022-02-21 03:10:12,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:12,908 INFO L93 Difference]: Finished difference Result 385 states and 525 transitions. [2022-02-21 03:10:12,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-21 03:10:12,908 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 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 12 [2022-02-21 03:10:12,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:10:12,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 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) [2022-02-21 03:10:12,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 337 transitions. [2022-02-21 03:10:12,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 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) [2022-02-21 03:10:12,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 337 transitions. [2022-02-21 03:10:12,924 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 337 transitions. [2022-02-21 03:10:13,181 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 337 edges. 337 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:10:13,185 INFO L225 Difference]: With dead ends: 385 [2022-02-21 03:10:13,185 INFO L226 Difference]: Without dead ends: 218 [2022-02-21 03:10:13,186 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-21 03:10:13,187 INFO L933 BasicCegarLoop]: 144 mSDtfsCounter, 33 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 413 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:10:13,187 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 413 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:10:13,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2022-02-21 03:10:13,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 193. [2022-02-21 03:10:13,198 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:10:13,199 INFO L82 GeneralOperation]: Start isEquivalent. First operand 218 states. Second operand has 193 states, 158 states have (on average 1.6455696202531647) internal successors, (260), 185 states have internal predecessors, (260), 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) [2022-02-21 03:10:13,199 INFO L74 IsIncluded]: Start isIncluded. First operand 218 states. Second operand has 193 states, 158 states have (on average 1.6455696202531647) internal successors, (260), 185 states have internal predecessors, (260), 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) [2022-02-21 03:10:13,200 INFO L87 Difference]: Start difference. First operand 218 states. Second operand has 193 states, 158 states have (on average 1.6455696202531647) internal successors, (260), 185 states have internal predecessors, (260), 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) [2022-02-21 03:10:13,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:13,207 INFO L93 Difference]: Finished difference Result 218 states and 292 transitions. [2022-02-21 03:10:13,207 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 292 transitions. [2022-02-21 03:10:13,207 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:10:13,207 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:10:13,208 INFO L74 IsIncluded]: Start isIncluded. First operand has 193 states, 158 states have (on average 1.6455696202531647) internal successors, (260), 185 states have internal predecessors, (260), 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) Second operand 218 states. [2022-02-21 03:10:13,209 INFO L87 Difference]: Start difference. First operand has 193 states, 158 states have (on average 1.6455696202531647) internal successors, (260), 185 states have internal predecessors, (260), 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) Second operand 218 states. [2022-02-21 03:10:13,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:13,216 INFO L93 Difference]: Finished difference Result 218 states and 292 transitions. [2022-02-21 03:10:13,216 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 292 transitions. [2022-02-21 03:10:13,217 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:10:13,217 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:10:13,217 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:10:13,217 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:10:13,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 158 states have (on average 1.6455696202531647) internal successors, (260), 185 states have internal predecessors, (260), 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) [2022-02-21 03:10:13,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 268 transitions. [2022-02-21 03:10:13,224 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 268 transitions. Word has length 12 [2022-02-21 03:10:13,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:10:13,224 INFO L470 AbstractCegarLoop]: Abstraction has 193 states and 268 transitions. [2022-02-21 03:10:13,224 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 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) [2022-02-21 03:10:13,224 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 268 transitions. [2022-02-21 03:10:13,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-02-21 03:10:13,225 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:10:13,225 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:10:13,225 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-21 03:10:13,225 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting base2fltErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2022-02-21 03:10:13,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:10:13,226 INFO L85 PathProgramCache]: Analyzing trace with hash -1503455626, now seen corresponding path program 1 times [2022-02-21 03:10:13,226 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:10:13,226 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633666305] [2022-02-21 03:10:13,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:10:13,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:10:13,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:13,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-21 03:10:13,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:13,364 INFO L290 TraceCheckUtils]: 0: Hoare triple {2817#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {2808#true} is VALID [2022-02-21 03:10:13,364 INFO L290 TraceCheckUtils]: 1: Hoare triple {2808#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {2808#true} is VALID [2022-02-21 03:10:13,364 INFO L290 TraceCheckUtils]: 2: Hoare triple {2808#true} #res := ~__retres4~0; {2808#true} is VALID [2022-02-21 03:10:13,365 INFO L290 TraceCheckUtils]: 3: Hoare triple {2808#true} assume true; {2808#true} is VALID [2022-02-21 03:10:13,365 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {2808#true} {2808#true} #394#return; {2808#true} is VALID [2022-02-21 03:10:13,365 INFO L290 TraceCheckUtils]: 0: Hoare triple {2808#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(21, 2);call #Ultimate.allocInit(12, 3); {2808#true} is VALID [2022-02-21 03:10:13,365 INFO L290 TraceCheckUtils]: 1: Hoare triple {2808#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~ret22#1, main_#t~ret23#1, main_#t~ret24#1, main_#t~ret25#1, main_#t~ret26#1, main_~a~0#1, main_~ma~2#1, main_~ea~2#1, main_~b~0#1, main_~mb~2#1, main_~eb~2#1, main_~r_mul~0#1, main_~zero~0#1, main_~one~0#1, main_~sb~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~tmp___1~0#1, main_~__retres16~0#1;havoc main_~a~0#1;main_~ma~2#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;main_~ea~2#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1;havoc main_~b~0#1;main_~mb~2#1 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;main_~eb~2#1 := main_#t~nondet21#1;havoc main_#t~nondet21#1;havoc main_~r_mul~0#1;havoc main_~zero~0#1;havoc main_~one~0#1;havoc main_~sb~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~tmp___1~0#1;havoc main_~__retres16~0#1; {2808#true} is VALID [2022-02-21 03:10:13,366 INFO L272 TraceCheckUtils]: 2: Hoare triple {2808#true} call main_#t~ret22#1 := base2flt(0, 0); {2817#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} is VALID [2022-02-21 03:10:13,366 INFO L290 TraceCheckUtils]: 3: Hoare triple {2817#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {2808#true} is VALID [2022-02-21 03:10:13,366 INFO L290 TraceCheckUtils]: 4: Hoare triple {2808#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {2808#true} is VALID [2022-02-21 03:10:13,367 INFO L290 TraceCheckUtils]: 5: Hoare triple {2808#true} #res := ~__retres4~0; {2808#true} is VALID [2022-02-21 03:10:13,367 INFO L290 TraceCheckUtils]: 6: Hoare triple {2808#true} assume true; {2808#true} is VALID [2022-02-21 03:10:13,367 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {2808#true} {2808#true} #394#return; {2808#true} is VALID [2022-02-21 03:10:13,367 INFO L290 TraceCheckUtils]: 8: Hoare triple {2808#true} main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1; {2808#true} is VALID [2022-02-21 03:10:13,368 INFO L272 TraceCheckUtils]: 9: Hoare triple {2808#true} call main_#t~ret23#1 := base2flt(1, 0); {2815#(= |base2flt_#in~m| 1)} is VALID [2022-02-21 03:10:13,368 INFO L290 TraceCheckUtils]: 10: Hoare triple {2815#(= |base2flt_#in~m| 1)} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {2816#(= (+ (- 1) base2flt_~m) 0)} is VALID [2022-02-21 03:10:13,368 INFO L290 TraceCheckUtils]: 11: Hoare triple {2816#(= (+ (- 1) base2flt_~m) 0)} assume !(0 == ~m % 4294967296); {2816#(= (+ (- 1) base2flt_~m) 0)} is VALID [2022-02-21 03:10:13,369 INFO L290 TraceCheckUtils]: 12: Hoare triple {2816#(= (+ (- 1) base2flt_~m) 0)} assume !(~m % 4294967296 < 16777216); {2809#false} is VALID [2022-02-21 03:10:13,369 INFO L290 TraceCheckUtils]: 13: Hoare triple {2809#false} assume !false; {2809#false} is VALID [2022-02-21 03:10:13,369 INFO L290 TraceCheckUtils]: 14: Hoare triple {2809#false} assume !(~m % 4294967296 >= 33554432); {2809#false} is VALID [2022-02-21 03:10:13,369 INFO L290 TraceCheckUtils]: 15: Hoare triple {2809#false} assume 0 == ~m || 0 == ~bitwiseComplement(16777216);~m := 0; {2809#false} is VALID [2022-02-21 03:10:13,370 INFO L290 TraceCheckUtils]: 16: Hoare triple {2809#false} assume 128 + ~e <= 2147483647; {2809#false} is VALID [2022-02-21 03:10:13,370 INFO L290 TraceCheckUtils]: 17: Hoare triple {2809#false} assume 128 + ~e >= -2147483648; {2809#false} is VALID [2022-02-21 03:10:13,370 INFO L290 TraceCheckUtils]: 18: Hoare triple {2809#false} assume !(16777216 * (128 + ~e) <= 2147483647); {2809#false} is VALID [2022-02-21 03:10:13,370 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:10:13,370 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:10:13,371 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633666305] [2022-02-21 03:10:13,371 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1633666305] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:10:13,371 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1166435071] [2022-02-21 03:10:13,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:10:13,371 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:10:13,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:10:13,373 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) [2022-02-21 03:10:13,377 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-02-21 03:10:13,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:13,445 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-21 03:10:13,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:13,462 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:10:13,577 INFO L290 TraceCheckUtils]: 0: Hoare triple {2808#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(21, 2);call #Ultimate.allocInit(12, 3); {2808#true} is VALID [2022-02-21 03:10:13,577 INFO L290 TraceCheckUtils]: 1: Hoare triple {2808#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~ret22#1, main_#t~ret23#1, main_#t~ret24#1, main_#t~ret25#1, main_#t~ret26#1, main_~a~0#1, main_~ma~2#1, main_~ea~2#1, main_~b~0#1, main_~mb~2#1, main_~eb~2#1, main_~r_mul~0#1, main_~zero~0#1, main_~one~0#1, main_~sb~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~tmp___1~0#1, main_~__retres16~0#1;havoc main_~a~0#1;main_~ma~2#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;main_~ea~2#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1;havoc main_~b~0#1;main_~mb~2#1 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;main_~eb~2#1 := main_#t~nondet21#1;havoc main_#t~nondet21#1;havoc main_~r_mul~0#1;havoc main_~zero~0#1;havoc main_~one~0#1;havoc main_~sb~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~tmp___1~0#1;havoc main_~__retres16~0#1; {2808#true} is VALID [2022-02-21 03:10:13,577 INFO L272 TraceCheckUtils]: 2: Hoare triple {2808#true} call main_#t~ret22#1 := base2flt(0, 0); {2808#true} is VALID [2022-02-21 03:10:13,578 INFO L290 TraceCheckUtils]: 3: Hoare triple {2808#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {2808#true} is VALID [2022-02-21 03:10:13,578 INFO L290 TraceCheckUtils]: 4: Hoare triple {2808#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {2808#true} is VALID [2022-02-21 03:10:13,578 INFO L290 TraceCheckUtils]: 5: Hoare triple {2808#true} #res := ~__retres4~0; {2808#true} is VALID [2022-02-21 03:10:13,578 INFO L290 TraceCheckUtils]: 6: Hoare triple {2808#true} assume true; {2808#true} is VALID [2022-02-21 03:10:13,578 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {2808#true} {2808#true} #394#return; {2808#true} is VALID [2022-02-21 03:10:13,579 INFO L290 TraceCheckUtils]: 8: Hoare triple {2808#true} main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1; {2808#true} is VALID [2022-02-21 03:10:13,579 INFO L272 TraceCheckUtils]: 9: Hoare triple {2808#true} call main_#t~ret23#1 := base2flt(1, 0); {2815#(= |base2flt_#in~m| 1)} is VALID [2022-02-21 03:10:13,580 INFO L290 TraceCheckUtils]: 10: Hoare triple {2815#(= |base2flt_#in~m| 1)} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {2816#(= (+ (- 1) base2flt_~m) 0)} is VALID [2022-02-21 03:10:13,581 INFO L290 TraceCheckUtils]: 11: Hoare triple {2816#(= (+ (- 1) base2flt_~m) 0)} assume !(0 == ~m % 4294967296); {2816#(= (+ (- 1) base2flt_~m) 0)} is VALID [2022-02-21 03:10:13,581 INFO L290 TraceCheckUtils]: 12: Hoare triple {2816#(= (+ (- 1) base2flt_~m) 0)} assume !(~m % 4294967296 < 16777216); {2809#false} is VALID [2022-02-21 03:10:13,581 INFO L290 TraceCheckUtils]: 13: Hoare triple {2809#false} assume !false; {2809#false} is VALID [2022-02-21 03:10:13,582 INFO L290 TraceCheckUtils]: 14: Hoare triple {2809#false} assume !(~m % 4294967296 >= 33554432); {2809#false} is VALID [2022-02-21 03:10:13,582 INFO L290 TraceCheckUtils]: 15: Hoare triple {2809#false} assume 0 == ~m || 0 == ~bitwiseComplement(16777216);~m := 0; {2809#false} is VALID [2022-02-21 03:10:13,582 INFO L290 TraceCheckUtils]: 16: Hoare triple {2809#false} assume 128 + ~e <= 2147483647; {2809#false} is VALID [2022-02-21 03:10:13,582 INFO L290 TraceCheckUtils]: 17: Hoare triple {2809#false} assume 128 + ~e >= -2147483648; {2809#false} is VALID [2022-02-21 03:10:13,582 INFO L290 TraceCheckUtils]: 18: Hoare triple {2809#false} assume !(16777216 * (128 + ~e) <= 2147483647); {2809#false} is VALID [2022-02-21 03:10:13,583 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:10:13,583 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-21 03:10:13,583 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1166435071] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:10:13,583 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-21 03:10:13,583 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2022-02-21 03:10:13,584 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184305455] [2022-02-21 03:10:13,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:10:13,584 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 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 19 [2022-02-21 03:10:13,585 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:10:13,585 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 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) [2022-02-21 03:10:13,606 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:10:13,606 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-21 03:10:13,606 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:10:13,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-21 03:10:13,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-21 03:10:13,608 INFO L87 Difference]: Start difference. First operand 193 states and 268 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 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) [2022-02-21 03:10:13,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:13,908 INFO L93 Difference]: Finished difference Result 365 states and 491 transitions. [2022-02-21 03:10:13,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-21 03:10:13,908 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 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 19 [2022-02-21 03:10:13,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:10:13,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 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) [2022-02-21 03:10:13,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 358 transitions. [2022-02-21 03:10:13,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 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) [2022-02-21 03:10:13,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 358 transitions. [2022-02-21 03:10:13,916 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 358 transitions. [2022-02-21 03:10:14,197 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 358 edges. 358 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:10:14,201 INFO L225 Difference]: With dead ends: 365 [2022-02-21 03:10:14,201 INFO L226 Difference]: Without dead ends: 194 [2022-02-21 03:10:14,202 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-02-21 03:10:14,203 INFO L933 BasicCegarLoop]: 154 mSDtfsCounter, 60 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 431 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:10:14,203 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [60 Valid, 431 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:10:14,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2022-02-21 03:10:14,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 176. [2022-02-21 03:10:14,211 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:10:14,212 INFO L82 GeneralOperation]: Start isEquivalent. First operand 194 states. Second operand has 176 states, 141 states have (on average 1.6453900709219857) internal successors, (232), 168 states have internal predecessors, (232), 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) [2022-02-21 03:10:14,212 INFO L74 IsIncluded]: Start isIncluded. First operand 194 states. Second operand has 176 states, 141 states have (on average 1.6453900709219857) internal successors, (232), 168 states have internal predecessors, (232), 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) [2022-02-21 03:10:14,213 INFO L87 Difference]: Start difference. First operand 194 states. Second operand has 176 states, 141 states have (on average 1.6453900709219857) internal successors, (232), 168 states have internal predecessors, (232), 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) [2022-02-21 03:10:14,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:14,218 INFO L93 Difference]: Finished difference Result 194 states and 249 transitions. [2022-02-21 03:10:14,218 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 249 transitions. [2022-02-21 03:10:14,219 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:10:14,219 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:10:14,219 INFO L74 IsIncluded]: Start isIncluded. First operand has 176 states, 141 states have (on average 1.6453900709219857) internal successors, (232), 168 states have internal predecessors, (232), 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) Second operand 194 states. [2022-02-21 03:10:14,220 INFO L87 Difference]: Start difference. First operand has 176 states, 141 states have (on average 1.6453900709219857) internal successors, (232), 168 states have internal predecessors, (232), 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) Second operand 194 states. [2022-02-21 03:10:14,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:14,226 INFO L93 Difference]: Finished difference Result 194 states and 249 transitions. [2022-02-21 03:10:14,226 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 249 transitions. [2022-02-21 03:10:14,226 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:10:14,226 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:10:14,226 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:10:14,226 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:10:14,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 141 states have (on average 1.6453900709219857) internal successors, (232), 168 states have internal predecessors, (232), 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) [2022-02-21 03:10:14,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 240 transitions. [2022-02-21 03:10:14,232 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 240 transitions. Word has length 19 [2022-02-21 03:10:14,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:10:14,232 INFO L470 AbstractCegarLoop]: Abstraction has 176 states and 240 transitions. [2022-02-21 03:10:14,232 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 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) [2022-02-21 03:10:14,233 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 240 transitions. [2022-02-21 03:10:14,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-02-21 03:10:14,233 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:10:14,233 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:10:14,263 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-02-21 03:10:14,447 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:10:14,448 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2022-02-21 03:10:14,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:10:14,448 INFO L85 PathProgramCache]: Analyzing trace with hash -1863907122, now seen corresponding path program 1 times [2022-02-21 03:10:14,448 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:10:14,448 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277519647] [2022-02-21 03:10:14,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:10:14,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:10:14,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:14,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-21 03:10:14,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:14,532 INFO L290 TraceCheckUtils]: 0: Hoare triple {3862#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {3852#true} is VALID [2022-02-21 03:10:14,533 INFO L290 TraceCheckUtils]: 1: Hoare triple {3852#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {3852#true} is VALID [2022-02-21 03:10:14,533 INFO L290 TraceCheckUtils]: 2: Hoare triple {3852#true} #res := ~__retres4~0; {3852#true} is VALID [2022-02-21 03:10:14,533 INFO L290 TraceCheckUtils]: 3: Hoare triple {3852#true} assume true; {3852#true} is VALID [2022-02-21 03:10:14,533 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {3852#true} {3852#true} #394#return; {3852#true} is VALID [2022-02-21 03:10:14,534 INFO L290 TraceCheckUtils]: 0: Hoare triple {3852#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(21, 2);call #Ultimate.allocInit(12, 3); {3852#true} is VALID [2022-02-21 03:10:14,534 INFO L290 TraceCheckUtils]: 1: Hoare triple {3852#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~ret22#1, main_#t~ret23#1, main_#t~ret24#1, main_#t~ret25#1, main_#t~ret26#1, main_~a~0#1, main_~ma~2#1, main_~ea~2#1, main_~b~0#1, main_~mb~2#1, main_~eb~2#1, main_~r_mul~0#1, main_~zero~0#1, main_~one~0#1, main_~sb~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~tmp___1~0#1, main_~__retres16~0#1;havoc main_~a~0#1;main_~ma~2#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;main_~ea~2#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1;havoc main_~b~0#1;main_~mb~2#1 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;main_~eb~2#1 := main_#t~nondet21#1;havoc main_#t~nondet21#1;havoc main_~r_mul~0#1;havoc main_~zero~0#1;havoc main_~one~0#1;havoc main_~sb~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~tmp___1~0#1;havoc main_~__retres16~0#1; {3852#true} is VALID [2022-02-21 03:10:14,535 INFO L272 TraceCheckUtils]: 2: Hoare triple {3852#true} call main_#t~ret22#1 := base2flt(0, 0); {3862#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} is VALID [2022-02-21 03:10:14,535 INFO L290 TraceCheckUtils]: 3: Hoare triple {3862#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {3852#true} is VALID [2022-02-21 03:10:14,535 INFO L290 TraceCheckUtils]: 4: Hoare triple {3852#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {3852#true} is VALID [2022-02-21 03:10:14,535 INFO L290 TraceCheckUtils]: 5: Hoare triple {3852#true} #res := ~__retres4~0; {3852#true} is VALID [2022-02-21 03:10:14,536 INFO L290 TraceCheckUtils]: 6: Hoare triple {3852#true} assume true; {3852#true} is VALID [2022-02-21 03:10:14,536 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {3852#true} {3852#true} #394#return; {3852#true} is VALID [2022-02-21 03:10:14,536 INFO L290 TraceCheckUtils]: 8: Hoare triple {3852#true} main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1; {3852#true} is VALID [2022-02-21 03:10:14,537 INFO L272 TraceCheckUtils]: 9: Hoare triple {3852#true} call main_#t~ret23#1 := base2flt(1, 0); {3859#(= |base2flt_#in~e| 0)} is VALID [2022-02-21 03:10:14,537 INFO L290 TraceCheckUtils]: 10: Hoare triple {3859#(= |base2flt_#in~e| 0)} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {3860#(= base2flt_~e 0)} is VALID [2022-02-21 03:10:14,538 INFO L290 TraceCheckUtils]: 11: Hoare triple {3860#(= base2flt_~e 0)} assume !(0 == ~m % 4294967296); {3860#(= base2flt_~e 0)} is VALID [2022-02-21 03:10:14,538 INFO L290 TraceCheckUtils]: 12: Hoare triple {3860#(= base2flt_~e 0)} assume ~m % 4294967296 < 16777216; {3860#(= base2flt_~e 0)} is VALID [2022-02-21 03:10:14,538 INFO L290 TraceCheckUtils]: 13: Hoare triple {3860#(= base2flt_~e 0)} assume !false; {3860#(= base2flt_~e 0)} is VALID [2022-02-21 03:10:14,539 INFO L290 TraceCheckUtils]: 14: Hoare triple {3860#(= base2flt_~e 0)} assume !(~e <= -128); {3860#(= base2flt_~e 0)} is VALID [2022-02-21 03:10:14,539 INFO L290 TraceCheckUtils]: 15: Hoare triple {3860#(= base2flt_~e 0)} assume ~e - 1 <= 2147483647; {3860#(= base2flt_~e 0)} is VALID [2022-02-21 03:10:14,540 INFO L290 TraceCheckUtils]: 16: Hoare triple {3860#(= base2flt_~e 0)} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {3861#(<= (+ base2flt_~e 1) 0)} is VALID [2022-02-21 03:10:14,540 INFO L290 TraceCheckUtils]: 17: Hoare triple {3861#(<= (+ base2flt_~e 1) 0)} assume !(~m % 4294967296 < 16777216); {3861#(<= (+ base2flt_~e 1) 0)} is VALID [2022-02-21 03:10:14,541 INFO L290 TraceCheckUtils]: 18: Hoare triple {3861#(<= (+ base2flt_~e 1) 0)} assume 0 == ~m || 0 == ~bitwiseComplement(16777216);~m := 0; {3861#(<= (+ base2flt_~e 1) 0)} is VALID [2022-02-21 03:10:14,541 INFO L290 TraceCheckUtils]: 19: Hoare triple {3861#(<= (+ base2flt_~e 1) 0)} assume !(128 + ~e <= 2147483647); {3853#false} is VALID [2022-02-21 03:10:14,542 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:10:14,542 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:10:14,542 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277519647] [2022-02-21 03:10:14,543 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [277519647] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:10:14,543 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [601588354] [2022-02-21 03:10:14,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:10:14,543 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:10:14,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:10:14,545 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) [2022-02-21 03:10:14,577 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-02-21 03:10:14,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:14,608 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 03:10:14,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:14,619 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:10:14,746 INFO L290 TraceCheckUtils]: 0: Hoare triple {3852#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(21, 2);call #Ultimate.allocInit(12, 3); {3852#true} is VALID [2022-02-21 03:10:14,747 INFO L290 TraceCheckUtils]: 1: Hoare triple {3852#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~ret22#1, main_#t~ret23#1, main_#t~ret24#1, main_#t~ret25#1, main_#t~ret26#1, main_~a~0#1, main_~ma~2#1, main_~ea~2#1, main_~b~0#1, main_~mb~2#1, main_~eb~2#1, main_~r_mul~0#1, main_~zero~0#1, main_~one~0#1, main_~sb~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~tmp___1~0#1, main_~__retres16~0#1;havoc main_~a~0#1;main_~ma~2#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;main_~ea~2#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1;havoc main_~b~0#1;main_~mb~2#1 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;main_~eb~2#1 := main_#t~nondet21#1;havoc main_#t~nondet21#1;havoc main_~r_mul~0#1;havoc main_~zero~0#1;havoc main_~one~0#1;havoc main_~sb~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~tmp___1~0#1;havoc main_~__retres16~0#1; {3852#true} is VALID [2022-02-21 03:10:14,747 INFO L272 TraceCheckUtils]: 2: Hoare triple {3852#true} call main_#t~ret22#1 := base2flt(0, 0); {3852#true} is VALID [2022-02-21 03:10:14,747 INFO L290 TraceCheckUtils]: 3: Hoare triple {3852#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {3852#true} is VALID [2022-02-21 03:10:14,747 INFO L290 TraceCheckUtils]: 4: Hoare triple {3852#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {3852#true} is VALID [2022-02-21 03:10:14,747 INFO L290 TraceCheckUtils]: 5: Hoare triple {3852#true} #res := ~__retres4~0; {3852#true} is VALID [2022-02-21 03:10:14,750 INFO L290 TraceCheckUtils]: 6: Hoare triple {3852#true} assume true; {3852#true} is VALID [2022-02-21 03:10:14,750 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {3852#true} {3852#true} #394#return; {3852#true} is VALID [2022-02-21 03:10:14,750 INFO L290 TraceCheckUtils]: 8: Hoare triple {3852#true} main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1; {3852#true} is VALID [2022-02-21 03:10:14,751 INFO L272 TraceCheckUtils]: 9: Hoare triple {3852#true} call main_#t~ret23#1 := base2flt(1, 0); {3893#(<= |base2flt_#in~e| 0)} is VALID [2022-02-21 03:10:14,752 INFO L290 TraceCheckUtils]: 10: Hoare triple {3893#(<= |base2flt_#in~e| 0)} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {3897#(<= base2flt_~e 0)} is VALID [2022-02-21 03:10:14,752 INFO L290 TraceCheckUtils]: 11: Hoare triple {3897#(<= base2flt_~e 0)} assume !(0 == ~m % 4294967296); {3897#(<= base2flt_~e 0)} is VALID [2022-02-21 03:10:14,753 INFO L290 TraceCheckUtils]: 12: Hoare triple {3897#(<= base2flt_~e 0)} assume ~m % 4294967296 < 16777216; {3897#(<= base2flt_~e 0)} is VALID [2022-02-21 03:10:14,755 INFO L290 TraceCheckUtils]: 13: Hoare triple {3897#(<= base2flt_~e 0)} assume !false; {3897#(<= base2flt_~e 0)} is VALID [2022-02-21 03:10:14,755 INFO L290 TraceCheckUtils]: 14: Hoare triple {3897#(<= base2flt_~e 0)} assume !(~e <= -128); {3897#(<= base2flt_~e 0)} is VALID [2022-02-21 03:10:14,756 INFO L290 TraceCheckUtils]: 15: Hoare triple {3897#(<= base2flt_~e 0)} assume ~e - 1 <= 2147483647; {3897#(<= base2flt_~e 0)} is VALID [2022-02-21 03:10:14,758 INFO L290 TraceCheckUtils]: 16: Hoare triple {3897#(<= base2flt_~e 0)} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {3861#(<= (+ base2flt_~e 1) 0)} is VALID [2022-02-21 03:10:14,758 INFO L290 TraceCheckUtils]: 17: Hoare triple {3861#(<= (+ base2flt_~e 1) 0)} assume !(~m % 4294967296 < 16777216); {3861#(<= (+ base2flt_~e 1) 0)} is VALID [2022-02-21 03:10:14,771 INFO L290 TraceCheckUtils]: 18: Hoare triple {3861#(<= (+ base2flt_~e 1) 0)} assume 0 == ~m || 0 == ~bitwiseComplement(16777216);~m := 0; {3861#(<= (+ base2flt_~e 1) 0)} is VALID [2022-02-21 03:10:14,772 INFO L290 TraceCheckUtils]: 19: Hoare triple {3861#(<= (+ base2flt_~e 1) 0)} assume !(128 + ~e <= 2147483647); {3853#false} is VALID [2022-02-21 03:10:14,772 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:10:14,772 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-21 03:10:14,772 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [601588354] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:10:14,773 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-21 03:10:14,773 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2022-02-21 03:10:14,773 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984457274] [2022-02-21 03:10:14,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:10:14,774 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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 20 [2022-02-21 03:10:14,774 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:10:14,774 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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) [2022-02-21 03:10:14,794 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:10:14,795 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-21 03:10:14,795 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:10:14,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-21 03:10:14,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-02-21 03:10:14,796 INFO L87 Difference]: Start difference. First operand 176 states and 240 transitions. Second operand has 5 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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) [2022-02-21 03:10:15,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:15,152 INFO L93 Difference]: Finished difference Result 187 states and 244 transitions. [2022-02-21 03:10:15,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-21 03:10:15,152 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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 20 [2022-02-21 03:10:15,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:10:15,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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) [2022-02-21 03:10:15,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 209 transitions. [2022-02-21 03:10:15,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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) [2022-02-21 03:10:15,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 209 transitions. [2022-02-21 03:10:15,158 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 209 transitions. [2022-02-21 03:10:15,326 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 209 edges. 209 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:10:15,329 INFO L225 Difference]: With dead ends: 187 [2022-02-21 03:10:15,329 INFO L226 Difference]: Without dead ends: 182 [2022-02-21 03:10:15,330 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2022-02-21 03:10:15,331 INFO L933 BasicCegarLoop]: 126 mSDtfsCounter, 152 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 375 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-21 03:10:15,331 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [152 Valid, 375 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-21 03:10:15,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2022-02-21 03:10:15,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 174. [2022-02-21 03:10:15,352 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:10:15,352 INFO L82 GeneralOperation]: Start isEquivalent. First operand 182 states. Second operand has 174 states, 141 states have (on average 1.553191489361702) internal successors, (219), 166 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) [2022-02-21 03:10:15,353 INFO L74 IsIncluded]: Start isIncluded. First operand 182 states. Second operand has 174 states, 141 states have (on average 1.553191489361702) internal successors, (219), 166 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) [2022-02-21 03:10:15,353 INFO L87 Difference]: Start difference. First operand 182 states. Second operand has 174 states, 141 states have (on average 1.553191489361702) internal successors, (219), 166 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) [2022-02-21 03:10:15,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:15,357 INFO L93 Difference]: Finished difference Result 182 states and 231 transitions. [2022-02-21 03:10:15,357 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 231 transitions. [2022-02-21 03:10:15,357 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:10:15,357 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:10:15,358 INFO L74 IsIncluded]: Start isIncluded. First operand has 174 states, 141 states have (on average 1.553191489361702) internal successors, (219), 166 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) Second operand 182 states. [2022-02-21 03:10:15,358 INFO L87 Difference]: Start difference. First operand has 174 states, 141 states have (on average 1.553191489361702) internal successors, (219), 166 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) Second operand 182 states. [2022-02-21 03:10:15,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:15,361 INFO L93 Difference]: Finished difference Result 182 states and 231 transitions. [2022-02-21 03:10:15,361 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 231 transitions. [2022-02-21 03:10:15,362 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:10:15,362 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:10:15,362 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:10:15,362 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:10:15,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 141 states have (on average 1.553191489361702) internal successors, (219), 166 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) [2022-02-21 03:10:15,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 227 transitions. [2022-02-21 03:10:15,366 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 227 transitions. Word has length 20 [2022-02-21 03:10:15,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:10:15,366 INFO L470 AbstractCegarLoop]: Abstraction has 174 states and 227 transitions. [2022-02-21 03:10:15,366 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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) [2022-02-21 03:10:15,366 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 227 transitions. [2022-02-21 03:10:15,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-02-21 03:10:15,367 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:10:15,367 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:10:15,392 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-02-21 03:10:15,581 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:10:15,581 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2022-02-21 03:10:15,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:10:15,582 INFO L85 PathProgramCache]: Analyzing trace with hash -1946545813, now seen corresponding path program 1 times [2022-02-21 03:10:15,582 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:10:15,582 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398936969] [2022-02-21 03:10:15,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:10:15,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:10:15,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:15,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-21 03:10:15,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:15,664 INFO L290 TraceCheckUtils]: 0: Hoare triple {4698#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {4688#true} is VALID [2022-02-21 03:10:15,664 INFO L290 TraceCheckUtils]: 1: Hoare triple {4688#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {4688#true} is VALID [2022-02-21 03:10:15,664 INFO L290 TraceCheckUtils]: 2: Hoare triple {4688#true} #res := ~__retres4~0; {4688#true} is VALID [2022-02-21 03:10:15,664 INFO L290 TraceCheckUtils]: 3: Hoare triple {4688#true} assume true; {4688#true} is VALID [2022-02-21 03:10:15,665 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {4688#true} {4688#true} #394#return; {4688#true} is VALID [2022-02-21 03:10:15,665 INFO L290 TraceCheckUtils]: 0: Hoare triple {4688#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(21, 2);call #Ultimate.allocInit(12, 3); {4688#true} is VALID [2022-02-21 03:10:15,665 INFO L290 TraceCheckUtils]: 1: Hoare triple {4688#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~ret22#1, main_#t~ret23#1, main_#t~ret24#1, main_#t~ret25#1, main_#t~ret26#1, main_~a~0#1, main_~ma~2#1, main_~ea~2#1, main_~b~0#1, main_~mb~2#1, main_~eb~2#1, main_~r_mul~0#1, main_~zero~0#1, main_~one~0#1, main_~sb~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~tmp___1~0#1, main_~__retres16~0#1;havoc main_~a~0#1;main_~ma~2#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;main_~ea~2#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1;havoc main_~b~0#1;main_~mb~2#1 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;main_~eb~2#1 := main_#t~nondet21#1;havoc main_#t~nondet21#1;havoc main_~r_mul~0#1;havoc main_~zero~0#1;havoc main_~one~0#1;havoc main_~sb~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~tmp___1~0#1;havoc main_~__retres16~0#1; {4688#true} is VALID [2022-02-21 03:10:15,667 INFO L272 TraceCheckUtils]: 2: Hoare triple {4688#true} call main_#t~ret22#1 := base2flt(0, 0); {4698#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} is VALID [2022-02-21 03:10:15,667 INFO L290 TraceCheckUtils]: 3: Hoare triple {4698#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {4688#true} is VALID [2022-02-21 03:10:15,667 INFO L290 TraceCheckUtils]: 4: Hoare triple {4688#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {4688#true} is VALID [2022-02-21 03:10:15,667 INFO L290 TraceCheckUtils]: 5: Hoare triple {4688#true} #res := ~__retres4~0; {4688#true} is VALID [2022-02-21 03:10:15,667 INFO L290 TraceCheckUtils]: 6: Hoare triple {4688#true} assume true; {4688#true} is VALID [2022-02-21 03:10:15,667 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {4688#true} {4688#true} #394#return; {4688#true} is VALID [2022-02-21 03:10:15,668 INFO L290 TraceCheckUtils]: 8: Hoare triple {4688#true} main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1; {4688#true} is VALID [2022-02-21 03:10:15,668 INFO L272 TraceCheckUtils]: 9: Hoare triple {4688#true} call main_#t~ret23#1 := base2flt(1, 0); {4695#(= |base2flt_#in~e| 0)} is VALID [2022-02-21 03:10:15,669 INFO L290 TraceCheckUtils]: 10: Hoare triple {4695#(= |base2flt_#in~e| 0)} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {4696#(= base2flt_~e 0)} is VALID [2022-02-21 03:10:15,669 INFO L290 TraceCheckUtils]: 11: Hoare triple {4696#(= base2flt_~e 0)} assume !(0 == ~m % 4294967296); {4696#(= base2flt_~e 0)} is VALID [2022-02-21 03:10:15,669 INFO L290 TraceCheckUtils]: 12: Hoare triple {4696#(= base2flt_~e 0)} assume ~m % 4294967296 < 16777216; {4696#(= base2flt_~e 0)} is VALID [2022-02-21 03:10:15,670 INFO L290 TraceCheckUtils]: 13: Hoare triple {4696#(= base2flt_~e 0)} assume !false; {4696#(= base2flt_~e 0)} is VALID [2022-02-21 03:10:15,670 INFO L290 TraceCheckUtils]: 14: Hoare triple {4696#(= base2flt_~e 0)} assume !(~e <= -128); {4696#(= base2flt_~e 0)} is VALID [2022-02-21 03:10:15,670 INFO L290 TraceCheckUtils]: 15: Hoare triple {4696#(= base2flt_~e 0)} assume ~e - 1 <= 2147483647; {4696#(= base2flt_~e 0)} is VALID [2022-02-21 03:10:15,671 INFO L290 TraceCheckUtils]: 16: Hoare triple {4696#(= base2flt_~e 0)} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {4697#(<= 0 (+ base2flt_~e 1))} is VALID [2022-02-21 03:10:15,671 INFO L290 TraceCheckUtils]: 17: Hoare triple {4697#(<= 0 (+ base2flt_~e 1))} assume !(~m % 4294967296 < 16777216); {4697#(<= 0 (+ base2flt_~e 1))} is VALID [2022-02-21 03:10:15,671 INFO L290 TraceCheckUtils]: 18: Hoare triple {4697#(<= 0 (+ base2flt_~e 1))} assume 0 == ~m || 0 == ~bitwiseComplement(16777216);~m := 0; {4697#(<= 0 (+ base2flt_~e 1))} is VALID [2022-02-21 03:10:15,672 INFO L290 TraceCheckUtils]: 19: Hoare triple {4697#(<= 0 (+ base2flt_~e 1))} assume 128 + ~e <= 2147483647; {4697#(<= 0 (+ base2flt_~e 1))} is VALID [2022-02-21 03:10:15,672 INFO L290 TraceCheckUtils]: 20: Hoare triple {4697#(<= 0 (+ base2flt_~e 1))} assume !(128 + ~e >= -2147483648); {4689#false} is VALID [2022-02-21 03:10:15,672 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:10:15,673 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:10:15,673 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398936969] [2022-02-21 03:10:15,673 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [398936969] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:10:15,673 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1134980379] [2022-02-21 03:10:15,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:10:15,673 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:10:15,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:10:15,676 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) [2022-02-21 03:10:15,704 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-02-21 03:10:15,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:15,727 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-21 03:10:15,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:15,742 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:10:15,822 INFO L290 TraceCheckUtils]: 0: Hoare triple {4688#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(21, 2);call #Ultimate.allocInit(12, 3); {4688#true} is VALID [2022-02-21 03:10:15,822 INFO L290 TraceCheckUtils]: 1: Hoare triple {4688#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~ret22#1, main_#t~ret23#1, main_#t~ret24#1, main_#t~ret25#1, main_#t~ret26#1, main_~a~0#1, main_~ma~2#1, main_~ea~2#1, main_~b~0#1, main_~mb~2#1, main_~eb~2#1, main_~r_mul~0#1, main_~zero~0#1, main_~one~0#1, main_~sb~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~tmp___1~0#1, main_~__retres16~0#1;havoc main_~a~0#1;main_~ma~2#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;main_~ea~2#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1;havoc main_~b~0#1;main_~mb~2#1 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;main_~eb~2#1 := main_#t~nondet21#1;havoc main_#t~nondet21#1;havoc main_~r_mul~0#1;havoc main_~zero~0#1;havoc main_~one~0#1;havoc main_~sb~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~tmp___1~0#1;havoc main_~__retres16~0#1; {4688#true} is VALID [2022-02-21 03:10:15,823 INFO L272 TraceCheckUtils]: 2: Hoare triple {4688#true} call main_#t~ret22#1 := base2flt(0, 0); {4688#true} is VALID [2022-02-21 03:10:15,823 INFO L290 TraceCheckUtils]: 3: Hoare triple {4688#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {4688#true} is VALID [2022-02-21 03:10:15,823 INFO L290 TraceCheckUtils]: 4: Hoare triple {4688#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {4688#true} is VALID [2022-02-21 03:10:15,823 INFO L290 TraceCheckUtils]: 5: Hoare triple {4688#true} #res := ~__retres4~0; {4688#true} is VALID [2022-02-21 03:10:15,824 INFO L290 TraceCheckUtils]: 6: Hoare triple {4688#true} assume true; {4688#true} is VALID [2022-02-21 03:10:15,824 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {4688#true} {4688#true} #394#return; {4688#true} is VALID [2022-02-21 03:10:15,824 INFO L290 TraceCheckUtils]: 8: Hoare triple {4688#true} main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1; {4688#true} is VALID [2022-02-21 03:10:15,824 INFO L272 TraceCheckUtils]: 9: Hoare triple {4688#true} call main_#t~ret23#1 := base2flt(1, 0); {4688#true} is VALID [2022-02-21 03:10:15,824 INFO L290 TraceCheckUtils]: 10: Hoare triple {4688#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {4688#true} is VALID [2022-02-21 03:10:15,824 INFO L290 TraceCheckUtils]: 11: Hoare triple {4688#true} assume !(0 == ~m % 4294967296); {4688#true} is VALID [2022-02-21 03:10:15,825 INFO L290 TraceCheckUtils]: 12: Hoare triple {4688#true} assume ~m % 4294967296 < 16777216; {4688#true} is VALID [2022-02-21 03:10:15,825 INFO L290 TraceCheckUtils]: 13: Hoare triple {4688#true} assume !false; {4688#true} is VALID [2022-02-21 03:10:15,825 INFO L290 TraceCheckUtils]: 14: Hoare triple {4688#true} assume !(~e <= -128); {4744#(not (<= (+ 128 base2flt_~e) 0))} is VALID [2022-02-21 03:10:15,826 INFO L290 TraceCheckUtils]: 15: Hoare triple {4744#(not (<= (+ 128 base2flt_~e) 0))} assume ~e - 1 <= 2147483647; {4744#(not (<= (+ 128 base2flt_~e) 0))} is VALID [2022-02-21 03:10:15,826 INFO L290 TraceCheckUtils]: 16: Hoare triple {4744#(not (<= (+ 128 base2flt_~e) 0))} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {4751#(< 0 (+ 129 base2flt_~e))} is VALID [2022-02-21 03:10:15,827 INFO L290 TraceCheckUtils]: 17: Hoare triple {4751#(< 0 (+ 129 base2flt_~e))} assume !(~m % 4294967296 < 16777216); {4751#(< 0 (+ 129 base2flt_~e))} is VALID [2022-02-21 03:10:15,827 INFO L290 TraceCheckUtils]: 18: Hoare triple {4751#(< 0 (+ 129 base2flt_~e))} assume 0 == ~m || 0 == ~bitwiseComplement(16777216);~m := 0; {4751#(< 0 (+ 129 base2flt_~e))} is VALID [2022-02-21 03:10:15,828 INFO L290 TraceCheckUtils]: 19: Hoare triple {4751#(< 0 (+ 129 base2flt_~e))} assume 128 + ~e <= 2147483647; {4751#(< 0 (+ 129 base2flt_~e))} is VALID [2022-02-21 03:10:15,828 INFO L290 TraceCheckUtils]: 20: Hoare triple {4751#(< 0 (+ 129 base2flt_~e))} assume !(128 + ~e >= -2147483648); {4689#false} is VALID [2022-02-21 03:10:15,828 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-21 03:10:15,828 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-21 03:10:15,829 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1134980379] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:10:15,829 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-21 03:10:15,829 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2022-02-21 03:10:15,829 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351145502] [2022-02-21 03:10:15,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:10:15,830 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, (2), 1 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 [2022-02-21 03:10:15,830 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:10:15,830 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-21 03:10:15,844 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:10:15,844 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-21 03:10:15,845 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:10:15,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-21 03:10:15,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-02-21 03:10:15,847 INFO L87 Difference]: Start difference. First operand 174 states and 227 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, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-21 03:10:16,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:16,115 INFO L93 Difference]: Finished difference Result 212 states and 284 transitions. [2022-02-21 03:10:16,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-21 03:10:16,115 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, (2), 1 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 [2022-02-21 03:10:16,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:10:16,116 INFO L82 GeneralOperation]: Start removeUnreachable. 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, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-21 03:10:16,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 191 transitions. [2022-02-21 03:10:16,119 INFO L82 GeneralOperation]: Start removeUnreachable. 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, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-21 03:10:16,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 191 transitions. [2022-02-21 03:10:16,124 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 191 transitions. [2022-02-21 03:10:16,258 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 191 edges. 191 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:10:16,262 INFO L225 Difference]: With dead ends: 212 [2022-02-21 03:10:16,262 INFO L226 Difference]: Without dead ends: 207 [2022-02-21 03:10:16,263 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-02-21 03:10:16,263 INFO L933 BasicCegarLoop]: 135 mSDtfsCounter, 32 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:10:16,263 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [32 Valid, 368 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:10:16,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2022-02-21 03:10:16,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 191. [2022-02-21 03:10:16,288 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:10:16,289 INFO L82 GeneralOperation]: Start isEquivalent. First operand 207 states. Second operand has 191 states, 159 states have (on average 1.4779874213836477) internal successors, (235), 183 states have internal predecessors, (235), 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) [2022-02-21 03:10:16,289 INFO L74 IsIncluded]: Start isIncluded. First operand 207 states. Second operand has 191 states, 159 states have (on average 1.4779874213836477) internal successors, (235), 183 states have internal predecessors, (235), 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) [2022-02-21 03:10:16,290 INFO L87 Difference]: Start difference. First operand 207 states. Second operand has 191 states, 159 states have (on average 1.4779874213836477) internal successors, (235), 183 states have internal predecessors, (235), 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) [2022-02-21 03:10:16,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:16,294 INFO L93 Difference]: Finished difference Result 207 states and 266 transitions. [2022-02-21 03:10:16,294 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 266 transitions. [2022-02-21 03:10:16,295 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:10:16,295 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:10:16,296 INFO L74 IsIncluded]: Start isIncluded. First operand has 191 states, 159 states have (on average 1.4779874213836477) internal successors, (235), 183 states have internal predecessors, (235), 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) Second operand 207 states. [2022-02-21 03:10:16,296 INFO L87 Difference]: Start difference. First operand has 191 states, 159 states have (on average 1.4779874213836477) internal successors, (235), 183 states have internal predecessors, (235), 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) Second operand 207 states. [2022-02-21 03:10:16,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:16,300 INFO L93 Difference]: Finished difference Result 207 states and 266 transitions. [2022-02-21 03:10:16,301 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 266 transitions. [2022-02-21 03:10:16,301 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:10:16,301 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:10:16,301 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:10:16,302 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:10:16,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 159 states have (on average 1.4779874213836477) internal successors, (235), 183 states have internal predecessors, (235), 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) [2022-02-21 03:10:16,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 243 transitions. [2022-02-21 03:10:16,306 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 243 transitions. Word has length 21 [2022-02-21 03:10:16,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:10:16,306 INFO L470 AbstractCegarLoop]: Abstraction has 191 states and 243 transitions. [2022-02-21 03:10:16,306 INFO L471 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, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-21 03:10:16,307 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 243 transitions. [2022-02-21 03:10:16,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-02-21 03:10:16,307 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:10:16,307 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:10:16,334 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-02-21 03:10:16,531 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:10:16,532 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2022-02-21 03:10:16,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:10:16,532 INFO L85 PathProgramCache]: Analyzing trace with hash 1511766147, now seen corresponding path program 1 times [2022-02-21 03:10:16,532 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:10:16,532 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716418464] [2022-02-21 03:10:16,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:10:16,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:10:16,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:16,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-21 03:10:16,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:16,599 INFO L290 TraceCheckUtils]: 0: Hoare triple {5637#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {5617#true} is VALID [2022-02-21 03:10:16,599 INFO L290 TraceCheckUtils]: 1: Hoare triple {5617#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {5617#true} is VALID [2022-02-21 03:10:16,599 INFO L290 TraceCheckUtils]: 2: Hoare triple {5617#true} #res := ~__retres4~0; {5617#true} is VALID [2022-02-21 03:10:16,600 INFO L290 TraceCheckUtils]: 3: Hoare triple {5617#true} assume true; {5617#true} is VALID [2022-02-21 03:10:16,600 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {5617#true} {5617#true} #394#return; {5617#true} is VALID [2022-02-21 03:10:16,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-02-21 03:10:16,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:16,653 INFO L290 TraceCheckUtils]: 0: Hoare triple {5637#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {5638#(or (= base2flt_~e |base2flt_#in~e|) (= base2flt_~e 0))} is VALID [2022-02-21 03:10:16,654 INFO L290 TraceCheckUtils]: 1: Hoare triple {5638#(or (= base2flt_~e |base2flt_#in~e|) (= base2flt_~e 0))} assume !(0 == ~m % 4294967296); {5638#(or (= base2flt_~e |base2flt_#in~e|) (= base2flt_~e 0))} is VALID [2022-02-21 03:10:16,655 INFO L290 TraceCheckUtils]: 2: Hoare triple {5638#(or (= base2flt_~e |base2flt_#in~e|) (= base2flt_~e 0))} assume ~m % 4294967296 < 16777216; {5638#(or (= base2flt_~e |base2flt_#in~e|) (= base2flt_~e 0))} is VALID [2022-02-21 03:10:16,655 INFO L290 TraceCheckUtils]: 3: Hoare triple {5638#(or (= base2flt_~e |base2flt_#in~e|) (= base2flt_~e 0))} assume !false; {5638#(or (= base2flt_~e |base2flt_#in~e|) (= base2flt_~e 0))} is VALID [2022-02-21 03:10:16,656 INFO L290 TraceCheckUtils]: 4: Hoare triple {5638#(or (= base2flt_~e |base2flt_#in~e|) (= base2flt_~e 0))} assume !(~e <= -128); {5638#(or (= base2flt_~e |base2flt_#in~e|) (= base2flt_~e 0))} is VALID [2022-02-21 03:10:16,656 INFO L290 TraceCheckUtils]: 5: Hoare triple {5638#(or (= base2flt_~e |base2flt_#in~e|) (= base2flt_~e 0))} assume ~e - 1 <= 2147483647; {5638#(or (= base2flt_~e |base2flt_#in~e|) (= base2flt_~e 0))} is VALID [2022-02-21 03:10:16,657 INFO L290 TraceCheckUtils]: 6: Hoare triple {5638#(or (= base2flt_~e |base2flt_#in~e|) (= base2flt_~e 0))} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {5639#(or (not (= |base2flt_#in~e| 0)) (<= 0 (+ base2flt_~e 1)))} is VALID [2022-02-21 03:10:16,657 INFO L290 TraceCheckUtils]: 7: Hoare triple {5639#(or (not (= |base2flt_#in~e| 0)) (<= 0 (+ base2flt_~e 1)))} assume ~m % 4294967296 < 16777216; {5639#(or (not (= |base2flt_#in~e| 0)) (<= 0 (+ base2flt_~e 1)))} is VALID [2022-02-21 03:10:16,658 INFO L290 TraceCheckUtils]: 8: Hoare triple {5639#(or (not (= |base2flt_#in~e| 0)) (<= 0 (+ base2flt_~e 1)))} assume !false; {5639#(or (not (= |base2flt_#in~e| 0)) (<= 0 (+ base2flt_~e 1)))} is VALID [2022-02-21 03:10:16,658 INFO L290 TraceCheckUtils]: 9: Hoare triple {5639#(or (not (= |base2flt_#in~e| 0)) (<= 0 (+ base2flt_~e 1)))} assume ~e <= -128;~__retres4~0 := 0; {5640#(not (= |base2flt_#in~e| 0))} is VALID [2022-02-21 03:10:16,659 INFO L290 TraceCheckUtils]: 10: Hoare triple {5640#(not (= |base2flt_#in~e| 0))} #res := ~__retres4~0; {5640#(not (= |base2flt_#in~e| 0))} is VALID [2022-02-21 03:10:16,660 INFO L290 TraceCheckUtils]: 11: Hoare triple {5640#(not (= |base2flt_#in~e| 0))} assume true; {5640#(not (= |base2flt_#in~e| 0))} is VALID [2022-02-21 03:10:16,661 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {5640#(not (= |base2flt_#in~e| 0))} {5617#true} #396#return; {5618#false} is VALID [2022-02-21 03:10:16,661 INFO L290 TraceCheckUtils]: 0: Hoare triple {5617#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(21, 2);call #Ultimate.allocInit(12, 3); {5617#true} is VALID [2022-02-21 03:10:16,661 INFO L290 TraceCheckUtils]: 1: Hoare triple {5617#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~ret22#1, main_#t~ret23#1, main_#t~ret24#1, main_#t~ret25#1, main_#t~ret26#1, main_~a~0#1, main_~ma~2#1, main_~ea~2#1, main_~b~0#1, main_~mb~2#1, main_~eb~2#1, main_~r_mul~0#1, main_~zero~0#1, main_~one~0#1, main_~sb~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~tmp___1~0#1, main_~__retres16~0#1;havoc main_~a~0#1;main_~ma~2#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;main_~ea~2#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1;havoc main_~b~0#1;main_~mb~2#1 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;main_~eb~2#1 := main_#t~nondet21#1;havoc main_#t~nondet21#1;havoc main_~r_mul~0#1;havoc main_~zero~0#1;havoc main_~one~0#1;havoc main_~sb~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~tmp___1~0#1;havoc main_~__retres16~0#1; {5617#true} is VALID [2022-02-21 03:10:16,662 INFO L272 TraceCheckUtils]: 2: Hoare triple {5617#true} call main_#t~ret22#1 := base2flt(0, 0); {5637#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} is VALID [2022-02-21 03:10:16,662 INFO L290 TraceCheckUtils]: 3: Hoare triple {5637#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {5617#true} is VALID [2022-02-21 03:10:16,662 INFO L290 TraceCheckUtils]: 4: Hoare triple {5617#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {5617#true} is VALID [2022-02-21 03:10:16,662 INFO L290 TraceCheckUtils]: 5: Hoare triple {5617#true} #res := ~__retres4~0; {5617#true} is VALID [2022-02-21 03:10:16,662 INFO L290 TraceCheckUtils]: 6: Hoare triple {5617#true} assume true; {5617#true} is VALID [2022-02-21 03:10:16,662 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {5617#true} {5617#true} #394#return; {5617#true} is VALID [2022-02-21 03:10:16,662 INFO L290 TraceCheckUtils]: 8: Hoare triple {5617#true} main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1; {5617#true} is VALID [2022-02-21 03:10:16,663 INFO L272 TraceCheckUtils]: 9: Hoare triple {5617#true} call main_#t~ret23#1 := base2flt(1, 0); {5637#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} is VALID [2022-02-21 03:10:16,663 INFO L290 TraceCheckUtils]: 10: Hoare triple {5637#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {5638#(or (= base2flt_~e |base2flt_#in~e|) (= base2flt_~e 0))} is VALID [2022-02-21 03:10:16,664 INFO L290 TraceCheckUtils]: 11: Hoare triple {5638#(or (= base2flt_~e |base2flt_#in~e|) (= base2flt_~e 0))} assume !(0 == ~m % 4294967296); {5638#(or (= base2flt_~e |base2flt_#in~e|) (= base2flt_~e 0))} is VALID [2022-02-21 03:10:16,664 INFO L290 TraceCheckUtils]: 12: Hoare triple {5638#(or (= base2flt_~e |base2flt_#in~e|) (= base2flt_~e 0))} assume ~m % 4294967296 < 16777216; {5638#(or (= base2flt_~e |base2flt_#in~e|) (= base2flt_~e 0))} is VALID [2022-02-21 03:10:16,665 INFO L290 TraceCheckUtils]: 13: Hoare triple {5638#(or (= base2flt_~e |base2flt_#in~e|) (= base2flt_~e 0))} assume !false; {5638#(or (= base2flt_~e |base2flt_#in~e|) (= base2flt_~e 0))} is VALID [2022-02-21 03:10:16,665 INFO L290 TraceCheckUtils]: 14: Hoare triple {5638#(or (= base2flt_~e |base2flt_#in~e|) (= base2flt_~e 0))} assume !(~e <= -128); {5638#(or (= base2flt_~e |base2flt_#in~e|) (= base2flt_~e 0))} is VALID [2022-02-21 03:10:16,666 INFO L290 TraceCheckUtils]: 15: Hoare triple {5638#(or (= base2flt_~e |base2flt_#in~e|) (= base2flt_~e 0))} assume ~e - 1 <= 2147483647; {5638#(or (= base2flt_~e |base2flt_#in~e|) (= base2flt_~e 0))} is VALID [2022-02-21 03:10:16,666 INFO L290 TraceCheckUtils]: 16: Hoare triple {5638#(or (= base2flt_~e |base2flt_#in~e|) (= base2flt_~e 0))} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {5639#(or (not (= |base2flt_#in~e| 0)) (<= 0 (+ base2flt_~e 1)))} is VALID [2022-02-21 03:10:16,667 INFO L290 TraceCheckUtils]: 17: Hoare triple {5639#(or (not (= |base2flt_#in~e| 0)) (<= 0 (+ base2flt_~e 1)))} assume ~m % 4294967296 < 16777216; {5639#(or (not (= |base2flt_#in~e| 0)) (<= 0 (+ base2flt_~e 1)))} is VALID [2022-02-21 03:10:16,671 INFO L290 TraceCheckUtils]: 18: Hoare triple {5639#(or (not (= |base2flt_#in~e| 0)) (<= 0 (+ base2flt_~e 1)))} assume !false; {5639#(or (not (= |base2flt_#in~e| 0)) (<= 0 (+ base2flt_~e 1)))} is VALID [2022-02-21 03:10:16,672 INFO L290 TraceCheckUtils]: 19: Hoare triple {5639#(or (not (= |base2flt_#in~e| 0)) (<= 0 (+ base2flt_~e 1)))} assume ~e <= -128;~__retres4~0 := 0; {5640#(not (= |base2flt_#in~e| 0))} is VALID [2022-02-21 03:10:16,672 INFO L290 TraceCheckUtils]: 20: Hoare triple {5640#(not (= |base2flt_#in~e| 0))} #res := ~__retres4~0; {5640#(not (= |base2flt_#in~e| 0))} is VALID [2022-02-21 03:10:16,672 INFO L290 TraceCheckUtils]: 21: Hoare triple {5640#(not (= |base2flt_#in~e| 0))} assume true; {5640#(not (= |base2flt_#in~e| 0))} is VALID [2022-02-21 03:10:16,673 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {5640#(not (= |base2flt_#in~e| 0))} {5617#true} #396#return; {5618#false} is VALID [2022-02-21 03:10:16,673 INFO L290 TraceCheckUtils]: 23: Hoare triple {5618#false} main_~one~0#1 := main_#t~ret23#1;havoc main_#t~ret23#1; {5618#false} is VALID [2022-02-21 03:10:16,673 INFO L272 TraceCheckUtils]: 24: Hoare triple {5618#false} call main_#t~ret24#1 := base2flt(main_~ma~2#1, main_~ea~2#1); {5618#false} is VALID [2022-02-21 03:10:16,674 INFO L290 TraceCheckUtils]: 25: Hoare triple {5618#false} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {5618#false} is VALID [2022-02-21 03:10:16,674 INFO L290 TraceCheckUtils]: 26: Hoare triple {5618#false} assume !(0 == ~m % 4294967296); {5618#false} is VALID [2022-02-21 03:10:16,674 INFO L290 TraceCheckUtils]: 27: Hoare triple {5618#false} assume ~m % 4294967296 < 16777216; {5618#false} is VALID [2022-02-21 03:10:16,674 INFO L290 TraceCheckUtils]: 28: Hoare triple {5618#false} assume !false; {5618#false} is VALID [2022-02-21 03:10:16,674 INFO L290 TraceCheckUtils]: 29: Hoare triple {5618#false} assume !(~e <= -128); {5618#false} is VALID [2022-02-21 03:10:16,674 INFO L290 TraceCheckUtils]: 30: Hoare triple {5618#false} assume !(~e - 1 <= 2147483647); {5618#false} is VALID [2022-02-21 03:10:16,675 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 14 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-21 03:10:16,675 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:10:16,675 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716418464] [2022-02-21 03:10:16,675 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1716418464] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:10:16,676 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1151845487] [2022-02-21 03:10:16,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:10:16,676 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:10:16,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:10:16,677 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) [2022-02-21 03:10:16,699 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-02-21 03:10:16,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:16,730 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 03:10:16,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:16,740 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:10:16,874 INFO L290 TraceCheckUtils]: 0: Hoare triple {5617#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(21, 2);call #Ultimate.allocInit(12, 3); {5617#true} is VALID [2022-02-21 03:10:16,874 INFO L290 TraceCheckUtils]: 1: Hoare triple {5617#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~ret22#1, main_#t~ret23#1, main_#t~ret24#1, main_#t~ret25#1, main_#t~ret26#1, main_~a~0#1, main_~ma~2#1, main_~ea~2#1, main_~b~0#1, main_~mb~2#1, main_~eb~2#1, main_~r_mul~0#1, main_~zero~0#1, main_~one~0#1, main_~sb~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~tmp___1~0#1, main_~__retres16~0#1;havoc main_~a~0#1;main_~ma~2#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;main_~ea~2#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1;havoc main_~b~0#1;main_~mb~2#1 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;main_~eb~2#1 := main_#t~nondet21#1;havoc main_#t~nondet21#1;havoc main_~r_mul~0#1;havoc main_~zero~0#1;havoc main_~one~0#1;havoc main_~sb~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~tmp___1~0#1;havoc main_~__retres16~0#1; {5617#true} is VALID [2022-02-21 03:10:16,874 INFO L272 TraceCheckUtils]: 2: Hoare triple {5617#true} call main_#t~ret22#1 := base2flt(0, 0); {5617#true} is VALID [2022-02-21 03:10:16,874 INFO L290 TraceCheckUtils]: 3: Hoare triple {5617#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {5617#true} is VALID [2022-02-21 03:10:16,875 INFO L290 TraceCheckUtils]: 4: Hoare triple {5617#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {5617#true} is VALID [2022-02-21 03:10:16,875 INFO L290 TraceCheckUtils]: 5: Hoare triple {5617#true} #res := ~__retres4~0; {5617#true} is VALID [2022-02-21 03:10:16,875 INFO L290 TraceCheckUtils]: 6: Hoare triple {5617#true} assume true; {5617#true} is VALID [2022-02-21 03:10:16,875 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {5617#true} {5617#true} #394#return; {5617#true} is VALID [2022-02-21 03:10:16,875 INFO L290 TraceCheckUtils]: 8: Hoare triple {5617#true} main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1; {5617#true} is VALID [2022-02-21 03:10:16,876 INFO L272 TraceCheckUtils]: 9: Hoare triple {5617#true} call main_#t~ret23#1 := base2flt(1, 0); {5617#true} is VALID [2022-02-21 03:10:16,876 INFO L290 TraceCheckUtils]: 10: Hoare triple {5617#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {5674#(<= |base2flt_#in~e| base2flt_~e)} is VALID [2022-02-21 03:10:16,876 INFO L290 TraceCheckUtils]: 11: Hoare triple {5674#(<= |base2flt_#in~e| base2flt_~e)} assume !(0 == ~m % 4294967296); {5674#(<= |base2flt_#in~e| base2flt_~e)} is VALID [2022-02-21 03:10:16,877 INFO L290 TraceCheckUtils]: 12: Hoare triple {5674#(<= |base2flt_#in~e| base2flt_~e)} assume ~m % 4294967296 < 16777216; {5674#(<= |base2flt_#in~e| base2flt_~e)} is VALID [2022-02-21 03:10:16,878 INFO L290 TraceCheckUtils]: 13: Hoare triple {5674#(<= |base2flt_#in~e| base2flt_~e)} assume !false; {5674#(<= |base2flt_#in~e| base2flt_~e)} is VALID [2022-02-21 03:10:16,878 INFO L290 TraceCheckUtils]: 14: Hoare triple {5674#(<= |base2flt_#in~e| base2flt_~e)} assume !(~e <= -128); {5674#(<= |base2flt_#in~e| base2flt_~e)} is VALID [2022-02-21 03:10:16,879 INFO L290 TraceCheckUtils]: 15: Hoare triple {5674#(<= |base2flt_#in~e| base2flt_~e)} assume ~e - 1 <= 2147483647; {5674#(<= |base2flt_#in~e| base2flt_~e)} is VALID [2022-02-21 03:10:16,879 INFO L290 TraceCheckUtils]: 16: Hoare triple {5674#(<= |base2flt_#in~e| base2flt_~e)} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {5693#(<= |base2flt_#in~e| (+ base2flt_~e 1))} is VALID [2022-02-21 03:10:16,880 INFO L290 TraceCheckUtils]: 17: Hoare triple {5693#(<= |base2flt_#in~e| (+ base2flt_~e 1))} assume ~m % 4294967296 < 16777216; {5693#(<= |base2flt_#in~e| (+ base2flt_~e 1))} is VALID [2022-02-21 03:10:16,880 INFO L290 TraceCheckUtils]: 18: Hoare triple {5693#(<= |base2flt_#in~e| (+ base2flt_~e 1))} assume !false; {5693#(<= |base2flt_#in~e| (+ base2flt_~e 1))} is VALID [2022-02-21 03:10:16,881 INFO L290 TraceCheckUtils]: 19: Hoare triple {5693#(<= |base2flt_#in~e| (+ base2flt_~e 1))} assume ~e <= -128;~__retres4~0 := 0; {5703#(<= (+ 127 |base2flt_#in~e|) 0)} is VALID [2022-02-21 03:10:16,881 INFO L290 TraceCheckUtils]: 20: Hoare triple {5703#(<= (+ 127 |base2flt_#in~e|) 0)} #res := ~__retres4~0; {5703#(<= (+ 127 |base2flt_#in~e|) 0)} is VALID [2022-02-21 03:10:16,882 INFO L290 TraceCheckUtils]: 21: Hoare triple {5703#(<= (+ 127 |base2flt_#in~e|) 0)} assume true; {5703#(<= (+ 127 |base2flt_#in~e|) 0)} is VALID [2022-02-21 03:10:16,883 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {5703#(<= (+ 127 |base2flt_#in~e|) 0)} {5617#true} #396#return; {5618#false} is VALID [2022-02-21 03:10:16,883 INFO L290 TraceCheckUtils]: 23: Hoare triple {5618#false} main_~one~0#1 := main_#t~ret23#1;havoc main_#t~ret23#1; {5618#false} is VALID [2022-02-21 03:10:16,883 INFO L272 TraceCheckUtils]: 24: Hoare triple {5618#false} call main_#t~ret24#1 := base2flt(main_~ma~2#1, main_~ea~2#1); {5618#false} is VALID [2022-02-21 03:10:16,883 INFO L290 TraceCheckUtils]: 25: Hoare triple {5618#false} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {5618#false} is VALID [2022-02-21 03:10:16,883 INFO L290 TraceCheckUtils]: 26: Hoare triple {5618#false} assume !(0 == ~m % 4294967296); {5618#false} is VALID [2022-02-21 03:10:16,883 INFO L290 TraceCheckUtils]: 27: Hoare triple {5618#false} assume ~m % 4294967296 < 16777216; {5618#false} is VALID [2022-02-21 03:10:16,884 INFO L290 TraceCheckUtils]: 28: Hoare triple {5618#false} assume !false; {5618#false} is VALID [2022-02-21 03:10:16,884 INFO L290 TraceCheckUtils]: 29: Hoare triple {5618#false} assume !(~e <= -128); {5618#false} is VALID [2022-02-21 03:10:16,884 INFO L290 TraceCheckUtils]: 30: Hoare triple {5618#false} assume !(~e - 1 <= 2147483647); {5618#false} is VALID [2022-02-21 03:10:16,884 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 14 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-21 03:10:16,884 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:10:17,172 INFO L290 TraceCheckUtils]: 30: Hoare triple {5618#false} assume !(~e - 1 <= 2147483647); {5618#false} is VALID [2022-02-21 03:10:17,173 INFO L290 TraceCheckUtils]: 29: Hoare triple {5618#false} assume !(~e <= -128); {5618#false} is VALID [2022-02-21 03:10:17,173 INFO L290 TraceCheckUtils]: 28: Hoare triple {5618#false} assume !false; {5618#false} is VALID [2022-02-21 03:10:17,173 INFO L290 TraceCheckUtils]: 27: Hoare triple {5618#false} assume ~m % 4294967296 < 16777216; {5618#false} is VALID [2022-02-21 03:10:17,173 INFO L290 TraceCheckUtils]: 26: Hoare triple {5618#false} assume !(0 == ~m % 4294967296); {5618#false} is VALID [2022-02-21 03:10:17,173 INFO L290 TraceCheckUtils]: 25: Hoare triple {5618#false} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {5618#false} is VALID [2022-02-21 03:10:17,173 INFO L272 TraceCheckUtils]: 24: Hoare triple {5618#false} call main_#t~ret24#1 := base2flt(main_~ma~2#1, main_~ea~2#1); {5618#false} is VALID [2022-02-21 03:10:17,173 INFO L290 TraceCheckUtils]: 23: Hoare triple {5618#false} main_~one~0#1 := main_#t~ret23#1;havoc main_#t~ret23#1; {5618#false} is VALID [2022-02-21 03:10:17,175 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {5764#(not (<= 0 |base2flt_#in~e|))} {5617#true} #396#return; {5618#false} is VALID [2022-02-21 03:10:17,175 INFO L290 TraceCheckUtils]: 21: Hoare triple {5764#(not (<= 0 |base2flt_#in~e|))} assume true; {5764#(not (<= 0 |base2flt_#in~e|))} is VALID [2022-02-21 03:10:17,178 INFO L290 TraceCheckUtils]: 20: Hoare triple {5764#(not (<= 0 |base2flt_#in~e|))} #res := ~__retres4~0; {5764#(not (<= 0 |base2flt_#in~e|))} is VALID [2022-02-21 03:10:17,178 INFO L290 TraceCheckUtils]: 19: Hoare triple {5774#(or (not (<= (+ 128 base2flt_~e) 0)) (not (<= 0 |base2flt_#in~e|)))} assume ~e <= -128;~__retres4~0 := 0; {5764#(not (<= 0 |base2flt_#in~e|))} is VALID [2022-02-21 03:10:17,179 INFO L290 TraceCheckUtils]: 18: Hoare triple {5774#(or (not (<= (+ 128 base2flt_~e) 0)) (not (<= 0 |base2flt_#in~e|)))} assume !false; {5774#(or (not (<= (+ 128 base2flt_~e) 0)) (not (<= 0 |base2flt_#in~e|)))} is VALID [2022-02-21 03:10:17,179 INFO L290 TraceCheckUtils]: 17: Hoare triple {5774#(or (not (<= (+ 128 base2flt_~e) 0)) (not (<= 0 |base2flt_#in~e|)))} assume ~m % 4294967296 < 16777216; {5774#(or (not (<= (+ 128 base2flt_~e) 0)) (not (<= 0 |base2flt_#in~e|)))} is VALID [2022-02-21 03:10:17,180 INFO L290 TraceCheckUtils]: 16: Hoare triple {5784#(or (< 0 (+ base2flt_~e 127)) (not (<= 0 |base2flt_#in~e|)))} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {5774#(or (not (<= (+ 128 base2flt_~e) 0)) (not (<= 0 |base2flt_#in~e|)))} is VALID [2022-02-21 03:10:17,180 INFO L290 TraceCheckUtils]: 15: Hoare triple {5784#(or (< 0 (+ base2flt_~e 127)) (not (<= 0 |base2flt_#in~e|)))} assume ~e - 1 <= 2147483647; {5784#(or (< 0 (+ base2flt_~e 127)) (not (<= 0 |base2flt_#in~e|)))} is VALID [2022-02-21 03:10:17,181 INFO L290 TraceCheckUtils]: 14: Hoare triple {5784#(or (< 0 (+ base2flt_~e 127)) (not (<= 0 |base2flt_#in~e|)))} assume !(~e <= -128); {5784#(or (< 0 (+ base2flt_~e 127)) (not (<= 0 |base2flt_#in~e|)))} is VALID [2022-02-21 03:10:17,181 INFO L290 TraceCheckUtils]: 13: Hoare triple {5784#(or (< 0 (+ base2flt_~e 127)) (not (<= 0 |base2flt_#in~e|)))} assume !false; {5784#(or (< 0 (+ base2flt_~e 127)) (not (<= 0 |base2flt_#in~e|)))} is VALID [2022-02-21 03:10:17,181 INFO L290 TraceCheckUtils]: 12: Hoare triple {5784#(or (< 0 (+ base2flt_~e 127)) (not (<= 0 |base2flt_#in~e|)))} assume ~m % 4294967296 < 16777216; {5784#(or (< 0 (+ base2flt_~e 127)) (not (<= 0 |base2flt_#in~e|)))} is VALID [2022-02-21 03:10:17,182 INFO L290 TraceCheckUtils]: 11: Hoare triple {5784#(or (< 0 (+ base2flt_~e 127)) (not (<= 0 |base2flt_#in~e|)))} assume !(0 == ~m % 4294967296); {5784#(or (< 0 (+ base2flt_~e 127)) (not (<= 0 |base2flt_#in~e|)))} is VALID [2022-02-21 03:10:17,182 INFO L290 TraceCheckUtils]: 10: Hoare triple {5617#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {5784#(or (< 0 (+ base2flt_~e 127)) (not (<= 0 |base2flt_#in~e|)))} is VALID [2022-02-21 03:10:17,182 INFO L272 TraceCheckUtils]: 9: Hoare triple {5617#true} call main_#t~ret23#1 := base2flt(1, 0); {5617#true} is VALID [2022-02-21 03:10:17,182 INFO L290 TraceCheckUtils]: 8: Hoare triple {5617#true} main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1; {5617#true} is VALID [2022-02-21 03:10:17,183 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {5617#true} {5617#true} #394#return; {5617#true} is VALID [2022-02-21 03:10:17,183 INFO L290 TraceCheckUtils]: 6: Hoare triple {5617#true} assume true; {5617#true} is VALID [2022-02-21 03:10:17,183 INFO L290 TraceCheckUtils]: 5: Hoare triple {5617#true} #res := ~__retres4~0; {5617#true} is VALID [2022-02-21 03:10:17,183 INFO L290 TraceCheckUtils]: 4: Hoare triple {5617#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {5617#true} is VALID [2022-02-21 03:10:17,183 INFO L290 TraceCheckUtils]: 3: Hoare triple {5617#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {5617#true} is VALID [2022-02-21 03:10:17,183 INFO L272 TraceCheckUtils]: 2: Hoare triple {5617#true} call main_#t~ret22#1 := base2flt(0, 0); {5617#true} is VALID [2022-02-21 03:10:17,183 INFO L290 TraceCheckUtils]: 1: Hoare triple {5617#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~ret22#1, main_#t~ret23#1, main_#t~ret24#1, main_#t~ret25#1, main_#t~ret26#1, main_~a~0#1, main_~ma~2#1, main_~ea~2#1, main_~b~0#1, main_~mb~2#1, main_~eb~2#1, main_~r_mul~0#1, main_~zero~0#1, main_~one~0#1, main_~sb~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~tmp___1~0#1, main_~__retres16~0#1;havoc main_~a~0#1;main_~ma~2#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;main_~ea~2#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1;havoc main_~b~0#1;main_~mb~2#1 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;main_~eb~2#1 := main_#t~nondet21#1;havoc main_#t~nondet21#1;havoc main_~r_mul~0#1;havoc main_~zero~0#1;havoc main_~one~0#1;havoc main_~sb~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~tmp___1~0#1;havoc main_~__retres16~0#1; {5617#true} is VALID [2022-02-21 03:10:17,184 INFO L290 TraceCheckUtils]: 0: Hoare triple {5617#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(21, 2);call #Ultimate.allocInit(12, 3); {5617#true} is VALID [2022-02-21 03:10:17,184 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 14 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-21 03:10:17,184 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1151845487] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:10:17,184 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:10:17,184 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 12 [2022-02-21 03:10:17,184 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752506192] [2022-02-21 03:10:17,184 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:10:17,185 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.25) internal successors, (51), 11 states have internal predecessors, (51), 2 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 31 [2022-02-21 03:10:17,186 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:10:17,186 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 4.25) internal successors, (51), 11 states have internal predecessors, (51), 2 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-02-21 03:10:17,231 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:10:17,231 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-02-21 03:10:17,232 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:10:17,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-02-21 03:10:17,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2022-02-21 03:10:17,233 INFO L87 Difference]: Start difference. First operand 191 states and 243 transitions. Second operand has 12 states, 12 states have (on average 4.25) internal successors, (51), 11 states have internal predecessors, (51), 2 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-02-21 03:10:19,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:19,080 INFO L93 Difference]: Finished difference Result 829 states and 1079 transitions. [2022-02-21 03:10:19,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-02-21 03:10:19,081 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.25) internal successors, (51), 11 states have internal predecessors, (51), 2 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 31 [2022-02-21 03:10:19,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:10:19,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 4.25) internal successors, (51), 11 states have internal predecessors, (51), 2 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-02-21 03:10:19,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 693 transitions. [2022-02-21 03:10:19,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 4.25) internal successors, (51), 11 states have internal predecessors, (51), 2 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-02-21 03:10:19,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 693 transitions. [2022-02-21 03:10:19,096 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 29 states and 693 transitions. [2022-02-21 03:10:19,681 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 693 edges. 693 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:10:19,707 INFO L225 Difference]: With dead ends: 829 [2022-02-21 03:10:19,708 INFO L226 Difference]: Without dead ends: 671 [2022-02-21 03:10:19,709 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 259 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=342, Invalid=714, Unknown=0, NotChecked=0, Total=1056 [2022-02-21 03:10:19,710 INFO L933 BasicCegarLoop]: 124 mSDtfsCounter, 714 mSDsluCounter, 677 mSDsCounter, 0 mSdLazyCounter, 361 mSolverCounterSat, 130 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 714 SdHoareTripleChecker+Valid, 801 SdHoareTripleChecker+Invalid, 491 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 130 IncrementalHoareTripleChecker+Valid, 361 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-21 03:10:19,710 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [714 Valid, 801 Invalid, 491 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [130 Valid, 361 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-21 03:10:19,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 671 states. [2022-02-21 03:10:19,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 671 to 221. [2022-02-21 03:10:19,754 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:10:19,755 INFO L82 GeneralOperation]: Start isEquivalent. First operand 671 states. Second operand has 221 states, 189 states have (on average 1.439153439153439) internal successors, (272), 213 states have internal predecessors, (272), 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) [2022-02-21 03:10:19,755 INFO L74 IsIncluded]: Start isIncluded. First operand 671 states. Second operand has 221 states, 189 states have (on average 1.439153439153439) internal successors, (272), 213 states have internal predecessors, (272), 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) [2022-02-21 03:10:19,757 INFO L87 Difference]: Start difference. First operand 671 states. Second operand has 221 states, 189 states have (on average 1.439153439153439) internal successors, (272), 213 states have internal predecessors, (272), 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) [2022-02-21 03:10:19,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:19,781 INFO L93 Difference]: Finished difference Result 671 states and 858 transitions. [2022-02-21 03:10:19,782 INFO L276 IsEmpty]: Start isEmpty. Operand 671 states and 858 transitions. [2022-02-21 03:10:19,785 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:10:19,785 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:10:19,786 INFO L74 IsIncluded]: Start isIncluded. First operand has 221 states, 189 states have (on average 1.439153439153439) internal successors, (272), 213 states have internal predecessors, (272), 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) Second operand 671 states. [2022-02-21 03:10:19,786 INFO L87 Difference]: Start difference. First operand has 221 states, 189 states have (on average 1.439153439153439) internal successors, (272), 213 states have internal predecessors, (272), 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) Second operand 671 states. [2022-02-21 03:10:19,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:19,813 INFO L93 Difference]: Finished difference Result 671 states and 858 transitions. [2022-02-21 03:10:19,813 INFO L276 IsEmpty]: Start isEmpty. Operand 671 states and 858 transitions. [2022-02-21 03:10:19,815 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:10:19,816 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:10:19,816 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:10:19,816 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:10:19,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 189 states have (on average 1.439153439153439) internal successors, (272), 213 states have internal predecessors, (272), 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) [2022-02-21 03:10:19,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 280 transitions. [2022-02-21 03:10:19,821 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 280 transitions. Word has length 31 [2022-02-21 03:10:19,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:10:19,821 INFO L470 AbstractCegarLoop]: Abstraction has 221 states and 280 transitions. [2022-02-21 03:10:19,822 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.25) internal successors, (51), 11 states have internal predecessors, (51), 2 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-02-21 03:10:19,822 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 280 transitions. [2022-02-21 03:10:19,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-02-21 03:10:19,824 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:10:19,825 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:10:19,850 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-02-21 03:10:20,038 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:10:20,038 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2022-02-21 03:10:20,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:10:20,039 INFO L85 PathProgramCache]: Analyzing trace with hash 24022301, now seen corresponding path program 1 times [2022-02-21 03:10:20,039 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:10:20,039 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513318920] [2022-02-21 03:10:20,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:10:20,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:10:20,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:20,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-21 03:10:20,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:20,126 INFO L290 TraceCheckUtils]: 0: Hoare triple {8409#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {8374#true} is VALID [2022-02-21 03:10:20,126 INFO L290 TraceCheckUtils]: 1: Hoare triple {8374#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {8374#true} is VALID [2022-02-21 03:10:20,126 INFO L290 TraceCheckUtils]: 2: Hoare triple {8374#true} #res := ~__retres4~0; {8374#true} is VALID [2022-02-21 03:10:20,127 INFO L290 TraceCheckUtils]: 3: Hoare triple {8374#true} assume true; {8374#true} is VALID [2022-02-21 03:10:20,127 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {8374#true} {8376#(<= |ULTIMATE.start_main_~ea~2#1| 127)} #394#return; {8376#(<= |ULTIMATE.start_main_~ea~2#1| 127)} is VALID [2022-02-21 03:10:20,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-02-21 03:10:20,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:20,156 INFO L290 TraceCheckUtils]: 0: Hoare triple {8409#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {8374#true} is VALID [2022-02-21 03:10:20,157 INFO L290 TraceCheckUtils]: 1: Hoare triple {8374#true} assume !(0 == ~m % 4294967296); {8374#true} is VALID [2022-02-21 03:10:20,157 INFO L290 TraceCheckUtils]: 2: Hoare triple {8374#true} assume ~m % 4294967296 < 16777216; {8374#true} is VALID [2022-02-21 03:10:20,157 INFO L290 TraceCheckUtils]: 3: Hoare triple {8374#true} assume !false; {8374#true} is VALID [2022-02-21 03:10:20,157 INFO L290 TraceCheckUtils]: 4: Hoare triple {8374#true} assume !(~e <= -128); {8374#true} is VALID [2022-02-21 03:10:20,157 INFO L290 TraceCheckUtils]: 5: Hoare triple {8374#true} assume ~e - 1 <= 2147483647; {8374#true} is VALID [2022-02-21 03:10:20,157 INFO L290 TraceCheckUtils]: 6: Hoare triple {8374#true} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {8374#true} is VALID [2022-02-21 03:10:20,158 INFO L290 TraceCheckUtils]: 7: Hoare triple {8374#true} assume !(~m % 4294967296 < 16777216); {8374#true} is VALID [2022-02-21 03:10:20,158 INFO L290 TraceCheckUtils]: 8: Hoare triple {8374#true} assume 0 == ~m || 0 == ~bitwiseComplement(16777216);~m := 0; {8374#true} is VALID [2022-02-21 03:10:20,158 INFO L290 TraceCheckUtils]: 9: Hoare triple {8374#true} assume 128 + ~e <= 2147483647; {8374#true} is VALID [2022-02-21 03:10:20,158 INFO L290 TraceCheckUtils]: 10: Hoare triple {8374#true} assume 128 + ~e >= -2147483648; {8374#true} is VALID [2022-02-21 03:10:20,158 INFO L290 TraceCheckUtils]: 11: Hoare triple {8374#true} assume 16777216 * (128 + ~e) <= 2147483647; {8374#true} is VALID [2022-02-21 03:10:20,158 INFO L290 TraceCheckUtils]: 12: Hoare triple {8374#true} assume 16777216 * (128 + ~e) >= -2147483648; {8374#true} is VALID [2022-02-21 03:10:20,159 INFO L290 TraceCheckUtils]: 13: Hoare triple {8374#true} assume 128 + ~e <= 2147483647; {8374#true} is VALID [2022-02-21 03:10:20,159 INFO L290 TraceCheckUtils]: 14: Hoare triple {8374#true} assume 128 + ~e >= -2147483648; {8374#true} is VALID [2022-02-21 03:10:20,159 INFO L290 TraceCheckUtils]: 15: Hoare triple {8374#true} assume 16777216 * (128 + ~e) <= 2147483647; {8374#true} is VALID [2022-02-21 03:10:20,159 INFO L290 TraceCheckUtils]: 16: Hoare triple {8374#true} assume 16777216 * (128 + ~e) >= -2147483648; {8374#true} is VALID [2022-02-21 03:10:20,159 INFO L290 TraceCheckUtils]: 17: Hoare triple {8374#true} assume !((1 == ~m && (0 == 16777216 * (128 + ~e) || 1 == 16777216 * (128 + ~e))) || ((0 == ~m || 1 == ~m) && 1 == 16777216 * (128 + ~e))); {8374#true} is VALID [2022-02-21 03:10:20,160 INFO L290 TraceCheckUtils]: 18: Hoare triple {8374#true} assume !(0 == ~m && (0 == 16777216 * (128 + ~e) || 1 == 16777216 * (128 + ~e))); {8374#true} is VALID [2022-02-21 03:10:20,160 INFO L290 TraceCheckUtils]: 19: Hoare triple {8374#true} assume !((0 == ~m || 1 == ~m) && 0 == 16777216 * (128 + ~e)); {8374#true} is VALID [2022-02-21 03:10:20,160 INFO L290 TraceCheckUtils]: 20: Hoare triple {8374#true} assume ~m >= 0 && 16777216 * (128 + ~e) >= 0;abs_77 := (if ~m < 16777216 * (128 + ~e) then 16777216 * (128 + ~e) else ~m);assume ~m >= 0 && 16777216 * (128 + ~e) >= 0;assume ~res~0 >= abs_77; {8374#true} is VALID [2022-02-21 03:10:20,160 INFO L290 TraceCheckUtils]: 21: Hoare triple {8374#true} ~__retres4~0 := ~res~0; {8374#true} is VALID [2022-02-21 03:10:20,160 INFO L290 TraceCheckUtils]: 22: Hoare triple {8374#true} #res := ~__retres4~0; {8374#true} is VALID [2022-02-21 03:10:20,161 INFO L290 TraceCheckUtils]: 23: Hoare triple {8374#true} assume true; {8374#true} is VALID [2022-02-21 03:10:20,163 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {8374#true} {8376#(<= |ULTIMATE.start_main_~ea~2#1| 127)} #396#return; {8376#(<= |ULTIMATE.start_main_~ea~2#1| 127)} is VALID [2022-02-21 03:10:20,163 INFO L290 TraceCheckUtils]: 0: Hoare triple {8374#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(21, 2);call #Ultimate.allocInit(12, 3); {8374#true} is VALID [2022-02-21 03:10:20,163 INFO L290 TraceCheckUtils]: 1: Hoare triple {8374#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~ret22#1, main_#t~ret23#1, main_#t~ret24#1, main_#t~ret25#1, main_#t~ret26#1, main_~a~0#1, main_~ma~2#1, main_~ea~2#1, main_~b~0#1, main_~mb~2#1, main_~eb~2#1, main_~r_mul~0#1, main_~zero~0#1, main_~one~0#1, main_~sb~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~tmp___1~0#1, main_~__retres16~0#1;havoc main_~a~0#1;main_~ma~2#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;main_~ea~2#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1;havoc main_~b~0#1;main_~mb~2#1 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;main_~eb~2#1 := main_#t~nondet21#1;havoc main_#t~nondet21#1;havoc main_~r_mul~0#1;havoc main_~zero~0#1;havoc main_~one~0#1;havoc main_~sb~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~tmp___1~0#1;havoc main_~__retres16~0#1; {8376#(<= |ULTIMATE.start_main_~ea~2#1| 127)} is VALID [2022-02-21 03:10:20,164 INFO L272 TraceCheckUtils]: 2: Hoare triple {8376#(<= |ULTIMATE.start_main_~ea~2#1| 127)} call main_#t~ret22#1 := base2flt(0, 0); {8409#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} is VALID [2022-02-21 03:10:20,164 INFO L290 TraceCheckUtils]: 3: Hoare triple {8409#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {8374#true} is VALID [2022-02-21 03:10:20,165 INFO L290 TraceCheckUtils]: 4: Hoare triple {8374#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {8374#true} is VALID [2022-02-21 03:10:20,165 INFO L290 TraceCheckUtils]: 5: Hoare triple {8374#true} #res := ~__retres4~0; {8374#true} is VALID [2022-02-21 03:10:20,165 INFO L290 TraceCheckUtils]: 6: Hoare triple {8374#true} assume true; {8374#true} is VALID [2022-02-21 03:10:20,165 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {8374#true} {8376#(<= |ULTIMATE.start_main_~ea~2#1| 127)} #394#return; {8376#(<= |ULTIMATE.start_main_~ea~2#1| 127)} is VALID [2022-02-21 03:10:20,167 INFO L290 TraceCheckUtils]: 8: Hoare triple {8376#(<= |ULTIMATE.start_main_~ea~2#1| 127)} main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1; {8376#(<= |ULTIMATE.start_main_~ea~2#1| 127)} is VALID [2022-02-21 03:10:20,168 INFO L272 TraceCheckUtils]: 9: Hoare triple {8376#(<= |ULTIMATE.start_main_~ea~2#1| 127)} call main_#t~ret23#1 := base2flt(1, 0); {8409#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} is VALID [2022-02-21 03:10:20,168 INFO L290 TraceCheckUtils]: 10: Hoare triple {8409#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {8374#true} is VALID [2022-02-21 03:10:20,168 INFO L290 TraceCheckUtils]: 11: Hoare triple {8374#true} assume !(0 == ~m % 4294967296); {8374#true} is VALID [2022-02-21 03:10:20,168 INFO L290 TraceCheckUtils]: 12: Hoare triple {8374#true} assume ~m % 4294967296 < 16777216; {8374#true} is VALID [2022-02-21 03:10:20,168 INFO L290 TraceCheckUtils]: 13: Hoare triple {8374#true} assume !false; {8374#true} is VALID [2022-02-21 03:10:20,169 INFO L290 TraceCheckUtils]: 14: Hoare triple {8374#true} assume !(~e <= -128); {8374#true} is VALID [2022-02-21 03:10:20,169 INFO L290 TraceCheckUtils]: 15: Hoare triple {8374#true} assume ~e - 1 <= 2147483647; {8374#true} is VALID [2022-02-21 03:10:20,169 INFO L290 TraceCheckUtils]: 16: Hoare triple {8374#true} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {8374#true} is VALID [2022-02-21 03:10:20,169 INFO L290 TraceCheckUtils]: 17: Hoare triple {8374#true} assume !(~m % 4294967296 < 16777216); {8374#true} is VALID [2022-02-21 03:10:20,169 INFO L290 TraceCheckUtils]: 18: Hoare triple {8374#true} assume 0 == ~m || 0 == ~bitwiseComplement(16777216);~m := 0; {8374#true} is VALID [2022-02-21 03:10:20,169 INFO L290 TraceCheckUtils]: 19: Hoare triple {8374#true} assume 128 + ~e <= 2147483647; {8374#true} is VALID [2022-02-21 03:10:20,170 INFO L290 TraceCheckUtils]: 20: Hoare triple {8374#true} assume 128 + ~e >= -2147483648; {8374#true} is VALID [2022-02-21 03:10:20,170 INFO L290 TraceCheckUtils]: 21: Hoare triple {8374#true} assume 16777216 * (128 + ~e) <= 2147483647; {8374#true} is VALID [2022-02-21 03:10:20,170 INFO L290 TraceCheckUtils]: 22: Hoare triple {8374#true} assume 16777216 * (128 + ~e) >= -2147483648; {8374#true} is VALID [2022-02-21 03:10:20,170 INFO L290 TraceCheckUtils]: 23: Hoare triple {8374#true} assume 128 + ~e <= 2147483647; {8374#true} is VALID [2022-02-21 03:10:20,170 INFO L290 TraceCheckUtils]: 24: Hoare triple {8374#true} assume 128 + ~e >= -2147483648; {8374#true} is VALID [2022-02-21 03:10:20,170 INFO L290 TraceCheckUtils]: 25: Hoare triple {8374#true} assume 16777216 * (128 + ~e) <= 2147483647; {8374#true} is VALID [2022-02-21 03:10:20,171 INFO L290 TraceCheckUtils]: 26: Hoare triple {8374#true} assume 16777216 * (128 + ~e) >= -2147483648; {8374#true} is VALID [2022-02-21 03:10:20,171 INFO L290 TraceCheckUtils]: 27: Hoare triple {8374#true} assume !((1 == ~m && (0 == 16777216 * (128 + ~e) || 1 == 16777216 * (128 + ~e))) || ((0 == ~m || 1 == ~m) && 1 == 16777216 * (128 + ~e))); {8374#true} is VALID [2022-02-21 03:10:20,171 INFO L290 TraceCheckUtils]: 28: Hoare triple {8374#true} assume !(0 == ~m && (0 == 16777216 * (128 + ~e) || 1 == 16777216 * (128 + ~e))); {8374#true} is VALID [2022-02-21 03:10:20,171 INFO L290 TraceCheckUtils]: 29: Hoare triple {8374#true} assume !((0 == ~m || 1 == ~m) && 0 == 16777216 * (128 + ~e)); {8374#true} is VALID [2022-02-21 03:10:20,171 INFO L290 TraceCheckUtils]: 30: Hoare triple {8374#true} assume ~m >= 0 && 16777216 * (128 + ~e) >= 0;abs_77 := (if ~m < 16777216 * (128 + ~e) then 16777216 * (128 + ~e) else ~m);assume ~m >= 0 && 16777216 * (128 + ~e) >= 0;assume ~res~0 >= abs_77; {8374#true} is VALID [2022-02-21 03:10:20,171 INFO L290 TraceCheckUtils]: 31: Hoare triple {8374#true} ~__retres4~0 := ~res~0; {8374#true} is VALID [2022-02-21 03:10:20,172 INFO L290 TraceCheckUtils]: 32: Hoare triple {8374#true} #res := ~__retres4~0; {8374#true} is VALID [2022-02-21 03:10:20,172 INFO L290 TraceCheckUtils]: 33: Hoare triple {8374#true} assume true; {8374#true} is VALID [2022-02-21 03:10:20,172 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {8374#true} {8376#(<= |ULTIMATE.start_main_~ea~2#1| 127)} #396#return; {8376#(<= |ULTIMATE.start_main_~ea~2#1| 127)} is VALID [2022-02-21 03:10:20,173 INFO L290 TraceCheckUtils]: 35: Hoare triple {8376#(<= |ULTIMATE.start_main_~ea~2#1| 127)} main_~one~0#1 := main_#t~ret23#1;havoc main_#t~ret23#1; {8376#(<= |ULTIMATE.start_main_~ea~2#1| 127)} is VALID [2022-02-21 03:10:20,173 INFO L272 TraceCheckUtils]: 36: Hoare triple {8376#(<= |ULTIMATE.start_main_~ea~2#1| 127)} call main_#t~ret24#1 := base2flt(main_~ma~2#1, main_~ea~2#1); {8407#(<= |base2flt_#in~e| 127)} is VALID [2022-02-21 03:10:20,174 INFO L290 TraceCheckUtils]: 37: Hoare triple {8407#(<= |base2flt_#in~e| 127)} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {8408#(<= base2flt_~e 127)} is VALID [2022-02-21 03:10:20,174 INFO L290 TraceCheckUtils]: 38: Hoare triple {8408#(<= base2flt_~e 127)} assume !(0 == ~m % 4294967296); {8408#(<= base2flt_~e 127)} is VALID [2022-02-21 03:10:20,175 INFO L290 TraceCheckUtils]: 39: Hoare triple {8408#(<= base2flt_~e 127)} assume ~m % 4294967296 < 16777216; {8408#(<= base2flt_~e 127)} is VALID [2022-02-21 03:10:20,175 INFO L290 TraceCheckUtils]: 40: Hoare triple {8408#(<= base2flt_~e 127)} assume !false; {8408#(<= base2flt_~e 127)} is VALID [2022-02-21 03:10:20,176 INFO L290 TraceCheckUtils]: 41: Hoare triple {8408#(<= base2flt_~e 127)} assume !(~e <= -128); {8408#(<= base2flt_~e 127)} is VALID [2022-02-21 03:10:20,177 INFO L290 TraceCheckUtils]: 42: Hoare triple {8408#(<= base2flt_~e 127)} assume !(~e - 1 <= 2147483647); {8375#false} is VALID [2022-02-21 03:10:20,177 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-02-21 03:10:20,178 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:10:20,178 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513318920] [2022-02-21 03:10:20,179 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1513318920] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:10:20,179 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1441804529] [2022-02-21 03:10:20,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:10:20,179 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:10:20,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:10:20,184 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) [2022-02-21 03:10:20,194 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-02-21 03:10:20,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:20,244 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 03:10:20,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:20,259 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:10:20,375 INFO L290 TraceCheckUtils]: 0: Hoare triple {8374#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(21, 2);call #Ultimate.allocInit(12, 3); {8374#true} is VALID [2022-02-21 03:10:20,375 INFO L290 TraceCheckUtils]: 1: Hoare triple {8374#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~ret22#1, main_#t~ret23#1, main_#t~ret24#1, main_#t~ret25#1, main_#t~ret26#1, main_~a~0#1, main_~ma~2#1, main_~ea~2#1, main_~b~0#1, main_~mb~2#1, main_~eb~2#1, main_~r_mul~0#1, main_~zero~0#1, main_~one~0#1, main_~sb~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~tmp___1~0#1, main_~__retres16~0#1;havoc main_~a~0#1;main_~ma~2#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;main_~ea~2#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1;havoc main_~b~0#1;main_~mb~2#1 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;main_~eb~2#1 := main_#t~nondet21#1;havoc main_#t~nondet21#1;havoc main_~r_mul~0#1;havoc main_~zero~0#1;havoc main_~one~0#1;havoc main_~sb~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~tmp___1~0#1;havoc main_~__retres16~0#1; {8376#(<= |ULTIMATE.start_main_~ea~2#1| 127)} is VALID [2022-02-21 03:10:20,375 INFO L272 TraceCheckUtils]: 2: Hoare triple {8376#(<= |ULTIMATE.start_main_~ea~2#1| 127)} call main_#t~ret22#1 := base2flt(0, 0); {8374#true} is VALID [2022-02-21 03:10:20,376 INFO L290 TraceCheckUtils]: 3: Hoare triple {8374#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {8374#true} is VALID [2022-02-21 03:10:20,376 INFO L290 TraceCheckUtils]: 4: Hoare triple {8374#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {8374#true} is VALID [2022-02-21 03:10:20,376 INFO L290 TraceCheckUtils]: 5: Hoare triple {8374#true} #res := ~__retres4~0; {8374#true} is VALID [2022-02-21 03:10:20,377 INFO L290 TraceCheckUtils]: 6: Hoare triple {8374#true} assume true; {8374#true} is VALID [2022-02-21 03:10:20,377 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {8374#true} {8376#(<= |ULTIMATE.start_main_~ea~2#1| 127)} #394#return; {8376#(<= |ULTIMATE.start_main_~ea~2#1| 127)} is VALID [2022-02-21 03:10:20,378 INFO L290 TraceCheckUtils]: 8: Hoare triple {8376#(<= |ULTIMATE.start_main_~ea~2#1| 127)} main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1; {8376#(<= |ULTIMATE.start_main_~ea~2#1| 127)} is VALID [2022-02-21 03:10:20,378 INFO L272 TraceCheckUtils]: 9: Hoare triple {8376#(<= |ULTIMATE.start_main_~ea~2#1| 127)} call main_#t~ret23#1 := base2flt(1, 0); {8374#true} is VALID [2022-02-21 03:10:20,378 INFO L290 TraceCheckUtils]: 10: Hoare triple {8374#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {8374#true} is VALID [2022-02-21 03:10:20,378 INFO L290 TraceCheckUtils]: 11: Hoare triple {8374#true} assume !(0 == ~m % 4294967296); {8374#true} is VALID [2022-02-21 03:10:20,378 INFO L290 TraceCheckUtils]: 12: Hoare triple {8374#true} assume ~m % 4294967296 < 16777216; {8374#true} is VALID [2022-02-21 03:10:20,378 INFO L290 TraceCheckUtils]: 13: Hoare triple {8374#true} assume !false; {8374#true} is VALID [2022-02-21 03:10:20,379 INFO L290 TraceCheckUtils]: 14: Hoare triple {8374#true} assume !(~e <= -128); {8374#true} is VALID [2022-02-21 03:10:20,379 INFO L290 TraceCheckUtils]: 15: Hoare triple {8374#true} assume ~e - 1 <= 2147483647; {8374#true} is VALID [2022-02-21 03:10:20,379 INFO L290 TraceCheckUtils]: 16: Hoare triple {8374#true} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {8374#true} is VALID [2022-02-21 03:10:20,379 INFO L290 TraceCheckUtils]: 17: Hoare triple {8374#true} assume !(~m % 4294967296 < 16777216); {8374#true} is VALID [2022-02-21 03:10:20,379 INFO L290 TraceCheckUtils]: 18: Hoare triple {8374#true} assume 0 == ~m || 0 == ~bitwiseComplement(16777216);~m := 0; {8374#true} is VALID [2022-02-21 03:10:20,379 INFO L290 TraceCheckUtils]: 19: Hoare triple {8374#true} assume 128 + ~e <= 2147483647; {8374#true} is VALID [2022-02-21 03:10:20,380 INFO L290 TraceCheckUtils]: 20: Hoare triple {8374#true} assume 128 + ~e >= -2147483648; {8374#true} is VALID [2022-02-21 03:10:20,381 INFO L290 TraceCheckUtils]: 21: Hoare triple {8374#true} assume 16777216 * (128 + ~e) <= 2147483647; {8374#true} is VALID [2022-02-21 03:10:20,386 INFO L290 TraceCheckUtils]: 22: Hoare triple {8374#true} assume 16777216 * (128 + ~e) >= -2147483648; {8374#true} is VALID [2022-02-21 03:10:20,387 INFO L290 TraceCheckUtils]: 23: Hoare triple {8374#true} assume 128 + ~e <= 2147483647; {8374#true} is VALID [2022-02-21 03:10:20,388 INFO L290 TraceCheckUtils]: 24: Hoare triple {8374#true} assume 128 + ~e >= -2147483648; {8374#true} is VALID [2022-02-21 03:10:20,388 INFO L290 TraceCheckUtils]: 25: Hoare triple {8374#true} assume 16777216 * (128 + ~e) <= 2147483647; {8374#true} is VALID [2022-02-21 03:10:20,388 INFO L290 TraceCheckUtils]: 26: Hoare triple {8374#true} assume 16777216 * (128 + ~e) >= -2147483648; {8374#true} is VALID [2022-02-21 03:10:20,389 INFO L290 TraceCheckUtils]: 27: Hoare triple {8374#true} assume !((1 == ~m && (0 == 16777216 * (128 + ~e) || 1 == 16777216 * (128 + ~e))) || ((0 == ~m || 1 == ~m) && 1 == 16777216 * (128 + ~e))); {8374#true} is VALID [2022-02-21 03:10:20,389 INFO L290 TraceCheckUtils]: 28: Hoare triple {8374#true} assume !(0 == ~m && (0 == 16777216 * (128 + ~e) || 1 == 16777216 * (128 + ~e))); {8374#true} is VALID [2022-02-21 03:10:20,389 INFO L290 TraceCheckUtils]: 29: Hoare triple {8374#true} assume !((0 == ~m || 1 == ~m) && 0 == 16777216 * (128 + ~e)); {8374#true} is VALID [2022-02-21 03:10:20,390 INFO L290 TraceCheckUtils]: 30: Hoare triple {8374#true} assume ~m >= 0 && 16777216 * (128 + ~e) >= 0;abs_77 := (if ~m < 16777216 * (128 + ~e) then 16777216 * (128 + ~e) else ~m);assume ~m >= 0 && 16777216 * (128 + ~e) >= 0;assume ~res~0 >= abs_77; {8374#true} is VALID [2022-02-21 03:10:20,390 INFO L290 TraceCheckUtils]: 31: Hoare triple {8374#true} ~__retres4~0 := ~res~0; {8374#true} is VALID [2022-02-21 03:10:20,390 INFO L290 TraceCheckUtils]: 32: Hoare triple {8374#true} #res := ~__retres4~0; {8374#true} is VALID [2022-02-21 03:10:20,390 INFO L290 TraceCheckUtils]: 33: Hoare triple {8374#true} assume true; {8374#true} is VALID [2022-02-21 03:10:20,392 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {8374#true} {8376#(<= |ULTIMATE.start_main_~ea~2#1| 127)} #396#return; {8376#(<= |ULTIMATE.start_main_~ea~2#1| 127)} is VALID [2022-02-21 03:10:20,392 INFO L290 TraceCheckUtils]: 35: Hoare triple {8376#(<= |ULTIMATE.start_main_~ea~2#1| 127)} main_~one~0#1 := main_#t~ret23#1;havoc main_#t~ret23#1; {8376#(<= |ULTIMATE.start_main_~ea~2#1| 127)} is VALID [2022-02-21 03:10:20,393 INFO L272 TraceCheckUtils]: 36: Hoare triple {8376#(<= |ULTIMATE.start_main_~ea~2#1| 127)} call main_#t~ret24#1 := base2flt(main_~ma~2#1, main_~ea~2#1); {8407#(<= |base2flt_#in~e| 127)} is VALID [2022-02-21 03:10:20,393 INFO L290 TraceCheckUtils]: 37: Hoare triple {8407#(<= |base2flt_#in~e| 127)} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {8408#(<= base2flt_~e 127)} is VALID [2022-02-21 03:10:20,394 INFO L290 TraceCheckUtils]: 38: Hoare triple {8408#(<= base2flt_~e 127)} assume !(0 == ~m % 4294967296); {8408#(<= base2flt_~e 127)} is VALID [2022-02-21 03:10:20,394 INFO L290 TraceCheckUtils]: 39: Hoare triple {8408#(<= base2flt_~e 127)} assume ~m % 4294967296 < 16777216; {8408#(<= base2flt_~e 127)} is VALID [2022-02-21 03:10:20,394 INFO L290 TraceCheckUtils]: 40: Hoare triple {8408#(<= base2flt_~e 127)} assume !false; {8408#(<= base2flt_~e 127)} is VALID [2022-02-21 03:10:20,395 INFO L290 TraceCheckUtils]: 41: Hoare triple {8408#(<= base2flt_~e 127)} assume !(~e <= -128); {8408#(<= base2flt_~e 127)} is VALID [2022-02-21 03:10:20,395 INFO L290 TraceCheckUtils]: 42: Hoare triple {8408#(<= base2flt_~e 127)} assume !(~e - 1 <= 2147483647); {8375#false} is VALID [2022-02-21 03:10:20,395 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-02-21 03:10:20,396 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-21 03:10:20,396 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1441804529] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:10:20,396 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-21 03:10:20,396 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2022-02-21 03:10:20,396 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788967192] [2022-02-21 03:10:20,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:10:20,397 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 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 43 [2022-02-21 03:10:20,397 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:10:20,397 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 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) [2022-02-21 03:10:20,423 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:10:20,423 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-21 03:10:20,423 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:10:20,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-21 03:10:20,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-21 03:10:20,425 INFO L87 Difference]: Start difference. First operand 221 states and 280 transitions. Second operand has 5 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 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) [2022-02-21 03:10:20,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:20,901 INFO L93 Difference]: Finished difference Result 312 states and 409 transitions. [2022-02-21 03:10:20,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-21 03:10:20,901 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 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 43 [2022-02-21 03:10:20,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:10:20,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 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) [2022-02-21 03:10:20,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 228 transitions. [2022-02-21 03:10:20,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 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) [2022-02-21 03:10:20,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 228 transitions. [2022-02-21 03:10:20,905 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 228 transitions. [2022-02-21 03:10:21,081 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 228 edges. 228 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:10:21,087 INFO L225 Difference]: With dead ends: 312 [2022-02-21 03:10:21,087 INFO L226 Difference]: Without dead ends: 309 [2022-02-21 03:10:21,088 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-02-21 03:10:21,088 INFO L933 BasicCegarLoop]: 114 mSDtfsCounter, 218 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-21 03:10:21,088 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [221 Valid, 378 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-21 03:10:21,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2022-02-21 03:10:21,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 290. [2022-02-21 03:10:21,164 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:10:21,165 INFO L82 GeneralOperation]: Start isEquivalent. First operand 309 states. Second operand has 290 states, 258 states have (on average 1.4651162790697674) internal successors, (378), 281 states have internal predecessors, (378), 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) [2022-02-21 03:10:21,165 INFO L74 IsIncluded]: Start isIncluded. First operand 309 states. Second operand has 290 states, 258 states have (on average 1.4651162790697674) internal successors, (378), 281 states have internal predecessors, (378), 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) [2022-02-21 03:10:21,166 INFO L87 Difference]: Start difference. First operand 309 states. Second operand has 290 states, 258 states have (on average 1.4651162790697674) internal successors, (378), 281 states have internal predecessors, (378), 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) [2022-02-21 03:10:21,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:21,173 INFO L93 Difference]: Finished difference Result 309 states and 402 transitions. [2022-02-21 03:10:21,173 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 402 transitions. [2022-02-21 03:10:21,174 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:10:21,174 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:10:21,175 INFO L74 IsIncluded]: Start isIncluded. First operand has 290 states, 258 states have (on average 1.4651162790697674) internal successors, (378), 281 states have internal predecessors, (378), 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) Second operand 309 states. [2022-02-21 03:10:21,176 INFO L87 Difference]: Start difference. First operand has 290 states, 258 states have (on average 1.4651162790697674) internal successors, (378), 281 states have internal predecessors, (378), 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) Second operand 309 states. [2022-02-21 03:10:21,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:21,183 INFO L93 Difference]: Finished difference Result 309 states and 402 transitions. [2022-02-21 03:10:21,183 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 402 transitions. [2022-02-21 03:10:21,184 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:10:21,184 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:10:21,184 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:10:21,184 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:10:21,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 258 states have (on average 1.4651162790697674) internal successors, (378), 281 states have internal predecessors, (378), 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) [2022-02-21 03:10:21,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 386 transitions. [2022-02-21 03:10:21,191 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 386 transitions. Word has length 43 [2022-02-21 03:10:21,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:10:21,191 INFO L470 AbstractCegarLoop]: Abstraction has 290 states and 386 transitions. [2022-02-21 03:10:21,192 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 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) [2022-02-21 03:10:21,192 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 386 transitions. [2022-02-21 03:10:21,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-02-21 03:10:21,192 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:10:21,193 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:10:21,220 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-02-21 03:10:21,415 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:10:21,416 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting base2fltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2022-02-21 03:10:21,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:10:21,416 INFO L85 PathProgramCache]: Analyzing trace with hash -1796922619, now seen corresponding path program 1 times [2022-02-21 03:10:21,416 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:10:21,416 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634724921] [2022-02-21 03:10:21,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:10:21,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:10:21,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:21,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-21 03:10:21,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:21,502 INFO L290 TraceCheckUtils]: 0: Hoare triple {9856#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {9821#true} is VALID [2022-02-21 03:10:21,502 INFO L290 TraceCheckUtils]: 1: Hoare triple {9821#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {9821#true} is VALID [2022-02-21 03:10:21,502 INFO L290 TraceCheckUtils]: 2: Hoare triple {9821#true} #res := ~__retres4~0; {9821#true} is VALID [2022-02-21 03:10:21,502 INFO L290 TraceCheckUtils]: 3: Hoare triple {9821#true} assume true; {9821#true} is VALID [2022-02-21 03:10:21,503 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {9821#true} {9823#(<= 0 (+ |ULTIMATE.start_main_~ea~2#1| 128))} #394#return; {9823#(<= 0 (+ |ULTIMATE.start_main_~ea~2#1| 128))} is VALID [2022-02-21 03:10:21,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-02-21 03:10:21,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:21,520 INFO L290 TraceCheckUtils]: 0: Hoare triple {9856#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {9821#true} is VALID [2022-02-21 03:10:21,520 INFO L290 TraceCheckUtils]: 1: Hoare triple {9821#true} assume !(0 == ~m % 4294967296); {9821#true} is VALID [2022-02-21 03:10:21,521 INFO L290 TraceCheckUtils]: 2: Hoare triple {9821#true} assume ~m % 4294967296 < 16777216; {9821#true} is VALID [2022-02-21 03:10:21,521 INFO L290 TraceCheckUtils]: 3: Hoare triple {9821#true} assume !false; {9821#true} is VALID [2022-02-21 03:10:21,521 INFO L290 TraceCheckUtils]: 4: Hoare triple {9821#true} assume !(~e <= -128); {9821#true} is VALID [2022-02-21 03:10:21,521 INFO L290 TraceCheckUtils]: 5: Hoare triple {9821#true} assume ~e - 1 <= 2147483647; {9821#true} is VALID [2022-02-21 03:10:21,521 INFO L290 TraceCheckUtils]: 6: Hoare triple {9821#true} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {9821#true} is VALID [2022-02-21 03:10:21,521 INFO L290 TraceCheckUtils]: 7: Hoare triple {9821#true} assume !(~m % 4294967296 < 16777216); {9821#true} is VALID [2022-02-21 03:10:21,522 INFO L290 TraceCheckUtils]: 8: Hoare triple {9821#true} assume 0 == ~m || 0 == ~bitwiseComplement(16777216);~m := 0; {9821#true} is VALID [2022-02-21 03:10:21,522 INFO L290 TraceCheckUtils]: 9: Hoare triple {9821#true} assume 128 + ~e <= 2147483647; {9821#true} is VALID [2022-02-21 03:10:21,522 INFO L290 TraceCheckUtils]: 10: Hoare triple {9821#true} assume 128 + ~e >= -2147483648; {9821#true} is VALID [2022-02-21 03:10:21,522 INFO L290 TraceCheckUtils]: 11: Hoare triple {9821#true} assume 16777216 * (128 + ~e) <= 2147483647; {9821#true} is VALID [2022-02-21 03:10:21,522 INFO L290 TraceCheckUtils]: 12: Hoare triple {9821#true} assume 16777216 * (128 + ~e) >= -2147483648; {9821#true} is VALID [2022-02-21 03:10:21,522 INFO L290 TraceCheckUtils]: 13: Hoare triple {9821#true} assume 128 + ~e <= 2147483647; {9821#true} is VALID [2022-02-21 03:10:21,523 INFO L290 TraceCheckUtils]: 14: Hoare triple {9821#true} assume 128 + ~e >= -2147483648; {9821#true} is VALID [2022-02-21 03:10:21,523 INFO L290 TraceCheckUtils]: 15: Hoare triple {9821#true} assume 16777216 * (128 + ~e) <= 2147483647; {9821#true} is VALID [2022-02-21 03:10:21,523 INFO L290 TraceCheckUtils]: 16: Hoare triple {9821#true} assume 16777216 * (128 + ~e) >= -2147483648; {9821#true} is VALID [2022-02-21 03:10:21,523 INFO L290 TraceCheckUtils]: 17: Hoare triple {9821#true} assume !((1 == ~m && (0 == 16777216 * (128 + ~e) || 1 == 16777216 * (128 + ~e))) || ((0 == ~m || 1 == ~m) && 1 == 16777216 * (128 + ~e))); {9821#true} is VALID [2022-02-21 03:10:21,523 INFO L290 TraceCheckUtils]: 18: Hoare triple {9821#true} assume !(0 == ~m && (0 == 16777216 * (128 + ~e) || 1 == 16777216 * (128 + ~e))); {9821#true} is VALID [2022-02-21 03:10:21,523 INFO L290 TraceCheckUtils]: 19: Hoare triple {9821#true} assume !((0 == ~m || 1 == ~m) && 0 == 16777216 * (128 + ~e)); {9821#true} is VALID [2022-02-21 03:10:21,523 INFO L290 TraceCheckUtils]: 20: Hoare triple {9821#true} assume ~m >= 0 && 16777216 * (128 + ~e) >= 0;abs_77 := (if ~m < 16777216 * (128 + ~e) then 16777216 * (128 + ~e) else ~m);assume ~m >= 0 && 16777216 * (128 + ~e) >= 0;assume ~res~0 >= abs_77; {9821#true} is VALID [2022-02-21 03:10:21,524 INFO L290 TraceCheckUtils]: 21: Hoare triple {9821#true} ~__retres4~0 := ~res~0; {9821#true} is VALID [2022-02-21 03:10:21,524 INFO L290 TraceCheckUtils]: 22: Hoare triple {9821#true} #res := ~__retres4~0; {9821#true} is VALID [2022-02-21 03:10:21,524 INFO L290 TraceCheckUtils]: 23: Hoare triple {9821#true} assume true; {9821#true} is VALID [2022-02-21 03:10:21,525 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {9821#true} {9823#(<= 0 (+ |ULTIMATE.start_main_~ea~2#1| 128))} #396#return; {9823#(<= 0 (+ |ULTIMATE.start_main_~ea~2#1| 128))} is VALID [2022-02-21 03:10:21,525 INFO L290 TraceCheckUtils]: 0: Hoare triple {9821#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(21, 2);call #Ultimate.allocInit(12, 3); {9821#true} is VALID [2022-02-21 03:10:21,525 INFO L290 TraceCheckUtils]: 1: Hoare triple {9821#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~ret22#1, main_#t~ret23#1, main_#t~ret24#1, main_#t~ret25#1, main_#t~ret26#1, main_~a~0#1, main_~ma~2#1, main_~ea~2#1, main_~b~0#1, main_~mb~2#1, main_~eb~2#1, main_~r_mul~0#1, main_~zero~0#1, main_~one~0#1, main_~sb~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~tmp___1~0#1, main_~__retres16~0#1;havoc main_~a~0#1;main_~ma~2#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;main_~ea~2#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1;havoc main_~b~0#1;main_~mb~2#1 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;main_~eb~2#1 := main_#t~nondet21#1;havoc main_#t~nondet21#1;havoc main_~r_mul~0#1;havoc main_~zero~0#1;havoc main_~one~0#1;havoc main_~sb~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~tmp___1~0#1;havoc main_~__retres16~0#1; {9823#(<= 0 (+ |ULTIMATE.start_main_~ea~2#1| 128))} is VALID [2022-02-21 03:10:21,526 INFO L272 TraceCheckUtils]: 2: Hoare triple {9823#(<= 0 (+ |ULTIMATE.start_main_~ea~2#1| 128))} call main_#t~ret22#1 := base2flt(0, 0); {9856#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} is VALID [2022-02-21 03:10:21,526 INFO L290 TraceCheckUtils]: 3: Hoare triple {9856#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {9821#true} is VALID [2022-02-21 03:10:21,526 INFO L290 TraceCheckUtils]: 4: Hoare triple {9821#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {9821#true} is VALID [2022-02-21 03:10:21,527 INFO L290 TraceCheckUtils]: 5: Hoare triple {9821#true} #res := ~__retres4~0; {9821#true} is VALID [2022-02-21 03:10:21,527 INFO L290 TraceCheckUtils]: 6: Hoare triple {9821#true} assume true; {9821#true} is VALID [2022-02-21 03:10:21,527 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {9821#true} {9823#(<= 0 (+ |ULTIMATE.start_main_~ea~2#1| 128))} #394#return; {9823#(<= 0 (+ |ULTIMATE.start_main_~ea~2#1| 128))} is VALID [2022-02-21 03:10:21,528 INFO L290 TraceCheckUtils]: 8: Hoare triple {9823#(<= 0 (+ |ULTIMATE.start_main_~ea~2#1| 128))} main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1; {9823#(<= 0 (+ |ULTIMATE.start_main_~ea~2#1| 128))} is VALID [2022-02-21 03:10:21,528 INFO L272 TraceCheckUtils]: 9: Hoare triple {9823#(<= 0 (+ |ULTIMATE.start_main_~ea~2#1| 128))} call main_#t~ret23#1 := base2flt(1, 0); {9856#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} is VALID [2022-02-21 03:10:21,529 INFO L290 TraceCheckUtils]: 10: Hoare triple {9856#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {9821#true} is VALID [2022-02-21 03:10:21,529 INFO L290 TraceCheckUtils]: 11: Hoare triple {9821#true} assume !(0 == ~m % 4294967296); {9821#true} is VALID [2022-02-21 03:10:21,529 INFO L290 TraceCheckUtils]: 12: Hoare triple {9821#true} assume ~m % 4294967296 < 16777216; {9821#true} is VALID [2022-02-21 03:10:21,529 INFO L290 TraceCheckUtils]: 13: Hoare triple {9821#true} assume !false; {9821#true} is VALID [2022-02-21 03:10:21,529 INFO L290 TraceCheckUtils]: 14: Hoare triple {9821#true} assume !(~e <= -128); {9821#true} is VALID [2022-02-21 03:10:21,529 INFO L290 TraceCheckUtils]: 15: Hoare triple {9821#true} assume ~e - 1 <= 2147483647; {9821#true} is VALID [2022-02-21 03:10:21,530 INFO L290 TraceCheckUtils]: 16: Hoare triple {9821#true} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {9821#true} is VALID [2022-02-21 03:10:21,530 INFO L290 TraceCheckUtils]: 17: Hoare triple {9821#true} assume !(~m % 4294967296 < 16777216); {9821#true} is VALID [2022-02-21 03:10:21,530 INFO L290 TraceCheckUtils]: 18: Hoare triple {9821#true} assume 0 == ~m || 0 == ~bitwiseComplement(16777216);~m := 0; {9821#true} is VALID [2022-02-21 03:10:21,530 INFO L290 TraceCheckUtils]: 19: Hoare triple {9821#true} assume 128 + ~e <= 2147483647; {9821#true} is VALID [2022-02-21 03:10:21,530 INFO L290 TraceCheckUtils]: 20: Hoare triple {9821#true} assume 128 + ~e >= -2147483648; {9821#true} is VALID [2022-02-21 03:10:21,530 INFO L290 TraceCheckUtils]: 21: Hoare triple {9821#true} assume 16777216 * (128 + ~e) <= 2147483647; {9821#true} is VALID [2022-02-21 03:10:21,531 INFO L290 TraceCheckUtils]: 22: Hoare triple {9821#true} assume 16777216 * (128 + ~e) >= -2147483648; {9821#true} is VALID [2022-02-21 03:10:21,531 INFO L290 TraceCheckUtils]: 23: Hoare triple {9821#true} assume 128 + ~e <= 2147483647; {9821#true} is VALID [2022-02-21 03:10:21,531 INFO L290 TraceCheckUtils]: 24: Hoare triple {9821#true} assume 128 + ~e >= -2147483648; {9821#true} is VALID [2022-02-21 03:10:21,531 INFO L290 TraceCheckUtils]: 25: Hoare triple {9821#true} assume 16777216 * (128 + ~e) <= 2147483647; {9821#true} is VALID [2022-02-21 03:10:21,531 INFO L290 TraceCheckUtils]: 26: Hoare triple {9821#true} assume 16777216 * (128 + ~e) >= -2147483648; {9821#true} is VALID [2022-02-21 03:10:21,531 INFO L290 TraceCheckUtils]: 27: Hoare triple {9821#true} assume !((1 == ~m && (0 == 16777216 * (128 + ~e) || 1 == 16777216 * (128 + ~e))) || ((0 == ~m || 1 == ~m) && 1 == 16777216 * (128 + ~e))); {9821#true} is VALID [2022-02-21 03:10:21,532 INFO L290 TraceCheckUtils]: 28: Hoare triple {9821#true} assume !(0 == ~m && (0 == 16777216 * (128 + ~e) || 1 == 16777216 * (128 + ~e))); {9821#true} is VALID [2022-02-21 03:10:21,532 INFO L290 TraceCheckUtils]: 29: Hoare triple {9821#true} assume !((0 == ~m || 1 == ~m) && 0 == 16777216 * (128 + ~e)); {9821#true} is VALID [2022-02-21 03:10:21,532 INFO L290 TraceCheckUtils]: 30: Hoare triple {9821#true} assume ~m >= 0 && 16777216 * (128 + ~e) >= 0;abs_77 := (if ~m < 16777216 * (128 + ~e) then 16777216 * (128 + ~e) else ~m);assume ~m >= 0 && 16777216 * (128 + ~e) >= 0;assume ~res~0 >= abs_77; {9821#true} is VALID [2022-02-21 03:10:21,532 INFO L290 TraceCheckUtils]: 31: Hoare triple {9821#true} ~__retres4~0 := ~res~0; {9821#true} is VALID [2022-02-21 03:10:21,532 INFO L290 TraceCheckUtils]: 32: Hoare triple {9821#true} #res := ~__retres4~0; {9821#true} is VALID [2022-02-21 03:10:21,532 INFO L290 TraceCheckUtils]: 33: Hoare triple {9821#true} assume true; {9821#true} is VALID [2022-02-21 03:10:21,533 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {9821#true} {9823#(<= 0 (+ |ULTIMATE.start_main_~ea~2#1| 128))} #396#return; {9823#(<= 0 (+ |ULTIMATE.start_main_~ea~2#1| 128))} is VALID [2022-02-21 03:10:21,533 INFO L290 TraceCheckUtils]: 35: Hoare triple {9823#(<= 0 (+ |ULTIMATE.start_main_~ea~2#1| 128))} main_~one~0#1 := main_#t~ret23#1;havoc main_#t~ret23#1; {9823#(<= 0 (+ |ULTIMATE.start_main_~ea~2#1| 128))} is VALID [2022-02-21 03:10:21,534 INFO L272 TraceCheckUtils]: 36: Hoare triple {9823#(<= 0 (+ |ULTIMATE.start_main_~ea~2#1| 128))} call main_#t~ret24#1 := base2flt(main_~ma~2#1, main_~ea~2#1); {9854#(<= 0 (+ 128 |base2flt_#in~e|))} is VALID [2022-02-21 03:10:21,535 INFO L290 TraceCheckUtils]: 37: Hoare triple {9854#(<= 0 (+ 128 |base2flt_#in~e|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {9855#(<= 0 (+ 128 base2flt_~e))} is VALID [2022-02-21 03:10:21,535 INFO L290 TraceCheckUtils]: 38: Hoare triple {9855#(<= 0 (+ 128 base2flt_~e))} assume !(0 == ~m % 4294967296); {9855#(<= 0 (+ 128 base2flt_~e))} is VALID [2022-02-21 03:10:21,535 INFO L290 TraceCheckUtils]: 39: Hoare triple {9855#(<= 0 (+ 128 base2flt_~e))} assume !(~m % 4294967296 < 16777216); {9855#(<= 0 (+ 128 base2flt_~e))} is VALID [2022-02-21 03:10:21,536 INFO L290 TraceCheckUtils]: 40: Hoare triple {9855#(<= 0 (+ 128 base2flt_~e))} assume !false; {9855#(<= 0 (+ 128 base2flt_~e))} is VALID [2022-02-21 03:10:21,536 INFO L290 TraceCheckUtils]: 41: Hoare triple {9855#(<= 0 (+ 128 base2flt_~e))} assume ~m % 4294967296 >= 33554432; {9855#(<= 0 (+ 128 base2flt_~e))} is VALID [2022-02-21 03:10:21,537 INFO L290 TraceCheckUtils]: 42: Hoare triple {9855#(<= 0 (+ 128 base2flt_~e))} assume !(~e >= 127); {9855#(<= 0 (+ 128 base2flt_~e))} is VALID [2022-02-21 03:10:21,537 INFO L290 TraceCheckUtils]: 43: Hoare triple {9855#(<= 0 (+ 128 base2flt_~e))} assume 1 + ~e <= 2147483647; {9855#(<= 0 (+ 128 base2flt_~e))} is VALID [2022-02-21 03:10:21,538 INFO L290 TraceCheckUtils]: 44: Hoare triple {9855#(<= 0 (+ 128 base2flt_~e))} assume !(1 + ~e >= -2147483648); {9822#false} is VALID [2022-02-21 03:10:21,538 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-02-21 03:10:21,538 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:10:21,538 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634724921] [2022-02-21 03:10:21,538 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [634724921] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:10:21,539 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1439233874] [2022-02-21 03:10:21,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:10:21,539 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:10:21,539 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:10:21,540 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) [2022-02-21 03:10:21,565 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-02-21 03:10:21,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:21,607 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 03:10:21,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:21,619 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:10:21,772 INFO L290 TraceCheckUtils]: 0: Hoare triple {9821#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(21, 2);call #Ultimate.allocInit(12, 3); {9821#true} is VALID [2022-02-21 03:10:21,773 INFO L290 TraceCheckUtils]: 1: Hoare triple {9821#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~ret22#1, main_#t~ret23#1, main_#t~ret24#1, main_#t~ret25#1, main_#t~ret26#1, main_~a~0#1, main_~ma~2#1, main_~ea~2#1, main_~b~0#1, main_~mb~2#1, main_~eb~2#1, main_~r_mul~0#1, main_~zero~0#1, main_~one~0#1, main_~sb~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~tmp___1~0#1, main_~__retres16~0#1;havoc main_~a~0#1;main_~ma~2#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;main_~ea~2#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1;havoc main_~b~0#1;main_~mb~2#1 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;main_~eb~2#1 := main_#t~nondet21#1;havoc main_#t~nondet21#1;havoc main_~r_mul~0#1;havoc main_~zero~0#1;havoc main_~one~0#1;havoc main_~sb~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~tmp___1~0#1;havoc main_~__retres16~0#1; {9823#(<= 0 (+ |ULTIMATE.start_main_~ea~2#1| 128))} is VALID [2022-02-21 03:10:21,773 INFO L272 TraceCheckUtils]: 2: Hoare triple {9823#(<= 0 (+ |ULTIMATE.start_main_~ea~2#1| 128))} call main_#t~ret22#1 := base2flt(0, 0); {9821#true} is VALID [2022-02-21 03:10:21,773 INFO L290 TraceCheckUtils]: 3: Hoare triple {9821#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {9821#true} is VALID [2022-02-21 03:10:21,773 INFO L290 TraceCheckUtils]: 4: Hoare triple {9821#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {9821#true} is VALID [2022-02-21 03:10:21,773 INFO L290 TraceCheckUtils]: 5: Hoare triple {9821#true} #res := ~__retres4~0; {9821#true} is VALID [2022-02-21 03:10:21,774 INFO L290 TraceCheckUtils]: 6: Hoare triple {9821#true} assume true; {9821#true} is VALID [2022-02-21 03:10:21,774 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {9821#true} {9823#(<= 0 (+ |ULTIMATE.start_main_~ea~2#1| 128))} #394#return; {9823#(<= 0 (+ |ULTIMATE.start_main_~ea~2#1| 128))} is VALID [2022-02-21 03:10:21,775 INFO L290 TraceCheckUtils]: 8: Hoare triple {9823#(<= 0 (+ |ULTIMATE.start_main_~ea~2#1| 128))} main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1; {9823#(<= 0 (+ |ULTIMATE.start_main_~ea~2#1| 128))} is VALID [2022-02-21 03:10:21,775 INFO L272 TraceCheckUtils]: 9: Hoare triple {9823#(<= 0 (+ |ULTIMATE.start_main_~ea~2#1| 128))} call main_#t~ret23#1 := base2flt(1, 0); {9821#true} is VALID [2022-02-21 03:10:21,775 INFO L290 TraceCheckUtils]: 10: Hoare triple {9821#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {9821#true} is VALID [2022-02-21 03:10:21,775 INFO L290 TraceCheckUtils]: 11: Hoare triple {9821#true} assume !(0 == ~m % 4294967296); {9821#true} is VALID [2022-02-21 03:10:21,775 INFO L290 TraceCheckUtils]: 12: Hoare triple {9821#true} assume ~m % 4294967296 < 16777216; {9821#true} is VALID [2022-02-21 03:10:21,776 INFO L290 TraceCheckUtils]: 13: Hoare triple {9821#true} assume !false; {9821#true} is VALID [2022-02-21 03:10:21,776 INFO L290 TraceCheckUtils]: 14: Hoare triple {9821#true} assume !(~e <= -128); {9821#true} is VALID [2022-02-21 03:10:21,776 INFO L290 TraceCheckUtils]: 15: Hoare triple {9821#true} assume ~e - 1 <= 2147483647; {9821#true} is VALID [2022-02-21 03:10:21,776 INFO L290 TraceCheckUtils]: 16: Hoare triple {9821#true} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {9821#true} is VALID [2022-02-21 03:10:21,776 INFO L290 TraceCheckUtils]: 17: Hoare triple {9821#true} assume !(~m % 4294967296 < 16777216); {9821#true} is VALID [2022-02-21 03:10:21,776 INFO L290 TraceCheckUtils]: 18: Hoare triple {9821#true} assume 0 == ~m || 0 == ~bitwiseComplement(16777216);~m := 0; {9821#true} is VALID [2022-02-21 03:10:21,777 INFO L290 TraceCheckUtils]: 19: Hoare triple {9821#true} assume 128 + ~e <= 2147483647; {9821#true} is VALID [2022-02-21 03:10:21,777 INFO L290 TraceCheckUtils]: 20: Hoare triple {9821#true} assume 128 + ~e >= -2147483648; {9821#true} is VALID [2022-02-21 03:10:21,777 INFO L290 TraceCheckUtils]: 21: Hoare triple {9821#true} assume 16777216 * (128 + ~e) <= 2147483647; {9821#true} is VALID [2022-02-21 03:10:21,777 INFO L290 TraceCheckUtils]: 22: Hoare triple {9821#true} assume 16777216 * (128 + ~e) >= -2147483648; {9821#true} is VALID [2022-02-21 03:10:21,777 INFO L290 TraceCheckUtils]: 23: Hoare triple {9821#true} assume 128 + ~e <= 2147483647; {9821#true} is VALID [2022-02-21 03:10:21,777 INFO L290 TraceCheckUtils]: 24: Hoare triple {9821#true} assume 128 + ~e >= -2147483648; {9821#true} is VALID [2022-02-21 03:10:21,777 INFO L290 TraceCheckUtils]: 25: Hoare triple {9821#true} assume 16777216 * (128 + ~e) <= 2147483647; {9821#true} is VALID [2022-02-21 03:10:21,778 INFO L290 TraceCheckUtils]: 26: Hoare triple {9821#true} assume 16777216 * (128 + ~e) >= -2147483648; {9821#true} is VALID [2022-02-21 03:10:21,778 INFO L290 TraceCheckUtils]: 27: Hoare triple {9821#true} assume !((1 == ~m && (0 == 16777216 * (128 + ~e) || 1 == 16777216 * (128 + ~e))) || ((0 == ~m || 1 == ~m) && 1 == 16777216 * (128 + ~e))); {9821#true} is VALID [2022-02-21 03:10:21,778 INFO L290 TraceCheckUtils]: 28: Hoare triple {9821#true} assume !(0 == ~m && (0 == 16777216 * (128 + ~e) || 1 == 16777216 * (128 + ~e))); {9821#true} is VALID [2022-02-21 03:10:21,778 INFO L290 TraceCheckUtils]: 29: Hoare triple {9821#true} assume !((0 == ~m || 1 == ~m) && 0 == 16777216 * (128 + ~e)); {9821#true} is VALID [2022-02-21 03:10:21,778 INFO L290 TraceCheckUtils]: 30: Hoare triple {9821#true} assume ~m >= 0 && 16777216 * (128 + ~e) >= 0;abs_77 := (if ~m < 16777216 * (128 + ~e) then 16777216 * (128 + ~e) else ~m);assume ~m >= 0 && 16777216 * (128 + ~e) >= 0;assume ~res~0 >= abs_77; {9821#true} is VALID [2022-02-21 03:10:21,781 INFO L290 TraceCheckUtils]: 31: Hoare triple {9821#true} ~__retres4~0 := ~res~0; {9821#true} is VALID [2022-02-21 03:10:21,782 INFO L290 TraceCheckUtils]: 32: Hoare triple {9821#true} #res := ~__retres4~0; {9821#true} is VALID [2022-02-21 03:10:21,782 INFO L290 TraceCheckUtils]: 33: Hoare triple {9821#true} assume true; {9821#true} is VALID [2022-02-21 03:10:21,783 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {9821#true} {9823#(<= 0 (+ |ULTIMATE.start_main_~ea~2#1| 128))} #396#return; {9823#(<= 0 (+ |ULTIMATE.start_main_~ea~2#1| 128))} is VALID [2022-02-21 03:10:21,783 INFO L290 TraceCheckUtils]: 35: Hoare triple {9823#(<= 0 (+ |ULTIMATE.start_main_~ea~2#1| 128))} main_~one~0#1 := main_#t~ret23#1;havoc main_#t~ret23#1; {9823#(<= 0 (+ |ULTIMATE.start_main_~ea~2#1| 128))} is VALID [2022-02-21 03:10:21,784 INFO L272 TraceCheckUtils]: 36: Hoare triple {9823#(<= 0 (+ |ULTIMATE.start_main_~ea~2#1| 128))} call main_#t~ret24#1 := base2flt(main_~ma~2#1, main_~ea~2#1); {9854#(<= 0 (+ 128 |base2flt_#in~e|))} is VALID [2022-02-21 03:10:21,784 INFO L290 TraceCheckUtils]: 37: Hoare triple {9854#(<= 0 (+ 128 |base2flt_#in~e|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {9855#(<= 0 (+ 128 base2flt_~e))} is VALID [2022-02-21 03:10:21,785 INFO L290 TraceCheckUtils]: 38: Hoare triple {9855#(<= 0 (+ 128 base2flt_~e))} assume !(0 == ~m % 4294967296); {9855#(<= 0 (+ 128 base2flt_~e))} is VALID [2022-02-21 03:10:21,785 INFO L290 TraceCheckUtils]: 39: Hoare triple {9855#(<= 0 (+ 128 base2flt_~e))} assume !(~m % 4294967296 < 16777216); {9855#(<= 0 (+ 128 base2flt_~e))} is VALID [2022-02-21 03:10:21,785 INFO L290 TraceCheckUtils]: 40: Hoare triple {9855#(<= 0 (+ 128 base2flt_~e))} assume !false; {9855#(<= 0 (+ 128 base2flt_~e))} is VALID [2022-02-21 03:10:21,786 INFO L290 TraceCheckUtils]: 41: Hoare triple {9855#(<= 0 (+ 128 base2flt_~e))} assume ~m % 4294967296 >= 33554432; {9855#(<= 0 (+ 128 base2flt_~e))} is VALID [2022-02-21 03:10:21,786 INFO L290 TraceCheckUtils]: 42: Hoare triple {9855#(<= 0 (+ 128 base2flt_~e))} assume !(~e >= 127); {9855#(<= 0 (+ 128 base2flt_~e))} is VALID [2022-02-21 03:10:21,787 INFO L290 TraceCheckUtils]: 43: Hoare triple {9855#(<= 0 (+ 128 base2flt_~e))} assume 1 + ~e <= 2147483647; {9855#(<= 0 (+ 128 base2flt_~e))} is VALID [2022-02-21 03:10:21,787 INFO L290 TraceCheckUtils]: 44: Hoare triple {9855#(<= 0 (+ 128 base2flt_~e))} assume !(1 + ~e >= -2147483648); {9822#false} is VALID [2022-02-21 03:10:21,787 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-02-21 03:10:21,787 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-21 03:10:21,788 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1439233874] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:10:21,788 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-21 03:10:21,788 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2022-02-21 03:10:21,788 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361801318] [2022-02-21 03:10:21,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:10:21,790 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 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 45 [2022-02-21 03:10:21,790 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:10:21,791 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 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) [2022-02-21 03:10:21,817 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:10:21,818 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-21 03:10:21,818 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:10:21,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-21 03:10:21,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-21 03:10:21,819 INFO L87 Difference]: Start difference. First operand 290 states and 386 transitions. Second operand has 5 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 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) [2022-02-21 03:10:22,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:22,346 INFO L93 Difference]: Finished difference Result 316 states and 410 transitions. [2022-02-21 03:10:22,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-21 03:10:22,346 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 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 45 [2022-02-21 03:10:22,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:10:22,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 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) [2022-02-21 03:10:22,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 237 transitions. [2022-02-21 03:10:22,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 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) [2022-02-21 03:10:22,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 237 transitions. [2022-02-21 03:10:22,351 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 237 transitions. [2022-02-21 03:10:22,543 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 237 edges. 237 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:10:22,550 INFO L225 Difference]: With dead ends: 316 [2022-02-21 03:10:22,550 INFO L226 Difference]: Without dead ends: 311 [2022-02-21 03:10:22,551 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-02-21 03:10:22,553 INFO L933 BasicCegarLoop]: 142 mSDtfsCounter, 171 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 449 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-21 03:10:22,553 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [174 Valid, 449 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-21 03:10:22,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2022-02-21 03:10:22,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 270. [2022-02-21 03:10:22,650 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:10:22,650 INFO L82 GeneralOperation]: Start isEquivalent. First operand 311 states. Second operand has 270 states, 238 states have (on average 1.4411764705882353) internal successors, (343), 261 states have internal predecessors, (343), 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) [2022-02-21 03:10:22,652 INFO L74 IsIncluded]: Start isIncluded. First operand 311 states. Second operand has 270 states, 238 states have (on average 1.4411764705882353) internal successors, (343), 261 states have internal predecessors, (343), 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) [2022-02-21 03:10:22,652 INFO L87 Difference]: Start difference. First operand 311 states. Second operand has 270 states, 238 states have (on average 1.4411764705882353) internal successors, (343), 261 states have internal predecessors, (343), 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) [2022-02-21 03:10:22,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:22,659 INFO L93 Difference]: Finished difference Result 311 states and 401 transitions. [2022-02-21 03:10:22,659 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 401 transitions. [2022-02-21 03:10:22,660 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:10:22,660 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:10:22,661 INFO L74 IsIncluded]: Start isIncluded. First operand has 270 states, 238 states have (on average 1.4411764705882353) internal successors, (343), 261 states have internal predecessors, (343), 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) Second operand 311 states. [2022-02-21 03:10:22,662 INFO L87 Difference]: Start difference. First operand has 270 states, 238 states have (on average 1.4411764705882353) internal successors, (343), 261 states have internal predecessors, (343), 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) Second operand 311 states. [2022-02-21 03:10:22,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:22,669 INFO L93 Difference]: Finished difference Result 311 states and 401 transitions. [2022-02-21 03:10:22,670 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 401 transitions. [2022-02-21 03:10:22,670 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:10:22,670 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:10:22,670 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:10:22,671 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:10:22,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 238 states have (on average 1.4411764705882353) internal successors, (343), 261 states have internal predecessors, (343), 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) [2022-02-21 03:10:22,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 351 transitions. [2022-02-21 03:10:22,677 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 351 transitions. Word has length 45 [2022-02-21 03:10:22,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:10:22,677 INFO L470 AbstractCegarLoop]: Abstraction has 270 states and 351 transitions. [2022-02-21 03:10:22,677 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 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) [2022-02-21 03:10:22,677 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 351 transitions. [2022-02-21 03:10:22,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-02-21 03:10:22,678 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:10:22,678 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:10:22,706 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-02-21 03:10:22,905 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:10:22,906 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting base2fltErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2022-02-21 03:10:22,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:10:22,906 INFO L85 PathProgramCache]: Analyzing trace with hash 132146510, now seen corresponding path program 1 times [2022-02-21 03:10:22,906 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:10:22,906 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618530038] [2022-02-21 03:10:22,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:10:22,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:10:22,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:22,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-21 03:10:22,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:22,949 INFO L290 TraceCheckUtils]: 0: Hoare triple {11295#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {11263#true} is VALID [2022-02-21 03:10:22,949 INFO L290 TraceCheckUtils]: 1: Hoare triple {11263#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {11263#true} is VALID [2022-02-21 03:10:22,949 INFO L290 TraceCheckUtils]: 2: Hoare triple {11263#true} #res := ~__retres4~0; {11263#true} is VALID [2022-02-21 03:10:22,949 INFO L290 TraceCheckUtils]: 3: Hoare triple {11263#true} assume true; {11263#true} is VALID [2022-02-21 03:10:22,949 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {11263#true} {11263#true} #394#return; {11263#true} is VALID [2022-02-21 03:10:22,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-02-21 03:10:22,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:23,022 INFO L290 TraceCheckUtils]: 0: Hoare triple {11295#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {11296#(or (= base2flt_~m |base2flt_#in~m|) (= (+ (- 1) base2flt_~m) 0))} is VALID [2022-02-21 03:10:23,022 INFO L290 TraceCheckUtils]: 1: Hoare triple {11296#(or (= base2flt_~m |base2flt_#in~m|) (= (+ (- 1) base2flt_~m) 0))} assume !(0 == ~m % 4294967296); {11296#(or (= base2flt_~m |base2flt_#in~m|) (= (+ (- 1) base2flt_~m) 0))} is VALID [2022-02-21 03:10:23,023 INFO L290 TraceCheckUtils]: 2: Hoare triple {11296#(or (= base2flt_~m |base2flt_#in~m|) (= (+ (- 1) base2flt_~m) 0))} assume ~m % 4294967296 < 16777216; {11296#(or (= base2flt_~m |base2flt_#in~m|) (= (+ (- 1) base2flt_~m) 0))} is VALID [2022-02-21 03:10:23,023 INFO L290 TraceCheckUtils]: 3: Hoare triple {11296#(or (= base2flt_~m |base2flt_#in~m|) (= (+ (- 1) base2flt_~m) 0))} assume !false; {11296#(or (= base2flt_~m |base2flt_#in~m|) (= (+ (- 1) base2flt_~m) 0))} is VALID [2022-02-21 03:10:23,024 INFO L290 TraceCheckUtils]: 4: Hoare triple {11296#(or (= base2flt_~m |base2flt_#in~m|) (= (+ (- 1) base2flt_~m) 0))} assume !(~e <= -128); {11296#(or (= base2flt_~m |base2flt_#in~m|) (= (+ (- 1) base2flt_~m) 0))} is VALID [2022-02-21 03:10:23,024 INFO L290 TraceCheckUtils]: 5: Hoare triple {11296#(or (= base2flt_~m |base2flt_#in~m|) (= (+ (- 1) base2flt_~m) 0))} assume ~e - 1 <= 2147483647; {11296#(or (= base2flt_~m |base2flt_#in~m|) (= (+ (- 1) base2flt_~m) 0))} is VALID [2022-02-21 03:10:23,025 INFO L290 TraceCheckUtils]: 6: Hoare triple {11296#(or (= base2flt_~m |base2flt_#in~m|) (= (+ (- 1) base2flt_~m) 0))} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {11297#(or (and (<= base2flt_~m 2) (not (<= (+ (div base2flt_~m 4294967296) 1) 0))) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:23,025 INFO L290 TraceCheckUtils]: 7: Hoare triple {11297#(or (and (<= base2flt_~m 2) (not (<= (+ (div base2flt_~m 4294967296) 1) 0))) (not (= |base2flt_#in~m| 1)))} assume !(~m % 4294967296 < 16777216); {11298#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:23,026 INFO L290 TraceCheckUtils]: 8: Hoare triple {11298#(not (= |base2flt_#in~m| 1))} assume 0 == ~m || 0 == ~bitwiseComplement(16777216);~m := 0; {11298#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:23,026 INFO L290 TraceCheckUtils]: 9: Hoare triple {11298#(not (= |base2flt_#in~m| 1))} assume 128 + ~e <= 2147483647; {11298#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:23,026 INFO L290 TraceCheckUtils]: 10: Hoare triple {11298#(not (= |base2flt_#in~m| 1))} assume 128 + ~e >= -2147483648; {11298#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:23,027 INFO L290 TraceCheckUtils]: 11: Hoare triple {11298#(not (= |base2flt_#in~m| 1))} assume 16777216 * (128 + ~e) <= 2147483647; {11298#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:23,027 INFO L290 TraceCheckUtils]: 12: Hoare triple {11298#(not (= |base2flt_#in~m| 1))} assume 16777216 * (128 + ~e) >= -2147483648; {11298#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:23,027 INFO L290 TraceCheckUtils]: 13: Hoare triple {11298#(not (= |base2flt_#in~m| 1))} assume 128 + ~e <= 2147483647; {11298#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:23,028 INFO L290 TraceCheckUtils]: 14: Hoare triple {11298#(not (= |base2flt_#in~m| 1))} assume 128 + ~e >= -2147483648; {11298#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:23,028 INFO L290 TraceCheckUtils]: 15: Hoare triple {11298#(not (= |base2flt_#in~m| 1))} assume 16777216 * (128 + ~e) <= 2147483647; {11298#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:23,029 INFO L290 TraceCheckUtils]: 16: Hoare triple {11298#(not (= |base2flt_#in~m| 1))} assume 16777216 * (128 + ~e) >= -2147483648; {11298#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:23,029 INFO L290 TraceCheckUtils]: 17: Hoare triple {11298#(not (= |base2flt_#in~m| 1))} assume !((1 == ~m && (0 == 16777216 * (128 + ~e) || 1 == 16777216 * (128 + ~e))) || ((0 == ~m || 1 == ~m) && 1 == 16777216 * (128 + ~e))); {11298#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:23,029 INFO L290 TraceCheckUtils]: 18: Hoare triple {11298#(not (= |base2flt_#in~m| 1))} assume !(0 == ~m && (0 == 16777216 * (128 + ~e) || 1 == 16777216 * (128 + ~e))); {11298#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:23,030 INFO L290 TraceCheckUtils]: 19: Hoare triple {11298#(not (= |base2flt_#in~m| 1))} assume !((0 == ~m || 1 == ~m) && 0 == 16777216 * (128 + ~e)); {11298#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:23,030 INFO L290 TraceCheckUtils]: 20: Hoare triple {11298#(not (= |base2flt_#in~m| 1))} assume ~m >= 0 && 16777216 * (128 + ~e) >= 0;abs_77 := (if ~m < 16777216 * (128 + ~e) then 16777216 * (128 + ~e) else ~m);assume ~m >= 0 && 16777216 * (128 + ~e) >= 0;assume ~res~0 >= abs_77; {11298#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:23,030 INFO L290 TraceCheckUtils]: 21: Hoare triple {11298#(not (= |base2flt_#in~m| 1))} ~__retres4~0 := ~res~0; {11298#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:23,031 INFO L290 TraceCheckUtils]: 22: Hoare triple {11298#(not (= |base2flt_#in~m| 1))} #res := ~__retres4~0; {11298#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:23,031 INFO L290 TraceCheckUtils]: 23: Hoare triple {11298#(not (= |base2flt_#in~m| 1))} assume true; {11298#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:23,032 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {11298#(not (= |base2flt_#in~m| 1))} {11263#true} #396#return; {11264#false} is VALID [2022-02-21 03:10:23,032 INFO L290 TraceCheckUtils]: 0: Hoare triple {11263#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(21, 2);call #Ultimate.allocInit(12, 3); {11263#true} is VALID [2022-02-21 03:10:23,032 INFO L290 TraceCheckUtils]: 1: Hoare triple {11263#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~ret22#1, main_#t~ret23#1, main_#t~ret24#1, main_#t~ret25#1, main_#t~ret26#1, main_~a~0#1, main_~ma~2#1, main_~ea~2#1, main_~b~0#1, main_~mb~2#1, main_~eb~2#1, main_~r_mul~0#1, main_~zero~0#1, main_~one~0#1, main_~sb~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~tmp___1~0#1, main_~__retres16~0#1;havoc main_~a~0#1;main_~ma~2#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;main_~ea~2#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1;havoc main_~b~0#1;main_~mb~2#1 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;main_~eb~2#1 := main_#t~nondet21#1;havoc main_#t~nondet21#1;havoc main_~r_mul~0#1;havoc main_~zero~0#1;havoc main_~one~0#1;havoc main_~sb~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~tmp___1~0#1;havoc main_~__retres16~0#1; {11263#true} is VALID [2022-02-21 03:10:23,033 INFO L272 TraceCheckUtils]: 2: Hoare triple {11263#true} call main_#t~ret22#1 := base2flt(0, 0); {11295#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} is VALID [2022-02-21 03:10:23,033 INFO L290 TraceCheckUtils]: 3: Hoare triple {11295#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {11263#true} is VALID [2022-02-21 03:10:23,033 INFO L290 TraceCheckUtils]: 4: Hoare triple {11263#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {11263#true} is VALID [2022-02-21 03:10:23,033 INFO L290 TraceCheckUtils]: 5: Hoare triple {11263#true} #res := ~__retres4~0; {11263#true} is VALID [2022-02-21 03:10:23,034 INFO L290 TraceCheckUtils]: 6: Hoare triple {11263#true} assume true; {11263#true} is VALID [2022-02-21 03:10:23,034 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {11263#true} {11263#true} #394#return; {11263#true} is VALID [2022-02-21 03:10:23,034 INFO L290 TraceCheckUtils]: 8: Hoare triple {11263#true} main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1; {11263#true} is VALID [2022-02-21 03:10:23,034 INFO L272 TraceCheckUtils]: 9: Hoare triple {11263#true} call main_#t~ret23#1 := base2flt(1, 0); {11295#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} is VALID [2022-02-21 03:10:23,035 INFO L290 TraceCheckUtils]: 10: Hoare triple {11295#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {11296#(or (= base2flt_~m |base2flt_#in~m|) (= (+ (- 1) base2flt_~m) 0))} is VALID [2022-02-21 03:10:23,035 INFO L290 TraceCheckUtils]: 11: Hoare triple {11296#(or (= base2flt_~m |base2flt_#in~m|) (= (+ (- 1) base2flt_~m) 0))} assume !(0 == ~m % 4294967296); {11296#(or (= base2flt_~m |base2flt_#in~m|) (= (+ (- 1) base2flt_~m) 0))} is VALID [2022-02-21 03:10:23,036 INFO L290 TraceCheckUtils]: 12: Hoare triple {11296#(or (= base2flt_~m |base2flt_#in~m|) (= (+ (- 1) base2flt_~m) 0))} assume ~m % 4294967296 < 16777216; {11296#(or (= base2flt_~m |base2flt_#in~m|) (= (+ (- 1) base2flt_~m) 0))} is VALID [2022-02-21 03:10:23,036 INFO L290 TraceCheckUtils]: 13: Hoare triple {11296#(or (= base2flt_~m |base2flt_#in~m|) (= (+ (- 1) base2flt_~m) 0))} assume !false; {11296#(or (= base2flt_~m |base2flt_#in~m|) (= (+ (- 1) base2flt_~m) 0))} is VALID [2022-02-21 03:10:23,036 INFO L290 TraceCheckUtils]: 14: Hoare triple {11296#(or (= base2flt_~m |base2flt_#in~m|) (= (+ (- 1) base2flt_~m) 0))} assume !(~e <= -128); {11296#(or (= base2flt_~m |base2flt_#in~m|) (= (+ (- 1) base2flt_~m) 0))} is VALID [2022-02-21 03:10:23,037 INFO L290 TraceCheckUtils]: 15: Hoare triple {11296#(or (= base2flt_~m |base2flt_#in~m|) (= (+ (- 1) base2flt_~m) 0))} assume ~e - 1 <= 2147483647; {11296#(or (= base2flt_~m |base2flt_#in~m|) (= (+ (- 1) base2flt_~m) 0))} is VALID [2022-02-21 03:10:23,037 INFO L290 TraceCheckUtils]: 16: Hoare triple {11296#(or (= base2flt_~m |base2flt_#in~m|) (= (+ (- 1) base2flt_~m) 0))} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {11297#(or (and (<= base2flt_~m 2) (not (<= (+ (div base2flt_~m 4294967296) 1) 0))) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:23,038 INFO L290 TraceCheckUtils]: 17: Hoare triple {11297#(or (and (<= base2flt_~m 2) (not (<= (+ (div base2flt_~m 4294967296) 1) 0))) (not (= |base2flt_#in~m| 1)))} assume !(~m % 4294967296 < 16777216); {11298#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:23,038 INFO L290 TraceCheckUtils]: 18: Hoare triple {11298#(not (= |base2flt_#in~m| 1))} assume 0 == ~m || 0 == ~bitwiseComplement(16777216);~m := 0; {11298#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:23,039 INFO L290 TraceCheckUtils]: 19: Hoare triple {11298#(not (= |base2flt_#in~m| 1))} assume 128 + ~e <= 2147483647; {11298#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:23,039 INFO L290 TraceCheckUtils]: 20: Hoare triple {11298#(not (= |base2flt_#in~m| 1))} assume 128 + ~e >= -2147483648; {11298#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:23,039 INFO L290 TraceCheckUtils]: 21: Hoare triple {11298#(not (= |base2flt_#in~m| 1))} assume 16777216 * (128 + ~e) <= 2147483647; {11298#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:23,040 INFO L290 TraceCheckUtils]: 22: Hoare triple {11298#(not (= |base2flt_#in~m| 1))} assume 16777216 * (128 + ~e) >= -2147483648; {11298#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:23,040 INFO L290 TraceCheckUtils]: 23: Hoare triple {11298#(not (= |base2flt_#in~m| 1))} assume 128 + ~e <= 2147483647; {11298#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:23,040 INFO L290 TraceCheckUtils]: 24: Hoare triple {11298#(not (= |base2flt_#in~m| 1))} assume 128 + ~e >= -2147483648; {11298#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:23,041 INFO L290 TraceCheckUtils]: 25: Hoare triple {11298#(not (= |base2flt_#in~m| 1))} assume 16777216 * (128 + ~e) <= 2147483647; {11298#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:23,041 INFO L290 TraceCheckUtils]: 26: Hoare triple {11298#(not (= |base2flt_#in~m| 1))} assume 16777216 * (128 + ~e) >= -2147483648; {11298#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:23,041 INFO L290 TraceCheckUtils]: 27: Hoare triple {11298#(not (= |base2flt_#in~m| 1))} assume !((1 == ~m && (0 == 16777216 * (128 + ~e) || 1 == 16777216 * (128 + ~e))) || ((0 == ~m || 1 == ~m) && 1 == 16777216 * (128 + ~e))); {11298#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:23,042 INFO L290 TraceCheckUtils]: 28: Hoare triple {11298#(not (= |base2flt_#in~m| 1))} assume !(0 == ~m && (0 == 16777216 * (128 + ~e) || 1 == 16777216 * (128 + ~e))); {11298#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:23,042 INFO L290 TraceCheckUtils]: 29: Hoare triple {11298#(not (= |base2flt_#in~m| 1))} assume !((0 == ~m || 1 == ~m) && 0 == 16777216 * (128 + ~e)); {11298#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:23,043 INFO L290 TraceCheckUtils]: 30: Hoare triple {11298#(not (= |base2flt_#in~m| 1))} assume ~m >= 0 && 16777216 * (128 + ~e) >= 0;abs_77 := (if ~m < 16777216 * (128 + ~e) then 16777216 * (128 + ~e) else ~m);assume ~m >= 0 && 16777216 * (128 + ~e) >= 0;assume ~res~0 >= abs_77; {11298#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:23,043 INFO L290 TraceCheckUtils]: 31: Hoare triple {11298#(not (= |base2flt_#in~m| 1))} ~__retres4~0 := ~res~0; {11298#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:23,043 INFO L290 TraceCheckUtils]: 32: Hoare triple {11298#(not (= |base2flt_#in~m| 1))} #res := ~__retres4~0; {11298#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:23,044 INFO L290 TraceCheckUtils]: 33: Hoare triple {11298#(not (= |base2flt_#in~m| 1))} assume true; {11298#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:23,044 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {11298#(not (= |base2flt_#in~m| 1))} {11263#true} #396#return; {11264#false} is VALID [2022-02-21 03:10:23,044 INFO L290 TraceCheckUtils]: 35: Hoare triple {11264#false} main_~one~0#1 := main_#t~ret23#1;havoc main_#t~ret23#1; {11264#false} is VALID [2022-02-21 03:10:23,045 INFO L272 TraceCheckUtils]: 36: Hoare triple {11264#false} call main_#t~ret24#1 := base2flt(main_~ma~2#1, main_~ea~2#1); {11264#false} is VALID [2022-02-21 03:10:23,045 INFO L290 TraceCheckUtils]: 37: Hoare triple {11264#false} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {11264#false} is VALID [2022-02-21 03:10:23,045 INFO L290 TraceCheckUtils]: 38: Hoare triple {11264#false} assume !(0 == ~m % 4294967296); {11264#false} is VALID [2022-02-21 03:10:23,045 INFO L290 TraceCheckUtils]: 39: Hoare triple {11264#false} assume !(~m % 4294967296 < 16777216); {11264#false} is VALID [2022-02-21 03:10:23,045 INFO L290 TraceCheckUtils]: 40: Hoare triple {11264#false} assume !false; {11264#false} is VALID [2022-02-21 03:10:23,045 INFO L290 TraceCheckUtils]: 41: Hoare triple {11264#false} assume !(~m % 4294967296 >= 33554432); {11264#false} is VALID [2022-02-21 03:10:23,045 INFO L290 TraceCheckUtils]: 42: Hoare triple {11264#false} assume 0 == ~m || 0 == ~bitwiseComplement(16777216);~m := 0; {11264#false} is VALID [2022-02-21 03:10:23,046 INFO L290 TraceCheckUtils]: 43: Hoare triple {11264#false} assume 128 + ~e <= 2147483647; {11264#false} is VALID [2022-02-21 03:10:23,046 INFO L290 TraceCheckUtils]: 44: Hoare triple {11264#false} assume 128 + ~e >= -2147483648; {11264#false} is VALID [2022-02-21 03:10:23,046 INFO L290 TraceCheckUtils]: 45: Hoare triple {11264#false} assume !(16777216 * (128 + ~e) <= 2147483647); {11264#false} is VALID [2022-02-21 03:10:23,046 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-21 03:10:23,046 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:10:23,047 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618530038] [2022-02-21 03:10:23,047 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1618530038] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:10:23,047 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:10:23,047 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-21 03:10:23,047 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065856983] [2022-02-21 03:10:23,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:10:23,048 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 46 [2022-02-21 03:10:23,048 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:10:23,048 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-21 03:10:23,083 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:10:23,083 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-21 03:10:23,083 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:10:23,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-21 03:10:23,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-02-21 03:10:23,084 INFO L87 Difference]: Start difference. First operand 270 states and 351 transitions. Second operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-21 03:10:23,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:23,921 INFO L93 Difference]: Finished difference Result 875 states and 1119 transitions. [2022-02-21 03:10:23,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-21 03:10:23,921 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 46 [2022-02-21 03:10:23,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:10:23,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-21 03:10:23,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 499 transitions. [2022-02-21 03:10:23,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-21 03:10:23,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 499 transitions. [2022-02-21 03:10:23,951 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 499 transitions. [2022-02-21 03:10:24,357 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 499 edges. 499 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:10:24,381 INFO L225 Difference]: With dead ends: 875 [2022-02-21 03:10:24,381 INFO L226 Difference]: Without dead ends: 648 [2022-02-21 03:10:24,382 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2022-02-21 03:10:24,382 INFO L933 BasicCegarLoop]: 152 mSDtfsCounter, 336 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 336 SdHoareTripleChecker+Valid, 438 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-21 03:10:24,383 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [336 Valid, 438 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-21 03:10:24,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 648 states. [2022-02-21 03:10:24,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 648 to 270. [2022-02-21 03:10:24,468 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:10:24,469 INFO L82 GeneralOperation]: Start isEquivalent. First operand 648 states. Second operand has 270 states, 238 states have (on average 1.4369747899159664) internal successors, (342), 261 states have internal predecessors, (342), 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) [2022-02-21 03:10:24,469 INFO L74 IsIncluded]: Start isIncluded. First operand 648 states. Second operand has 270 states, 238 states have (on average 1.4369747899159664) internal successors, (342), 261 states have internal predecessors, (342), 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) [2022-02-21 03:10:24,470 INFO L87 Difference]: Start difference. First operand 648 states. Second operand has 270 states, 238 states have (on average 1.4369747899159664) internal successors, (342), 261 states have internal predecessors, (342), 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) [2022-02-21 03:10:24,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:24,490 INFO L93 Difference]: Finished difference Result 648 states and 821 transitions. [2022-02-21 03:10:24,490 INFO L276 IsEmpty]: Start isEmpty. Operand 648 states and 821 transitions. [2022-02-21 03:10:24,491 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:10:24,491 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:10:24,492 INFO L74 IsIncluded]: Start isIncluded. First operand has 270 states, 238 states have (on average 1.4369747899159664) internal successors, (342), 261 states have internal predecessors, (342), 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) Second operand 648 states. [2022-02-21 03:10:24,492 INFO L87 Difference]: Start difference. First operand has 270 states, 238 states have (on average 1.4369747899159664) internal successors, (342), 261 states have internal predecessors, (342), 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) Second operand 648 states. [2022-02-21 03:10:24,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:24,512 INFO L93 Difference]: Finished difference Result 648 states and 821 transitions. [2022-02-21 03:10:24,512 INFO L276 IsEmpty]: Start isEmpty. Operand 648 states and 821 transitions. [2022-02-21 03:10:24,514 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:10:24,514 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:10:24,514 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:10:24,514 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:10:24,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 238 states have (on average 1.4369747899159664) internal successors, (342), 261 states have internal predecessors, (342), 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) [2022-02-21 03:10:24,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 350 transitions. [2022-02-21 03:10:24,520 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 350 transitions. Word has length 46 [2022-02-21 03:10:24,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:10:24,520 INFO L470 AbstractCegarLoop]: Abstraction has 270 states and 350 transitions. [2022-02-21 03:10:24,521 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-21 03:10:24,521 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 350 transitions. [2022-02-21 03:10:24,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-02-21 03:10:24,522 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:10:24,522 INFO L514 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:10:24,523 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-02-21 03:10:24,523 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting base2fltErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2022-02-21 03:10:24,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:10:24,524 INFO L85 PathProgramCache]: Analyzing trace with hash 594216172, now seen corresponding path program 1 times [2022-02-21 03:10:24,524 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:10:24,524 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269096237] [2022-02-21 03:10:24,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:10:24,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:10:24,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:24,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-21 03:10:24,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:24,577 INFO L290 TraceCheckUtils]: 0: Hoare triple {13898#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {13863#true} is VALID [2022-02-21 03:10:24,577 INFO L290 TraceCheckUtils]: 1: Hoare triple {13863#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {13863#true} is VALID [2022-02-21 03:10:24,577 INFO L290 TraceCheckUtils]: 2: Hoare triple {13863#true} #res := ~__retres4~0; {13863#true} is VALID [2022-02-21 03:10:24,577 INFO L290 TraceCheckUtils]: 3: Hoare triple {13863#true} assume true; {13863#true} is VALID [2022-02-21 03:10:24,577 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {13863#true} {13863#true} #394#return; {13863#true} is VALID [2022-02-21 03:10:24,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-02-21 03:10:24,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:24,663 INFO L290 TraceCheckUtils]: 0: Hoare triple {13898#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {13899#(or (= base2flt_~e |base2flt_#in~e|) (= base2flt_~e 0))} is VALID [2022-02-21 03:10:24,664 INFO L290 TraceCheckUtils]: 1: Hoare triple {13899#(or (= base2flt_~e |base2flt_#in~e|) (= base2flt_~e 0))} assume !(0 == ~m % 4294967296); {13899#(or (= base2flt_~e |base2flt_#in~e|) (= base2flt_~e 0))} is VALID [2022-02-21 03:10:24,664 INFO L290 TraceCheckUtils]: 2: Hoare triple {13899#(or (= base2flt_~e |base2flt_#in~e|) (= base2flt_~e 0))} assume ~m % 4294967296 < 16777216; {13899#(or (= base2flt_~e |base2flt_#in~e|) (= base2flt_~e 0))} is VALID [2022-02-21 03:10:24,664 INFO L290 TraceCheckUtils]: 3: Hoare triple {13899#(or (= base2flt_~e |base2flt_#in~e|) (= base2flt_~e 0))} assume !false; {13899#(or (= base2flt_~e |base2flt_#in~e|) (= base2flt_~e 0))} is VALID [2022-02-21 03:10:24,665 INFO L290 TraceCheckUtils]: 4: Hoare triple {13899#(or (= base2flt_~e |base2flt_#in~e|) (= base2flt_~e 0))} assume !(~e <= -128); {13899#(or (= base2flt_~e |base2flt_#in~e|) (= base2flt_~e 0))} is VALID [2022-02-21 03:10:24,665 INFO L290 TraceCheckUtils]: 5: Hoare triple {13899#(or (= base2flt_~e |base2flt_#in~e|) (= base2flt_~e 0))} assume ~e - 1 <= 2147483647; {13899#(or (= base2flt_~e |base2flt_#in~e|) (= base2flt_~e 0))} is VALID [2022-02-21 03:10:24,666 INFO L290 TraceCheckUtils]: 6: Hoare triple {13899#(or (= base2flt_~e |base2flt_#in~e|) (= base2flt_~e 0))} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {13900#(or (not (= |base2flt_#in~e| 0)) (<= 0 (+ base2flt_~e 1)))} is VALID [2022-02-21 03:10:24,666 INFO L290 TraceCheckUtils]: 7: Hoare triple {13900#(or (not (= |base2flt_#in~e| 0)) (<= 0 (+ base2flt_~e 1)))} assume ~m % 4294967296 < 16777216; {13900#(or (not (= |base2flt_#in~e| 0)) (<= 0 (+ base2flt_~e 1)))} is VALID [2022-02-21 03:10:24,667 INFO L290 TraceCheckUtils]: 8: Hoare triple {13900#(or (not (= |base2flt_#in~e| 0)) (<= 0 (+ base2flt_~e 1)))} assume !false; {13900#(or (not (= |base2flt_#in~e| 0)) (<= 0 (+ base2flt_~e 1)))} is VALID [2022-02-21 03:10:24,667 INFO L290 TraceCheckUtils]: 9: Hoare triple {13900#(or (not (= |base2flt_#in~e| 0)) (<= 0 (+ base2flt_~e 1)))} assume !(~e <= -128); {13900#(or (not (= |base2flt_#in~e| 0)) (<= 0 (+ base2flt_~e 1)))} is VALID [2022-02-21 03:10:24,667 INFO L290 TraceCheckUtils]: 10: Hoare triple {13900#(or (not (= |base2flt_#in~e| 0)) (<= 0 (+ base2flt_~e 1)))} assume ~e - 1 <= 2147483647; {13900#(or (not (= |base2flt_#in~e| 0)) (<= 0 (+ base2flt_~e 1)))} is VALID [2022-02-21 03:10:24,668 INFO L290 TraceCheckUtils]: 11: Hoare triple {13900#(or (not (= |base2flt_#in~e| 0)) (<= 0 (+ base2flt_~e 1)))} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {13901#(or (<= 0 (+ 2 base2flt_~e)) (not (= |base2flt_#in~e| 0)))} is VALID [2022-02-21 03:10:24,669 INFO L290 TraceCheckUtils]: 12: Hoare triple {13901#(or (<= 0 (+ 2 base2flt_~e)) (not (= |base2flt_#in~e| 0)))} assume ~m % 4294967296 < 16777216; {13901#(or (<= 0 (+ 2 base2flt_~e)) (not (= |base2flt_#in~e| 0)))} is VALID [2022-02-21 03:10:24,669 INFO L290 TraceCheckUtils]: 13: Hoare triple {13901#(or (<= 0 (+ 2 base2flt_~e)) (not (= |base2flt_#in~e| 0)))} assume !false; {13901#(or (<= 0 (+ 2 base2flt_~e)) (not (= |base2flt_#in~e| 0)))} is VALID [2022-02-21 03:10:24,670 INFO L290 TraceCheckUtils]: 14: Hoare triple {13901#(or (<= 0 (+ 2 base2flt_~e)) (not (= |base2flt_#in~e| 0)))} assume !(~e <= -128); {13901#(or (<= 0 (+ 2 base2flt_~e)) (not (= |base2flt_#in~e| 0)))} is VALID [2022-02-21 03:10:24,670 INFO L290 TraceCheckUtils]: 15: Hoare triple {13901#(or (<= 0 (+ 2 base2flt_~e)) (not (= |base2flt_#in~e| 0)))} assume ~e - 1 <= 2147483647; {13901#(or (<= 0 (+ 2 base2flt_~e)) (not (= |base2flt_#in~e| 0)))} is VALID [2022-02-21 03:10:24,671 INFO L290 TraceCheckUtils]: 16: Hoare triple {13901#(or (<= 0 (+ 2 base2flt_~e)) (not (= |base2flt_#in~e| 0)))} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {13902#(or (not (= |base2flt_#in~e| 0)) (<= 0 (+ 3 base2flt_~e)))} is VALID [2022-02-21 03:10:24,671 INFO L290 TraceCheckUtils]: 17: Hoare triple {13902#(or (not (= |base2flt_#in~e| 0)) (<= 0 (+ 3 base2flt_~e)))} assume ~m % 4294967296 < 16777216; {13902#(or (not (= |base2flt_#in~e| 0)) (<= 0 (+ 3 base2flt_~e)))} is VALID [2022-02-21 03:10:24,672 INFO L290 TraceCheckUtils]: 18: Hoare triple {13902#(or (not (= |base2flt_#in~e| 0)) (<= 0 (+ 3 base2flt_~e)))} assume !false; {13902#(or (not (= |base2flt_#in~e| 0)) (<= 0 (+ 3 base2flt_~e)))} is VALID [2022-02-21 03:10:24,672 INFO L290 TraceCheckUtils]: 19: Hoare triple {13902#(or (not (= |base2flt_#in~e| 0)) (<= 0 (+ 3 base2flt_~e)))} assume !(~e <= -128); {13902#(or (not (= |base2flt_#in~e| 0)) (<= 0 (+ 3 base2flt_~e)))} is VALID [2022-02-21 03:10:24,672 INFO L290 TraceCheckUtils]: 20: Hoare triple {13902#(or (not (= |base2flt_#in~e| 0)) (<= 0 (+ 3 base2flt_~e)))} assume ~e - 1 <= 2147483647; {13902#(or (not (= |base2flt_#in~e| 0)) (<= 0 (+ 3 base2flt_~e)))} is VALID [2022-02-21 03:10:24,673 INFO L290 TraceCheckUtils]: 21: Hoare triple {13902#(or (not (= |base2flt_#in~e| 0)) (<= 0 (+ 3 base2flt_~e)))} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {13903#(or (<= 0 (+ base2flt_~e 4)) (not (= |base2flt_#in~e| 0)))} is VALID [2022-02-21 03:10:24,674 INFO L290 TraceCheckUtils]: 22: Hoare triple {13903#(or (<= 0 (+ base2flt_~e 4)) (not (= |base2flt_#in~e| 0)))} assume ~m % 4294967296 < 16777216; {13903#(or (<= 0 (+ base2flt_~e 4)) (not (= |base2flt_#in~e| 0)))} is VALID [2022-02-21 03:10:24,674 INFO L290 TraceCheckUtils]: 23: Hoare triple {13903#(or (<= 0 (+ base2flt_~e 4)) (not (= |base2flt_#in~e| 0)))} assume !false; {13903#(or (<= 0 (+ base2flt_~e 4)) (not (= |base2flt_#in~e| 0)))} is VALID [2022-02-21 03:10:24,675 INFO L290 TraceCheckUtils]: 24: Hoare triple {13903#(or (<= 0 (+ base2flt_~e 4)) (not (= |base2flt_#in~e| 0)))} assume ~e <= -128;~__retres4~0 := 0; {13904#(not (= |base2flt_#in~e| 0))} is VALID [2022-02-21 03:10:24,675 INFO L290 TraceCheckUtils]: 25: Hoare triple {13904#(not (= |base2flt_#in~e| 0))} #res := ~__retres4~0; {13904#(not (= |base2flt_#in~e| 0))} is VALID [2022-02-21 03:10:24,675 INFO L290 TraceCheckUtils]: 26: Hoare triple {13904#(not (= |base2flt_#in~e| 0))} assume true; {13904#(not (= |base2flt_#in~e| 0))} is VALID [2022-02-21 03:10:24,676 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {13904#(not (= |base2flt_#in~e| 0))} {13863#true} #396#return; {13864#false} is VALID [2022-02-21 03:10:24,677 INFO L290 TraceCheckUtils]: 0: Hoare triple {13863#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(21, 2);call #Ultimate.allocInit(12, 3); {13863#true} is VALID [2022-02-21 03:10:24,677 INFO L290 TraceCheckUtils]: 1: Hoare triple {13863#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~ret22#1, main_#t~ret23#1, main_#t~ret24#1, main_#t~ret25#1, main_#t~ret26#1, main_~a~0#1, main_~ma~2#1, main_~ea~2#1, main_~b~0#1, main_~mb~2#1, main_~eb~2#1, main_~r_mul~0#1, main_~zero~0#1, main_~one~0#1, main_~sb~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~tmp___1~0#1, main_~__retres16~0#1;havoc main_~a~0#1;main_~ma~2#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;main_~ea~2#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1;havoc main_~b~0#1;main_~mb~2#1 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;main_~eb~2#1 := main_#t~nondet21#1;havoc main_#t~nondet21#1;havoc main_~r_mul~0#1;havoc main_~zero~0#1;havoc main_~one~0#1;havoc main_~sb~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~tmp___1~0#1;havoc main_~__retres16~0#1; {13863#true} is VALID [2022-02-21 03:10:24,677 INFO L272 TraceCheckUtils]: 2: Hoare triple {13863#true} call main_#t~ret22#1 := base2flt(0, 0); {13898#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} is VALID [2022-02-21 03:10:24,678 INFO L290 TraceCheckUtils]: 3: Hoare triple {13898#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {13863#true} is VALID [2022-02-21 03:10:24,678 INFO L290 TraceCheckUtils]: 4: Hoare triple {13863#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {13863#true} is VALID [2022-02-21 03:10:24,678 INFO L290 TraceCheckUtils]: 5: Hoare triple {13863#true} #res := ~__retres4~0; {13863#true} is VALID [2022-02-21 03:10:24,678 INFO L290 TraceCheckUtils]: 6: Hoare triple {13863#true} assume true; {13863#true} is VALID [2022-02-21 03:10:24,678 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {13863#true} {13863#true} #394#return; {13863#true} is VALID [2022-02-21 03:10:24,678 INFO L290 TraceCheckUtils]: 8: Hoare triple {13863#true} main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1; {13863#true} is VALID [2022-02-21 03:10:24,679 INFO L272 TraceCheckUtils]: 9: Hoare triple {13863#true} call main_#t~ret23#1 := base2flt(1, 0); {13898#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} is VALID [2022-02-21 03:10:24,679 INFO L290 TraceCheckUtils]: 10: Hoare triple {13898#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {13899#(or (= base2flt_~e |base2flt_#in~e|) (= base2flt_~e 0))} is VALID [2022-02-21 03:10:24,680 INFO L290 TraceCheckUtils]: 11: Hoare triple {13899#(or (= base2flt_~e |base2flt_#in~e|) (= base2flt_~e 0))} assume !(0 == ~m % 4294967296); {13899#(or (= base2flt_~e |base2flt_#in~e|) (= base2flt_~e 0))} is VALID [2022-02-21 03:10:24,680 INFO L290 TraceCheckUtils]: 12: Hoare triple {13899#(or (= base2flt_~e |base2flt_#in~e|) (= base2flt_~e 0))} assume ~m % 4294967296 < 16777216; {13899#(or (= base2flt_~e |base2flt_#in~e|) (= base2flt_~e 0))} is VALID [2022-02-21 03:10:24,681 INFO L290 TraceCheckUtils]: 13: Hoare triple {13899#(or (= base2flt_~e |base2flt_#in~e|) (= base2flt_~e 0))} assume !false; {13899#(or (= base2flt_~e |base2flt_#in~e|) (= base2flt_~e 0))} is VALID [2022-02-21 03:10:24,681 INFO L290 TraceCheckUtils]: 14: Hoare triple {13899#(or (= base2flt_~e |base2flt_#in~e|) (= base2flt_~e 0))} assume !(~e <= -128); {13899#(or (= base2flt_~e |base2flt_#in~e|) (= base2flt_~e 0))} is VALID [2022-02-21 03:10:24,682 INFO L290 TraceCheckUtils]: 15: Hoare triple {13899#(or (= base2flt_~e |base2flt_#in~e|) (= base2flt_~e 0))} assume ~e - 1 <= 2147483647; {13899#(or (= base2flt_~e |base2flt_#in~e|) (= base2flt_~e 0))} is VALID [2022-02-21 03:10:24,682 INFO L290 TraceCheckUtils]: 16: Hoare triple {13899#(or (= base2flt_~e |base2flt_#in~e|) (= base2flt_~e 0))} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {13900#(or (not (= |base2flt_#in~e| 0)) (<= 0 (+ base2flt_~e 1)))} is VALID [2022-02-21 03:10:24,683 INFO L290 TraceCheckUtils]: 17: Hoare triple {13900#(or (not (= |base2flt_#in~e| 0)) (<= 0 (+ base2flt_~e 1)))} assume ~m % 4294967296 < 16777216; {13900#(or (not (= |base2flt_#in~e| 0)) (<= 0 (+ base2flt_~e 1)))} is VALID [2022-02-21 03:10:24,683 INFO L290 TraceCheckUtils]: 18: Hoare triple {13900#(or (not (= |base2flt_#in~e| 0)) (<= 0 (+ base2flt_~e 1)))} assume !false; {13900#(or (not (= |base2flt_#in~e| 0)) (<= 0 (+ base2flt_~e 1)))} is VALID [2022-02-21 03:10:24,683 INFO L290 TraceCheckUtils]: 19: Hoare triple {13900#(or (not (= |base2flt_#in~e| 0)) (<= 0 (+ base2flt_~e 1)))} assume !(~e <= -128); {13900#(or (not (= |base2flt_#in~e| 0)) (<= 0 (+ base2flt_~e 1)))} is VALID [2022-02-21 03:10:24,684 INFO L290 TraceCheckUtils]: 20: Hoare triple {13900#(or (not (= |base2flt_#in~e| 0)) (<= 0 (+ base2flt_~e 1)))} assume ~e - 1 <= 2147483647; {13900#(or (not (= |base2flt_#in~e| 0)) (<= 0 (+ base2flt_~e 1)))} is VALID [2022-02-21 03:10:24,684 INFO L290 TraceCheckUtils]: 21: Hoare triple {13900#(or (not (= |base2flt_#in~e| 0)) (<= 0 (+ base2flt_~e 1)))} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {13901#(or (<= 0 (+ 2 base2flt_~e)) (not (= |base2flt_#in~e| 0)))} is VALID [2022-02-21 03:10:24,685 INFO L290 TraceCheckUtils]: 22: Hoare triple {13901#(or (<= 0 (+ 2 base2flt_~e)) (not (= |base2flt_#in~e| 0)))} assume ~m % 4294967296 < 16777216; {13901#(or (<= 0 (+ 2 base2flt_~e)) (not (= |base2flt_#in~e| 0)))} is VALID [2022-02-21 03:10:24,685 INFO L290 TraceCheckUtils]: 23: Hoare triple {13901#(or (<= 0 (+ 2 base2flt_~e)) (not (= |base2flt_#in~e| 0)))} assume !false; {13901#(or (<= 0 (+ 2 base2flt_~e)) (not (= |base2flt_#in~e| 0)))} is VALID [2022-02-21 03:10:24,686 INFO L290 TraceCheckUtils]: 24: Hoare triple {13901#(or (<= 0 (+ 2 base2flt_~e)) (not (= |base2flt_#in~e| 0)))} assume !(~e <= -128); {13901#(or (<= 0 (+ 2 base2flt_~e)) (not (= |base2flt_#in~e| 0)))} is VALID [2022-02-21 03:10:24,686 INFO L290 TraceCheckUtils]: 25: Hoare triple {13901#(or (<= 0 (+ 2 base2flt_~e)) (not (= |base2flt_#in~e| 0)))} assume ~e - 1 <= 2147483647; {13901#(or (<= 0 (+ 2 base2flt_~e)) (not (= |base2flt_#in~e| 0)))} is VALID [2022-02-21 03:10:24,687 INFO L290 TraceCheckUtils]: 26: Hoare triple {13901#(or (<= 0 (+ 2 base2flt_~e)) (not (= |base2flt_#in~e| 0)))} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {13902#(or (not (= |base2flt_#in~e| 0)) (<= 0 (+ 3 base2flt_~e)))} is VALID [2022-02-21 03:10:24,687 INFO L290 TraceCheckUtils]: 27: Hoare triple {13902#(or (not (= |base2flt_#in~e| 0)) (<= 0 (+ 3 base2flt_~e)))} assume ~m % 4294967296 < 16777216; {13902#(or (not (= |base2flt_#in~e| 0)) (<= 0 (+ 3 base2flt_~e)))} is VALID [2022-02-21 03:10:24,687 INFO L290 TraceCheckUtils]: 28: Hoare triple {13902#(or (not (= |base2flt_#in~e| 0)) (<= 0 (+ 3 base2flt_~e)))} assume !false; {13902#(or (not (= |base2flt_#in~e| 0)) (<= 0 (+ 3 base2flt_~e)))} is VALID [2022-02-21 03:10:24,688 INFO L290 TraceCheckUtils]: 29: Hoare triple {13902#(or (not (= |base2flt_#in~e| 0)) (<= 0 (+ 3 base2flt_~e)))} assume !(~e <= -128); {13902#(or (not (= |base2flt_#in~e| 0)) (<= 0 (+ 3 base2flt_~e)))} is VALID [2022-02-21 03:10:24,688 INFO L290 TraceCheckUtils]: 30: Hoare triple {13902#(or (not (= |base2flt_#in~e| 0)) (<= 0 (+ 3 base2flt_~e)))} assume ~e - 1 <= 2147483647; {13902#(or (not (= |base2flt_#in~e| 0)) (<= 0 (+ 3 base2flt_~e)))} is VALID [2022-02-21 03:10:24,689 INFO L290 TraceCheckUtils]: 31: Hoare triple {13902#(or (not (= |base2flt_#in~e| 0)) (<= 0 (+ 3 base2flt_~e)))} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {13903#(or (<= 0 (+ base2flt_~e 4)) (not (= |base2flt_#in~e| 0)))} is VALID [2022-02-21 03:10:24,689 INFO L290 TraceCheckUtils]: 32: Hoare triple {13903#(or (<= 0 (+ base2flt_~e 4)) (not (= |base2flt_#in~e| 0)))} assume ~m % 4294967296 < 16777216; {13903#(or (<= 0 (+ base2flt_~e 4)) (not (= |base2flt_#in~e| 0)))} is VALID [2022-02-21 03:10:24,690 INFO L290 TraceCheckUtils]: 33: Hoare triple {13903#(or (<= 0 (+ base2flt_~e 4)) (not (= |base2flt_#in~e| 0)))} assume !false; {13903#(or (<= 0 (+ base2flt_~e 4)) (not (= |base2flt_#in~e| 0)))} is VALID [2022-02-21 03:10:24,690 INFO L290 TraceCheckUtils]: 34: Hoare triple {13903#(or (<= 0 (+ base2flt_~e 4)) (not (= |base2flt_#in~e| 0)))} assume ~e <= -128;~__retres4~0 := 0; {13904#(not (= |base2flt_#in~e| 0))} is VALID [2022-02-21 03:10:24,691 INFO L290 TraceCheckUtils]: 35: Hoare triple {13904#(not (= |base2flt_#in~e| 0))} #res := ~__retres4~0; {13904#(not (= |base2flt_#in~e| 0))} is VALID [2022-02-21 03:10:24,691 INFO L290 TraceCheckUtils]: 36: Hoare triple {13904#(not (= |base2flt_#in~e| 0))} assume true; {13904#(not (= |base2flt_#in~e| 0))} is VALID [2022-02-21 03:10:24,692 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {13904#(not (= |base2flt_#in~e| 0))} {13863#true} #396#return; {13864#false} is VALID [2022-02-21 03:10:24,692 INFO L290 TraceCheckUtils]: 38: Hoare triple {13864#false} main_~one~0#1 := main_#t~ret23#1;havoc main_#t~ret23#1; {13864#false} is VALID [2022-02-21 03:10:24,692 INFO L272 TraceCheckUtils]: 39: Hoare triple {13864#false} call main_#t~ret24#1 := base2flt(main_~ma~2#1, main_~ea~2#1); {13864#false} is VALID [2022-02-21 03:10:24,692 INFO L290 TraceCheckUtils]: 40: Hoare triple {13864#false} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {13864#false} is VALID [2022-02-21 03:10:24,692 INFO L290 TraceCheckUtils]: 41: Hoare triple {13864#false} assume !(0 == ~m % 4294967296); {13864#false} is VALID [2022-02-21 03:10:24,692 INFO L290 TraceCheckUtils]: 42: Hoare triple {13864#false} assume !(~m % 4294967296 < 16777216); {13864#false} is VALID [2022-02-21 03:10:24,693 INFO L290 TraceCheckUtils]: 43: Hoare triple {13864#false} assume !false; {13864#false} is VALID [2022-02-21 03:10:24,693 INFO L290 TraceCheckUtils]: 44: Hoare triple {13864#false} assume !(~m % 4294967296 >= 33554432); {13864#false} is VALID [2022-02-21 03:10:24,693 INFO L290 TraceCheckUtils]: 45: Hoare triple {13864#false} assume 0 == ~m || 0 == ~bitwiseComplement(16777216);~m := 0; {13864#false} is VALID [2022-02-21 03:10:24,693 INFO L290 TraceCheckUtils]: 46: Hoare triple {13864#false} assume 128 + ~e <= 2147483647; {13864#false} is VALID [2022-02-21 03:10:24,693 INFO L290 TraceCheckUtils]: 47: Hoare triple {13864#false} assume 128 + ~e >= -2147483648; {13864#false} is VALID [2022-02-21 03:10:24,693 INFO L290 TraceCheckUtils]: 48: Hoare triple {13864#false} assume !(16777216 * (128 + ~e) <= 2147483647); {13864#false} is VALID [2022-02-21 03:10:24,694 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 9 proven. 38 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-21 03:10:24,694 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:10:24,694 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269096237] [2022-02-21 03:10:24,694 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1269096237] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:10:24,694 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1884198689] [2022-02-21 03:10:24,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:10:24,695 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:10:24,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:10:24,696 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) [2022-02-21 03:10:24,704 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-02-21 03:10:24,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:24,756 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-21 03:10:24,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:24,775 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:10:25,021 INFO L290 TraceCheckUtils]: 0: Hoare triple {13863#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(21, 2);call #Ultimate.allocInit(12, 3); {13863#true} is VALID [2022-02-21 03:10:25,021 INFO L290 TraceCheckUtils]: 1: Hoare triple {13863#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~ret22#1, main_#t~ret23#1, main_#t~ret24#1, main_#t~ret25#1, main_#t~ret26#1, main_~a~0#1, main_~ma~2#1, main_~ea~2#1, main_~b~0#1, main_~mb~2#1, main_~eb~2#1, main_~r_mul~0#1, main_~zero~0#1, main_~one~0#1, main_~sb~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~tmp___1~0#1, main_~__retres16~0#1;havoc main_~a~0#1;main_~ma~2#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;main_~ea~2#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1;havoc main_~b~0#1;main_~mb~2#1 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;main_~eb~2#1 := main_#t~nondet21#1;havoc main_#t~nondet21#1;havoc main_~r_mul~0#1;havoc main_~zero~0#1;havoc main_~one~0#1;havoc main_~sb~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~tmp___1~0#1;havoc main_~__retres16~0#1; {13863#true} is VALID [2022-02-21 03:10:25,021 INFO L272 TraceCheckUtils]: 2: Hoare triple {13863#true} call main_#t~ret22#1 := base2flt(0, 0); {13863#true} is VALID [2022-02-21 03:10:25,021 INFO L290 TraceCheckUtils]: 3: Hoare triple {13863#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {13863#true} is VALID [2022-02-21 03:10:25,021 INFO L290 TraceCheckUtils]: 4: Hoare triple {13863#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {13863#true} is VALID [2022-02-21 03:10:25,021 INFO L290 TraceCheckUtils]: 5: Hoare triple {13863#true} #res := ~__retres4~0; {13863#true} is VALID [2022-02-21 03:10:25,022 INFO L290 TraceCheckUtils]: 6: Hoare triple {13863#true} assume true; {13863#true} is VALID [2022-02-21 03:10:25,022 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {13863#true} {13863#true} #394#return; {13863#true} is VALID [2022-02-21 03:10:25,022 INFO L290 TraceCheckUtils]: 8: Hoare triple {13863#true} main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1; {13863#true} is VALID [2022-02-21 03:10:25,022 INFO L272 TraceCheckUtils]: 9: Hoare triple {13863#true} call main_#t~ret23#1 := base2flt(1, 0); {13863#true} is VALID [2022-02-21 03:10:25,022 INFO L290 TraceCheckUtils]: 10: Hoare triple {13863#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {13938#(<= |base2flt_#in~e| base2flt_~e)} is VALID [2022-02-21 03:10:25,023 INFO L290 TraceCheckUtils]: 11: Hoare triple {13938#(<= |base2flt_#in~e| base2flt_~e)} assume !(0 == ~m % 4294967296); {13938#(<= |base2flt_#in~e| base2flt_~e)} is VALID [2022-02-21 03:10:25,023 INFO L290 TraceCheckUtils]: 12: Hoare triple {13938#(<= |base2flt_#in~e| base2flt_~e)} assume ~m % 4294967296 < 16777216; {13938#(<= |base2flt_#in~e| base2flt_~e)} is VALID [2022-02-21 03:10:25,023 INFO L290 TraceCheckUtils]: 13: Hoare triple {13938#(<= |base2flt_#in~e| base2flt_~e)} assume !false; {13938#(<= |base2flt_#in~e| base2flt_~e)} is VALID [2022-02-21 03:10:25,024 INFO L290 TraceCheckUtils]: 14: Hoare triple {13938#(<= |base2flt_#in~e| base2flt_~e)} assume !(~e <= -128); {13938#(<= |base2flt_#in~e| base2flt_~e)} is VALID [2022-02-21 03:10:25,024 INFO L290 TraceCheckUtils]: 15: Hoare triple {13938#(<= |base2flt_#in~e| base2flt_~e)} assume ~e - 1 <= 2147483647; {13938#(<= |base2flt_#in~e| base2flt_~e)} is VALID [2022-02-21 03:10:25,025 INFO L290 TraceCheckUtils]: 16: Hoare triple {13938#(<= |base2flt_#in~e| base2flt_~e)} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {13957#(<= |base2flt_#in~e| (+ base2flt_~e 1))} is VALID [2022-02-21 03:10:25,025 INFO L290 TraceCheckUtils]: 17: Hoare triple {13957#(<= |base2flt_#in~e| (+ base2flt_~e 1))} assume ~m % 4294967296 < 16777216; {13957#(<= |base2flt_#in~e| (+ base2flt_~e 1))} is VALID [2022-02-21 03:10:25,026 INFO L290 TraceCheckUtils]: 18: Hoare triple {13957#(<= |base2flt_#in~e| (+ base2flt_~e 1))} assume !false; {13957#(<= |base2flt_#in~e| (+ base2flt_~e 1))} is VALID [2022-02-21 03:10:25,026 INFO L290 TraceCheckUtils]: 19: Hoare triple {13957#(<= |base2flt_#in~e| (+ base2flt_~e 1))} assume !(~e <= -128); {13957#(<= |base2flt_#in~e| (+ base2flt_~e 1))} is VALID [2022-02-21 03:10:25,026 INFO L290 TraceCheckUtils]: 20: Hoare triple {13957#(<= |base2flt_#in~e| (+ base2flt_~e 1))} assume ~e - 1 <= 2147483647; {13957#(<= |base2flt_#in~e| (+ base2flt_~e 1))} is VALID [2022-02-21 03:10:25,027 INFO L290 TraceCheckUtils]: 21: Hoare triple {13957#(<= |base2flt_#in~e| (+ base2flt_~e 1))} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {13973#(<= |base2flt_#in~e| (+ 2 base2flt_~e))} is VALID [2022-02-21 03:10:25,027 INFO L290 TraceCheckUtils]: 22: Hoare triple {13973#(<= |base2flt_#in~e| (+ 2 base2flt_~e))} assume ~m % 4294967296 < 16777216; {13973#(<= |base2flt_#in~e| (+ 2 base2flt_~e))} is VALID [2022-02-21 03:10:25,028 INFO L290 TraceCheckUtils]: 23: Hoare triple {13973#(<= |base2flt_#in~e| (+ 2 base2flt_~e))} assume !false; {13973#(<= |base2flt_#in~e| (+ 2 base2flt_~e))} is VALID [2022-02-21 03:10:25,028 INFO L290 TraceCheckUtils]: 24: Hoare triple {13973#(<= |base2flt_#in~e| (+ 2 base2flt_~e))} assume !(~e <= -128); {13973#(<= |base2flt_#in~e| (+ 2 base2flt_~e))} is VALID [2022-02-21 03:10:25,028 INFO L290 TraceCheckUtils]: 25: Hoare triple {13973#(<= |base2flt_#in~e| (+ 2 base2flt_~e))} assume ~e - 1 <= 2147483647; {13973#(<= |base2flt_#in~e| (+ 2 base2flt_~e))} is VALID [2022-02-21 03:10:25,029 INFO L290 TraceCheckUtils]: 26: Hoare triple {13973#(<= |base2flt_#in~e| (+ 2 base2flt_~e))} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {13989#(<= |base2flt_#in~e| (+ 3 base2flt_~e))} is VALID [2022-02-21 03:10:25,029 INFO L290 TraceCheckUtils]: 27: Hoare triple {13989#(<= |base2flt_#in~e| (+ 3 base2flt_~e))} assume ~m % 4294967296 < 16777216; {13989#(<= |base2flt_#in~e| (+ 3 base2flt_~e))} is VALID [2022-02-21 03:10:25,030 INFO L290 TraceCheckUtils]: 28: Hoare triple {13989#(<= |base2flt_#in~e| (+ 3 base2flt_~e))} assume !false; {13989#(<= |base2flt_#in~e| (+ 3 base2flt_~e))} is VALID [2022-02-21 03:10:25,030 INFO L290 TraceCheckUtils]: 29: Hoare triple {13989#(<= |base2flt_#in~e| (+ 3 base2flt_~e))} assume !(~e <= -128); {13989#(<= |base2flt_#in~e| (+ 3 base2flt_~e))} is VALID [2022-02-21 03:10:25,030 INFO L290 TraceCheckUtils]: 30: Hoare triple {13989#(<= |base2flt_#in~e| (+ 3 base2flt_~e))} assume ~e - 1 <= 2147483647; {13989#(<= |base2flt_#in~e| (+ 3 base2flt_~e))} is VALID [2022-02-21 03:10:25,031 INFO L290 TraceCheckUtils]: 31: Hoare triple {13989#(<= |base2flt_#in~e| (+ 3 base2flt_~e))} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {14005#(<= |base2flt_#in~e| (+ base2flt_~e 4))} is VALID [2022-02-21 03:10:25,032 INFO L290 TraceCheckUtils]: 32: Hoare triple {14005#(<= |base2flt_#in~e| (+ base2flt_~e 4))} assume ~m % 4294967296 < 16777216; {14005#(<= |base2flt_#in~e| (+ base2flt_~e 4))} is VALID [2022-02-21 03:10:25,032 INFO L290 TraceCheckUtils]: 33: Hoare triple {14005#(<= |base2flt_#in~e| (+ base2flt_~e 4))} assume !false; {14005#(<= |base2flt_#in~e| (+ base2flt_~e 4))} is VALID [2022-02-21 03:10:25,033 INFO L290 TraceCheckUtils]: 34: Hoare triple {14005#(<= |base2flt_#in~e| (+ base2flt_~e 4))} assume ~e <= -128;~__retres4~0 := 0; {14015#(<= (+ |base2flt_#in~e| 124) 0)} is VALID [2022-02-21 03:10:25,033 INFO L290 TraceCheckUtils]: 35: Hoare triple {14015#(<= (+ |base2flt_#in~e| 124) 0)} #res := ~__retres4~0; {14015#(<= (+ |base2flt_#in~e| 124) 0)} is VALID [2022-02-21 03:10:25,033 INFO L290 TraceCheckUtils]: 36: Hoare triple {14015#(<= (+ |base2flt_#in~e| 124) 0)} assume true; {14015#(<= (+ |base2flt_#in~e| 124) 0)} is VALID [2022-02-21 03:10:25,034 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {14015#(<= (+ |base2flt_#in~e| 124) 0)} {13863#true} #396#return; {13864#false} is VALID [2022-02-21 03:10:25,034 INFO L290 TraceCheckUtils]: 38: Hoare triple {13864#false} main_~one~0#1 := main_#t~ret23#1;havoc main_#t~ret23#1; {13864#false} is VALID [2022-02-21 03:10:25,034 INFO L272 TraceCheckUtils]: 39: Hoare triple {13864#false} call main_#t~ret24#1 := base2flt(main_~ma~2#1, main_~ea~2#1); {13864#false} is VALID [2022-02-21 03:10:25,034 INFO L290 TraceCheckUtils]: 40: Hoare triple {13864#false} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {13864#false} is VALID [2022-02-21 03:10:25,034 INFO L290 TraceCheckUtils]: 41: Hoare triple {13864#false} assume !(0 == ~m % 4294967296); {13864#false} is VALID [2022-02-21 03:10:25,035 INFO L290 TraceCheckUtils]: 42: Hoare triple {13864#false} assume !(~m % 4294967296 < 16777216); {13864#false} is VALID [2022-02-21 03:10:25,035 INFO L290 TraceCheckUtils]: 43: Hoare triple {13864#false} assume !false; {13864#false} is VALID [2022-02-21 03:10:25,035 INFO L290 TraceCheckUtils]: 44: Hoare triple {13864#false} assume !(~m % 4294967296 >= 33554432); {13864#false} is VALID [2022-02-21 03:10:25,035 INFO L290 TraceCheckUtils]: 45: Hoare triple {13864#false} assume 0 == ~m || 0 == ~bitwiseComplement(16777216);~m := 0; {13864#false} is VALID [2022-02-21 03:10:25,035 INFO L290 TraceCheckUtils]: 46: Hoare triple {13864#false} assume 128 + ~e <= 2147483647; {13864#false} is VALID [2022-02-21 03:10:25,035 INFO L290 TraceCheckUtils]: 47: Hoare triple {13864#false} assume 128 + ~e >= -2147483648; {13864#false} is VALID [2022-02-21 03:10:25,035 INFO L290 TraceCheckUtils]: 48: Hoare triple {13864#false} assume !(16777216 * (128 + ~e) <= 2147483647); {13864#false} is VALID [2022-02-21 03:10:25,035 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 9 proven. 38 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-21 03:10:25,036 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:10:25,559 INFO L290 TraceCheckUtils]: 48: Hoare triple {13864#false} assume !(16777216 * (128 + ~e) <= 2147483647); {13864#false} is VALID [2022-02-21 03:10:25,559 INFO L290 TraceCheckUtils]: 47: Hoare triple {13864#false} assume 128 + ~e >= -2147483648; {13864#false} is VALID [2022-02-21 03:10:25,559 INFO L290 TraceCheckUtils]: 46: Hoare triple {13864#false} assume 128 + ~e <= 2147483647; {13864#false} is VALID [2022-02-21 03:10:25,559 INFO L290 TraceCheckUtils]: 45: Hoare triple {13864#false} assume 0 == ~m || 0 == ~bitwiseComplement(16777216);~m := 0; {13864#false} is VALID [2022-02-21 03:10:25,560 INFO L290 TraceCheckUtils]: 44: Hoare triple {13864#false} assume !(~m % 4294967296 >= 33554432); {13864#false} is VALID [2022-02-21 03:10:25,560 INFO L290 TraceCheckUtils]: 43: Hoare triple {13864#false} assume !false; {13864#false} is VALID [2022-02-21 03:10:25,560 INFO L290 TraceCheckUtils]: 42: Hoare triple {13864#false} assume !(~m % 4294967296 < 16777216); {13864#false} is VALID [2022-02-21 03:10:25,560 INFO L290 TraceCheckUtils]: 41: Hoare triple {13864#false} assume !(0 == ~m % 4294967296); {13864#false} is VALID [2022-02-21 03:10:25,560 INFO L290 TraceCheckUtils]: 40: Hoare triple {13864#false} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {13864#false} is VALID [2022-02-21 03:10:25,560 INFO L272 TraceCheckUtils]: 39: Hoare triple {13864#false} call main_#t~ret24#1 := base2flt(main_~ma~2#1, main_~ea~2#1); {13864#false} is VALID [2022-02-21 03:10:25,561 INFO L290 TraceCheckUtils]: 38: Hoare triple {13864#false} main_~one~0#1 := main_#t~ret23#1;havoc main_#t~ret23#1; {13864#false} is VALID [2022-02-21 03:10:25,561 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {14094#(not (<= 0 |base2flt_#in~e|))} {13863#true} #396#return; {13864#false} is VALID [2022-02-21 03:10:25,562 INFO L290 TraceCheckUtils]: 36: Hoare triple {14094#(not (<= 0 |base2flt_#in~e|))} assume true; {14094#(not (<= 0 |base2flt_#in~e|))} is VALID [2022-02-21 03:10:25,562 INFO L290 TraceCheckUtils]: 35: Hoare triple {14094#(not (<= 0 |base2flt_#in~e|))} #res := ~__retres4~0; {14094#(not (<= 0 |base2flt_#in~e|))} is VALID [2022-02-21 03:10:25,563 INFO L290 TraceCheckUtils]: 34: Hoare triple {14104#(or (not (<= (+ 128 base2flt_~e) 0)) (not (<= 0 |base2flt_#in~e|)))} assume ~e <= -128;~__retres4~0 := 0; {14094#(not (<= 0 |base2flt_#in~e|))} is VALID [2022-02-21 03:10:25,563 INFO L290 TraceCheckUtils]: 33: Hoare triple {14104#(or (not (<= (+ 128 base2flt_~e) 0)) (not (<= 0 |base2flt_#in~e|)))} assume !false; {14104#(or (not (<= (+ 128 base2flt_~e) 0)) (not (<= 0 |base2flt_#in~e|)))} is VALID [2022-02-21 03:10:25,564 INFO L290 TraceCheckUtils]: 32: Hoare triple {14104#(or (not (<= (+ 128 base2flt_~e) 0)) (not (<= 0 |base2flt_#in~e|)))} assume ~m % 4294967296 < 16777216; {14104#(or (not (<= (+ 128 base2flt_~e) 0)) (not (<= 0 |base2flt_#in~e|)))} is VALID [2022-02-21 03:10:25,564 INFO L290 TraceCheckUtils]: 31: Hoare triple {14114#(or (< 0 (+ base2flt_~e 127)) (not (<= 0 |base2flt_#in~e|)))} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {14104#(or (not (<= (+ 128 base2flt_~e) 0)) (not (<= 0 |base2flt_#in~e|)))} is VALID [2022-02-21 03:10:25,565 INFO L290 TraceCheckUtils]: 30: Hoare triple {14114#(or (< 0 (+ base2flt_~e 127)) (not (<= 0 |base2flt_#in~e|)))} assume ~e - 1 <= 2147483647; {14114#(or (< 0 (+ base2flt_~e 127)) (not (<= 0 |base2flt_#in~e|)))} is VALID [2022-02-21 03:10:25,565 INFO L290 TraceCheckUtils]: 29: Hoare triple {14114#(or (< 0 (+ base2flt_~e 127)) (not (<= 0 |base2flt_#in~e|)))} assume !(~e <= -128); {14114#(or (< 0 (+ base2flt_~e 127)) (not (<= 0 |base2flt_#in~e|)))} is VALID [2022-02-21 03:10:25,566 INFO L290 TraceCheckUtils]: 28: Hoare triple {14114#(or (< 0 (+ base2flt_~e 127)) (not (<= 0 |base2flt_#in~e|)))} assume !false; {14114#(or (< 0 (+ base2flt_~e 127)) (not (<= 0 |base2flt_#in~e|)))} is VALID [2022-02-21 03:10:25,566 INFO L290 TraceCheckUtils]: 27: Hoare triple {14114#(or (< 0 (+ base2flt_~e 127)) (not (<= 0 |base2flt_#in~e|)))} assume ~m % 4294967296 < 16777216; {14114#(or (< 0 (+ base2flt_~e 127)) (not (<= 0 |base2flt_#in~e|)))} is VALID [2022-02-21 03:10:25,567 INFO L290 TraceCheckUtils]: 26: Hoare triple {14130#(or (< 0 (+ 126 base2flt_~e)) (not (<= 0 |base2flt_#in~e|)))} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {14114#(or (< 0 (+ base2flt_~e 127)) (not (<= 0 |base2flt_#in~e|)))} is VALID [2022-02-21 03:10:25,567 INFO L290 TraceCheckUtils]: 25: Hoare triple {14130#(or (< 0 (+ 126 base2flt_~e)) (not (<= 0 |base2flt_#in~e|)))} assume ~e - 1 <= 2147483647; {14130#(or (< 0 (+ 126 base2flt_~e)) (not (<= 0 |base2flt_#in~e|)))} is VALID [2022-02-21 03:10:25,568 INFO L290 TraceCheckUtils]: 24: Hoare triple {14130#(or (< 0 (+ 126 base2flt_~e)) (not (<= 0 |base2flt_#in~e|)))} assume !(~e <= -128); {14130#(or (< 0 (+ 126 base2flt_~e)) (not (<= 0 |base2flt_#in~e|)))} is VALID [2022-02-21 03:10:25,568 INFO L290 TraceCheckUtils]: 23: Hoare triple {14130#(or (< 0 (+ 126 base2flt_~e)) (not (<= 0 |base2flt_#in~e|)))} assume !false; {14130#(or (< 0 (+ 126 base2flt_~e)) (not (<= 0 |base2flt_#in~e|)))} is VALID [2022-02-21 03:10:25,568 INFO L290 TraceCheckUtils]: 22: Hoare triple {14130#(or (< 0 (+ 126 base2flt_~e)) (not (<= 0 |base2flt_#in~e|)))} assume ~m % 4294967296 < 16777216; {14130#(or (< 0 (+ 126 base2flt_~e)) (not (<= 0 |base2flt_#in~e|)))} is VALID [2022-02-21 03:10:25,569 INFO L290 TraceCheckUtils]: 21: Hoare triple {14146#(or (< 0 (+ 125 base2flt_~e)) (not (<= 0 |base2flt_#in~e|)))} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {14130#(or (< 0 (+ 126 base2flt_~e)) (not (<= 0 |base2flt_#in~e|)))} is VALID [2022-02-21 03:10:25,570 INFO L290 TraceCheckUtils]: 20: Hoare triple {14146#(or (< 0 (+ 125 base2flt_~e)) (not (<= 0 |base2flt_#in~e|)))} assume ~e - 1 <= 2147483647; {14146#(or (< 0 (+ 125 base2flt_~e)) (not (<= 0 |base2flt_#in~e|)))} is VALID [2022-02-21 03:10:25,570 INFO L290 TraceCheckUtils]: 19: Hoare triple {14146#(or (< 0 (+ 125 base2flt_~e)) (not (<= 0 |base2flt_#in~e|)))} assume !(~e <= -128); {14146#(or (< 0 (+ 125 base2flt_~e)) (not (<= 0 |base2flt_#in~e|)))} is VALID [2022-02-21 03:10:25,570 INFO L290 TraceCheckUtils]: 18: Hoare triple {14146#(or (< 0 (+ 125 base2flt_~e)) (not (<= 0 |base2flt_#in~e|)))} assume !false; {14146#(or (< 0 (+ 125 base2flt_~e)) (not (<= 0 |base2flt_#in~e|)))} is VALID [2022-02-21 03:10:25,571 INFO L290 TraceCheckUtils]: 17: Hoare triple {14146#(or (< 0 (+ 125 base2flt_~e)) (not (<= 0 |base2flt_#in~e|)))} assume ~m % 4294967296 < 16777216; {14146#(or (< 0 (+ 125 base2flt_~e)) (not (<= 0 |base2flt_#in~e|)))} is VALID [2022-02-21 03:10:25,571 INFO L290 TraceCheckUtils]: 16: Hoare triple {14162#(or (< 0 (+ base2flt_~e 124)) (not (<= 0 |base2flt_#in~e|)))} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {14146#(or (< 0 (+ 125 base2flt_~e)) (not (<= 0 |base2flt_#in~e|)))} is VALID [2022-02-21 03:10:25,572 INFO L290 TraceCheckUtils]: 15: Hoare triple {14162#(or (< 0 (+ base2flt_~e 124)) (not (<= 0 |base2flt_#in~e|)))} assume ~e - 1 <= 2147483647; {14162#(or (< 0 (+ base2flt_~e 124)) (not (<= 0 |base2flt_#in~e|)))} is VALID [2022-02-21 03:10:25,572 INFO L290 TraceCheckUtils]: 14: Hoare triple {14162#(or (< 0 (+ base2flt_~e 124)) (not (<= 0 |base2flt_#in~e|)))} assume !(~e <= -128); {14162#(or (< 0 (+ base2flt_~e 124)) (not (<= 0 |base2flt_#in~e|)))} is VALID [2022-02-21 03:10:25,573 INFO L290 TraceCheckUtils]: 13: Hoare triple {14162#(or (< 0 (+ base2flt_~e 124)) (not (<= 0 |base2flt_#in~e|)))} assume !false; {14162#(or (< 0 (+ base2flt_~e 124)) (not (<= 0 |base2flt_#in~e|)))} is VALID [2022-02-21 03:10:25,573 INFO L290 TraceCheckUtils]: 12: Hoare triple {14162#(or (< 0 (+ base2flt_~e 124)) (not (<= 0 |base2flt_#in~e|)))} assume ~m % 4294967296 < 16777216; {14162#(or (< 0 (+ base2flt_~e 124)) (not (<= 0 |base2flt_#in~e|)))} is VALID [2022-02-21 03:10:25,573 INFO L290 TraceCheckUtils]: 11: Hoare triple {14162#(or (< 0 (+ base2flt_~e 124)) (not (<= 0 |base2flt_#in~e|)))} assume !(0 == ~m % 4294967296); {14162#(or (< 0 (+ base2flt_~e 124)) (not (<= 0 |base2flt_#in~e|)))} is VALID [2022-02-21 03:10:25,574 INFO L290 TraceCheckUtils]: 10: Hoare triple {13863#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {14162#(or (< 0 (+ base2flt_~e 124)) (not (<= 0 |base2flt_#in~e|)))} is VALID [2022-02-21 03:10:25,574 INFO L272 TraceCheckUtils]: 9: Hoare triple {13863#true} call main_#t~ret23#1 := base2flt(1, 0); {13863#true} is VALID [2022-02-21 03:10:25,574 INFO L290 TraceCheckUtils]: 8: Hoare triple {13863#true} main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1; {13863#true} is VALID [2022-02-21 03:10:25,574 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {13863#true} {13863#true} #394#return; {13863#true} is VALID [2022-02-21 03:10:25,574 INFO L290 TraceCheckUtils]: 6: Hoare triple {13863#true} assume true; {13863#true} is VALID [2022-02-21 03:10:25,575 INFO L290 TraceCheckUtils]: 5: Hoare triple {13863#true} #res := ~__retres4~0; {13863#true} is VALID [2022-02-21 03:10:25,575 INFO L290 TraceCheckUtils]: 4: Hoare triple {13863#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {13863#true} is VALID [2022-02-21 03:10:25,575 INFO L290 TraceCheckUtils]: 3: Hoare triple {13863#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {13863#true} is VALID [2022-02-21 03:10:25,575 INFO L272 TraceCheckUtils]: 2: Hoare triple {13863#true} call main_#t~ret22#1 := base2flt(0, 0); {13863#true} is VALID [2022-02-21 03:10:25,575 INFO L290 TraceCheckUtils]: 1: Hoare triple {13863#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~ret22#1, main_#t~ret23#1, main_#t~ret24#1, main_#t~ret25#1, main_#t~ret26#1, main_~a~0#1, main_~ma~2#1, main_~ea~2#1, main_~b~0#1, main_~mb~2#1, main_~eb~2#1, main_~r_mul~0#1, main_~zero~0#1, main_~one~0#1, main_~sb~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~tmp___1~0#1, main_~__retres16~0#1;havoc main_~a~0#1;main_~ma~2#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;main_~ea~2#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1;havoc main_~b~0#1;main_~mb~2#1 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;main_~eb~2#1 := main_#t~nondet21#1;havoc main_#t~nondet21#1;havoc main_~r_mul~0#1;havoc main_~zero~0#1;havoc main_~one~0#1;havoc main_~sb~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~tmp___1~0#1;havoc main_~__retres16~0#1; {13863#true} is VALID [2022-02-21 03:10:25,575 INFO L290 TraceCheckUtils]: 0: Hoare triple {13863#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(21, 2);call #Ultimate.allocInit(12, 3); {13863#true} is VALID [2022-02-21 03:10:25,576 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 9 proven. 38 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-21 03:10:25,576 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1884198689] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:10:25,576 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:10:25,576 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 21 [2022-02-21 03:10:25,577 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219151831] [2022-02-21 03:10:25,577 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:10:25,577 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 4.714285714285714) internal successors, (99), 20 states have internal predecessors, (99), 2 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 49 [2022-02-21 03:10:25,578 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:10:25,578 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 21 states, 21 states have (on average 4.714285714285714) internal successors, (99), 20 states have internal predecessors, (99), 2 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-02-21 03:10:25,666 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 108 edges. 108 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:10:25,666 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-02-21 03:10:25,667 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:10:25,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-02-21 03:10:25,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=282, Unknown=0, NotChecked=0, Total=420 [2022-02-21 03:10:25,668 INFO L87 Difference]: Start difference. First operand 270 states and 350 transitions. Second operand has 21 states, 21 states have (on average 4.714285714285714) internal successors, (99), 20 states have internal predecessors, (99), 2 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-02-21 03:10:29,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:29,875 INFO L93 Difference]: Finished difference Result 2122 states and 2748 transitions. [2022-02-21 03:10:29,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2022-02-21 03:10:29,875 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 4.714285714285714) internal successors, (99), 20 states have internal predecessors, (99), 2 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 49 [2022-02-21 03:10:29,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:10:29,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 4.714285714285714) internal successors, (99), 20 states have internal predecessors, (99), 2 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-02-21 03:10:29,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 1102 transitions. [2022-02-21 03:10:29,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 4.714285714285714) internal successors, (99), 20 states have internal predecessors, (99), 2 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-02-21 03:10:29,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 1102 transitions. [2022-02-21 03:10:29,903 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 53 states and 1102 transitions. [2022-02-21 03:10:30,897 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1102 edges. 1102 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:10:31,073 INFO L225 Difference]: With dead ends: 2122 [2022-02-21 03:10:31,073 INFO L226 Difference]: Without dead ends: 1915 [2022-02-21 03:10:31,074 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1061 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1137, Invalid=2403, Unknown=0, NotChecked=0, Total=3540 [2022-02-21 03:10:31,075 INFO L933 BasicCegarLoop]: 127 mSDtfsCounter, 2098 mSDsluCounter, 812 mSDsCounter, 0 mSdLazyCounter, 512 mSolverCounterSat, 387 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2098 SdHoareTripleChecker+Valid, 939 SdHoareTripleChecker+Invalid, 899 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 387 IncrementalHoareTripleChecker+Valid, 512 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-02-21 03:10:31,075 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2098 Valid, 939 Invalid, 899 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [387 Valid, 512 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-02-21 03:10:31,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1915 states. [2022-02-21 03:10:31,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1915 to 300. [2022-02-21 03:10:31,205 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:10:31,205 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1915 states. Second operand has 300 states, 268 states have (on average 1.4104477611940298) internal successors, (378), 291 states have internal predecessors, (378), 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) [2022-02-21 03:10:31,206 INFO L74 IsIncluded]: Start isIncluded. First operand 1915 states. Second operand has 300 states, 268 states have (on average 1.4104477611940298) internal successors, (378), 291 states have internal predecessors, (378), 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) [2022-02-21 03:10:31,207 INFO L87 Difference]: Start difference. First operand 1915 states. Second operand has 300 states, 268 states have (on average 1.4104477611940298) internal successors, (378), 291 states have internal predecessors, (378), 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) [2022-02-21 03:10:31,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:31,357 INFO L93 Difference]: Finished difference Result 1915 states and 2435 transitions. [2022-02-21 03:10:31,358 INFO L276 IsEmpty]: Start isEmpty. Operand 1915 states and 2435 transitions. [2022-02-21 03:10:31,360 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:10:31,361 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:10:31,361 INFO L74 IsIncluded]: Start isIncluded. First operand has 300 states, 268 states have (on average 1.4104477611940298) internal successors, (378), 291 states have internal predecessors, (378), 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) Second operand 1915 states. [2022-02-21 03:10:31,362 INFO L87 Difference]: Start difference. First operand has 300 states, 268 states have (on average 1.4104477611940298) internal successors, (378), 291 states have internal predecessors, (378), 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) Second operand 1915 states. [2022-02-21 03:10:31,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:31,521 INFO L93 Difference]: Finished difference Result 1915 states and 2435 transitions. [2022-02-21 03:10:31,521 INFO L276 IsEmpty]: Start isEmpty. Operand 1915 states and 2435 transitions. [2022-02-21 03:10:31,525 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:10:31,525 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:10:31,525 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:10:31,526 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:10:31,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 268 states have (on average 1.4104477611940298) internal successors, (378), 291 states have internal predecessors, (378), 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) [2022-02-21 03:10:31,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 386 transitions. [2022-02-21 03:10:31,533 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 386 transitions. Word has length 49 [2022-02-21 03:10:31,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:10:31,533 INFO L470 AbstractCegarLoop]: Abstraction has 300 states and 386 transitions. [2022-02-21 03:10:31,534 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 4.714285714285714) internal successors, (99), 20 states have internal predecessors, (99), 2 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-02-21 03:10:31,534 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 386 transitions. [2022-02-21 03:10:31,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-02-21 03:10:31,534 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:10:31,535 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:10:31,564 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-02-21 03:10:31,747 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:10:31,748 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting base2fltErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2022-02-21 03:10:31,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:10:31,748 INFO L85 PathProgramCache]: Analyzing trace with hash 567559826, now seen corresponding path program 1 times [2022-02-21 03:10:31,748 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:10:31,748 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803901382] [2022-02-21 03:10:31,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:10:31,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:10:31,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:31,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-21 03:10:31,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:31,813 INFO L290 TraceCheckUtils]: 0: Hoare triple {20835#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {20798#true} is VALID [2022-02-21 03:10:31,813 INFO L290 TraceCheckUtils]: 1: Hoare triple {20798#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {20798#true} is VALID [2022-02-21 03:10:31,813 INFO L290 TraceCheckUtils]: 2: Hoare triple {20798#true} #res := ~__retres4~0; {20798#true} is VALID [2022-02-21 03:10:31,813 INFO L290 TraceCheckUtils]: 3: Hoare triple {20798#true} assume true; {20798#true} is VALID [2022-02-21 03:10:31,813 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {20798#true} {20798#true} #394#return; {20798#true} is VALID [2022-02-21 03:10:31,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-02-21 03:10:31,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:31,895 INFO L290 TraceCheckUtils]: 0: Hoare triple {20835#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {20836#(or (= base2flt_~m |base2flt_#in~m|) (= (+ (- 1) base2flt_~m) 0))} is VALID [2022-02-21 03:10:31,896 INFO L290 TraceCheckUtils]: 1: Hoare triple {20836#(or (= base2flt_~m |base2flt_#in~m|) (= (+ (- 1) base2flt_~m) 0))} assume !(0 == ~m % 4294967296); {20836#(or (= base2flt_~m |base2flt_#in~m|) (= (+ (- 1) base2flt_~m) 0))} is VALID [2022-02-21 03:10:31,896 INFO L290 TraceCheckUtils]: 2: Hoare triple {20836#(or (= base2flt_~m |base2flt_#in~m|) (= (+ (- 1) base2flt_~m) 0))} assume ~m % 4294967296 < 16777216; {20836#(or (= base2flt_~m |base2flt_#in~m|) (= (+ (- 1) base2flt_~m) 0))} is VALID [2022-02-21 03:10:31,897 INFO L290 TraceCheckUtils]: 3: Hoare triple {20836#(or (= base2flt_~m |base2flt_#in~m|) (= (+ (- 1) base2flt_~m) 0))} assume !false; {20836#(or (= base2flt_~m |base2flt_#in~m|) (= (+ (- 1) base2flt_~m) 0))} is VALID [2022-02-21 03:10:31,897 INFO L290 TraceCheckUtils]: 4: Hoare triple {20836#(or (= base2flt_~m |base2flt_#in~m|) (= (+ (- 1) base2flt_~m) 0))} assume !(~e <= -128); {20836#(or (= base2flt_~m |base2flt_#in~m|) (= (+ (- 1) base2flt_~m) 0))} is VALID [2022-02-21 03:10:31,897 INFO L290 TraceCheckUtils]: 5: Hoare triple {20836#(or (= base2flt_~m |base2flt_#in~m|) (= (+ (- 1) base2flt_~m) 0))} assume ~e - 1 <= 2147483647; {20836#(or (= base2flt_~m |base2flt_#in~m|) (= (+ (- 1) base2flt_~m) 0))} is VALID [2022-02-21 03:10:31,898 INFO L290 TraceCheckUtils]: 6: Hoare triple {20836#(or (= base2flt_~m |base2flt_#in~m|) (= (+ (- 1) base2flt_~m) 0))} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {20837#(or (and (<= base2flt_~m 2) (<= 2 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:31,899 INFO L290 TraceCheckUtils]: 7: Hoare triple {20837#(or (and (<= base2flt_~m 2) (<= 2 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} assume ~m % 4294967296 < 16777216; {20837#(or (and (<= base2flt_~m 2) (<= 2 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:31,899 INFO L290 TraceCheckUtils]: 8: Hoare triple {20837#(or (and (<= base2flt_~m 2) (<= 2 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} assume !false; {20837#(or (and (<= base2flt_~m 2) (<= 2 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:31,900 INFO L290 TraceCheckUtils]: 9: Hoare triple {20837#(or (and (<= base2flt_~m 2) (<= 2 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} assume !(~e <= -128); {20837#(or (and (<= base2flt_~m 2) (<= 2 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:31,900 INFO L290 TraceCheckUtils]: 10: Hoare triple {20837#(or (and (<= base2flt_~m 2) (<= 2 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} assume ~e - 1 <= 2147483647; {20837#(or (and (<= base2flt_~m 2) (<= 2 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:31,901 INFO L290 TraceCheckUtils]: 11: Hoare triple {20837#(or (and (<= base2flt_~m 2) (<= 2 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {20838#(or (and (<= base2flt_~m 4) (not (<= (+ (div base2flt_~m 4294967296) 1) 0))) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:31,902 INFO L290 TraceCheckUtils]: 12: Hoare triple {20838#(or (and (<= base2flt_~m 4) (not (<= (+ (div base2flt_~m 4294967296) 1) 0))) (not (= |base2flt_#in~m| 1)))} assume !(~m % 4294967296 < 16777216); {20839#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:31,902 INFO L290 TraceCheckUtils]: 13: Hoare triple {20839#(not (= |base2flt_#in~m| 1))} assume 0 == ~m || 0 == ~bitwiseComplement(16777216);~m := 0; {20839#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:31,902 INFO L290 TraceCheckUtils]: 14: Hoare triple {20839#(not (= |base2flt_#in~m| 1))} assume 128 + ~e <= 2147483647; {20839#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:31,903 INFO L290 TraceCheckUtils]: 15: Hoare triple {20839#(not (= |base2flt_#in~m| 1))} assume 128 + ~e >= -2147483648; {20839#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:31,903 INFO L290 TraceCheckUtils]: 16: Hoare triple {20839#(not (= |base2flt_#in~m| 1))} assume 16777216 * (128 + ~e) <= 2147483647; {20839#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:31,903 INFO L290 TraceCheckUtils]: 17: Hoare triple {20839#(not (= |base2flt_#in~m| 1))} assume 16777216 * (128 + ~e) >= -2147483648; {20839#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:31,904 INFO L290 TraceCheckUtils]: 18: Hoare triple {20839#(not (= |base2flt_#in~m| 1))} assume 128 + ~e <= 2147483647; {20839#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:31,904 INFO L290 TraceCheckUtils]: 19: Hoare triple {20839#(not (= |base2flt_#in~m| 1))} assume 128 + ~e >= -2147483648; {20839#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:31,904 INFO L290 TraceCheckUtils]: 20: Hoare triple {20839#(not (= |base2flt_#in~m| 1))} assume 16777216 * (128 + ~e) <= 2147483647; {20839#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:31,905 INFO L290 TraceCheckUtils]: 21: Hoare triple {20839#(not (= |base2flt_#in~m| 1))} assume 16777216 * (128 + ~e) >= -2147483648; {20839#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:31,905 INFO L290 TraceCheckUtils]: 22: Hoare triple {20839#(not (= |base2flt_#in~m| 1))} assume !((1 == ~m && (0 == 16777216 * (128 + ~e) || 1 == 16777216 * (128 + ~e))) || ((0 == ~m || 1 == ~m) && 1 == 16777216 * (128 + ~e))); {20839#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:31,906 INFO L290 TraceCheckUtils]: 23: Hoare triple {20839#(not (= |base2flt_#in~m| 1))} assume !(0 == ~m && (0 == 16777216 * (128 + ~e) || 1 == 16777216 * (128 + ~e))); {20839#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:31,906 INFO L290 TraceCheckUtils]: 24: Hoare triple {20839#(not (= |base2flt_#in~m| 1))} assume !((0 == ~m || 1 == ~m) && 0 == 16777216 * (128 + ~e)); {20839#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:31,906 INFO L290 TraceCheckUtils]: 25: Hoare triple {20839#(not (= |base2flt_#in~m| 1))} assume ~m >= 0 && 16777216 * (128 + ~e) >= 0;abs_77 := (if ~m < 16777216 * (128 + ~e) then 16777216 * (128 + ~e) else ~m);assume ~m >= 0 && 16777216 * (128 + ~e) >= 0;assume ~res~0 >= abs_77; {20839#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:31,907 INFO L290 TraceCheckUtils]: 26: Hoare triple {20839#(not (= |base2flt_#in~m| 1))} ~__retres4~0 := ~res~0; {20839#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:31,907 INFO L290 TraceCheckUtils]: 27: Hoare triple {20839#(not (= |base2flt_#in~m| 1))} #res := ~__retres4~0; {20839#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:31,907 INFO L290 TraceCheckUtils]: 28: Hoare triple {20839#(not (= |base2flt_#in~m| 1))} assume true; {20839#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:31,908 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {20839#(not (= |base2flt_#in~m| 1))} {20798#true} #396#return; {20799#false} is VALID [2022-02-21 03:10:31,908 INFO L290 TraceCheckUtils]: 0: Hoare triple {20798#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(21, 2);call #Ultimate.allocInit(12, 3); {20798#true} is VALID [2022-02-21 03:10:31,908 INFO L290 TraceCheckUtils]: 1: Hoare triple {20798#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~ret22#1, main_#t~ret23#1, main_#t~ret24#1, main_#t~ret25#1, main_#t~ret26#1, main_~a~0#1, main_~ma~2#1, main_~ea~2#1, main_~b~0#1, main_~mb~2#1, main_~eb~2#1, main_~r_mul~0#1, main_~zero~0#1, main_~one~0#1, main_~sb~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~tmp___1~0#1, main_~__retres16~0#1;havoc main_~a~0#1;main_~ma~2#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;main_~ea~2#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1;havoc main_~b~0#1;main_~mb~2#1 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;main_~eb~2#1 := main_#t~nondet21#1;havoc main_#t~nondet21#1;havoc main_~r_mul~0#1;havoc main_~zero~0#1;havoc main_~one~0#1;havoc main_~sb~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~tmp___1~0#1;havoc main_~__retres16~0#1; {20798#true} is VALID [2022-02-21 03:10:31,909 INFO L272 TraceCheckUtils]: 2: Hoare triple {20798#true} call main_#t~ret22#1 := base2flt(0, 0); {20835#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} is VALID [2022-02-21 03:10:31,909 INFO L290 TraceCheckUtils]: 3: Hoare triple {20835#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {20798#true} is VALID [2022-02-21 03:10:31,909 INFO L290 TraceCheckUtils]: 4: Hoare triple {20798#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {20798#true} is VALID [2022-02-21 03:10:31,910 INFO L290 TraceCheckUtils]: 5: Hoare triple {20798#true} #res := ~__retres4~0; {20798#true} is VALID [2022-02-21 03:10:31,910 INFO L290 TraceCheckUtils]: 6: Hoare triple {20798#true} assume true; {20798#true} is VALID [2022-02-21 03:10:31,910 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {20798#true} {20798#true} #394#return; {20798#true} is VALID [2022-02-21 03:10:31,910 INFO L290 TraceCheckUtils]: 8: Hoare triple {20798#true} main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1; {20798#true} is VALID [2022-02-21 03:10:31,911 INFO L272 TraceCheckUtils]: 9: Hoare triple {20798#true} call main_#t~ret23#1 := base2flt(1, 0); {20835#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} is VALID [2022-02-21 03:10:31,911 INFO L290 TraceCheckUtils]: 10: Hoare triple {20835#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {20836#(or (= base2flt_~m |base2flt_#in~m|) (= (+ (- 1) base2flt_~m) 0))} is VALID [2022-02-21 03:10:31,911 INFO L290 TraceCheckUtils]: 11: Hoare triple {20836#(or (= base2flt_~m |base2flt_#in~m|) (= (+ (- 1) base2flt_~m) 0))} assume !(0 == ~m % 4294967296); {20836#(or (= base2flt_~m |base2flt_#in~m|) (= (+ (- 1) base2flt_~m) 0))} is VALID [2022-02-21 03:10:31,912 INFO L290 TraceCheckUtils]: 12: Hoare triple {20836#(or (= base2flt_~m |base2flt_#in~m|) (= (+ (- 1) base2flt_~m) 0))} assume ~m % 4294967296 < 16777216; {20836#(or (= base2flt_~m |base2flt_#in~m|) (= (+ (- 1) base2flt_~m) 0))} is VALID [2022-02-21 03:10:31,912 INFO L290 TraceCheckUtils]: 13: Hoare triple {20836#(or (= base2flt_~m |base2flt_#in~m|) (= (+ (- 1) base2flt_~m) 0))} assume !false; {20836#(or (= base2flt_~m |base2flt_#in~m|) (= (+ (- 1) base2flt_~m) 0))} is VALID [2022-02-21 03:10:31,912 INFO L290 TraceCheckUtils]: 14: Hoare triple {20836#(or (= base2flt_~m |base2flt_#in~m|) (= (+ (- 1) base2flt_~m) 0))} assume !(~e <= -128); {20836#(or (= base2flt_~m |base2flt_#in~m|) (= (+ (- 1) base2flt_~m) 0))} is VALID [2022-02-21 03:10:31,913 INFO L290 TraceCheckUtils]: 15: Hoare triple {20836#(or (= base2flt_~m |base2flt_#in~m|) (= (+ (- 1) base2flt_~m) 0))} assume ~e - 1 <= 2147483647; {20836#(or (= base2flt_~m |base2flt_#in~m|) (= (+ (- 1) base2flt_~m) 0))} is VALID [2022-02-21 03:10:31,913 INFO L290 TraceCheckUtils]: 16: Hoare triple {20836#(or (= base2flt_~m |base2flt_#in~m|) (= (+ (- 1) base2flt_~m) 0))} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {20837#(or (and (<= base2flt_~m 2) (<= 2 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:31,914 INFO L290 TraceCheckUtils]: 17: Hoare triple {20837#(or (and (<= base2flt_~m 2) (<= 2 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} assume ~m % 4294967296 < 16777216; {20837#(or (and (<= base2flt_~m 2) (<= 2 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:31,914 INFO L290 TraceCheckUtils]: 18: Hoare triple {20837#(or (and (<= base2flt_~m 2) (<= 2 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} assume !false; {20837#(or (and (<= base2flt_~m 2) (<= 2 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:31,915 INFO L290 TraceCheckUtils]: 19: Hoare triple {20837#(or (and (<= base2flt_~m 2) (<= 2 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} assume !(~e <= -128); {20837#(or (and (<= base2flt_~m 2) (<= 2 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:31,915 INFO L290 TraceCheckUtils]: 20: Hoare triple {20837#(or (and (<= base2flt_~m 2) (<= 2 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} assume ~e - 1 <= 2147483647; {20837#(or (and (<= base2flt_~m 2) (<= 2 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:31,916 INFO L290 TraceCheckUtils]: 21: Hoare triple {20837#(or (and (<= base2flt_~m 2) (<= 2 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {20838#(or (and (<= base2flt_~m 4) (not (<= (+ (div base2flt_~m 4294967296) 1) 0))) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:31,917 INFO L290 TraceCheckUtils]: 22: Hoare triple {20838#(or (and (<= base2flt_~m 4) (not (<= (+ (div base2flt_~m 4294967296) 1) 0))) (not (= |base2flt_#in~m| 1)))} assume !(~m % 4294967296 < 16777216); {20839#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:31,917 INFO L290 TraceCheckUtils]: 23: Hoare triple {20839#(not (= |base2flt_#in~m| 1))} assume 0 == ~m || 0 == ~bitwiseComplement(16777216);~m := 0; {20839#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:31,918 INFO L290 TraceCheckUtils]: 24: Hoare triple {20839#(not (= |base2flt_#in~m| 1))} assume 128 + ~e <= 2147483647; {20839#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:31,918 INFO L290 TraceCheckUtils]: 25: Hoare triple {20839#(not (= |base2flt_#in~m| 1))} assume 128 + ~e >= -2147483648; {20839#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:31,918 INFO L290 TraceCheckUtils]: 26: Hoare triple {20839#(not (= |base2flt_#in~m| 1))} assume 16777216 * (128 + ~e) <= 2147483647; {20839#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:31,919 INFO L290 TraceCheckUtils]: 27: Hoare triple {20839#(not (= |base2flt_#in~m| 1))} assume 16777216 * (128 + ~e) >= -2147483648; {20839#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:31,919 INFO L290 TraceCheckUtils]: 28: Hoare triple {20839#(not (= |base2flt_#in~m| 1))} assume 128 + ~e <= 2147483647; {20839#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:31,919 INFO L290 TraceCheckUtils]: 29: Hoare triple {20839#(not (= |base2flt_#in~m| 1))} assume 128 + ~e >= -2147483648; {20839#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:31,920 INFO L290 TraceCheckUtils]: 30: Hoare triple {20839#(not (= |base2flt_#in~m| 1))} assume 16777216 * (128 + ~e) <= 2147483647; {20839#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:31,920 INFO L290 TraceCheckUtils]: 31: Hoare triple {20839#(not (= |base2flt_#in~m| 1))} assume 16777216 * (128 + ~e) >= -2147483648; {20839#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:31,920 INFO L290 TraceCheckUtils]: 32: Hoare triple {20839#(not (= |base2flt_#in~m| 1))} assume !((1 == ~m && (0 == 16777216 * (128 + ~e) || 1 == 16777216 * (128 + ~e))) || ((0 == ~m || 1 == ~m) && 1 == 16777216 * (128 + ~e))); {20839#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:31,921 INFO L290 TraceCheckUtils]: 33: Hoare triple {20839#(not (= |base2flt_#in~m| 1))} assume !(0 == ~m && (0 == 16777216 * (128 + ~e) || 1 == 16777216 * (128 + ~e))); {20839#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:31,921 INFO L290 TraceCheckUtils]: 34: Hoare triple {20839#(not (= |base2flt_#in~m| 1))} assume !((0 == ~m || 1 == ~m) && 0 == 16777216 * (128 + ~e)); {20839#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:31,921 INFO L290 TraceCheckUtils]: 35: Hoare triple {20839#(not (= |base2flt_#in~m| 1))} assume ~m >= 0 && 16777216 * (128 + ~e) >= 0;abs_77 := (if ~m < 16777216 * (128 + ~e) then 16777216 * (128 + ~e) else ~m);assume ~m >= 0 && 16777216 * (128 + ~e) >= 0;assume ~res~0 >= abs_77; {20839#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:31,922 INFO L290 TraceCheckUtils]: 36: Hoare triple {20839#(not (= |base2flt_#in~m| 1))} ~__retres4~0 := ~res~0; {20839#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:31,922 INFO L290 TraceCheckUtils]: 37: Hoare triple {20839#(not (= |base2flt_#in~m| 1))} #res := ~__retres4~0; {20839#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:31,922 INFO L290 TraceCheckUtils]: 38: Hoare triple {20839#(not (= |base2flt_#in~m| 1))} assume true; {20839#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:31,923 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {20839#(not (= |base2flt_#in~m| 1))} {20798#true} #396#return; {20799#false} is VALID [2022-02-21 03:10:31,923 INFO L290 TraceCheckUtils]: 40: Hoare triple {20799#false} main_~one~0#1 := main_#t~ret23#1;havoc main_#t~ret23#1; {20799#false} is VALID [2022-02-21 03:10:31,923 INFO L272 TraceCheckUtils]: 41: Hoare triple {20799#false} call main_#t~ret24#1 := base2flt(main_~ma~2#1, main_~ea~2#1); {20799#false} is VALID [2022-02-21 03:10:31,923 INFO L290 TraceCheckUtils]: 42: Hoare triple {20799#false} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {20799#false} is VALID [2022-02-21 03:10:31,923 INFO L290 TraceCheckUtils]: 43: Hoare triple {20799#false} assume !(0 == ~m % 4294967296); {20799#false} is VALID [2022-02-21 03:10:31,924 INFO L290 TraceCheckUtils]: 44: Hoare triple {20799#false} assume !(~m % 4294967296 < 16777216); {20799#false} is VALID [2022-02-21 03:10:31,924 INFO L290 TraceCheckUtils]: 45: Hoare triple {20799#false} assume !false; {20799#false} is VALID [2022-02-21 03:10:31,924 INFO L290 TraceCheckUtils]: 46: Hoare triple {20799#false} assume !(~m % 4294967296 >= 33554432); {20799#false} is VALID [2022-02-21 03:10:31,924 INFO L290 TraceCheckUtils]: 47: Hoare triple {20799#false} assume 0 == ~m || 0 == ~bitwiseComplement(16777216);~m := 0; {20799#false} is VALID [2022-02-21 03:10:31,924 INFO L290 TraceCheckUtils]: 48: Hoare triple {20799#false} assume 128 + ~e <= 2147483647; {20799#false} is VALID [2022-02-21 03:10:31,924 INFO L290 TraceCheckUtils]: 49: Hoare triple {20799#false} assume 128 + ~e >= -2147483648; {20799#false} is VALID [2022-02-21 03:10:31,924 INFO L290 TraceCheckUtils]: 50: Hoare triple {20799#false} assume !(16777216 * (128 + ~e) <= 2147483647); {20799#false} is VALID [2022-02-21 03:10:31,925 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-21 03:10:31,926 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:10:31,926 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803901382] [2022-02-21 03:10:31,926 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [803901382] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:10:31,926 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [147822590] [2022-02-21 03:10:31,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:10:31,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:10:31,927 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:10:31,932 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) [2022-02-21 03:10:31,934 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-02-21 03:10:31,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:31,993 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 9 conjunts are in the unsatisfiable core [2022-02-21 03:10:32,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:32,007 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:10:32,188 INFO L290 TraceCheckUtils]: 0: Hoare triple {20798#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(21, 2);call #Ultimate.allocInit(12, 3); {20798#true} is VALID [2022-02-21 03:10:32,189 INFO L290 TraceCheckUtils]: 1: Hoare triple {20798#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~ret22#1, main_#t~ret23#1, main_#t~ret24#1, main_#t~ret25#1, main_#t~ret26#1, main_~a~0#1, main_~ma~2#1, main_~ea~2#1, main_~b~0#1, main_~mb~2#1, main_~eb~2#1, main_~r_mul~0#1, main_~zero~0#1, main_~one~0#1, main_~sb~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~tmp___1~0#1, main_~__retres16~0#1;havoc main_~a~0#1;main_~ma~2#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;main_~ea~2#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1;havoc main_~b~0#1;main_~mb~2#1 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;main_~eb~2#1 := main_#t~nondet21#1;havoc main_#t~nondet21#1;havoc main_~r_mul~0#1;havoc main_~zero~0#1;havoc main_~one~0#1;havoc main_~sb~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~tmp___1~0#1;havoc main_~__retres16~0#1; {20798#true} is VALID [2022-02-21 03:10:32,189 INFO L272 TraceCheckUtils]: 2: Hoare triple {20798#true} call main_#t~ret22#1 := base2flt(0, 0); {20798#true} is VALID [2022-02-21 03:10:32,189 INFO L290 TraceCheckUtils]: 3: Hoare triple {20798#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {20798#true} is VALID [2022-02-21 03:10:32,189 INFO L290 TraceCheckUtils]: 4: Hoare triple {20798#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {20798#true} is VALID [2022-02-21 03:10:32,189 INFO L290 TraceCheckUtils]: 5: Hoare triple {20798#true} #res := ~__retres4~0; {20798#true} is VALID [2022-02-21 03:10:32,190 INFO L290 TraceCheckUtils]: 6: Hoare triple {20798#true} assume true; {20798#true} is VALID [2022-02-21 03:10:32,190 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {20798#true} {20798#true} #394#return; {20798#true} is VALID [2022-02-21 03:10:32,190 INFO L290 TraceCheckUtils]: 8: Hoare triple {20798#true} main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1; {20798#true} is VALID [2022-02-21 03:10:32,190 INFO L272 TraceCheckUtils]: 9: Hoare triple {20798#true} call main_#t~ret23#1 := base2flt(1, 0); {20798#true} is VALID [2022-02-21 03:10:32,190 INFO L290 TraceCheckUtils]: 10: Hoare triple {20798#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {20873#(= base2flt_~m |base2flt_#in~m|)} is VALID [2022-02-21 03:10:32,191 INFO L290 TraceCheckUtils]: 11: Hoare triple {20873#(= base2flt_~m |base2flt_#in~m|)} assume !(0 == ~m % 4294967296); {20873#(= base2flt_~m |base2flt_#in~m|)} is VALID [2022-02-21 03:10:32,191 INFO L290 TraceCheckUtils]: 12: Hoare triple {20873#(= base2flt_~m |base2flt_#in~m|)} assume ~m % 4294967296 < 16777216; {20873#(= base2flt_~m |base2flt_#in~m|)} is VALID [2022-02-21 03:10:32,192 INFO L290 TraceCheckUtils]: 13: Hoare triple {20873#(= base2flt_~m |base2flt_#in~m|)} assume !false; {20873#(= base2flt_~m |base2flt_#in~m|)} is VALID [2022-02-21 03:10:32,192 INFO L290 TraceCheckUtils]: 14: Hoare triple {20873#(= base2flt_~m |base2flt_#in~m|)} assume !(~e <= -128); {20873#(= base2flt_~m |base2flt_#in~m|)} is VALID [2022-02-21 03:10:32,192 INFO L290 TraceCheckUtils]: 15: Hoare triple {20873#(= base2flt_~m |base2flt_#in~m|)} assume ~e - 1 <= 2147483647; {20873#(= base2flt_~m |base2flt_#in~m|)} is VALID [2022-02-21 03:10:32,193 INFO L290 TraceCheckUtils]: 16: Hoare triple {20873#(= base2flt_~m |base2flt_#in~m|)} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {20892#(= (* 2 |base2flt_#in~m|) base2flt_~m)} is VALID [2022-02-21 03:10:32,193 INFO L290 TraceCheckUtils]: 17: Hoare triple {20892#(= (* 2 |base2flt_#in~m|) base2flt_~m)} assume ~m % 4294967296 < 16777216; {20892#(= (* 2 |base2flt_#in~m|) base2flt_~m)} is VALID [2022-02-21 03:10:32,194 INFO L290 TraceCheckUtils]: 18: Hoare triple {20892#(= (* 2 |base2flt_#in~m|) base2flt_~m)} assume !false; {20892#(= (* 2 |base2flt_#in~m|) base2flt_~m)} is VALID [2022-02-21 03:10:32,194 INFO L290 TraceCheckUtils]: 19: Hoare triple {20892#(= (* 2 |base2flt_#in~m|) base2flt_~m)} assume !(~e <= -128); {20892#(= (* 2 |base2flt_#in~m|) base2flt_~m)} is VALID [2022-02-21 03:10:32,194 INFO L290 TraceCheckUtils]: 20: Hoare triple {20892#(= (* 2 |base2flt_#in~m|) base2flt_~m)} assume ~e - 1 <= 2147483647; {20892#(= (* 2 |base2flt_#in~m|) base2flt_~m)} is VALID [2022-02-21 03:10:32,195 INFO L290 TraceCheckUtils]: 21: Hoare triple {20892#(= (* 2 |base2flt_#in~m|) base2flt_~m)} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {20908#(= (* |base2flt_#in~m| 4) base2flt_~m)} is VALID [2022-02-21 03:10:32,196 INFO L290 TraceCheckUtils]: 22: Hoare triple {20908#(= (* |base2flt_#in~m| 4) base2flt_~m)} assume !(~m % 4294967296 < 16777216); {20912#(not (< (mod (* |base2flt_#in~m| 4) 4294967296) 16777216))} is VALID [2022-02-21 03:10:32,196 INFO L290 TraceCheckUtils]: 23: Hoare triple {20912#(not (< (mod (* |base2flt_#in~m| 4) 4294967296) 16777216))} assume 0 == ~m || 0 == ~bitwiseComplement(16777216);~m := 0; {20912#(not (< (mod (* |base2flt_#in~m| 4) 4294967296) 16777216))} is VALID [2022-02-21 03:10:32,197 INFO L290 TraceCheckUtils]: 24: Hoare triple {20912#(not (< (mod (* |base2flt_#in~m| 4) 4294967296) 16777216))} assume 128 + ~e <= 2147483647; {20912#(not (< (mod (* |base2flt_#in~m| 4) 4294967296) 16777216))} is VALID [2022-02-21 03:10:32,197 INFO L290 TraceCheckUtils]: 25: Hoare triple {20912#(not (< (mod (* |base2flt_#in~m| 4) 4294967296) 16777216))} assume 128 + ~e >= -2147483648; {20912#(not (< (mod (* |base2flt_#in~m| 4) 4294967296) 16777216))} is VALID [2022-02-21 03:10:32,197 INFO L290 TraceCheckUtils]: 26: Hoare triple {20912#(not (< (mod (* |base2flt_#in~m| 4) 4294967296) 16777216))} assume 16777216 * (128 + ~e) <= 2147483647; {20912#(not (< (mod (* |base2flt_#in~m| 4) 4294967296) 16777216))} is VALID [2022-02-21 03:10:32,198 INFO L290 TraceCheckUtils]: 27: Hoare triple {20912#(not (< (mod (* |base2flt_#in~m| 4) 4294967296) 16777216))} assume 16777216 * (128 + ~e) >= -2147483648; {20912#(not (< (mod (* |base2flt_#in~m| 4) 4294967296) 16777216))} is VALID [2022-02-21 03:10:32,198 INFO L290 TraceCheckUtils]: 28: Hoare triple {20912#(not (< (mod (* |base2flt_#in~m| 4) 4294967296) 16777216))} assume 128 + ~e <= 2147483647; {20912#(not (< (mod (* |base2flt_#in~m| 4) 4294967296) 16777216))} is VALID [2022-02-21 03:10:32,199 INFO L290 TraceCheckUtils]: 29: Hoare triple {20912#(not (< (mod (* |base2flt_#in~m| 4) 4294967296) 16777216))} assume 128 + ~e >= -2147483648; {20912#(not (< (mod (* |base2flt_#in~m| 4) 4294967296) 16777216))} is VALID [2022-02-21 03:10:32,199 INFO L290 TraceCheckUtils]: 30: Hoare triple {20912#(not (< (mod (* |base2flt_#in~m| 4) 4294967296) 16777216))} assume 16777216 * (128 + ~e) <= 2147483647; {20912#(not (< (mod (* |base2flt_#in~m| 4) 4294967296) 16777216))} is VALID [2022-02-21 03:10:32,199 INFO L290 TraceCheckUtils]: 31: Hoare triple {20912#(not (< (mod (* |base2flt_#in~m| 4) 4294967296) 16777216))} assume 16777216 * (128 + ~e) >= -2147483648; {20912#(not (< (mod (* |base2flt_#in~m| 4) 4294967296) 16777216))} is VALID [2022-02-21 03:10:32,200 INFO L290 TraceCheckUtils]: 32: Hoare triple {20912#(not (< (mod (* |base2flt_#in~m| 4) 4294967296) 16777216))} assume !((1 == ~m && (0 == 16777216 * (128 + ~e) || 1 == 16777216 * (128 + ~e))) || ((0 == ~m || 1 == ~m) && 1 == 16777216 * (128 + ~e))); {20912#(not (< (mod (* |base2flt_#in~m| 4) 4294967296) 16777216))} is VALID [2022-02-21 03:10:32,200 INFO L290 TraceCheckUtils]: 33: Hoare triple {20912#(not (< (mod (* |base2flt_#in~m| 4) 4294967296) 16777216))} assume !(0 == ~m && (0 == 16777216 * (128 + ~e) || 1 == 16777216 * (128 + ~e))); {20912#(not (< (mod (* |base2flt_#in~m| 4) 4294967296) 16777216))} is VALID [2022-02-21 03:10:32,200 INFO L290 TraceCheckUtils]: 34: Hoare triple {20912#(not (< (mod (* |base2flt_#in~m| 4) 4294967296) 16777216))} assume !((0 == ~m || 1 == ~m) && 0 == 16777216 * (128 + ~e)); {20912#(not (< (mod (* |base2flt_#in~m| 4) 4294967296) 16777216))} is VALID [2022-02-21 03:10:32,201 INFO L290 TraceCheckUtils]: 35: Hoare triple {20912#(not (< (mod (* |base2flt_#in~m| 4) 4294967296) 16777216))} assume ~m >= 0 && 16777216 * (128 + ~e) >= 0;abs_77 := (if ~m < 16777216 * (128 + ~e) then 16777216 * (128 + ~e) else ~m);assume ~m >= 0 && 16777216 * (128 + ~e) >= 0;assume ~res~0 >= abs_77; {20912#(not (< (mod (* |base2flt_#in~m| 4) 4294967296) 16777216))} is VALID [2022-02-21 03:10:32,201 INFO L290 TraceCheckUtils]: 36: Hoare triple {20912#(not (< (mod (* |base2flt_#in~m| 4) 4294967296) 16777216))} ~__retres4~0 := ~res~0; {20912#(not (< (mod (* |base2flt_#in~m| 4) 4294967296) 16777216))} is VALID [2022-02-21 03:10:32,201 INFO L290 TraceCheckUtils]: 37: Hoare triple {20912#(not (< (mod (* |base2flt_#in~m| 4) 4294967296) 16777216))} #res := ~__retres4~0; {20912#(not (< (mod (* |base2flt_#in~m| 4) 4294967296) 16777216))} is VALID [2022-02-21 03:10:32,202 INFO L290 TraceCheckUtils]: 38: Hoare triple {20912#(not (< (mod (* |base2flt_#in~m| 4) 4294967296) 16777216))} assume true; {20912#(not (< (mod (* |base2flt_#in~m| 4) 4294967296) 16777216))} is VALID [2022-02-21 03:10:32,203 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {20912#(not (< (mod (* |base2flt_#in~m| 4) 4294967296) 16777216))} {20798#true} #396#return; {20799#false} is VALID [2022-02-21 03:10:32,203 INFO L290 TraceCheckUtils]: 40: Hoare triple {20799#false} main_~one~0#1 := main_#t~ret23#1;havoc main_#t~ret23#1; {20799#false} is VALID [2022-02-21 03:10:32,203 INFO L272 TraceCheckUtils]: 41: Hoare triple {20799#false} call main_#t~ret24#1 := base2flt(main_~ma~2#1, main_~ea~2#1); {20799#false} is VALID [2022-02-21 03:10:32,203 INFO L290 TraceCheckUtils]: 42: Hoare triple {20799#false} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {20799#false} is VALID [2022-02-21 03:10:32,203 INFO L290 TraceCheckUtils]: 43: Hoare triple {20799#false} assume !(0 == ~m % 4294967296); {20799#false} is VALID [2022-02-21 03:10:32,203 INFO L290 TraceCheckUtils]: 44: Hoare triple {20799#false} assume !(~m % 4294967296 < 16777216); {20799#false} is VALID [2022-02-21 03:10:32,203 INFO L290 TraceCheckUtils]: 45: Hoare triple {20799#false} assume !false; {20799#false} is VALID [2022-02-21 03:10:32,204 INFO L290 TraceCheckUtils]: 46: Hoare triple {20799#false} assume !(~m % 4294967296 >= 33554432); {20799#false} is VALID [2022-02-21 03:10:32,204 INFO L290 TraceCheckUtils]: 47: Hoare triple {20799#false} assume 0 == ~m || 0 == ~bitwiseComplement(16777216);~m := 0; {20799#false} is VALID [2022-02-21 03:10:32,204 INFO L290 TraceCheckUtils]: 48: Hoare triple {20799#false} assume 128 + ~e <= 2147483647; {20799#false} is VALID [2022-02-21 03:10:32,204 INFO L290 TraceCheckUtils]: 49: Hoare triple {20799#false} assume 128 + ~e >= -2147483648; {20799#false} is VALID [2022-02-21 03:10:32,204 INFO L290 TraceCheckUtils]: 50: Hoare triple {20799#false} assume !(16777216 * (128 + ~e) <= 2147483647); {20799#false} is VALID [2022-02-21 03:10:32,204 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-21 03:10:32,205 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:10:32,480 INFO L290 TraceCheckUtils]: 50: Hoare triple {20799#false} assume !(16777216 * (128 + ~e) <= 2147483647); {20799#false} is VALID [2022-02-21 03:10:32,480 INFO L290 TraceCheckUtils]: 49: Hoare triple {20799#false} assume 128 + ~e >= -2147483648; {20799#false} is VALID [2022-02-21 03:10:32,480 INFO L290 TraceCheckUtils]: 48: Hoare triple {20799#false} assume 128 + ~e <= 2147483647; {20799#false} is VALID [2022-02-21 03:10:32,480 INFO L290 TraceCheckUtils]: 47: Hoare triple {20799#false} assume 0 == ~m || 0 == ~bitwiseComplement(16777216);~m := 0; {20799#false} is VALID [2022-02-21 03:10:32,480 INFO L290 TraceCheckUtils]: 46: Hoare triple {20799#false} assume !(~m % 4294967296 >= 33554432); {20799#false} is VALID [2022-02-21 03:10:32,480 INFO L290 TraceCheckUtils]: 45: Hoare triple {20799#false} assume !false; {20799#false} is VALID [2022-02-21 03:10:32,480 INFO L290 TraceCheckUtils]: 44: Hoare triple {20799#false} assume !(~m % 4294967296 < 16777216); {20799#false} is VALID [2022-02-21 03:10:32,481 INFO L290 TraceCheckUtils]: 43: Hoare triple {20799#false} assume !(0 == ~m % 4294967296); {20799#false} is VALID [2022-02-21 03:10:32,481 INFO L290 TraceCheckUtils]: 42: Hoare triple {20799#false} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {20799#false} is VALID [2022-02-21 03:10:32,481 INFO L272 TraceCheckUtils]: 41: Hoare triple {20799#false} call main_#t~ret24#1 := base2flt(main_~ma~2#1, main_~ea~2#1); {20799#false} is VALID [2022-02-21 03:10:32,481 INFO L290 TraceCheckUtils]: 40: Hoare triple {20799#false} main_~one~0#1 := main_#t~ret23#1;havoc main_#t~ret23#1; {20799#false} is VALID [2022-02-21 03:10:32,482 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {20839#(not (= |base2flt_#in~m| 1))} {20798#true} #396#return; {20799#false} is VALID [2022-02-21 03:10:32,482 INFO L290 TraceCheckUtils]: 38: Hoare triple {20839#(not (= |base2flt_#in~m| 1))} assume true; {20839#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:32,483 INFO L290 TraceCheckUtils]: 37: Hoare triple {20839#(not (= |base2flt_#in~m| 1))} #res := ~__retres4~0; {20839#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:32,483 INFO L290 TraceCheckUtils]: 36: Hoare triple {20839#(not (= |base2flt_#in~m| 1))} ~__retres4~0 := ~res~0; {20839#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:32,483 INFO L290 TraceCheckUtils]: 35: Hoare triple {20839#(not (= |base2flt_#in~m| 1))} assume ~m >= 0 && 16777216 * (128 + ~e) >= 0;abs_77 := (if ~m < 16777216 * (128 + ~e) then 16777216 * (128 + ~e) else ~m);assume ~m >= 0 && 16777216 * (128 + ~e) >= 0;assume ~res~0 >= abs_77; {20839#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:32,484 INFO L290 TraceCheckUtils]: 34: Hoare triple {20839#(not (= |base2flt_#in~m| 1))} assume !((0 == ~m || 1 == ~m) && 0 == 16777216 * (128 + ~e)); {20839#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:32,484 INFO L290 TraceCheckUtils]: 33: Hoare triple {20839#(not (= |base2flt_#in~m| 1))} assume !(0 == ~m && (0 == 16777216 * (128 + ~e) || 1 == 16777216 * (128 + ~e))); {20839#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:32,485 INFO L290 TraceCheckUtils]: 32: Hoare triple {20839#(not (= |base2flt_#in~m| 1))} assume !((1 == ~m && (0 == 16777216 * (128 + ~e) || 1 == 16777216 * (128 + ~e))) || ((0 == ~m || 1 == ~m) && 1 == 16777216 * (128 + ~e))); {20839#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:32,485 INFO L290 TraceCheckUtils]: 31: Hoare triple {20839#(not (= |base2flt_#in~m| 1))} assume 16777216 * (128 + ~e) >= -2147483648; {20839#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:32,485 INFO L290 TraceCheckUtils]: 30: Hoare triple {20839#(not (= |base2flt_#in~m| 1))} assume 16777216 * (128 + ~e) <= 2147483647; {20839#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:32,486 INFO L290 TraceCheckUtils]: 29: Hoare triple {20839#(not (= |base2flt_#in~m| 1))} assume 128 + ~e >= -2147483648; {20839#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:32,486 INFO L290 TraceCheckUtils]: 28: Hoare triple {20839#(not (= |base2flt_#in~m| 1))} assume 128 + ~e <= 2147483647; {20839#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:32,487 INFO L290 TraceCheckUtils]: 27: Hoare triple {20839#(not (= |base2flt_#in~m| 1))} assume 16777216 * (128 + ~e) >= -2147483648; {20839#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:32,487 INFO L290 TraceCheckUtils]: 26: Hoare triple {20839#(not (= |base2flt_#in~m| 1))} assume 16777216 * (128 + ~e) <= 2147483647; {20839#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:32,487 INFO L290 TraceCheckUtils]: 25: Hoare triple {20839#(not (= |base2flt_#in~m| 1))} assume 128 + ~e >= -2147483648; {20839#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:32,488 INFO L290 TraceCheckUtils]: 24: Hoare triple {20839#(not (= |base2flt_#in~m| 1))} assume 128 + ~e <= 2147483647; {20839#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:32,488 INFO L290 TraceCheckUtils]: 23: Hoare triple {20839#(not (= |base2flt_#in~m| 1))} assume 0 == ~m || 0 == ~bitwiseComplement(16777216);~m := 0; {20839#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:32,489 INFO L290 TraceCheckUtils]: 22: Hoare triple {21084#(or (< (mod base2flt_~m 4294967296) 16777216) (not (= |base2flt_#in~m| 1)))} assume !(~m % 4294967296 < 16777216); {20839#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:32,490 INFO L290 TraceCheckUtils]: 21: Hoare triple {21088#(or (< (mod (* 2 base2flt_~m) 4294967296) 16777216) (not (= |base2flt_#in~m| 1)))} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {21084#(or (< (mod base2flt_~m 4294967296) 16777216) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:32,491 INFO L290 TraceCheckUtils]: 20: Hoare triple {21088#(or (< (mod (* 2 base2flt_~m) 4294967296) 16777216) (not (= |base2flt_#in~m| 1)))} assume ~e - 1 <= 2147483647; {21088#(or (< (mod (* 2 base2flt_~m) 4294967296) 16777216) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:32,491 INFO L290 TraceCheckUtils]: 19: Hoare triple {21088#(or (< (mod (* 2 base2flt_~m) 4294967296) 16777216) (not (= |base2flt_#in~m| 1)))} assume !(~e <= -128); {21088#(or (< (mod (* 2 base2flt_~m) 4294967296) 16777216) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:32,492 INFO L290 TraceCheckUtils]: 18: Hoare triple {21088#(or (< (mod (* 2 base2flt_~m) 4294967296) 16777216) (not (= |base2flt_#in~m| 1)))} assume !false; {21088#(or (< (mod (* 2 base2flt_~m) 4294967296) 16777216) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:32,492 INFO L290 TraceCheckUtils]: 17: Hoare triple {21088#(or (< (mod (* 2 base2flt_~m) 4294967296) 16777216) (not (= |base2flt_#in~m| 1)))} assume ~m % 4294967296 < 16777216; {21088#(or (< (mod (* 2 base2flt_~m) 4294967296) 16777216) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:32,494 INFO L290 TraceCheckUtils]: 16: Hoare triple {21104#(or (< (mod (* base2flt_~m 4) 4294967296) 16777216) (not (= |base2flt_#in~m| 1)))} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {21088#(or (< (mod (* 2 base2flt_~m) 4294967296) 16777216) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:32,494 INFO L290 TraceCheckUtils]: 15: Hoare triple {21104#(or (< (mod (* base2flt_~m 4) 4294967296) 16777216) (not (= |base2flt_#in~m| 1)))} assume ~e - 1 <= 2147483647; {21104#(or (< (mod (* base2flt_~m 4) 4294967296) 16777216) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:32,495 INFO L290 TraceCheckUtils]: 14: Hoare triple {21104#(or (< (mod (* base2flt_~m 4) 4294967296) 16777216) (not (= |base2flt_#in~m| 1)))} assume !(~e <= -128); {21104#(or (< (mod (* base2flt_~m 4) 4294967296) 16777216) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:32,495 INFO L290 TraceCheckUtils]: 13: Hoare triple {21104#(or (< (mod (* base2flt_~m 4) 4294967296) 16777216) (not (= |base2flt_#in~m| 1)))} assume !false; {21104#(or (< (mod (* base2flt_~m 4) 4294967296) 16777216) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:32,496 INFO L290 TraceCheckUtils]: 12: Hoare triple {21104#(or (< (mod (* base2flt_~m 4) 4294967296) 16777216) (not (= |base2flt_#in~m| 1)))} assume ~m % 4294967296 < 16777216; {21104#(or (< (mod (* base2flt_~m 4) 4294967296) 16777216) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:32,496 INFO L290 TraceCheckUtils]: 11: Hoare triple {21104#(or (< (mod (* base2flt_~m 4) 4294967296) 16777216) (not (= |base2flt_#in~m| 1)))} assume !(0 == ~m % 4294967296); {21104#(or (< (mod (* base2flt_~m 4) 4294967296) 16777216) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:32,496 INFO L290 TraceCheckUtils]: 10: Hoare triple {20798#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {21104#(or (< (mod (* base2flt_~m 4) 4294967296) 16777216) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:32,497 INFO L272 TraceCheckUtils]: 9: Hoare triple {20798#true} call main_#t~ret23#1 := base2flt(1, 0); {20798#true} is VALID [2022-02-21 03:10:32,497 INFO L290 TraceCheckUtils]: 8: Hoare triple {20798#true} main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1; {20798#true} is VALID [2022-02-21 03:10:32,497 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {20798#true} {20798#true} #394#return; {20798#true} is VALID [2022-02-21 03:10:32,497 INFO L290 TraceCheckUtils]: 6: Hoare triple {20798#true} assume true; {20798#true} is VALID [2022-02-21 03:10:32,497 INFO L290 TraceCheckUtils]: 5: Hoare triple {20798#true} #res := ~__retres4~0; {20798#true} is VALID [2022-02-21 03:10:32,497 INFO L290 TraceCheckUtils]: 4: Hoare triple {20798#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {20798#true} is VALID [2022-02-21 03:10:32,498 INFO L290 TraceCheckUtils]: 3: Hoare triple {20798#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {20798#true} is VALID [2022-02-21 03:10:32,498 INFO L272 TraceCheckUtils]: 2: Hoare triple {20798#true} call main_#t~ret22#1 := base2flt(0, 0); {20798#true} is VALID [2022-02-21 03:10:32,498 INFO L290 TraceCheckUtils]: 1: Hoare triple {20798#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~ret22#1, main_#t~ret23#1, main_#t~ret24#1, main_#t~ret25#1, main_#t~ret26#1, main_~a~0#1, main_~ma~2#1, main_~ea~2#1, main_~b~0#1, main_~mb~2#1, main_~eb~2#1, main_~r_mul~0#1, main_~zero~0#1, main_~one~0#1, main_~sb~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~tmp___1~0#1, main_~__retres16~0#1;havoc main_~a~0#1;main_~ma~2#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;main_~ea~2#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1;havoc main_~b~0#1;main_~mb~2#1 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;main_~eb~2#1 := main_#t~nondet21#1;havoc main_#t~nondet21#1;havoc main_~r_mul~0#1;havoc main_~zero~0#1;havoc main_~one~0#1;havoc main_~sb~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~tmp___1~0#1;havoc main_~__retres16~0#1; {20798#true} is VALID [2022-02-21 03:10:32,498 INFO L290 TraceCheckUtils]: 0: Hoare triple {20798#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(21, 2);call #Ultimate.allocInit(12, 3); {20798#true} is VALID [2022-02-21 03:10:32,498 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-21 03:10:32,499 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [147822590] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:10:32,499 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:10:32,499 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 14 [2022-02-21 03:10:32,500 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963155088] [2022-02-21 03:10:32,500 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:10:32,500 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 6.357142857142857) internal successors, (89), 13 states have internal predecessors, (89), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 51 [2022-02-21 03:10:32,501 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:10:32,501 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 6.357142857142857) internal successors, (89), 13 states have internal predecessors, (89), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-21 03:10:32,581 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 97 edges. 97 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:10:32,581 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-02-21 03:10:32,581 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:10:32,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-02-21 03:10:32,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2022-02-21 03:10:32,582 INFO L87 Difference]: Start difference. First operand 300 states and 386 transitions. Second operand has 14 states, 14 states have (on average 6.357142857142857) internal successors, (89), 13 states have internal predecessors, (89), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-21 03:10:35,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:35,666 INFO L93 Difference]: Finished difference Result 1225 states and 1545 transitions. [2022-02-21 03:10:35,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-02-21 03:10:35,666 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 6.357142857142857) internal successors, (89), 13 states have internal predecessors, (89), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 51 [2022-02-21 03:10:35,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:10:35,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 6.357142857142857) internal successors, (89), 13 states have internal predecessors, (89), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-21 03:10:35,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 670 transitions. [2022-02-21 03:10:35,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 6.357142857142857) internal successors, (89), 13 states have internal predecessors, (89), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-21 03:10:35,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 670 transitions. [2022-02-21 03:10:35,679 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 28 states and 670 transitions. [2022-02-21 03:10:36,471 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 670 edges. 670 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:10:36,510 INFO L225 Difference]: With dead ends: 1225 [2022-02-21 03:10:36,510 INFO L226 Difference]: Without dead ends: 942 [2022-02-21 03:10:36,510 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 289 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=345, Invalid=845, Unknown=0, NotChecked=0, Total=1190 [2022-02-21 03:10:36,511 INFO L933 BasicCegarLoop]: 187 mSDtfsCounter, 761 mSDsluCounter, 873 mSDsCounter, 0 mSdLazyCounter, 448 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 761 SdHoareTripleChecker+Valid, 1060 SdHoareTripleChecker+Invalid, 547 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-21 03:10:36,511 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [761 Valid, 1060 Invalid, 547 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 448 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-02-21 03:10:36,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 942 states. [2022-02-21 03:10:36,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 942 to 364. [2022-02-21 03:10:36,765 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:10:36,766 INFO L82 GeneralOperation]: Start isEquivalent. First operand 942 states. Second operand has 364 states, 332 states have (on average 1.4006024096385543) internal successors, (465), 355 states have internal predecessors, (465), 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) [2022-02-21 03:10:36,768 INFO L74 IsIncluded]: Start isIncluded. First operand 942 states. Second operand has 364 states, 332 states have (on average 1.4006024096385543) internal successors, (465), 355 states have internal predecessors, (465), 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) [2022-02-21 03:10:36,768 INFO L87 Difference]: Start difference. First operand 942 states. Second operand has 364 states, 332 states have (on average 1.4006024096385543) internal successors, (465), 355 states have internal predecessors, (465), 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) [2022-02-21 03:10:36,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:36,809 INFO L93 Difference]: Finished difference Result 942 states and 1159 transitions. [2022-02-21 03:10:36,809 INFO L276 IsEmpty]: Start isEmpty. Operand 942 states and 1159 transitions. [2022-02-21 03:10:36,811 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:10:36,811 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:10:36,812 INFO L74 IsIncluded]: Start isIncluded. First operand has 364 states, 332 states have (on average 1.4006024096385543) internal successors, (465), 355 states have internal predecessors, (465), 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) Second operand 942 states. [2022-02-21 03:10:36,814 INFO L87 Difference]: Start difference. First operand has 364 states, 332 states have (on average 1.4006024096385543) internal successors, (465), 355 states have internal predecessors, (465), 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) Second operand 942 states. [2022-02-21 03:10:36,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:36,855 INFO L93 Difference]: Finished difference Result 942 states and 1159 transitions. [2022-02-21 03:10:36,855 INFO L276 IsEmpty]: Start isEmpty. Operand 942 states and 1159 transitions. [2022-02-21 03:10:36,859 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:10:36,859 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:10:36,859 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:10:36,859 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:10:36,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 364 states, 332 states have (on average 1.4006024096385543) internal successors, (465), 355 states have internal predecessors, (465), 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) [2022-02-21 03:10:36,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 473 transitions. [2022-02-21 03:10:36,869 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 473 transitions. Word has length 51 [2022-02-21 03:10:36,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:10:36,869 INFO L470 AbstractCegarLoop]: Abstraction has 364 states and 473 transitions. [2022-02-21 03:10:36,869 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 6.357142857142857) internal successors, (89), 13 states have internal predecessors, (89), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-21 03:10:36,869 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 473 transitions. [2022-02-21 03:10:36,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-02-21 03:10:36,870 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:10:36,870 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:10:36,903 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-02-21 03:10:37,095 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-02-21 03:10:37,096 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting base2fltErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 27 more)] === [2022-02-21 03:10:37,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:10:37,096 INFO L85 PathProgramCache]: Analyzing trace with hash -1383845486, now seen corresponding path program 2 times [2022-02-21 03:10:37,096 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:10:37,096 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739949895] [2022-02-21 03:10:37,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:10:37,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:10:37,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:37,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-21 03:10:37,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:37,168 INFO L290 TraceCheckUtils]: 0: Hoare triple {24914#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {24857#true} is VALID [2022-02-21 03:10:37,169 INFO L290 TraceCheckUtils]: 1: Hoare triple {24857#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {24857#true} is VALID [2022-02-21 03:10:37,169 INFO L290 TraceCheckUtils]: 2: Hoare triple {24857#true} #res := ~__retres4~0; {24857#true} is VALID [2022-02-21 03:10:37,169 INFO L290 TraceCheckUtils]: 3: Hoare triple {24857#true} assume true; {24857#true} is VALID [2022-02-21 03:10:37,169 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {24857#true} {24857#true} #394#return; {24857#true} is VALID [2022-02-21 03:10:37,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-02-21 03:10:37,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:37,372 INFO L290 TraceCheckUtils]: 0: Hoare triple {24914#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {24915#(or (= base2flt_~m |base2flt_#in~m|) (= (+ (- 1) base2flt_~m) 0))} is VALID [2022-02-21 03:10:37,373 INFO L290 TraceCheckUtils]: 1: Hoare triple {24915#(or (= base2flt_~m |base2flt_#in~m|) (= (+ (- 1) base2flt_~m) 0))} assume !(0 == ~m % 4294967296); {24915#(or (= base2flt_~m |base2flt_#in~m|) (= (+ (- 1) base2flt_~m) 0))} is VALID [2022-02-21 03:10:37,374 INFO L290 TraceCheckUtils]: 2: Hoare triple {24915#(or (= base2flt_~m |base2flt_#in~m|) (= (+ (- 1) base2flt_~m) 0))} assume ~m % 4294967296 < 16777216; {24915#(or (= base2flt_~m |base2flt_#in~m|) (= (+ (- 1) base2flt_~m) 0))} is VALID [2022-02-21 03:10:37,374 INFO L290 TraceCheckUtils]: 3: Hoare triple {24915#(or (= base2flt_~m |base2flt_#in~m|) (= (+ (- 1) base2flt_~m) 0))} assume !false; {24915#(or (= base2flt_~m |base2flt_#in~m|) (= (+ (- 1) base2flt_~m) 0))} is VALID [2022-02-21 03:10:37,374 INFO L290 TraceCheckUtils]: 4: Hoare triple {24915#(or (= base2flt_~m |base2flt_#in~m|) (= (+ (- 1) base2flt_~m) 0))} assume !(~e <= -128); {24915#(or (= base2flt_~m |base2flt_#in~m|) (= (+ (- 1) base2flt_~m) 0))} is VALID [2022-02-21 03:10:37,375 INFO L290 TraceCheckUtils]: 5: Hoare triple {24915#(or (= base2flt_~m |base2flt_#in~m|) (= (+ (- 1) base2flt_~m) 0))} assume ~e - 1 <= 2147483647; {24915#(or (= base2flt_~m |base2flt_#in~m|) (= (+ (- 1) base2flt_~m) 0))} is VALID [2022-02-21 03:10:37,375 INFO L290 TraceCheckUtils]: 6: Hoare triple {24915#(or (= base2flt_~m |base2flt_#in~m|) (= (+ (- 1) base2flt_~m) 0))} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {24916#(or (and (<= base2flt_~m 2) (<= 2 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:37,376 INFO L290 TraceCheckUtils]: 7: Hoare triple {24916#(or (and (<= base2flt_~m 2) (<= 2 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} assume ~m % 4294967296 < 16777216; {24916#(or (and (<= base2flt_~m 2) (<= 2 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:37,377 INFO L290 TraceCheckUtils]: 8: Hoare triple {24916#(or (and (<= base2flt_~m 2) (<= 2 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} assume !false; {24916#(or (and (<= base2flt_~m 2) (<= 2 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:37,377 INFO L290 TraceCheckUtils]: 9: Hoare triple {24916#(or (and (<= base2flt_~m 2) (<= 2 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} assume !(~e <= -128); {24916#(or (and (<= base2flt_~m 2) (<= 2 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:37,378 INFO L290 TraceCheckUtils]: 10: Hoare triple {24916#(or (and (<= base2flt_~m 2) (<= 2 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} assume ~e - 1 <= 2147483647; {24916#(or (and (<= base2flt_~m 2) (<= 2 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:37,379 INFO L290 TraceCheckUtils]: 11: Hoare triple {24916#(or (and (<= base2flt_~m 2) (<= 2 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {24917#(or (and (<= 4 base2flt_~m) (<= base2flt_~m 4)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:37,379 INFO L290 TraceCheckUtils]: 12: Hoare triple {24917#(or (and (<= 4 base2flt_~m) (<= base2flt_~m 4)) (not (= |base2flt_#in~m| 1)))} assume ~m % 4294967296 < 16777216; {24917#(or (and (<= 4 base2flt_~m) (<= base2flt_~m 4)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:37,380 INFO L290 TraceCheckUtils]: 13: Hoare triple {24917#(or (and (<= 4 base2flt_~m) (<= base2flt_~m 4)) (not (= |base2flt_#in~m| 1)))} assume !false; {24917#(or (and (<= 4 base2flt_~m) (<= base2flt_~m 4)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:37,381 INFO L290 TraceCheckUtils]: 14: Hoare triple {24917#(or (and (<= 4 base2flt_~m) (<= base2flt_~m 4)) (not (= |base2flt_#in~m| 1)))} assume !(~e <= -128); {24917#(or (and (<= 4 base2flt_~m) (<= base2flt_~m 4)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:37,381 INFO L290 TraceCheckUtils]: 15: Hoare triple {24917#(or (and (<= 4 base2flt_~m) (<= base2flt_~m 4)) (not (= |base2flt_#in~m| 1)))} assume ~e - 1 <= 2147483647; {24917#(or (and (<= 4 base2flt_~m) (<= base2flt_~m 4)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:37,382 INFO L290 TraceCheckUtils]: 16: Hoare triple {24917#(or (and (<= 4 base2flt_~m) (<= base2flt_~m 4)) (not (= |base2flt_#in~m| 1)))} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {24918#(or (and (<= 8 base2flt_~m) (<= base2flt_~m 8)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:37,383 INFO L290 TraceCheckUtils]: 17: Hoare triple {24918#(or (and (<= 8 base2flt_~m) (<= base2flt_~m 8)) (not (= |base2flt_#in~m| 1)))} assume ~m % 4294967296 < 16777216; {24918#(or (and (<= 8 base2flt_~m) (<= base2flt_~m 8)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:37,383 INFO L290 TraceCheckUtils]: 18: Hoare triple {24918#(or (and (<= 8 base2flt_~m) (<= base2flt_~m 8)) (not (= |base2flt_#in~m| 1)))} assume !false; {24918#(or (and (<= 8 base2flt_~m) (<= base2flt_~m 8)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:37,384 INFO L290 TraceCheckUtils]: 19: Hoare triple {24918#(or (and (<= 8 base2flt_~m) (<= base2flt_~m 8)) (not (= |base2flt_#in~m| 1)))} assume !(~e <= -128); {24918#(or (and (<= 8 base2flt_~m) (<= base2flt_~m 8)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:37,384 INFO L290 TraceCheckUtils]: 20: Hoare triple {24918#(or (and (<= 8 base2flt_~m) (<= base2flt_~m 8)) (not (= |base2flt_#in~m| 1)))} assume ~e - 1 <= 2147483647; {24918#(or (and (<= 8 base2flt_~m) (<= base2flt_~m 8)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:37,385 INFO L290 TraceCheckUtils]: 21: Hoare triple {24918#(or (and (<= 8 base2flt_~m) (<= base2flt_~m 8)) (not (= |base2flt_#in~m| 1)))} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {24919#(or (and (<= base2flt_~m 16) (<= 16 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:37,386 INFO L290 TraceCheckUtils]: 22: Hoare triple {24919#(or (and (<= base2flt_~m 16) (<= 16 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} assume ~m % 4294967296 < 16777216; {24919#(or (and (<= base2flt_~m 16) (<= 16 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:37,386 INFO L290 TraceCheckUtils]: 23: Hoare triple {24919#(or (and (<= base2flt_~m 16) (<= 16 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} assume !false; {24919#(or (and (<= base2flt_~m 16) (<= 16 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:37,387 INFO L290 TraceCheckUtils]: 24: Hoare triple {24919#(or (and (<= base2flt_~m 16) (<= 16 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} assume !(~e <= -128); {24919#(or (and (<= base2flt_~m 16) (<= 16 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:37,387 INFO L290 TraceCheckUtils]: 25: Hoare triple {24919#(or (and (<= base2flt_~m 16) (<= 16 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} assume ~e - 1 <= 2147483647; {24919#(or (and (<= base2flt_~m 16) (<= 16 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:37,388 INFO L290 TraceCheckUtils]: 26: Hoare triple {24919#(or (and (<= base2flt_~m 16) (<= 16 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {24920#(or (and (<= base2flt_~m 32) (<= 32 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:37,389 INFO L290 TraceCheckUtils]: 27: Hoare triple {24920#(or (and (<= base2flt_~m 32) (<= 32 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} assume ~m % 4294967296 < 16777216; {24920#(or (and (<= base2flt_~m 32) (<= 32 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:37,390 INFO L290 TraceCheckUtils]: 28: Hoare triple {24920#(or (and (<= base2flt_~m 32) (<= 32 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} assume !false; {24920#(or (and (<= base2flt_~m 32) (<= 32 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:37,390 INFO L290 TraceCheckUtils]: 29: Hoare triple {24920#(or (and (<= base2flt_~m 32) (<= 32 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} assume !(~e <= -128); {24920#(or (and (<= base2flt_~m 32) (<= 32 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:37,391 INFO L290 TraceCheckUtils]: 30: Hoare triple {24920#(or (and (<= base2flt_~m 32) (<= 32 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} assume ~e - 1 <= 2147483647; {24920#(or (and (<= base2flt_~m 32) (<= 32 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:37,392 INFO L290 TraceCheckUtils]: 31: Hoare triple {24920#(or (and (<= base2flt_~m 32) (<= 32 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {24921#(or (and (not (<= (+ (div base2flt_~m 4294967296) 1) 0)) (<= base2flt_~m 64)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:37,393 INFO L290 TraceCheckUtils]: 32: Hoare triple {24921#(or (and (not (<= (+ (div base2flt_~m 4294967296) 1) 0)) (<= base2flt_~m 64)) (not (= |base2flt_#in~m| 1)))} assume !(~m % 4294967296 < 16777216); {24922#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:37,393 INFO L290 TraceCheckUtils]: 33: Hoare triple {24922#(not (= |base2flt_#in~m| 1))} assume 0 == ~m || 0 == ~bitwiseComplement(16777216);~m := 0; {24922#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:37,393 INFO L290 TraceCheckUtils]: 34: Hoare triple {24922#(not (= |base2flt_#in~m| 1))} assume 128 + ~e <= 2147483647; {24922#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:37,394 INFO L290 TraceCheckUtils]: 35: Hoare triple {24922#(not (= |base2flt_#in~m| 1))} assume 128 + ~e >= -2147483648; {24922#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:37,394 INFO L290 TraceCheckUtils]: 36: Hoare triple {24922#(not (= |base2flt_#in~m| 1))} assume 16777216 * (128 + ~e) <= 2147483647; {24922#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:37,395 INFO L290 TraceCheckUtils]: 37: Hoare triple {24922#(not (= |base2flt_#in~m| 1))} assume 16777216 * (128 + ~e) >= -2147483648; {24922#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:37,395 INFO L290 TraceCheckUtils]: 38: Hoare triple {24922#(not (= |base2flt_#in~m| 1))} assume 128 + ~e <= 2147483647; {24922#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:37,395 INFO L290 TraceCheckUtils]: 39: Hoare triple {24922#(not (= |base2flt_#in~m| 1))} assume 128 + ~e >= -2147483648; {24922#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:37,396 INFO L290 TraceCheckUtils]: 40: Hoare triple {24922#(not (= |base2flt_#in~m| 1))} assume 16777216 * (128 + ~e) <= 2147483647; {24922#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:37,396 INFO L290 TraceCheckUtils]: 41: Hoare triple {24922#(not (= |base2flt_#in~m| 1))} assume 16777216 * (128 + ~e) >= -2147483648; {24922#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:37,396 INFO L290 TraceCheckUtils]: 42: Hoare triple {24922#(not (= |base2flt_#in~m| 1))} assume !((1 == ~m && (0 == 16777216 * (128 + ~e) || 1 == 16777216 * (128 + ~e))) || ((0 == ~m || 1 == ~m) && 1 == 16777216 * (128 + ~e))); {24922#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:37,397 INFO L290 TraceCheckUtils]: 43: Hoare triple {24922#(not (= |base2flt_#in~m| 1))} assume !(0 == ~m && (0 == 16777216 * (128 + ~e) || 1 == 16777216 * (128 + ~e))); {24922#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:37,397 INFO L290 TraceCheckUtils]: 44: Hoare triple {24922#(not (= |base2flt_#in~m| 1))} assume !((0 == ~m || 1 == ~m) && 0 == 16777216 * (128 + ~e)); {24922#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:37,398 INFO L290 TraceCheckUtils]: 45: Hoare triple {24922#(not (= |base2flt_#in~m| 1))} assume ~m >= 0 && 16777216 * (128 + ~e) >= 0;abs_77 := (if ~m < 16777216 * (128 + ~e) then 16777216 * (128 + ~e) else ~m);assume ~m >= 0 && 16777216 * (128 + ~e) >= 0;assume ~res~0 >= abs_77; {24922#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:37,398 INFO L290 TraceCheckUtils]: 46: Hoare triple {24922#(not (= |base2flt_#in~m| 1))} ~__retres4~0 := ~res~0; {24922#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:37,398 INFO L290 TraceCheckUtils]: 47: Hoare triple {24922#(not (= |base2flt_#in~m| 1))} #res := ~__retres4~0; {24922#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:37,399 INFO L290 TraceCheckUtils]: 48: Hoare triple {24922#(not (= |base2flt_#in~m| 1))} assume true; {24922#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:37,399 INFO L284 TraceCheckUtils]: 49: Hoare quadruple {24922#(not (= |base2flt_#in~m| 1))} {24857#true} #396#return; {24858#false} is VALID [2022-02-21 03:10:37,400 INFO L290 TraceCheckUtils]: 0: Hoare triple {24857#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(21, 2);call #Ultimate.allocInit(12, 3); {24857#true} is VALID [2022-02-21 03:10:37,400 INFO L290 TraceCheckUtils]: 1: Hoare triple {24857#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~ret22#1, main_#t~ret23#1, main_#t~ret24#1, main_#t~ret25#1, main_#t~ret26#1, main_~a~0#1, main_~ma~2#1, main_~ea~2#1, main_~b~0#1, main_~mb~2#1, main_~eb~2#1, main_~r_mul~0#1, main_~zero~0#1, main_~one~0#1, main_~sb~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~tmp___1~0#1, main_~__retres16~0#1;havoc main_~a~0#1;main_~ma~2#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;main_~ea~2#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1;havoc main_~b~0#1;main_~mb~2#1 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;main_~eb~2#1 := main_#t~nondet21#1;havoc main_#t~nondet21#1;havoc main_~r_mul~0#1;havoc main_~zero~0#1;havoc main_~one~0#1;havoc main_~sb~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~tmp___1~0#1;havoc main_~__retres16~0#1; {24857#true} is VALID [2022-02-21 03:10:37,401 INFO L272 TraceCheckUtils]: 2: Hoare triple {24857#true} call main_#t~ret22#1 := base2flt(0, 0); {24914#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} is VALID [2022-02-21 03:10:37,401 INFO L290 TraceCheckUtils]: 3: Hoare triple {24914#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {24857#true} is VALID [2022-02-21 03:10:37,401 INFO L290 TraceCheckUtils]: 4: Hoare triple {24857#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {24857#true} is VALID [2022-02-21 03:10:37,401 INFO L290 TraceCheckUtils]: 5: Hoare triple {24857#true} #res := ~__retres4~0; {24857#true} is VALID [2022-02-21 03:10:37,401 INFO L290 TraceCheckUtils]: 6: Hoare triple {24857#true} assume true; {24857#true} is VALID [2022-02-21 03:10:37,401 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {24857#true} {24857#true} #394#return; {24857#true} is VALID [2022-02-21 03:10:37,402 INFO L290 TraceCheckUtils]: 8: Hoare triple {24857#true} main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1; {24857#true} is VALID [2022-02-21 03:10:37,402 INFO L272 TraceCheckUtils]: 9: Hoare triple {24857#true} call main_#t~ret23#1 := base2flt(1, 0); {24914#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} is VALID [2022-02-21 03:10:37,403 INFO L290 TraceCheckUtils]: 10: Hoare triple {24914#(and (= abs_77 |old(abs_77)|) (= abs_76 |old(abs_76)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {24915#(or (= base2flt_~m |base2flt_#in~m|) (= (+ (- 1) base2flt_~m) 0))} is VALID [2022-02-21 03:10:37,403 INFO L290 TraceCheckUtils]: 11: Hoare triple {24915#(or (= base2flt_~m |base2flt_#in~m|) (= (+ (- 1) base2flt_~m) 0))} assume !(0 == ~m % 4294967296); {24915#(or (= base2flt_~m |base2flt_#in~m|) (= (+ (- 1) base2flt_~m) 0))} is VALID [2022-02-21 03:10:37,404 INFO L290 TraceCheckUtils]: 12: Hoare triple {24915#(or (= base2flt_~m |base2flt_#in~m|) (= (+ (- 1) base2flt_~m) 0))} assume ~m % 4294967296 < 16777216; {24915#(or (= base2flt_~m |base2flt_#in~m|) (= (+ (- 1) base2flt_~m) 0))} is VALID [2022-02-21 03:10:37,404 INFO L290 TraceCheckUtils]: 13: Hoare triple {24915#(or (= base2flt_~m |base2flt_#in~m|) (= (+ (- 1) base2flt_~m) 0))} assume !false; {24915#(or (= base2flt_~m |base2flt_#in~m|) (= (+ (- 1) base2flt_~m) 0))} is VALID [2022-02-21 03:10:37,404 INFO L290 TraceCheckUtils]: 14: Hoare triple {24915#(or (= base2flt_~m |base2flt_#in~m|) (= (+ (- 1) base2flt_~m) 0))} assume !(~e <= -128); {24915#(or (= base2flt_~m |base2flt_#in~m|) (= (+ (- 1) base2flt_~m) 0))} is VALID [2022-02-21 03:10:37,405 INFO L290 TraceCheckUtils]: 15: Hoare triple {24915#(or (= base2flt_~m |base2flt_#in~m|) (= (+ (- 1) base2flt_~m) 0))} assume ~e - 1 <= 2147483647; {24915#(or (= base2flt_~m |base2flt_#in~m|) (= (+ (- 1) base2flt_~m) 0))} is VALID [2022-02-21 03:10:37,405 INFO L290 TraceCheckUtils]: 16: Hoare triple {24915#(or (= base2flt_~m |base2flt_#in~m|) (= (+ (- 1) base2flt_~m) 0))} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {24916#(or (and (<= base2flt_~m 2) (<= 2 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:37,406 INFO L290 TraceCheckUtils]: 17: Hoare triple {24916#(or (and (<= base2flt_~m 2) (<= 2 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} assume ~m % 4294967296 < 16777216; {24916#(or (and (<= base2flt_~m 2) (<= 2 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:37,407 INFO L290 TraceCheckUtils]: 18: Hoare triple {24916#(or (and (<= base2flt_~m 2) (<= 2 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} assume !false; {24916#(or (and (<= base2flt_~m 2) (<= 2 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:37,408 INFO L290 TraceCheckUtils]: 19: Hoare triple {24916#(or (and (<= base2flt_~m 2) (<= 2 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} assume !(~e <= -128); {24916#(or (and (<= base2flt_~m 2) (<= 2 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:37,408 INFO L290 TraceCheckUtils]: 20: Hoare triple {24916#(or (and (<= base2flt_~m 2) (<= 2 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} assume ~e - 1 <= 2147483647; {24916#(or (and (<= base2flt_~m 2) (<= 2 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:37,409 INFO L290 TraceCheckUtils]: 21: Hoare triple {24916#(or (and (<= base2flt_~m 2) (<= 2 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {24917#(or (and (<= 4 base2flt_~m) (<= base2flt_~m 4)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:37,410 INFO L290 TraceCheckUtils]: 22: Hoare triple {24917#(or (and (<= 4 base2flt_~m) (<= base2flt_~m 4)) (not (= |base2flt_#in~m| 1)))} assume ~m % 4294967296 < 16777216; {24917#(or (and (<= 4 base2flt_~m) (<= base2flt_~m 4)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:37,410 INFO L290 TraceCheckUtils]: 23: Hoare triple {24917#(or (and (<= 4 base2flt_~m) (<= base2flt_~m 4)) (not (= |base2flt_#in~m| 1)))} assume !false; {24917#(or (and (<= 4 base2flt_~m) (<= base2flt_~m 4)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:37,411 INFO L290 TraceCheckUtils]: 24: Hoare triple {24917#(or (and (<= 4 base2flt_~m) (<= base2flt_~m 4)) (not (= |base2flt_#in~m| 1)))} assume !(~e <= -128); {24917#(or (and (<= 4 base2flt_~m) (<= base2flt_~m 4)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:37,411 INFO L290 TraceCheckUtils]: 25: Hoare triple {24917#(or (and (<= 4 base2flt_~m) (<= base2flt_~m 4)) (not (= |base2flt_#in~m| 1)))} assume ~e - 1 <= 2147483647; {24917#(or (and (<= 4 base2flt_~m) (<= base2flt_~m 4)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:37,412 INFO L290 TraceCheckUtils]: 26: Hoare triple {24917#(or (and (<= 4 base2flt_~m) (<= base2flt_~m 4)) (not (= |base2flt_#in~m| 1)))} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {24918#(or (and (<= 8 base2flt_~m) (<= base2flt_~m 8)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:37,413 INFO L290 TraceCheckUtils]: 27: Hoare triple {24918#(or (and (<= 8 base2flt_~m) (<= base2flt_~m 8)) (not (= |base2flt_#in~m| 1)))} assume ~m % 4294967296 < 16777216; {24918#(or (and (<= 8 base2flt_~m) (<= base2flt_~m 8)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:37,413 INFO L290 TraceCheckUtils]: 28: Hoare triple {24918#(or (and (<= 8 base2flt_~m) (<= base2flt_~m 8)) (not (= |base2flt_#in~m| 1)))} assume !false; {24918#(or (and (<= 8 base2flt_~m) (<= base2flt_~m 8)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:37,413 INFO L290 TraceCheckUtils]: 29: Hoare triple {24918#(or (and (<= 8 base2flt_~m) (<= base2flt_~m 8)) (not (= |base2flt_#in~m| 1)))} assume !(~e <= -128); {24918#(or (and (<= 8 base2flt_~m) (<= base2flt_~m 8)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:37,414 INFO L290 TraceCheckUtils]: 30: Hoare triple {24918#(or (and (<= 8 base2flt_~m) (<= base2flt_~m 8)) (not (= |base2flt_#in~m| 1)))} assume ~e - 1 <= 2147483647; {24918#(or (and (<= 8 base2flt_~m) (<= base2flt_~m 8)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:37,415 INFO L290 TraceCheckUtils]: 31: Hoare triple {24918#(or (and (<= 8 base2flt_~m) (<= base2flt_~m 8)) (not (= |base2flt_#in~m| 1)))} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {24919#(or (and (<= base2flt_~m 16) (<= 16 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:37,415 INFO L290 TraceCheckUtils]: 32: Hoare triple {24919#(or (and (<= base2flt_~m 16) (<= 16 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} assume ~m % 4294967296 < 16777216; {24919#(or (and (<= base2flt_~m 16) (<= 16 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:37,416 INFO L290 TraceCheckUtils]: 33: Hoare triple {24919#(or (and (<= base2flt_~m 16) (<= 16 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} assume !false; {24919#(or (and (<= base2flt_~m 16) (<= 16 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:37,416 INFO L290 TraceCheckUtils]: 34: Hoare triple {24919#(or (and (<= base2flt_~m 16) (<= 16 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} assume !(~e <= -128); {24919#(or (and (<= base2flt_~m 16) (<= 16 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:37,417 INFO L290 TraceCheckUtils]: 35: Hoare triple {24919#(or (and (<= base2flt_~m 16) (<= 16 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} assume ~e - 1 <= 2147483647; {24919#(or (and (<= base2flt_~m 16) (<= 16 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:37,418 INFO L290 TraceCheckUtils]: 36: Hoare triple {24919#(or (and (<= base2flt_~m 16) (<= 16 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {24920#(or (and (<= base2flt_~m 32) (<= 32 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:37,418 INFO L290 TraceCheckUtils]: 37: Hoare triple {24920#(or (and (<= base2flt_~m 32) (<= 32 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} assume ~m % 4294967296 < 16777216; {24920#(or (and (<= base2flt_~m 32) (<= 32 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:37,419 INFO L290 TraceCheckUtils]: 38: Hoare triple {24920#(or (and (<= base2flt_~m 32) (<= 32 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} assume !false; {24920#(or (and (<= base2flt_~m 32) (<= 32 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:37,419 INFO L290 TraceCheckUtils]: 39: Hoare triple {24920#(or (and (<= base2flt_~m 32) (<= 32 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} assume !(~e <= -128); {24920#(or (and (<= base2flt_~m 32) (<= 32 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:37,420 INFO L290 TraceCheckUtils]: 40: Hoare triple {24920#(or (and (<= base2flt_~m 32) (<= 32 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} assume ~e - 1 <= 2147483647; {24920#(or (and (<= base2flt_~m 32) (<= 32 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:37,421 INFO L290 TraceCheckUtils]: 41: Hoare triple {24920#(or (and (<= base2flt_~m 32) (<= 32 base2flt_~m)) (not (= |base2flt_#in~m| 1)))} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {24921#(or (and (not (<= (+ (div base2flt_~m 4294967296) 1) 0)) (<= base2flt_~m 64)) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:37,422 INFO L290 TraceCheckUtils]: 42: Hoare triple {24921#(or (and (not (<= (+ (div base2flt_~m 4294967296) 1) 0)) (<= base2flt_~m 64)) (not (= |base2flt_#in~m| 1)))} assume !(~m % 4294967296 < 16777216); {24922#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:37,422 INFO L290 TraceCheckUtils]: 43: Hoare triple {24922#(not (= |base2flt_#in~m| 1))} assume 0 == ~m || 0 == ~bitwiseComplement(16777216);~m := 0; {24922#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:37,423 INFO L290 TraceCheckUtils]: 44: Hoare triple {24922#(not (= |base2flt_#in~m| 1))} assume 128 + ~e <= 2147483647; {24922#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:37,423 INFO L290 TraceCheckUtils]: 45: Hoare triple {24922#(not (= |base2flt_#in~m| 1))} assume 128 + ~e >= -2147483648; {24922#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:37,423 INFO L290 TraceCheckUtils]: 46: Hoare triple {24922#(not (= |base2flt_#in~m| 1))} assume 16777216 * (128 + ~e) <= 2147483647; {24922#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:37,424 INFO L290 TraceCheckUtils]: 47: Hoare triple {24922#(not (= |base2flt_#in~m| 1))} assume 16777216 * (128 + ~e) >= -2147483648; {24922#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:37,424 INFO L290 TraceCheckUtils]: 48: Hoare triple {24922#(not (= |base2flt_#in~m| 1))} assume 128 + ~e <= 2147483647; {24922#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:37,425 INFO L290 TraceCheckUtils]: 49: Hoare triple {24922#(not (= |base2flt_#in~m| 1))} assume 128 + ~e >= -2147483648; {24922#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:37,425 INFO L290 TraceCheckUtils]: 50: Hoare triple {24922#(not (= |base2flt_#in~m| 1))} assume 16777216 * (128 + ~e) <= 2147483647; {24922#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:37,425 INFO L290 TraceCheckUtils]: 51: Hoare triple {24922#(not (= |base2flt_#in~m| 1))} assume 16777216 * (128 + ~e) >= -2147483648; {24922#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:37,426 INFO L290 TraceCheckUtils]: 52: Hoare triple {24922#(not (= |base2flt_#in~m| 1))} assume !((1 == ~m && (0 == 16777216 * (128 + ~e) || 1 == 16777216 * (128 + ~e))) || ((0 == ~m || 1 == ~m) && 1 == 16777216 * (128 + ~e))); {24922#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:37,426 INFO L290 TraceCheckUtils]: 53: Hoare triple {24922#(not (= |base2flt_#in~m| 1))} assume !(0 == ~m && (0 == 16777216 * (128 + ~e) || 1 == 16777216 * (128 + ~e))); {24922#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:37,427 INFO L290 TraceCheckUtils]: 54: Hoare triple {24922#(not (= |base2flt_#in~m| 1))} assume !((0 == ~m || 1 == ~m) && 0 == 16777216 * (128 + ~e)); {24922#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:37,427 INFO L290 TraceCheckUtils]: 55: Hoare triple {24922#(not (= |base2flt_#in~m| 1))} assume ~m >= 0 && 16777216 * (128 + ~e) >= 0;abs_77 := (if ~m < 16777216 * (128 + ~e) then 16777216 * (128 + ~e) else ~m);assume ~m >= 0 && 16777216 * (128 + ~e) >= 0;assume ~res~0 >= abs_77; {24922#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:37,427 INFO L290 TraceCheckUtils]: 56: Hoare triple {24922#(not (= |base2flt_#in~m| 1))} ~__retres4~0 := ~res~0; {24922#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:37,428 INFO L290 TraceCheckUtils]: 57: Hoare triple {24922#(not (= |base2flt_#in~m| 1))} #res := ~__retres4~0; {24922#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:37,428 INFO L290 TraceCheckUtils]: 58: Hoare triple {24922#(not (= |base2flt_#in~m| 1))} assume true; {24922#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:37,429 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {24922#(not (= |base2flt_#in~m| 1))} {24857#true} #396#return; {24858#false} is VALID [2022-02-21 03:10:37,429 INFO L290 TraceCheckUtils]: 60: Hoare triple {24858#false} main_~one~0#1 := main_#t~ret23#1;havoc main_#t~ret23#1; {24858#false} is VALID [2022-02-21 03:10:37,429 INFO L272 TraceCheckUtils]: 61: Hoare triple {24858#false} call main_#t~ret24#1 := base2flt(main_~ma~2#1, main_~ea~2#1); {24858#false} is VALID [2022-02-21 03:10:37,429 INFO L290 TraceCheckUtils]: 62: Hoare triple {24858#false} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {24858#false} is VALID [2022-02-21 03:10:37,429 INFO L290 TraceCheckUtils]: 63: Hoare triple {24858#false} assume !(0 == ~m % 4294967296); {24858#false} is VALID [2022-02-21 03:10:37,430 INFO L290 TraceCheckUtils]: 64: Hoare triple {24858#false} assume !(~m % 4294967296 < 16777216); {24858#false} is VALID [2022-02-21 03:10:37,430 INFO L290 TraceCheckUtils]: 65: Hoare triple {24858#false} assume !false; {24858#false} is VALID [2022-02-21 03:10:37,430 INFO L290 TraceCheckUtils]: 66: Hoare triple {24858#false} assume !(~m % 4294967296 >= 33554432); {24858#false} is VALID [2022-02-21 03:10:37,430 INFO L290 TraceCheckUtils]: 67: Hoare triple {24858#false} assume 0 == ~m || 0 == ~bitwiseComplement(16777216);~m := 0; {24858#false} is VALID [2022-02-21 03:10:37,430 INFO L290 TraceCheckUtils]: 68: Hoare triple {24858#false} assume 128 + ~e <= 2147483647; {24858#false} is VALID [2022-02-21 03:10:37,430 INFO L290 TraceCheckUtils]: 69: Hoare triple {24858#false} assume 128 + ~e >= -2147483648; {24858#false} is VALID [2022-02-21 03:10:37,430 INFO L290 TraceCheckUtils]: 70: Hoare triple {24858#false} assume !(16777216 * (128 + ~e) <= 2147483647); {24858#false} is VALID [2022-02-21 03:10:37,431 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 13 proven. 75 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-21 03:10:37,431 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:10:37,431 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739949895] [2022-02-21 03:10:37,431 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1739949895] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:10:37,432 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [743288992] [2022-02-21 03:10:37,432 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-21 03:10:37,432 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:10:37,432 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:10:37,436 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) [2022-02-21 03:10:37,468 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-02-21 03:10:37,533 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-21 03:10:37,533 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-21 03:10:37,535 INFO L263 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 17 conjunts are in the unsatisfiable core [2022-02-21 03:10:37,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:37,549 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:10:37,899 INFO L290 TraceCheckUtils]: 0: Hoare triple {24857#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(21, 2);call #Ultimate.allocInit(12, 3); {24857#true} is VALID [2022-02-21 03:10:37,900 INFO L290 TraceCheckUtils]: 1: Hoare triple {24857#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~ret22#1, main_#t~ret23#1, main_#t~ret24#1, main_#t~ret25#1, main_#t~ret26#1, main_~a~0#1, main_~ma~2#1, main_~ea~2#1, main_~b~0#1, main_~mb~2#1, main_~eb~2#1, main_~r_mul~0#1, main_~zero~0#1, main_~one~0#1, main_~sb~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~tmp___1~0#1, main_~__retres16~0#1;havoc main_~a~0#1;main_~ma~2#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;main_~ea~2#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1;havoc main_~b~0#1;main_~mb~2#1 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;main_~eb~2#1 := main_#t~nondet21#1;havoc main_#t~nondet21#1;havoc main_~r_mul~0#1;havoc main_~zero~0#1;havoc main_~one~0#1;havoc main_~sb~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~tmp___1~0#1;havoc main_~__retres16~0#1; {24857#true} is VALID [2022-02-21 03:10:37,900 INFO L272 TraceCheckUtils]: 2: Hoare triple {24857#true} call main_#t~ret22#1 := base2flt(0, 0); {24857#true} is VALID [2022-02-21 03:10:37,900 INFO L290 TraceCheckUtils]: 3: Hoare triple {24857#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {24857#true} is VALID [2022-02-21 03:10:37,900 INFO L290 TraceCheckUtils]: 4: Hoare triple {24857#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {24857#true} is VALID [2022-02-21 03:10:37,900 INFO L290 TraceCheckUtils]: 5: Hoare triple {24857#true} #res := ~__retres4~0; {24857#true} is VALID [2022-02-21 03:10:37,900 INFO L290 TraceCheckUtils]: 6: Hoare triple {24857#true} assume true; {24857#true} is VALID [2022-02-21 03:10:37,900 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {24857#true} {24857#true} #394#return; {24857#true} is VALID [2022-02-21 03:10:37,900 INFO L290 TraceCheckUtils]: 8: Hoare triple {24857#true} main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1; {24857#true} is VALID [2022-02-21 03:10:37,901 INFO L272 TraceCheckUtils]: 9: Hoare triple {24857#true} call main_#t~ret23#1 := base2flt(1, 0); {24857#true} is VALID [2022-02-21 03:10:37,901 INFO L290 TraceCheckUtils]: 10: Hoare triple {24857#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {24956#(= base2flt_~m |base2flt_#in~m|)} is VALID [2022-02-21 03:10:37,901 INFO L290 TraceCheckUtils]: 11: Hoare triple {24956#(= base2flt_~m |base2flt_#in~m|)} assume !(0 == ~m % 4294967296); {24956#(= base2flt_~m |base2flt_#in~m|)} is VALID [2022-02-21 03:10:37,902 INFO L290 TraceCheckUtils]: 12: Hoare triple {24956#(= base2flt_~m |base2flt_#in~m|)} assume ~m % 4294967296 < 16777216; {24956#(= base2flt_~m |base2flt_#in~m|)} is VALID [2022-02-21 03:10:37,902 INFO L290 TraceCheckUtils]: 13: Hoare triple {24956#(= base2flt_~m |base2flt_#in~m|)} assume !false; {24956#(= base2flt_~m |base2flt_#in~m|)} is VALID [2022-02-21 03:10:37,902 INFO L290 TraceCheckUtils]: 14: Hoare triple {24956#(= base2flt_~m |base2flt_#in~m|)} assume !(~e <= -128); {24956#(= base2flt_~m |base2flt_#in~m|)} is VALID [2022-02-21 03:10:37,903 INFO L290 TraceCheckUtils]: 15: Hoare triple {24956#(= base2flt_~m |base2flt_#in~m|)} assume ~e - 1 <= 2147483647; {24956#(= base2flt_~m |base2flt_#in~m|)} is VALID [2022-02-21 03:10:37,903 INFO L290 TraceCheckUtils]: 16: Hoare triple {24956#(= base2flt_~m |base2flt_#in~m|)} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {24975#(= (* 2 |base2flt_#in~m|) base2flt_~m)} is VALID [2022-02-21 03:10:37,904 INFO L290 TraceCheckUtils]: 17: Hoare triple {24975#(= (* 2 |base2flt_#in~m|) base2flt_~m)} assume ~m % 4294967296 < 16777216; {24975#(= (* 2 |base2flt_#in~m|) base2flt_~m)} is VALID [2022-02-21 03:10:37,904 INFO L290 TraceCheckUtils]: 18: Hoare triple {24975#(= (* 2 |base2flt_#in~m|) base2flt_~m)} assume !false; {24975#(= (* 2 |base2flt_#in~m|) base2flt_~m)} is VALID [2022-02-21 03:10:37,905 INFO L290 TraceCheckUtils]: 19: Hoare triple {24975#(= (* 2 |base2flt_#in~m|) base2flt_~m)} assume !(~e <= -128); {24975#(= (* 2 |base2flt_#in~m|) base2flt_~m)} is VALID [2022-02-21 03:10:37,905 INFO L290 TraceCheckUtils]: 20: Hoare triple {24975#(= (* 2 |base2flt_#in~m|) base2flt_~m)} assume ~e - 1 <= 2147483647; {24975#(= (* 2 |base2flt_#in~m|) base2flt_~m)} is VALID [2022-02-21 03:10:37,906 INFO L290 TraceCheckUtils]: 21: Hoare triple {24975#(= (* 2 |base2flt_#in~m|) base2flt_~m)} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {24991#(= (* |base2flt_#in~m| 4) base2flt_~m)} is VALID [2022-02-21 03:10:37,906 INFO L290 TraceCheckUtils]: 22: Hoare triple {24991#(= (* |base2flt_#in~m| 4) base2flt_~m)} assume ~m % 4294967296 < 16777216; {24991#(= (* |base2flt_#in~m| 4) base2flt_~m)} is VALID [2022-02-21 03:10:37,907 INFO L290 TraceCheckUtils]: 23: Hoare triple {24991#(= (* |base2flt_#in~m| 4) base2flt_~m)} assume !false; {24991#(= (* |base2flt_#in~m| 4) base2flt_~m)} is VALID [2022-02-21 03:10:37,907 INFO L290 TraceCheckUtils]: 24: Hoare triple {24991#(= (* |base2flt_#in~m| 4) base2flt_~m)} assume !(~e <= -128); {24991#(= (* |base2flt_#in~m| 4) base2flt_~m)} is VALID [2022-02-21 03:10:37,908 INFO L290 TraceCheckUtils]: 25: Hoare triple {24991#(= (* |base2flt_#in~m| 4) base2flt_~m)} assume ~e - 1 <= 2147483647; {24991#(= (* |base2flt_#in~m| 4) base2flt_~m)} is VALID [2022-02-21 03:10:37,908 INFO L290 TraceCheckUtils]: 26: Hoare triple {24991#(= (* |base2flt_#in~m| 4) base2flt_~m)} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {25007#(= (* 8 |base2flt_#in~m|) base2flt_~m)} is VALID [2022-02-21 03:10:37,909 INFO L290 TraceCheckUtils]: 27: Hoare triple {25007#(= (* 8 |base2flt_#in~m|) base2flt_~m)} assume ~m % 4294967296 < 16777216; {25007#(= (* 8 |base2flt_#in~m|) base2flt_~m)} is VALID [2022-02-21 03:10:37,909 INFO L290 TraceCheckUtils]: 28: Hoare triple {25007#(= (* 8 |base2flt_#in~m|) base2flt_~m)} assume !false; {25007#(= (* 8 |base2flt_#in~m|) base2flt_~m)} is VALID [2022-02-21 03:10:37,910 INFO L290 TraceCheckUtils]: 29: Hoare triple {25007#(= (* 8 |base2flt_#in~m|) base2flt_~m)} assume !(~e <= -128); {25007#(= (* 8 |base2flt_#in~m|) base2flt_~m)} is VALID [2022-02-21 03:10:37,910 INFO L290 TraceCheckUtils]: 30: Hoare triple {25007#(= (* 8 |base2flt_#in~m|) base2flt_~m)} assume ~e - 1 <= 2147483647; {25007#(= (* 8 |base2flt_#in~m|) base2flt_~m)} is VALID [2022-02-21 03:10:37,911 INFO L290 TraceCheckUtils]: 31: Hoare triple {25007#(= (* 8 |base2flt_#in~m|) base2flt_~m)} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {25023#(= (* 16 |base2flt_#in~m|) base2flt_~m)} is VALID [2022-02-21 03:10:37,911 INFO L290 TraceCheckUtils]: 32: Hoare triple {25023#(= (* 16 |base2flt_#in~m|) base2flt_~m)} assume ~m % 4294967296 < 16777216; {25023#(= (* 16 |base2flt_#in~m|) base2flt_~m)} is VALID [2022-02-21 03:10:37,911 INFO L290 TraceCheckUtils]: 33: Hoare triple {25023#(= (* 16 |base2flt_#in~m|) base2flt_~m)} assume !false; {25023#(= (* 16 |base2flt_#in~m|) base2flt_~m)} is VALID [2022-02-21 03:10:37,912 INFO L290 TraceCheckUtils]: 34: Hoare triple {25023#(= (* 16 |base2flt_#in~m|) base2flt_~m)} assume !(~e <= -128); {25023#(= (* 16 |base2flt_#in~m|) base2flt_~m)} is VALID [2022-02-21 03:10:37,912 INFO L290 TraceCheckUtils]: 35: Hoare triple {25023#(= (* 16 |base2flt_#in~m|) base2flt_~m)} assume ~e - 1 <= 2147483647; {25023#(= (* 16 |base2flt_#in~m|) base2flt_~m)} is VALID [2022-02-21 03:10:37,913 INFO L290 TraceCheckUtils]: 36: Hoare triple {25023#(= (* 16 |base2flt_#in~m|) base2flt_~m)} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {25039#(= (* 32 |base2flt_#in~m|) base2flt_~m)} is VALID [2022-02-21 03:10:37,913 INFO L290 TraceCheckUtils]: 37: Hoare triple {25039#(= (* 32 |base2flt_#in~m|) base2flt_~m)} assume ~m % 4294967296 < 16777216; {25039#(= (* 32 |base2flt_#in~m|) base2flt_~m)} is VALID [2022-02-21 03:10:37,914 INFO L290 TraceCheckUtils]: 38: Hoare triple {25039#(= (* 32 |base2flt_#in~m|) base2flt_~m)} assume !false; {25039#(= (* 32 |base2flt_#in~m|) base2flt_~m)} is VALID [2022-02-21 03:10:37,914 INFO L290 TraceCheckUtils]: 39: Hoare triple {25039#(= (* 32 |base2flt_#in~m|) base2flt_~m)} assume !(~e <= -128); {25039#(= (* 32 |base2flt_#in~m|) base2flt_~m)} is VALID [2022-02-21 03:10:37,914 INFO L290 TraceCheckUtils]: 40: Hoare triple {25039#(= (* 32 |base2flt_#in~m|) base2flt_~m)} assume ~e - 1 <= 2147483647; {25039#(= (* 32 |base2flt_#in~m|) base2flt_~m)} is VALID [2022-02-21 03:10:37,915 INFO L290 TraceCheckUtils]: 41: Hoare triple {25039#(= (* 32 |base2flt_#in~m|) base2flt_~m)} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {25055#(= (* 64 |base2flt_#in~m|) base2flt_~m)} is VALID [2022-02-21 03:10:37,917 INFO L290 TraceCheckUtils]: 42: Hoare triple {25055#(= (* 64 |base2flt_#in~m|) base2flt_~m)} assume !(~m % 4294967296 < 16777216); {25059#(not (< (mod (* 64 |base2flt_#in~m|) 4294967296) 16777216))} is VALID [2022-02-21 03:10:37,918 INFO L290 TraceCheckUtils]: 43: Hoare triple {25059#(not (< (mod (* 64 |base2flt_#in~m|) 4294967296) 16777216))} assume 0 == ~m || 0 == ~bitwiseComplement(16777216);~m := 0; {25059#(not (< (mod (* 64 |base2flt_#in~m|) 4294967296) 16777216))} is VALID [2022-02-21 03:10:37,918 INFO L290 TraceCheckUtils]: 44: Hoare triple {25059#(not (< (mod (* 64 |base2flt_#in~m|) 4294967296) 16777216))} assume 128 + ~e <= 2147483647; {25059#(not (< (mod (* 64 |base2flt_#in~m|) 4294967296) 16777216))} is VALID [2022-02-21 03:10:37,918 INFO L290 TraceCheckUtils]: 45: Hoare triple {25059#(not (< (mod (* 64 |base2flt_#in~m|) 4294967296) 16777216))} assume 128 + ~e >= -2147483648; {25059#(not (< (mod (* 64 |base2flt_#in~m|) 4294967296) 16777216))} is VALID [2022-02-21 03:10:37,919 INFO L290 TraceCheckUtils]: 46: Hoare triple {25059#(not (< (mod (* 64 |base2flt_#in~m|) 4294967296) 16777216))} assume 16777216 * (128 + ~e) <= 2147483647; {25059#(not (< (mod (* 64 |base2flt_#in~m|) 4294967296) 16777216))} is VALID [2022-02-21 03:10:37,919 INFO L290 TraceCheckUtils]: 47: Hoare triple {25059#(not (< (mod (* 64 |base2flt_#in~m|) 4294967296) 16777216))} assume 16777216 * (128 + ~e) >= -2147483648; {25059#(not (< (mod (* 64 |base2flt_#in~m|) 4294967296) 16777216))} is VALID [2022-02-21 03:10:37,919 INFO L290 TraceCheckUtils]: 48: Hoare triple {25059#(not (< (mod (* 64 |base2flt_#in~m|) 4294967296) 16777216))} assume 128 + ~e <= 2147483647; {25059#(not (< (mod (* 64 |base2flt_#in~m|) 4294967296) 16777216))} is VALID [2022-02-21 03:10:37,920 INFO L290 TraceCheckUtils]: 49: Hoare triple {25059#(not (< (mod (* 64 |base2flt_#in~m|) 4294967296) 16777216))} assume 128 + ~e >= -2147483648; {25059#(not (< (mod (* 64 |base2flt_#in~m|) 4294967296) 16777216))} is VALID [2022-02-21 03:10:37,920 INFO L290 TraceCheckUtils]: 50: Hoare triple {25059#(not (< (mod (* 64 |base2flt_#in~m|) 4294967296) 16777216))} assume 16777216 * (128 + ~e) <= 2147483647; {25059#(not (< (mod (* 64 |base2flt_#in~m|) 4294967296) 16777216))} is VALID [2022-02-21 03:10:37,921 INFO L290 TraceCheckUtils]: 51: Hoare triple {25059#(not (< (mod (* 64 |base2flt_#in~m|) 4294967296) 16777216))} assume 16777216 * (128 + ~e) >= -2147483648; {25059#(not (< (mod (* 64 |base2flt_#in~m|) 4294967296) 16777216))} is VALID [2022-02-21 03:10:37,921 INFO L290 TraceCheckUtils]: 52: Hoare triple {25059#(not (< (mod (* 64 |base2flt_#in~m|) 4294967296) 16777216))} assume !((1 == ~m && (0 == 16777216 * (128 + ~e) || 1 == 16777216 * (128 + ~e))) || ((0 == ~m || 1 == ~m) && 1 == 16777216 * (128 + ~e))); {25059#(not (< (mod (* 64 |base2flt_#in~m|) 4294967296) 16777216))} is VALID [2022-02-21 03:10:37,921 INFO L290 TraceCheckUtils]: 53: Hoare triple {25059#(not (< (mod (* 64 |base2flt_#in~m|) 4294967296) 16777216))} assume !(0 == ~m && (0 == 16777216 * (128 + ~e) || 1 == 16777216 * (128 + ~e))); {25059#(not (< (mod (* 64 |base2flt_#in~m|) 4294967296) 16777216))} is VALID [2022-02-21 03:10:37,922 INFO L290 TraceCheckUtils]: 54: Hoare triple {25059#(not (< (mod (* 64 |base2flt_#in~m|) 4294967296) 16777216))} assume !((0 == ~m || 1 == ~m) && 0 == 16777216 * (128 + ~e)); {25059#(not (< (mod (* 64 |base2flt_#in~m|) 4294967296) 16777216))} is VALID [2022-02-21 03:10:37,922 INFO L290 TraceCheckUtils]: 55: Hoare triple {25059#(not (< (mod (* 64 |base2flt_#in~m|) 4294967296) 16777216))} assume ~m >= 0 && 16777216 * (128 + ~e) >= 0;abs_77 := (if ~m < 16777216 * (128 + ~e) then 16777216 * (128 + ~e) else ~m);assume ~m >= 0 && 16777216 * (128 + ~e) >= 0;assume ~res~0 >= abs_77; {25059#(not (< (mod (* 64 |base2flt_#in~m|) 4294967296) 16777216))} is VALID [2022-02-21 03:10:37,922 INFO L290 TraceCheckUtils]: 56: Hoare triple {25059#(not (< (mod (* 64 |base2flt_#in~m|) 4294967296) 16777216))} ~__retres4~0 := ~res~0; {25059#(not (< (mod (* 64 |base2flt_#in~m|) 4294967296) 16777216))} is VALID [2022-02-21 03:10:37,923 INFO L290 TraceCheckUtils]: 57: Hoare triple {25059#(not (< (mod (* 64 |base2flt_#in~m|) 4294967296) 16777216))} #res := ~__retres4~0; {25059#(not (< (mod (* 64 |base2flt_#in~m|) 4294967296) 16777216))} is VALID [2022-02-21 03:10:37,923 INFO L290 TraceCheckUtils]: 58: Hoare triple {25059#(not (< (mod (* 64 |base2flt_#in~m|) 4294967296) 16777216))} assume true; {25059#(not (< (mod (* 64 |base2flt_#in~m|) 4294967296) 16777216))} is VALID [2022-02-21 03:10:37,924 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {25059#(not (< (mod (* 64 |base2flt_#in~m|) 4294967296) 16777216))} {24857#true} #396#return; {24858#false} is VALID [2022-02-21 03:10:37,924 INFO L290 TraceCheckUtils]: 60: Hoare triple {24858#false} main_~one~0#1 := main_#t~ret23#1;havoc main_#t~ret23#1; {24858#false} is VALID [2022-02-21 03:10:37,924 INFO L272 TraceCheckUtils]: 61: Hoare triple {24858#false} call main_#t~ret24#1 := base2flt(main_~ma~2#1, main_~ea~2#1); {24858#false} is VALID [2022-02-21 03:10:37,924 INFO L290 TraceCheckUtils]: 62: Hoare triple {24858#false} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {24858#false} is VALID [2022-02-21 03:10:37,924 INFO L290 TraceCheckUtils]: 63: Hoare triple {24858#false} assume !(0 == ~m % 4294967296); {24858#false} is VALID [2022-02-21 03:10:37,924 INFO L290 TraceCheckUtils]: 64: Hoare triple {24858#false} assume !(~m % 4294967296 < 16777216); {24858#false} is VALID [2022-02-21 03:10:37,924 INFO L290 TraceCheckUtils]: 65: Hoare triple {24858#false} assume !false; {24858#false} is VALID [2022-02-21 03:10:37,925 INFO L290 TraceCheckUtils]: 66: Hoare triple {24858#false} assume !(~m % 4294967296 >= 33554432); {24858#false} is VALID [2022-02-21 03:10:37,925 INFO L290 TraceCheckUtils]: 67: Hoare triple {24858#false} assume 0 == ~m || 0 == ~bitwiseComplement(16777216);~m := 0; {24858#false} is VALID [2022-02-21 03:10:37,925 INFO L290 TraceCheckUtils]: 68: Hoare triple {24858#false} assume 128 + ~e <= 2147483647; {24858#false} is VALID [2022-02-21 03:10:37,925 INFO L290 TraceCheckUtils]: 69: Hoare triple {24858#false} assume 128 + ~e >= -2147483648; {24858#false} is VALID [2022-02-21 03:10:37,925 INFO L290 TraceCheckUtils]: 70: Hoare triple {24858#false} assume !(16777216 * (128 + ~e) <= 2147483647); {24858#false} is VALID [2022-02-21 03:10:37,925 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 13 proven. 75 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-21 03:10:37,925 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:10:38,836 INFO L290 TraceCheckUtils]: 70: Hoare triple {24858#false} assume !(16777216 * (128 + ~e) <= 2147483647); {24858#false} is VALID [2022-02-21 03:10:38,836 INFO L290 TraceCheckUtils]: 69: Hoare triple {24858#false} assume 128 + ~e >= -2147483648; {24858#false} is VALID [2022-02-21 03:10:38,836 INFO L290 TraceCheckUtils]: 68: Hoare triple {24858#false} assume 128 + ~e <= 2147483647; {24858#false} is VALID [2022-02-21 03:10:38,837 INFO L290 TraceCheckUtils]: 67: Hoare triple {24858#false} assume 0 == ~m || 0 == ~bitwiseComplement(16777216);~m := 0; {24858#false} is VALID [2022-02-21 03:10:38,837 INFO L290 TraceCheckUtils]: 66: Hoare triple {24858#false} assume !(~m % 4294967296 >= 33554432); {24858#false} is VALID [2022-02-21 03:10:38,837 INFO L290 TraceCheckUtils]: 65: Hoare triple {24858#false} assume !false; {24858#false} is VALID [2022-02-21 03:10:38,837 INFO L290 TraceCheckUtils]: 64: Hoare triple {24858#false} assume !(~m % 4294967296 < 16777216); {24858#false} is VALID [2022-02-21 03:10:38,837 INFO L290 TraceCheckUtils]: 63: Hoare triple {24858#false} assume !(0 == ~m % 4294967296); {24858#false} is VALID [2022-02-21 03:10:38,837 INFO L290 TraceCheckUtils]: 62: Hoare triple {24858#false} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {24858#false} is VALID [2022-02-21 03:10:38,837 INFO L272 TraceCheckUtils]: 61: Hoare triple {24858#false} call main_#t~ret24#1 := base2flt(main_~ma~2#1, main_~ea~2#1); {24858#false} is VALID [2022-02-21 03:10:38,838 INFO L290 TraceCheckUtils]: 60: Hoare triple {24858#false} main_~one~0#1 := main_#t~ret23#1;havoc main_#t~ret23#1; {24858#false} is VALID [2022-02-21 03:10:38,838 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {24922#(not (= |base2flt_#in~m| 1))} {24857#true} #396#return; {24858#false} is VALID [2022-02-21 03:10:38,839 INFO L290 TraceCheckUtils]: 58: Hoare triple {24922#(not (= |base2flt_#in~m| 1))} assume true; {24922#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:38,839 INFO L290 TraceCheckUtils]: 57: Hoare triple {24922#(not (= |base2flt_#in~m| 1))} #res := ~__retres4~0; {24922#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:38,839 INFO L290 TraceCheckUtils]: 56: Hoare triple {24922#(not (= |base2flt_#in~m| 1))} ~__retres4~0 := ~res~0; {24922#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:38,840 INFO L290 TraceCheckUtils]: 55: Hoare triple {24922#(not (= |base2flt_#in~m| 1))} assume ~m >= 0 && 16777216 * (128 + ~e) >= 0;abs_77 := (if ~m < 16777216 * (128 + ~e) then 16777216 * (128 + ~e) else ~m);assume ~m >= 0 && 16777216 * (128 + ~e) >= 0;assume ~res~0 >= abs_77; {24922#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:38,840 INFO L290 TraceCheckUtils]: 54: Hoare triple {24922#(not (= |base2flt_#in~m| 1))} assume !((0 == ~m || 1 == ~m) && 0 == 16777216 * (128 + ~e)); {24922#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:38,841 INFO L290 TraceCheckUtils]: 53: Hoare triple {24922#(not (= |base2flt_#in~m| 1))} assume !(0 == ~m && (0 == 16777216 * (128 + ~e) || 1 == 16777216 * (128 + ~e))); {24922#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:38,841 INFO L290 TraceCheckUtils]: 52: Hoare triple {24922#(not (= |base2flt_#in~m| 1))} assume !((1 == ~m && (0 == 16777216 * (128 + ~e) || 1 == 16777216 * (128 + ~e))) || ((0 == ~m || 1 == ~m) && 1 == 16777216 * (128 + ~e))); {24922#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:38,841 INFO L290 TraceCheckUtils]: 51: Hoare triple {24922#(not (= |base2flt_#in~m| 1))} assume 16777216 * (128 + ~e) >= -2147483648; {24922#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:38,842 INFO L290 TraceCheckUtils]: 50: Hoare triple {24922#(not (= |base2flt_#in~m| 1))} assume 16777216 * (128 + ~e) <= 2147483647; {24922#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:38,842 INFO L290 TraceCheckUtils]: 49: Hoare triple {24922#(not (= |base2flt_#in~m| 1))} assume 128 + ~e >= -2147483648; {24922#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:38,842 INFO L290 TraceCheckUtils]: 48: Hoare triple {24922#(not (= |base2flt_#in~m| 1))} assume 128 + ~e <= 2147483647; {24922#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:38,843 INFO L290 TraceCheckUtils]: 47: Hoare triple {24922#(not (= |base2flt_#in~m| 1))} assume 16777216 * (128 + ~e) >= -2147483648; {24922#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:38,843 INFO L290 TraceCheckUtils]: 46: Hoare triple {24922#(not (= |base2flt_#in~m| 1))} assume 16777216 * (128 + ~e) <= 2147483647; {24922#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:38,843 INFO L290 TraceCheckUtils]: 45: Hoare triple {24922#(not (= |base2flt_#in~m| 1))} assume 128 + ~e >= -2147483648; {24922#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:38,844 INFO L290 TraceCheckUtils]: 44: Hoare triple {24922#(not (= |base2flt_#in~m| 1))} assume 128 + ~e <= 2147483647; {24922#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:38,844 INFO L290 TraceCheckUtils]: 43: Hoare triple {24922#(not (= |base2flt_#in~m| 1))} assume 0 == ~m || 0 == ~bitwiseComplement(16777216);~m := 0; {24922#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:38,845 INFO L290 TraceCheckUtils]: 42: Hoare triple {25231#(or (< (mod base2flt_~m 4294967296) 16777216) (not (= |base2flt_#in~m| 1)))} assume !(~m % 4294967296 < 16777216); {24922#(not (= |base2flt_#in~m| 1))} is VALID [2022-02-21 03:10:38,846 INFO L290 TraceCheckUtils]: 41: Hoare triple {25235#(or (< (mod (* 2 base2flt_~m) 4294967296) 16777216) (not (= |base2flt_#in~m| 1)))} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {25231#(or (< (mod base2flt_~m 4294967296) 16777216) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:38,846 INFO L290 TraceCheckUtils]: 40: Hoare triple {25235#(or (< (mod (* 2 base2flt_~m) 4294967296) 16777216) (not (= |base2flt_#in~m| 1)))} assume ~e - 1 <= 2147483647; {25235#(or (< (mod (* 2 base2flt_~m) 4294967296) 16777216) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:38,847 INFO L290 TraceCheckUtils]: 39: Hoare triple {25235#(or (< (mod (* 2 base2flt_~m) 4294967296) 16777216) (not (= |base2flt_#in~m| 1)))} assume !(~e <= -128); {25235#(or (< (mod (* 2 base2flt_~m) 4294967296) 16777216) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:38,847 INFO L290 TraceCheckUtils]: 38: Hoare triple {25235#(or (< (mod (* 2 base2flt_~m) 4294967296) 16777216) (not (= |base2flt_#in~m| 1)))} assume !false; {25235#(or (< (mod (* 2 base2flt_~m) 4294967296) 16777216) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:38,847 INFO L290 TraceCheckUtils]: 37: Hoare triple {25235#(or (< (mod (* 2 base2flt_~m) 4294967296) 16777216) (not (= |base2flt_#in~m| 1)))} assume ~m % 4294967296 < 16777216; {25235#(or (< (mod (* 2 base2flt_~m) 4294967296) 16777216) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:38,849 INFO L290 TraceCheckUtils]: 36: Hoare triple {25251#(or (< (mod (* base2flt_~m 4) 4294967296) 16777216) (not (= |base2flt_#in~m| 1)))} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {25235#(or (< (mod (* 2 base2flt_~m) 4294967296) 16777216) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:38,850 INFO L290 TraceCheckUtils]: 35: Hoare triple {25251#(or (< (mod (* base2flt_~m 4) 4294967296) 16777216) (not (= |base2flt_#in~m| 1)))} assume ~e - 1 <= 2147483647; {25251#(or (< (mod (* base2flt_~m 4) 4294967296) 16777216) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:38,850 INFO L290 TraceCheckUtils]: 34: Hoare triple {25251#(or (< (mod (* base2flt_~m 4) 4294967296) 16777216) (not (= |base2flt_#in~m| 1)))} assume !(~e <= -128); {25251#(or (< (mod (* base2flt_~m 4) 4294967296) 16777216) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:38,850 INFO L290 TraceCheckUtils]: 33: Hoare triple {25251#(or (< (mod (* base2flt_~m 4) 4294967296) 16777216) (not (= |base2flt_#in~m| 1)))} assume !false; {25251#(or (< (mod (* base2flt_~m 4) 4294967296) 16777216) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:38,850 INFO L290 TraceCheckUtils]: 32: Hoare triple {25251#(or (< (mod (* base2flt_~m 4) 4294967296) 16777216) (not (= |base2flt_#in~m| 1)))} assume ~m % 4294967296 < 16777216; {25251#(or (< (mod (* base2flt_~m 4) 4294967296) 16777216) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:38,851 INFO L290 TraceCheckUtils]: 31: Hoare triple {25267#(or (< (mod (* base2flt_~m 8) 4294967296) 16777216) (not (= |base2flt_#in~m| 1)))} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {25251#(or (< (mod (* base2flt_~m 4) 4294967296) 16777216) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:38,852 INFO L290 TraceCheckUtils]: 30: Hoare triple {25267#(or (< (mod (* base2flt_~m 8) 4294967296) 16777216) (not (= |base2flt_#in~m| 1)))} assume ~e - 1 <= 2147483647; {25267#(or (< (mod (* base2flt_~m 8) 4294967296) 16777216) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:38,852 INFO L290 TraceCheckUtils]: 29: Hoare triple {25267#(or (< (mod (* base2flt_~m 8) 4294967296) 16777216) (not (= |base2flt_#in~m| 1)))} assume !(~e <= -128); {25267#(or (< (mod (* base2flt_~m 8) 4294967296) 16777216) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:38,852 INFO L290 TraceCheckUtils]: 28: Hoare triple {25267#(or (< (mod (* base2flt_~m 8) 4294967296) 16777216) (not (= |base2flt_#in~m| 1)))} assume !false; {25267#(or (< (mod (* base2flt_~m 8) 4294967296) 16777216) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:38,853 INFO L290 TraceCheckUtils]: 27: Hoare triple {25267#(or (< (mod (* base2flt_~m 8) 4294967296) 16777216) (not (= |base2flt_#in~m| 1)))} assume ~m % 4294967296 < 16777216; {25267#(or (< (mod (* base2flt_~m 8) 4294967296) 16777216) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:38,853 INFO L290 TraceCheckUtils]: 26: Hoare triple {25283#(or (< (mod (* 16 base2flt_~m) 4294967296) 16777216) (not (= |base2flt_#in~m| 1)))} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {25267#(or (< (mod (* base2flt_~m 8) 4294967296) 16777216) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:38,854 INFO L290 TraceCheckUtils]: 25: Hoare triple {25283#(or (< (mod (* 16 base2flt_~m) 4294967296) 16777216) (not (= |base2flt_#in~m| 1)))} assume ~e - 1 <= 2147483647; {25283#(or (< (mod (* 16 base2flt_~m) 4294967296) 16777216) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:38,854 INFO L290 TraceCheckUtils]: 24: Hoare triple {25283#(or (< (mod (* 16 base2flt_~m) 4294967296) 16777216) (not (= |base2flt_#in~m| 1)))} assume !(~e <= -128); {25283#(or (< (mod (* 16 base2flt_~m) 4294967296) 16777216) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:38,854 INFO L290 TraceCheckUtils]: 23: Hoare triple {25283#(or (< (mod (* 16 base2flt_~m) 4294967296) 16777216) (not (= |base2flt_#in~m| 1)))} assume !false; {25283#(or (< (mod (* 16 base2flt_~m) 4294967296) 16777216) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:38,855 INFO L290 TraceCheckUtils]: 22: Hoare triple {25283#(or (< (mod (* 16 base2flt_~m) 4294967296) 16777216) (not (= |base2flt_#in~m| 1)))} assume ~m % 4294967296 < 16777216; {25283#(or (< (mod (* 16 base2flt_~m) 4294967296) 16777216) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:38,856 INFO L290 TraceCheckUtils]: 21: Hoare triple {25299#(or (< (mod (* 32 base2flt_~m) 4294967296) 16777216) (not (= |base2flt_#in~m| 1)))} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {25283#(or (< (mod (* 16 base2flt_~m) 4294967296) 16777216) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:38,856 INFO L290 TraceCheckUtils]: 20: Hoare triple {25299#(or (< (mod (* 32 base2flt_~m) 4294967296) 16777216) (not (= |base2flt_#in~m| 1)))} assume ~e - 1 <= 2147483647; {25299#(or (< (mod (* 32 base2flt_~m) 4294967296) 16777216) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:38,856 INFO L290 TraceCheckUtils]: 19: Hoare triple {25299#(or (< (mod (* 32 base2flt_~m) 4294967296) 16777216) (not (= |base2flt_#in~m| 1)))} assume !(~e <= -128); {25299#(or (< (mod (* 32 base2flt_~m) 4294967296) 16777216) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:38,857 INFO L290 TraceCheckUtils]: 18: Hoare triple {25299#(or (< (mod (* 32 base2flt_~m) 4294967296) 16777216) (not (= |base2flt_#in~m| 1)))} assume !false; {25299#(or (< (mod (* 32 base2flt_~m) 4294967296) 16777216) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:38,857 INFO L290 TraceCheckUtils]: 17: Hoare triple {25299#(or (< (mod (* 32 base2flt_~m) 4294967296) 16777216) (not (= |base2flt_#in~m| 1)))} assume ~m % 4294967296 < 16777216; {25299#(or (< (mod (* 32 base2flt_~m) 4294967296) 16777216) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:38,861 INFO L290 TraceCheckUtils]: 16: Hoare triple {25315#(or (< (mod (* 64 base2flt_~m) 4294967296) 16777216) (not (= |base2flt_#in~m| 1)))} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {25299#(or (< (mod (* 32 base2flt_~m) 4294967296) 16777216) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:38,861 INFO L290 TraceCheckUtils]: 15: Hoare triple {25315#(or (< (mod (* 64 base2flt_~m) 4294967296) 16777216) (not (= |base2flt_#in~m| 1)))} assume ~e - 1 <= 2147483647; {25315#(or (< (mod (* 64 base2flt_~m) 4294967296) 16777216) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:38,861 INFO L290 TraceCheckUtils]: 14: Hoare triple {25315#(or (< (mod (* 64 base2flt_~m) 4294967296) 16777216) (not (= |base2flt_#in~m| 1)))} assume !(~e <= -128); {25315#(or (< (mod (* 64 base2flt_~m) 4294967296) 16777216) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:38,862 INFO L290 TraceCheckUtils]: 13: Hoare triple {25315#(or (< (mod (* 64 base2flt_~m) 4294967296) 16777216) (not (= |base2flt_#in~m| 1)))} assume !false; {25315#(or (< (mod (* 64 base2flt_~m) 4294967296) 16777216) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:38,862 INFO L290 TraceCheckUtils]: 12: Hoare triple {25315#(or (< (mod (* 64 base2flt_~m) 4294967296) 16777216) (not (= |base2flt_#in~m| 1)))} assume ~m % 4294967296 < 16777216; {25315#(or (< (mod (* 64 base2flt_~m) 4294967296) 16777216) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:38,862 INFO L290 TraceCheckUtils]: 11: Hoare triple {25315#(or (< (mod (* 64 base2flt_~m) 4294967296) 16777216) (not (= |base2flt_#in~m| 1)))} assume !(0 == ~m % 4294967296); {25315#(or (< (mod (* 64 base2flt_~m) 4294967296) 16777216) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:38,863 INFO L290 TraceCheckUtils]: 10: Hoare triple {24857#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {25315#(or (< (mod (* 64 base2flt_~m) 4294967296) 16777216) (not (= |base2flt_#in~m| 1)))} is VALID [2022-02-21 03:10:38,863 INFO L272 TraceCheckUtils]: 9: Hoare triple {24857#true} call main_#t~ret23#1 := base2flt(1, 0); {24857#true} is VALID [2022-02-21 03:10:38,863 INFO L290 TraceCheckUtils]: 8: Hoare triple {24857#true} main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1; {24857#true} is VALID [2022-02-21 03:10:38,863 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {24857#true} {24857#true} #394#return; {24857#true} is VALID [2022-02-21 03:10:38,863 INFO L290 TraceCheckUtils]: 6: Hoare triple {24857#true} assume true; {24857#true} is VALID [2022-02-21 03:10:38,863 INFO L290 TraceCheckUtils]: 5: Hoare triple {24857#true} #res := ~__retres4~0; {24857#true} is VALID [2022-02-21 03:10:38,863 INFO L290 TraceCheckUtils]: 4: Hoare triple {24857#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {24857#true} is VALID [2022-02-21 03:10:38,863 INFO L290 TraceCheckUtils]: 3: Hoare triple {24857#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {24857#true} is VALID [2022-02-21 03:10:38,863 INFO L272 TraceCheckUtils]: 2: Hoare triple {24857#true} call main_#t~ret22#1 := base2flt(0, 0); {24857#true} is VALID [2022-02-21 03:10:38,864 INFO L290 TraceCheckUtils]: 1: Hoare triple {24857#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~ret22#1, main_#t~ret23#1, main_#t~ret24#1, main_#t~ret25#1, main_#t~ret26#1, main_~a~0#1, main_~ma~2#1, main_~ea~2#1, main_~b~0#1, main_~mb~2#1, main_~eb~2#1, main_~r_mul~0#1, main_~zero~0#1, main_~one~0#1, main_~sb~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~tmp___1~0#1, main_~__retres16~0#1;havoc main_~a~0#1;main_~ma~2#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;main_~ea~2#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1;havoc main_~b~0#1;main_~mb~2#1 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;main_~eb~2#1 := main_#t~nondet21#1;havoc main_#t~nondet21#1;havoc main_~r_mul~0#1;havoc main_~zero~0#1;havoc main_~one~0#1;havoc main_~sb~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~tmp___1~0#1;havoc main_~__retres16~0#1; {24857#true} is VALID [2022-02-21 03:10:38,864 INFO L290 TraceCheckUtils]: 0: Hoare triple {24857#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(21, 2);call #Ultimate.allocInit(12, 3); {24857#true} is VALID [2022-02-21 03:10:38,864 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 13 proven. 75 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-21 03:10:38,865 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [743288992] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:10:38,865 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:10:38,865 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 26 [2022-02-21 03:10:38,865 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922827940] [2022-02-21 03:10:38,865 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:10:38,866 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 5.730769230769231) internal successors, (149), 25 states have internal predecessors, (149), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 71 [2022-02-21 03:10:38,866 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:10:38,867 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 26 states, 26 states have (on average 5.730769230769231) internal successors, (149), 25 states have internal predecessors, (149), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-21 03:10:38,991 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 157 edges. 157 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:10:38,991 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-02-21 03:10:38,991 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:10:38,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-02-21 03:10:38,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2022-02-21 03:10:38,992 INFO L87 Difference]: Start difference. First operand 364 states and 473 transitions. Second operand has 26 states, 26 states have (on average 5.730769230769231) internal successors, (149), 25 states have internal predecessors, (149), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3)