./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/bitvector/soft_float_1-2a.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_1-2a.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 c9ff936057be59b0f479a8c37fd17409fe797633e9a8a05703f5728379735d91 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-21 03:09:44,256 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-21 03:09:44,257 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-21 03:09:44,280 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-21 03:09:44,282 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-21 03:09:44,285 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-21 03:09:44,286 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-21 03:09:44,291 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-21 03:09:44,294 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-21 03:09:44,297 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-21 03:09:44,298 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-21 03:09:44,299 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-21 03:09:44,300 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-21 03:09:44,301 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-21 03:09:44,302 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-21 03:09:44,304 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-21 03:09:44,305 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-21 03:09:44,305 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-21 03:09:44,308 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-21 03:09:44,313 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-21 03:09:44,314 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-21 03:09:44,315 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-21 03:09:44,316 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-21 03:09:44,317 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-21 03:09:44,321 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-21 03:09:44,322 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-21 03:09:44,322 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-21 03:09:44,323 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-21 03:09:44,324 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-21 03:09:44,324 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-21 03:09:44,325 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-21 03:09:44,326 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-21 03:09:44,327 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-21 03:09:44,327 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-21 03:09:44,328 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-21 03:09:44,329 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-21 03:09:44,329 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-21 03:09:44,329 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-21 03:09:44,329 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-21 03:09:44,331 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-21 03:09:44,331 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-21 03:09:44,333 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:09:44,361 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-21 03:09:44,362 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-21 03:09:44,362 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-21 03:09:44,362 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-21 03:09:44,363 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-21 03:09:44,363 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-21 03:09:44,364 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-21 03:09:44,364 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-21 03:09:44,364 INFO L138 SettingsManager]: * Use SBE=true [2022-02-21 03:09:44,364 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-21 03:09:44,365 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-21 03:09:44,365 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-21 03:09:44,365 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-21 03:09:44,365 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-21 03:09:44,365 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-21 03:09:44,365 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-21 03:09:44,366 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-21 03:09:44,366 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-21 03:09:44,366 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-02-21 03:09:44,366 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-21 03:09:44,366 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-21 03:09:44,366 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-21 03:09:44,367 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-21 03:09:44,367 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-21 03:09:44,367 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-21 03:09:44,367 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-21 03:09:44,367 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-21 03:09:44,368 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-21 03:09:44,368 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-21 03:09:44,369 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-21 03:09:44,369 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-21 03:09:44,369 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-21 03:09:44,369 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-21 03:09:44,369 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 -> c9ff936057be59b0f479a8c37fd17409fe797633e9a8a05703f5728379735d91 [2022-02-21 03:09:44,564 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-21 03:09:44,580 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-21 03:09:44,582 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-21 03:09:44,582 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-21 03:09:44,584 INFO L275 PluginConnector]: CDTParser initialized [2022-02-21 03:09:44,585 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/soft_float_1-2a.c.cil.c [2022-02-21 03:09:44,652 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7dc17f14c/73d1231314834cbc9c7cf22df1fe56d4/FLAGc21d6dae4 [2022-02-21 03:09:45,011 INFO L306 CDTParser]: Found 1 translation units. [2022-02-21 03:09:45,012 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_1-2a.c.cil.c [2022-02-21 03:09:45,017 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7dc17f14c/73d1231314834cbc9c7cf22df1fe56d4/FLAGc21d6dae4 [2022-02-21 03:09:45,026 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7dc17f14c/73d1231314834cbc9c7cf22df1fe56d4 [2022-02-21 03:09:45,028 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-21 03:09:45,028 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-21 03:09:45,030 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-21 03:09:45,030 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-21 03:09:45,033 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-21 03:09:45,034 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:09:45" (1/1) ... [2022-02-21 03:09:45,035 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d6441d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:09:45, skipping insertion in model container [2022-02-21 03:09:45,035 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:09:45" (1/1) ... [2022-02-21 03:09:45,039 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-21 03:09:45,059 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 03:09:45,196 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_1-2a.c.cil.c[755,768] [2022-02-21 03:09:45,271 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:09:45,277 INFO L203 MainTranslator]: Completed pre-run [2022-02-21 03:09:45,286 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_1-2a.c.cil.c[755,768] [2022-02-21 03:09:45,312 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:09:45,327 INFO L208 MainTranslator]: Completed translation [2022-02-21 03:09:45,328 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:09:45 WrapperNode [2022-02-21 03:09:45,328 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-21 03:09:45,329 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-21 03:09:45,329 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-21 03:09:45,329 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-21 03:09:45,335 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:09:45" (1/1) ... [2022-02-21 03:09:45,353 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:09:45" (1/1) ... [2022-02-21 03:09:45,378 INFO L137 Inliner]: procedures = 17, calls = 18, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 226 [2022-02-21 03:09:45,379 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-21 03:09:45,379 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-21 03:09:45,379 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-21 03:09:45,379 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-21 03:09:45,385 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:09:45" (1/1) ... [2022-02-21 03:09:45,385 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:09:45" (1/1) ... [2022-02-21 03:09:45,388 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:09:45" (1/1) ... [2022-02-21 03:09:45,389 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:09:45" (1/1) ... [2022-02-21 03:09:45,394 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:09:45" (1/1) ... [2022-02-21 03:09:45,399 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:09:45" (1/1) ... [2022-02-21 03:09:45,401 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:09:45" (1/1) ... [2022-02-21 03:09:45,414 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-21 03:09:45,415 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-21 03:09:45,415 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-21 03:09:45,415 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-21 03:09:45,416 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:09:45" (1/1) ... [2022-02-21 03:09:45,420 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-21 03:09:45,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:09:45,438 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:09:45,445 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:09:45,485 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-21 03:09:45,486 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-21 03:09:45,486 INFO L130 BoogieDeclarations]: Found specification of procedure base2flt [2022-02-21 03:09:45,486 INFO L138 BoogieDeclarations]: Found implementation of procedure base2flt [2022-02-21 03:09:45,486 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-21 03:09:45,486 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-21 03:09:45,487 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-02-21 03:09:45,489 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-02-21 03:09:45,543 INFO L234 CfgBuilder]: Building ICFG [2022-02-21 03:09:45,544 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-21 03:09:46,021 INFO L275 CfgBuilder]: Performing block encoding [2022-02-21 03:09:46,032 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-21 03:09:46,032 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-02-21 03:09:46,034 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:09:46 BoogieIcfgContainer [2022-02-21 03:09:46,034 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-21 03:09:46,035 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-21 03:09:46,057 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-21 03:09:46,060 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-21 03:09:46,060 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.02 03:09:45" (1/3) ... [2022-02-21 03:09:46,061 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2036d286 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.02 03:09:46, skipping insertion in model container [2022-02-21 03:09:46,061 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:09:45" (2/3) ... [2022-02-21 03:09:46,061 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2036d286 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.02 03:09:46, skipping insertion in model container [2022-02-21 03:09:46,061 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:09:46" (3/3) ... [2022-02-21 03:09:46,062 INFO L111 eAbstractionObserver]: Analyzing ICFG soft_float_1-2a.c.cil.c [2022-02-21 03:09:46,066 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-21 03:09:46,067 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 20 error locations. [2022-02-21 03:09:46,110 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-21 03:09:46,115 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:09:46,115 INFO L340 AbstractCegarLoop]: Starting to check reachability of 20 error locations. [2022-02-21 03:09:46,135 INFO L276 IsEmpty]: Start isEmpty. Operand has 142 states, 111 states have (on average 1.7837837837837838) internal successors, (198), 133 states have internal predecessors, (198), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-21 03:09:46,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-02-21 03:09:46,139 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:09:46,140 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:09:46,140 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-02-21 03:09:46,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:09:46,144 INFO L85 PathProgramCache]: Analyzing trace with hash 1487654612, now seen corresponding path program 1 times [2022-02-21 03:09:46,150 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:09:46,150 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794871766] [2022-02-21 03:09:46,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:09:46,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:09:46,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:09:46,294 INFO L290 TraceCheckUtils]: 0: Hoare triple {145#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(24, 2);call #Ultimate.allocInit(12, 3); {145#true} is VALID [2022-02-21 03:09:46,295 INFO L290 TraceCheckUtils]: 1: Hoare triple {145#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_~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_add~0#1, main_~zero~0#1, main_~sa~0#1, main_~sb~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~tmp___1~0#1, main_~tmp___2~0#1, main_~tmp___3~0#1, main_~tmp___4~0#1, main_~tmp___5~0#1, main_~tmp___6~0#1, main_~tmp___7~0#1, main_~tmp___8~0#1, main_~tmp___9~0#1, main_~__retres23~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_add~0#1;havoc main_~zero~0#1;havoc main_~sa~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_~tmp___2~0#1;havoc main_~tmp___3~0#1;havoc main_~tmp___4~0#1;havoc main_~tmp___5~0#1;havoc main_~tmp___6~0#1;havoc main_~tmp___7~0#1;havoc main_~tmp___8~0#1;havoc main_~tmp___9~0#1;havoc main_~__retres23~0#1; {145#true} is VALID [2022-02-21 03:09:46,295 INFO L272 TraceCheckUtils]: 2: Hoare triple {145#true} call main_#t~ret22#1 := base2flt(0, 0); {145#true} is VALID [2022-02-21 03:09:46,296 INFO L290 TraceCheckUtils]: 3: Hoare triple {145#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {145#true} is VALID [2022-02-21 03:09:46,296 INFO L290 TraceCheckUtils]: 4: Hoare triple {145#true} assume !(0 == ~m % 4294967296); {145#true} is VALID [2022-02-21 03:09:46,296 INFO L290 TraceCheckUtils]: 5: Hoare triple {145#true} assume !(~m % 4294967296 < 16777216); {145#true} is VALID [2022-02-21 03:09:46,297 INFO L290 TraceCheckUtils]: 6: Hoare triple {145#true} assume !true; {146#false} is VALID [2022-02-21 03:09:46,297 INFO L290 TraceCheckUtils]: 7: Hoare triple {146#false} assume 0 == ~m || 0 == ~bitwiseComplement(16777216);~m := 0; {146#false} is VALID [2022-02-21 03:09:46,297 INFO L290 TraceCheckUtils]: 8: Hoare triple {146#false} assume !(128 + ~e <= 2147483647); {146#false} is VALID [2022-02-21 03:09:46,298 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:09:46,299 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:09:46,300 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794871766] [2022-02-21 03:09:46,301 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1794871766] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:09:46,301 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:09:46,301 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-21 03:09:46,304 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655575116] [2022-02-21 03:09:46,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:09:46,309 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:09:46,311 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:09:46,314 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:09:46,324 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:09:46,325 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-21 03:09:46,325 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:09:46,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-21 03:09:46,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-21 03:09:46,354 INFO L87 Difference]: Start difference. First operand has 142 states, 111 states have (on average 1.7837837837837838) internal successors, (198), 133 states have internal predecessors, (198), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) 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:09:46,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:09:46,525 INFO L93 Difference]: Finished difference Result 279 states and 432 transitions. [2022-02-21 03:09:46,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-21 03:09:46,525 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:09:46,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:09:46,526 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:09:46,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 432 transitions. [2022-02-21 03:09:46,544 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:09:46,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 432 transitions. [2022-02-21 03:09:46,554 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 432 transitions. [2022-02-21 03:09:46,874 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 432 edges. 432 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:09:46,882 INFO L225 Difference]: With dead ends: 279 [2022-02-21 03:09:46,883 INFO L226 Difference]: Without dead ends: 107 [2022-02-21 03:09:46,886 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:09:46,888 INFO L933 BasicCegarLoop]: 193 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, 193 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:09:46,888 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:09:46,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2022-02-21 03:09:46,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2022-02-21 03:09:46,918 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:09:46,920 INFO L82 GeneralOperation]: Start isEquivalent. First operand 107 states. Second operand has 107 states, 82 states have (on average 1.5365853658536586) internal successors, (126), 99 states have internal predecessors, (126), 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:09:46,923 INFO L74 IsIncluded]: Start isIncluded. First operand 107 states. Second operand has 107 states, 82 states have (on average 1.5365853658536586) internal successors, (126), 99 states have internal predecessors, (126), 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:09:46,924 INFO L87 Difference]: Start difference. First operand 107 states. Second operand has 107 states, 82 states have (on average 1.5365853658536586) internal successors, (126), 99 states have internal predecessors, (126), 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:09:46,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:09:46,933 INFO L93 Difference]: Finished difference Result 107 states and 136 transitions. [2022-02-21 03:09:46,933 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 136 transitions. [2022-02-21 03:09:46,934 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:09:46,935 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:09:46,935 INFO L74 IsIncluded]: Start isIncluded. First operand has 107 states, 82 states have (on average 1.5365853658536586) internal successors, (126), 99 states have internal predecessors, (126), 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 107 states. [2022-02-21 03:09:46,936 INFO L87 Difference]: Start difference. First operand has 107 states, 82 states have (on average 1.5365853658536586) internal successors, (126), 99 states have internal predecessors, (126), 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 107 states. [2022-02-21 03:09:46,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:09:46,940 INFO L93 Difference]: Finished difference Result 107 states and 136 transitions. [2022-02-21 03:09:46,941 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 136 transitions. [2022-02-21 03:09:46,946 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:09:46,947 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:09:46,947 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:09:46,947 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:09:46,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 82 states have (on average 1.5365853658536586) internal successors, (126), 99 states have internal predecessors, (126), 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:09:46,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 136 transitions. [2022-02-21 03:09:46,951 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 136 transitions. Word has length 9 [2022-02-21 03:09:46,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:09:46,952 INFO L470 AbstractCegarLoop]: Abstraction has 107 states and 136 transitions. [2022-02-21 03:09:46,952 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:09:46,952 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 136 transitions. [2022-02-21 03:09:46,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-02-21 03:09:46,954 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:09:46,954 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:09:46,954 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-21 03:09:46,954 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-02-21 03:09:46,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:09:46,957 INFO L85 PathProgramCache]: Analyzing trace with hash 1486713264, now seen corresponding path program 1 times [2022-02-21 03:09:46,959 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:09:46,959 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614758546] [2022-02-21 03:09:46,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:09:46,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:09:46,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:09:47,013 INFO L290 TraceCheckUtils]: 0: Hoare triple {795#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(24, 2);call #Ultimate.allocInit(12, 3); {795#true} is VALID [2022-02-21 03:09:47,014 INFO L290 TraceCheckUtils]: 1: Hoare triple {795#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_~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_add~0#1, main_~zero~0#1, main_~sa~0#1, main_~sb~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~tmp___1~0#1, main_~tmp___2~0#1, main_~tmp___3~0#1, main_~tmp___4~0#1, main_~tmp___5~0#1, main_~tmp___6~0#1, main_~tmp___7~0#1, main_~tmp___8~0#1, main_~tmp___9~0#1, main_~__retres23~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_add~0#1;havoc main_~zero~0#1;havoc main_~sa~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_~tmp___2~0#1;havoc main_~tmp___3~0#1;havoc main_~tmp___4~0#1;havoc main_~tmp___5~0#1;havoc main_~tmp___6~0#1;havoc main_~tmp___7~0#1;havoc main_~tmp___8~0#1;havoc main_~tmp___9~0#1;havoc main_~__retres23~0#1; {795#true} is VALID [2022-02-21 03:09:47,014 INFO L272 TraceCheckUtils]: 2: Hoare triple {795#true} call main_#t~ret22#1 := base2flt(0, 0); {797#(= |base2flt_#in~e| 0)} is VALID [2022-02-21 03:09:47,015 INFO L290 TraceCheckUtils]: 3: Hoare triple {797#(= |base2flt_#in~e| 0)} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {798#(= base2flt_~e 0)} is VALID [2022-02-21 03:09:47,015 INFO L290 TraceCheckUtils]: 4: Hoare triple {798#(= base2flt_~e 0)} assume !(0 == ~m % 4294967296); {798#(= base2flt_~e 0)} is VALID [2022-02-21 03:09:47,015 INFO L290 TraceCheckUtils]: 5: Hoare triple {798#(= base2flt_~e 0)} assume ~m % 4294967296 < 16777216; {798#(= base2flt_~e 0)} is VALID [2022-02-21 03:09:47,016 INFO L290 TraceCheckUtils]: 6: Hoare triple {798#(= base2flt_~e 0)} assume !false; {798#(= base2flt_~e 0)} is VALID [2022-02-21 03:09:47,016 INFO L290 TraceCheckUtils]: 7: Hoare triple {798#(= base2flt_~e 0)} assume !(~e <= -128); {798#(= base2flt_~e 0)} is VALID [2022-02-21 03:09:47,017 INFO L290 TraceCheckUtils]: 8: Hoare triple {798#(= base2flt_~e 0)} assume !(~e - 1 <= 2147483647); {796#false} is VALID [2022-02-21 03:09:47,017 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:09:47,017 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:09:47,018 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614758546] [2022-02-21 03:09:47,018 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [614758546] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:09:47,018 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:09:47,018 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 03:09:47,018 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940091551] [2022-02-21 03:09:47,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:09:47,020 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:09:47,020 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:09:47,020 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:09:47,026 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:09:47,026 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-21 03:09:47,026 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:09:47,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-21 03:09:47,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-21 03:09:47,027 INFO L87 Difference]: Start difference. First operand 107 states and 136 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:09:47,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:09:47,288 INFO L93 Difference]: Finished difference Result 273 states and 363 transitions. [2022-02-21 03:09:47,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-21 03:09:47,289 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:09:47,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:09:47,289 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:09:47,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 363 transitions. [2022-02-21 03:09:47,293 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:09:47,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 363 transitions. [2022-02-21 03:09:47,297 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 363 transitions. [2022-02-21 03:09:47,519 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 363 edges. 363 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:09:47,528 INFO L225 Difference]: With dead ends: 273 [2022-02-21 03:09:47,529 INFO L226 Difference]: Without dead ends: 169 [2022-02-21 03:09:47,534 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:09:47,535 INFO L933 BasicCegarLoop]: 119 mSDtfsCounter, 106 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:09:47,536 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [106 Valid, 358 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:09:47,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2022-02-21 03:09:47,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 156. [2022-02-21 03:09:47,553 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:09:47,553 INFO L82 GeneralOperation]: Start isEquivalent. First operand 169 states. Second operand has 156 states, 130 states have (on average 1.5461538461538462) internal successors, (201), 147 states have internal predecessors, (201), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-21 03:09:47,554 INFO L74 IsIncluded]: Start isIncluded. First operand 169 states. Second operand has 156 states, 130 states have (on average 1.5461538461538462) internal successors, (201), 147 states have internal predecessors, (201), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-21 03:09:47,554 INFO L87 Difference]: Start difference. First operand 169 states. Second operand has 156 states, 130 states have (on average 1.5461538461538462) internal successors, (201), 147 states have internal predecessors, (201), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-21 03:09:47,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:09:47,560 INFO L93 Difference]: Finished difference Result 169 states and 217 transitions. [2022-02-21 03:09:47,560 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 217 transitions. [2022-02-21 03:09:47,561 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:09:47,561 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:09:47,561 INFO L74 IsIncluded]: Start isIncluded. First operand has 156 states, 130 states have (on average 1.5461538461538462) internal successors, (201), 147 states have internal predecessors, (201), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 169 states. [2022-02-21 03:09:47,562 INFO L87 Difference]: Start difference. First operand has 156 states, 130 states have (on average 1.5461538461538462) internal successors, (201), 147 states have internal predecessors, (201), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 169 states. [2022-02-21 03:09:47,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:09:47,568 INFO L93 Difference]: Finished difference Result 169 states and 217 transitions. [2022-02-21 03:09:47,568 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 217 transitions. [2022-02-21 03:09:47,569 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:09:47,569 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:09:47,569 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:09:47,569 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:09:47,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 130 states have (on average 1.5461538461538462) internal successors, (201), 147 states have internal predecessors, (201), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-21 03:09:47,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 211 transitions. [2022-02-21 03:09:47,574 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 211 transitions. Word has length 9 [2022-02-21 03:09:47,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:09:47,575 INFO L470 AbstractCegarLoop]: Abstraction has 156 states and 211 transitions. [2022-02-21 03:09:47,575 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:09:47,575 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 211 transitions. [2022-02-21 03:09:47,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-02-21 03:09:47,576 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:09:47,576 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:09:47,576 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-21 03:09:47,576 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-02-21 03:09:47,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:09:47,577 INFO L85 PathProgramCache]: Analyzing trace with hash 71825417, now seen corresponding path program 1 times [2022-02-21 03:09:47,577 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:09:47,577 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611341802] [2022-02-21 03:09:47,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:09:47,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:09:47,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:09:47,628 INFO L290 TraceCheckUtils]: 0: Hoare triple {1619#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(24, 2);call #Ultimate.allocInit(12, 3); {1619#true} is VALID [2022-02-21 03:09:47,629 INFO L290 TraceCheckUtils]: 1: Hoare triple {1619#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_~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_add~0#1, main_~zero~0#1, main_~sa~0#1, main_~sb~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~tmp___1~0#1, main_~tmp___2~0#1, main_~tmp___3~0#1, main_~tmp___4~0#1, main_~tmp___5~0#1, main_~tmp___6~0#1, main_~tmp___7~0#1, main_~tmp___8~0#1, main_~tmp___9~0#1, main_~__retres23~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_add~0#1;havoc main_~zero~0#1;havoc main_~sa~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_~tmp___2~0#1;havoc main_~tmp___3~0#1;havoc main_~tmp___4~0#1;havoc main_~tmp___5~0#1;havoc main_~tmp___6~0#1;havoc main_~tmp___7~0#1;havoc main_~tmp___8~0#1;havoc main_~tmp___9~0#1;havoc main_~__retres23~0#1; {1619#true} is VALID [2022-02-21 03:09:47,629 INFO L272 TraceCheckUtils]: 2: Hoare triple {1619#true} call main_#t~ret22#1 := base2flt(0, 0); {1621#(= |base2flt_#in~e| 0)} is VALID [2022-02-21 03:09:47,629 INFO L290 TraceCheckUtils]: 3: Hoare triple {1621#(= |base2flt_#in~e| 0)} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {1622#(= base2flt_~e 0)} is VALID [2022-02-21 03:09:47,630 INFO L290 TraceCheckUtils]: 4: Hoare triple {1622#(= base2flt_~e 0)} assume !(0 == ~m % 4294967296); {1622#(= base2flt_~e 0)} is VALID [2022-02-21 03:09:47,630 INFO L290 TraceCheckUtils]: 5: Hoare triple {1622#(= base2flt_~e 0)} assume ~m % 4294967296 < 16777216; {1622#(= base2flt_~e 0)} is VALID [2022-02-21 03:09:47,631 INFO L290 TraceCheckUtils]: 6: Hoare triple {1622#(= base2flt_~e 0)} assume !false; {1622#(= base2flt_~e 0)} is VALID [2022-02-21 03:09:47,632 INFO L290 TraceCheckUtils]: 7: Hoare triple {1622#(= base2flt_~e 0)} assume !(~e <= -128); {1622#(= base2flt_~e 0)} is VALID [2022-02-21 03:09:47,632 INFO L290 TraceCheckUtils]: 8: Hoare triple {1622#(= base2flt_~e 0)} assume ~e - 1 <= 2147483647; {1622#(= base2flt_~e 0)} is VALID [2022-02-21 03:09:47,633 INFO L290 TraceCheckUtils]: 9: Hoare triple {1622#(= base2flt_~e 0)} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {1623#(<= (+ base2flt_~e 1) 0)} is VALID [2022-02-21 03:09:47,633 INFO L290 TraceCheckUtils]: 10: Hoare triple {1623#(<= (+ base2flt_~e 1) 0)} assume !(~m % 4294967296 < 16777216); {1623#(<= (+ base2flt_~e 1) 0)} is VALID [2022-02-21 03:09:47,633 INFO L290 TraceCheckUtils]: 11: Hoare triple {1623#(<= (+ base2flt_~e 1) 0)} assume 0 == ~m || 0 == ~bitwiseComplement(16777216);~m := 0; {1623#(<= (+ base2flt_~e 1) 0)} is VALID [2022-02-21 03:09:47,634 INFO L290 TraceCheckUtils]: 12: Hoare triple {1623#(<= (+ base2flt_~e 1) 0)} assume !(128 + ~e <= 2147483647); {1620#false} is VALID [2022-02-21 03:09:47,634 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:09:47,634 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:09:47,634 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611341802] [2022-02-21 03:09:47,634 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1611341802] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:09:47,635 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:09:47,635 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-21 03:09:47,635 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797795336] [2022-02-21 03:09:47,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:09:47,636 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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 13 [2022-02-21 03:09:47,636 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:09:47,636 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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:09:47,643 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:09:47,643 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-21 03:09:47,643 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:09:47,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-21 03:09:47,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-21 03:09:47,644 INFO L87 Difference]: Start difference. First operand 156 states and 211 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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:09:47,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:09:47,972 INFO L93 Difference]: Finished difference Result 191 states and 250 transitions. [2022-02-21 03:09:47,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-21 03:09:47,972 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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 13 [2022-02-21 03:09:47,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:09:47,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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:09:47,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 250 transitions. [2022-02-21 03:09:47,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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:09:47,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 250 transitions. [2022-02-21 03:09:47,978 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 250 transitions. [2022-02-21 03:09:48,128 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 250 edges. 250 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:09:48,130 INFO L225 Difference]: With dead ends: 191 [2022-02-21 03:09:48,130 INFO L226 Difference]: Without dead ends: 188 [2022-02-21 03:09:48,131 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-02-21 03:09:48,131 INFO L933 BasicCegarLoop]: 126 mSDtfsCounter, 161 mSDsluCounter, 353 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 479 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-21 03:09:48,132 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [161 Valid, 479 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-21 03:09:48,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2022-02-21 03:09:48,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 163. [2022-02-21 03:09:48,139 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:09:48,139 INFO L82 GeneralOperation]: Start isEquivalent. First operand 188 states. Second operand has 163 states, 137 states have (on average 1.5474452554744527) internal successors, (212), 154 states have internal predecessors, (212), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-21 03:09:48,139 INFO L74 IsIncluded]: Start isIncluded. First operand 188 states. Second operand has 163 states, 137 states have (on average 1.5474452554744527) internal successors, (212), 154 states have internal predecessors, (212), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-21 03:09:48,140 INFO L87 Difference]: Start difference. First operand 188 states. Second operand has 163 states, 137 states have (on average 1.5474452554744527) internal successors, (212), 154 states have internal predecessors, (212), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-21 03:09:48,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:09:48,144 INFO L93 Difference]: Finished difference Result 188 states and 247 transitions. [2022-02-21 03:09:48,144 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 247 transitions. [2022-02-21 03:09:48,144 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:09:48,145 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:09:48,145 INFO L74 IsIncluded]: Start isIncluded. First operand has 163 states, 137 states have (on average 1.5474452554744527) internal successors, (212), 154 states have internal predecessors, (212), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 188 states. [2022-02-21 03:09:48,145 INFO L87 Difference]: Start difference. First operand has 163 states, 137 states have (on average 1.5474452554744527) internal successors, (212), 154 states have internal predecessors, (212), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 188 states. [2022-02-21 03:09:48,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:09:48,149 INFO L93 Difference]: Finished difference Result 188 states and 247 transitions. [2022-02-21 03:09:48,150 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 247 transitions. [2022-02-21 03:09:48,150 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:09:48,150 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:09:48,150 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:09:48,150 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:09:48,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 137 states have (on average 1.5474452554744527) internal successors, (212), 154 states have internal predecessors, (212), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-21 03:09:48,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 222 transitions. [2022-02-21 03:09:48,154 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 222 transitions. Word has length 13 [2022-02-21 03:09:48,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:09:48,155 INFO L470 AbstractCegarLoop]: Abstraction has 163 states and 222 transitions. [2022-02-21 03:09:48,155 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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:09:48,155 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 222 transitions. [2022-02-21 03:09:48,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-02-21 03:09:48,156 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:09:48,156 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:09:48,156 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-21 03:09:48,156 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-02-21 03:09:48,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:09:48,157 INFO L85 PathProgramCache]: Analyzing trace with hash -2068379248, now seen corresponding path program 1 times [2022-02-21 03:09:48,157 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:09:48,157 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761259661] [2022-02-21 03:09:48,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:09:48,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:09:48,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:09:48,205 INFO L290 TraceCheckUtils]: 0: Hoare triple {2403#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(24, 2);call #Ultimate.allocInit(12, 3); {2403#true} is VALID [2022-02-21 03:09:48,206 INFO L290 TraceCheckUtils]: 1: Hoare triple {2403#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_~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_add~0#1, main_~zero~0#1, main_~sa~0#1, main_~sb~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~tmp___1~0#1, main_~tmp___2~0#1, main_~tmp___3~0#1, main_~tmp___4~0#1, main_~tmp___5~0#1, main_~tmp___6~0#1, main_~tmp___7~0#1, main_~tmp___8~0#1, main_~tmp___9~0#1, main_~__retres23~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_add~0#1;havoc main_~zero~0#1;havoc main_~sa~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_~tmp___2~0#1;havoc main_~tmp___3~0#1;havoc main_~tmp___4~0#1;havoc main_~tmp___5~0#1;havoc main_~tmp___6~0#1;havoc main_~tmp___7~0#1;havoc main_~tmp___8~0#1;havoc main_~tmp___9~0#1;havoc main_~__retres23~0#1; {2403#true} is VALID [2022-02-21 03:09:48,206 INFO L272 TraceCheckUtils]: 2: Hoare triple {2403#true} call main_#t~ret22#1 := base2flt(0, 0); {2405#(= |base2flt_#in~e| 0)} is VALID [2022-02-21 03:09:48,207 INFO L290 TraceCheckUtils]: 3: Hoare triple {2405#(= |base2flt_#in~e| 0)} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {2406#(= base2flt_~e 0)} is VALID [2022-02-21 03:09:48,207 INFO L290 TraceCheckUtils]: 4: Hoare triple {2406#(= base2flt_~e 0)} assume !(0 == ~m % 4294967296); {2406#(= base2flt_~e 0)} is VALID [2022-02-21 03:09:48,207 INFO L290 TraceCheckUtils]: 5: Hoare triple {2406#(= base2flt_~e 0)} assume ~m % 4294967296 < 16777216; {2406#(= base2flt_~e 0)} is VALID [2022-02-21 03:09:48,208 INFO L290 TraceCheckUtils]: 6: Hoare triple {2406#(= base2flt_~e 0)} assume !false; {2406#(= base2flt_~e 0)} is VALID [2022-02-21 03:09:48,208 INFO L290 TraceCheckUtils]: 7: Hoare triple {2406#(= base2flt_~e 0)} assume !(~e <= -128); {2406#(= base2flt_~e 0)} is VALID [2022-02-21 03:09:48,208 INFO L290 TraceCheckUtils]: 8: Hoare triple {2406#(= base2flt_~e 0)} assume ~e - 1 <= 2147483647; {2406#(= base2flt_~e 0)} is VALID [2022-02-21 03:09:48,209 INFO L290 TraceCheckUtils]: 9: Hoare triple {2406#(= base2flt_~e 0)} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {2407#(<= 0 (+ base2flt_~e 1))} is VALID [2022-02-21 03:09:48,209 INFO L290 TraceCheckUtils]: 10: Hoare triple {2407#(<= 0 (+ base2flt_~e 1))} assume !(~m % 4294967296 < 16777216); {2407#(<= 0 (+ base2flt_~e 1))} is VALID [2022-02-21 03:09:48,209 INFO L290 TraceCheckUtils]: 11: Hoare triple {2407#(<= 0 (+ base2flt_~e 1))} assume 0 == ~m || 0 == ~bitwiseComplement(16777216);~m := 0; {2407#(<= 0 (+ base2flt_~e 1))} is VALID [2022-02-21 03:09:48,210 INFO L290 TraceCheckUtils]: 12: Hoare triple {2407#(<= 0 (+ base2flt_~e 1))} assume 128 + ~e <= 2147483647; {2407#(<= 0 (+ base2flt_~e 1))} is VALID [2022-02-21 03:09:48,210 INFO L290 TraceCheckUtils]: 13: Hoare triple {2407#(<= 0 (+ base2flt_~e 1))} assume !(128 + ~e >= -2147483648); {2404#false} is VALID [2022-02-21 03:09:48,211 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:09:48,211 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:09:48,211 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761259661] [2022-02-21 03:09:48,211 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1761259661] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:09:48,211 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:09:48,211 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-21 03:09:48,211 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409575419] [2022-02-21 03:09:48,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:09:48,212 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-02-21 03:09:48,212 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:09:48,212 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:09:48,220 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:09:48,220 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-21 03:09:48,221 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:09:48,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-21 03:09:48,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-02-21 03:09:48,222 INFO L87 Difference]: Start difference. First operand 163 states and 222 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:09:48,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:09:48,559 INFO L93 Difference]: Finished difference Result 306 states and 402 transitions. [2022-02-21 03:09:48,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-21 03:09:48,560 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-02-21 03:09:48,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:09:48,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:09:48,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 387 transitions. [2022-02-21 03:09:48,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:09:48,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 387 transitions. [2022-02-21 03:09:48,566 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 387 transitions. [2022-02-21 03:09:48,822 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 387 edges. 387 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:09:48,825 INFO L225 Difference]: With dead ends: 306 [2022-02-21 03:09:48,825 INFO L226 Difference]: Without dead ends: 198 [2022-02-21 03:09:48,826 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-02-21 03:09:48,826 INFO L933 BasicCegarLoop]: 124 mSDtfsCounter, 190 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 396 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-21 03:09:48,827 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [190 Valid, 396 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-21 03:09:48,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2022-02-21 03:09:48,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 167. [2022-02-21 03:09:48,836 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:09:48,836 INFO L82 GeneralOperation]: Start isEquivalent. First operand 198 states. Second operand has 167 states, 141 states have (on average 1.524822695035461) internal successors, (215), 158 states have internal predecessors, (215), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-21 03:09:48,836 INFO L74 IsIncluded]: Start isIncluded. First operand 198 states. Second operand has 167 states, 141 states have (on average 1.524822695035461) internal successors, (215), 158 states have internal predecessors, (215), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-21 03:09:48,837 INFO L87 Difference]: Start difference. First operand 198 states. Second operand has 167 states, 141 states have (on average 1.524822695035461) internal successors, (215), 158 states have internal predecessors, (215), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-21 03:09:48,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:09:48,841 INFO L93 Difference]: Finished difference Result 198 states and 257 transitions. [2022-02-21 03:09:48,841 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 257 transitions. [2022-02-21 03:09:48,842 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:09:48,842 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:09:48,842 INFO L74 IsIncluded]: Start isIncluded. First operand has 167 states, 141 states have (on average 1.524822695035461) internal successors, (215), 158 states have internal predecessors, (215), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 198 states. [2022-02-21 03:09:48,843 INFO L87 Difference]: Start difference. First operand has 167 states, 141 states have (on average 1.524822695035461) internal successors, (215), 158 states have internal predecessors, (215), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 198 states. [2022-02-21 03:09:48,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:09:48,847 INFO L93 Difference]: Finished difference Result 198 states and 257 transitions. [2022-02-21 03:09:48,847 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 257 transitions. [2022-02-21 03:09:48,847 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:09:48,847 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:09:48,848 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:09:48,848 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:09:48,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 141 states have (on average 1.524822695035461) internal successors, (215), 158 states have internal predecessors, (215), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-21 03:09:48,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 225 transitions. [2022-02-21 03:09:48,851 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 225 transitions. Word has length 14 [2022-02-21 03:09:48,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:09:48,852 INFO L470 AbstractCegarLoop]: Abstraction has 167 states and 225 transitions. [2022-02-21 03:09:48,852 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:09:48,852 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 225 transitions. [2022-02-21 03:09:48,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-02-21 03:09:48,853 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:09:48,853 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:09:48,853 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-21 03:09:48,853 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-02-21 03:09:48,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:09:48,854 INFO L85 PathProgramCache]: Analyzing trace with hash -1659659560, now seen corresponding path program 1 times [2022-02-21 03:09:48,854 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:09:48,854 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789919598] [2022-02-21 03:09:48,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:09:48,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:09:48,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:09:48,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-21 03:09:48,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:09:48,912 INFO L290 TraceCheckUtils]: 0: Hoare triple {3350#(and (= abs_77 |old(abs_77)|) (= abs_78 |old(abs_78)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {3340#true} is VALID [2022-02-21 03:09:48,912 INFO L290 TraceCheckUtils]: 1: Hoare triple {3340#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {3340#true} is VALID [2022-02-21 03:09:48,912 INFO L290 TraceCheckUtils]: 2: Hoare triple {3340#true} #res := ~__retres4~0; {3340#true} is VALID [2022-02-21 03:09:48,913 INFO L290 TraceCheckUtils]: 3: Hoare triple {3340#true} assume true; {3340#true} is VALID [2022-02-21 03:09:48,913 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {3340#true} {3342#(<= |ULTIMATE.start_main_~ea~2#1| 127)} #453#return; {3342#(<= |ULTIMATE.start_main_~ea~2#1| 127)} is VALID [2022-02-21 03:09:48,914 INFO L290 TraceCheckUtils]: 0: Hoare triple {3340#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(24, 2);call #Ultimate.allocInit(12, 3); {3340#true} is VALID [2022-02-21 03:09:48,914 INFO L290 TraceCheckUtils]: 1: Hoare triple {3340#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_~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_add~0#1, main_~zero~0#1, main_~sa~0#1, main_~sb~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~tmp___1~0#1, main_~tmp___2~0#1, main_~tmp___3~0#1, main_~tmp___4~0#1, main_~tmp___5~0#1, main_~tmp___6~0#1, main_~tmp___7~0#1, main_~tmp___8~0#1, main_~tmp___9~0#1, main_~__retres23~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_add~0#1;havoc main_~zero~0#1;havoc main_~sa~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_~tmp___2~0#1;havoc main_~tmp___3~0#1;havoc main_~tmp___4~0#1;havoc main_~tmp___5~0#1;havoc main_~tmp___6~0#1;havoc main_~tmp___7~0#1;havoc main_~tmp___8~0#1;havoc main_~tmp___9~0#1;havoc main_~__retres23~0#1; {3342#(<= |ULTIMATE.start_main_~ea~2#1| 127)} is VALID [2022-02-21 03:09:48,915 INFO L272 TraceCheckUtils]: 2: Hoare triple {3342#(<= |ULTIMATE.start_main_~ea~2#1| 127)} call main_#t~ret22#1 := base2flt(0, 0); {3350#(and (= abs_77 |old(abs_77)|) (= abs_78 |old(abs_78)|))} is VALID [2022-02-21 03:09:48,915 INFO L290 TraceCheckUtils]: 3: Hoare triple {3350#(and (= abs_77 |old(abs_77)|) (= abs_78 |old(abs_78)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {3340#true} is VALID [2022-02-21 03:09:48,915 INFO L290 TraceCheckUtils]: 4: Hoare triple {3340#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {3340#true} is VALID [2022-02-21 03:09:48,915 INFO L290 TraceCheckUtils]: 5: Hoare triple {3340#true} #res := ~__retres4~0; {3340#true} is VALID [2022-02-21 03:09:48,915 INFO L290 TraceCheckUtils]: 6: Hoare triple {3340#true} assume true; {3340#true} is VALID [2022-02-21 03:09:48,916 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {3340#true} {3342#(<= |ULTIMATE.start_main_~ea~2#1| 127)} #453#return; {3342#(<= |ULTIMATE.start_main_~ea~2#1| 127)} is VALID [2022-02-21 03:09:48,916 INFO L290 TraceCheckUtils]: 8: Hoare triple {3342#(<= |ULTIMATE.start_main_~ea~2#1| 127)} main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1; {3342#(<= |ULTIMATE.start_main_~ea~2#1| 127)} is VALID [2022-02-21 03:09:48,916 INFO L272 TraceCheckUtils]: 9: Hoare triple {3342#(<= |ULTIMATE.start_main_~ea~2#1| 127)} call main_#t~ret23#1 := base2flt(main_~ma~2#1, main_~ea~2#1); {3348#(<= |base2flt_#in~e| 127)} is VALID [2022-02-21 03:09:48,917 INFO L290 TraceCheckUtils]: 10: Hoare triple {3348#(<= |base2flt_#in~e| 127)} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {3349#(<= base2flt_~e 127)} is VALID [2022-02-21 03:09:48,917 INFO L290 TraceCheckUtils]: 11: Hoare triple {3349#(<= base2flt_~e 127)} assume !(0 == ~m % 4294967296); {3349#(<= base2flt_~e 127)} is VALID [2022-02-21 03:09:48,917 INFO L290 TraceCheckUtils]: 12: Hoare triple {3349#(<= base2flt_~e 127)} assume ~m % 4294967296 < 16777216; {3349#(<= base2flt_~e 127)} is VALID [2022-02-21 03:09:48,918 INFO L290 TraceCheckUtils]: 13: Hoare triple {3349#(<= base2flt_~e 127)} assume !false; {3349#(<= base2flt_~e 127)} is VALID [2022-02-21 03:09:48,918 INFO L290 TraceCheckUtils]: 14: Hoare triple {3349#(<= base2flt_~e 127)} assume !(~e <= -128); {3349#(<= base2flt_~e 127)} is VALID [2022-02-21 03:09:48,918 INFO L290 TraceCheckUtils]: 15: Hoare triple {3349#(<= base2flt_~e 127)} assume !(~e - 1 <= 2147483647); {3341#false} is VALID [2022-02-21 03:09:48,919 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:09:48,919 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:09:48,919 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789919598] [2022-02-21 03:09:48,919 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [789919598] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:09:48,919 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [48927217] [2022-02-21 03:09:48,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:09:48,920 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:09:48,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:09:48,941 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:09:48,959 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:09:48,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:09:48,996 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 03:09:49,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:09:49,022 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:09:49,101 INFO L290 TraceCheckUtils]: 0: Hoare triple {3340#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(24, 2);call #Ultimate.allocInit(12, 3); {3340#true} is VALID [2022-02-21 03:09:49,101 INFO L290 TraceCheckUtils]: 1: Hoare triple {3340#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_~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_add~0#1, main_~zero~0#1, main_~sa~0#1, main_~sb~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~tmp___1~0#1, main_~tmp___2~0#1, main_~tmp___3~0#1, main_~tmp___4~0#1, main_~tmp___5~0#1, main_~tmp___6~0#1, main_~tmp___7~0#1, main_~tmp___8~0#1, main_~tmp___9~0#1, main_~__retres23~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_add~0#1;havoc main_~zero~0#1;havoc main_~sa~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_~tmp___2~0#1;havoc main_~tmp___3~0#1;havoc main_~tmp___4~0#1;havoc main_~tmp___5~0#1;havoc main_~tmp___6~0#1;havoc main_~tmp___7~0#1;havoc main_~tmp___8~0#1;havoc main_~tmp___9~0#1;havoc main_~__retres23~0#1; {3342#(<= |ULTIMATE.start_main_~ea~2#1| 127)} is VALID [2022-02-21 03:09:49,101 INFO L272 TraceCheckUtils]: 2: Hoare triple {3342#(<= |ULTIMATE.start_main_~ea~2#1| 127)} call main_#t~ret22#1 := base2flt(0, 0); {3340#true} is VALID [2022-02-21 03:09:49,102 INFO L290 TraceCheckUtils]: 3: Hoare triple {3340#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {3340#true} is VALID [2022-02-21 03:09:49,102 INFO L290 TraceCheckUtils]: 4: Hoare triple {3340#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {3340#true} is VALID [2022-02-21 03:09:49,102 INFO L290 TraceCheckUtils]: 5: Hoare triple {3340#true} #res := ~__retres4~0; {3340#true} is VALID [2022-02-21 03:09:49,102 INFO L290 TraceCheckUtils]: 6: Hoare triple {3340#true} assume true; {3340#true} is VALID [2022-02-21 03:09:49,103 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {3340#true} {3342#(<= |ULTIMATE.start_main_~ea~2#1| 127)} #453#return; {3342#(<= |ULTIMATE.start_main_~ea~2#1| 127)} is VALID [2022-02-21 03:09:49,103 INFO L290 TraceCheckUtils]: 8: Hoare triple {3342#(<= |ULTIMATE.start_main_~ea~2#1| 127)} main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1; {3342#(<= |ULTIMATE.start_main_~ea~2#1| 127)} is VALID [2022-02-21 03:09:49,104 INFO L272 TraceCheckUtils]: 9: Hoare triple {3342#(<= |ULTIMATE.start_main_~ea~2#1| 127)} call main_#t~ret23#1 := base2flt(main_~ma~2#1, main_~ea~2#1); {3348#(<= |base2flt_#in~e| 127)} is VALID [2022-02-21 03:09:49,104 INFO L290 TraceCheckUtils]: 10: Hoare triple {3348#(<= |base2flt_#in~e| 127)} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {3349#(<= base2flt_~e 127)} is VALID [2022-02-21 03:09:49,105 INFO L290 TraceCheckUtils]: 11: Hoare triple {3349#(<= base2flt_~e 127)} assume !(0 == ~m % 4294967296); {3349#(<= base2flt_~e 127)} is VALID [2022-02-21 03:09:49,105 INFO L290 TraceCheckUtils]: 12: Hoare triple {3349#(<= base2flt_~e 127)} assume ~m % 4294967296 < 16777216; {3349#(<= base2flt_~e 127)} is VALID [2022-02-21 03:09:49,105 INFO L290 TraceCheckUtils]: 13: Hoare triple {3349#(<= base2flt_~e 127)} assume !false; {3349#(<= base2flt_~e 127)} is VALID [2022-02-21 03:09:49,106 INFO L290 TraceCheckUtils]: 14: Hoare triple {3349#(<= base2flt_~e 127)} assume !(~e <= -128); {3349#(<= base2flt_~e 127)} is VALID [2022-02-21 03:09:49,106 INFO L290 TraceCheckUtils]: 15: Hoare triple {3349#(<= base2flt_~e 127)} assume !(~e - 1 <= 2147483647); {3341#false} is VALID [2022-02-21 03:09:49,106 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:09:49,106 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-21 03:09:49,107 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [48927217] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:09:49,107 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-21 03:09:49,107 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2022-02-21 03:09:49,107 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338705611] [2022-02-21 03:09:49,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:09:49,108 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-02-21 03:09:49,108 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:09:49,108 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-21 03:09:49,118 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:09:49,119 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-21 03:09:49,119 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:09:49,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-21 03:09:49,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-21 03:09:49,120 INFO L87 Difference]: Start difference. First operand 167 states and 225 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (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:09:49,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:09:49,460 INFO L93 Difference]: Finished difference Result 237 states and 322 transitions. [2022-02-21 03:09:49,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-21 03:09:49,460 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-02-21 03:09:49,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:09:49,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (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:09:49,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 224 transitions. [2022-02-21 03:09:49,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (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:09:49,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 224 transitions. [2022-02-21 03:09:49,466 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 224 transitions. [2022-02-21 03:09:49,597 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 224 edges. 224 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:09:49,601 INFO L225 Difference]: With dead ends: 237 [2022-02-21 03:09:49,602 INFO L226 Difference]: Without dead ends: 233 [2022-02-21 03:09:49,602 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 18 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:09:49,604 INFO L933 BasicCegarLoop]: 110 mSDtfsCounter, 189 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 379 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-21 03:09:49,604 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [194 Valid, 379 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-21 03:09:49,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2022-02-21 03:09:49,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 203. [2022-02-21 03:09:49,630 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:09:49,630 INFO L82 GeneralOperation]: Start isEquivalent. First operand 233 states. Second operand has 203 states, 177 states have (on average 1.5536723163841808) internal successors, (275), 193 states have internal predecessors, (275), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-21 03:09:49,631 INFO L74 IsIncluded]: Start isIncluded. First operand 233 states. Second operand has 203 states, 177 states have (on average 1.5536723163841808) internal successors, (275), 193 states have internal predecessors, (275), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-21 03:09:49,631 INFO L87 Difference]: Start difference. First operand 233 states. Second operand has 203 states, 177 states have (on average 1.5536723163841808) internal successors, (275), 193 states have internal predecessors, (275), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-21 03:09:49,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:09:49,635 INFO L93 Difference]: Finished difference Result 233 states and 316 transitions. [2022-02-21 03:09:49,635 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 316 transitions. [2022-02-21 03:09:49,635 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:09:49,635 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:09:49,636 INFO L74 IsIncluded]: Start isIncluded. First operand has 203 states, 177 states have (on average 1.5536723163841808) internal successors, (275), 193 states have internal predecessors, (275), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 233 states. [2022-02-21 03:09:49,636 INFO L87 Difference]: Start difference. First operand has 203 states, 177 states have (on average 1.5536723163841808) internal successors, (275), 193 states have internal predecessors, (275), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 233 states. [2022-02-21 03:09:49,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:09:49,640 INFO L93 Difference]: Finished difference Result 233 states and 316 transitions. [2022-02-21 03:09:49,641 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 316 transitions. [2022-02-21 03:09:49,641 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:09:49,641 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:09:49,641 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:09:49,641 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:09:49,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 177 states have (on average 1.5536723163841808) internal successors, (275), 193 states have internal predecessors, (275), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-21 03:09:49,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 285 transitions. [2022-02-21 03:09:49,645 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 285 transitions. Word has length 16 [2022-02-21 03:09:49,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:09:49,645 INFO L470 AbstractCegarLoop]: Abstraction has 203 states and 285 transitions. [2022-02-21 03:09:49,646 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (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:09:49,646 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 285 transitions. [2022-02-21 03:09:49,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-02-21 03:09:49,646 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:09:49,646 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:09:49,678 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:09:49,877 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:09:49,878 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-02-21 03:09:49,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:09:49,878 INFO L85 PathProgramCache]: Analyzing trace with hash -1313978510, now seen corresponding path program 1 times [2022-02-21 03:09:49,878 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:09:49,879 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283262239] [2022-02-21 03:09:49,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:09:49,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:09:49,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:09:49,918 INFO L290 TraceCheckUtils]: 0: Hoare triple {4366#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(24, 2);call #Ultimate.allocInit(12, 3); {4366#true} is VALID [2022-02-21 03:09:49,919 INFO L290 TraceCheckUtils]: 1: Hoare triple {4366#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_~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_add~0#1, main_~zero~0#1, main_~sa~0#1, main_~sb~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~tmp___1~0#1, main_~tmp___2~0#1, main_~tmp___3~0#1, main_~tmp___4~0#1, main_~tmp___5~0#1, main_~tmp___6~0#1, main_~tmp___7~0#1, main_~tmp___8~0#1, main_~tmp___9~0#1, main_~__retres23~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_add~0#1;havoc main_~zero~0#1;havoc main_~sa~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_~tmp___2~0#1;havoc main_~tmp___3~0#1;havoc main_~tmp___4~0#1;havoc main_~tmp___5~0#1;havoc main_~tmp___6~0#1;havoc main_~tmp___7~0#1;havoc main_~tmp___8~0#1;havoc main_~tmp___9~0#1;havoc main_~__retres23~0#1; {4366#true} is VALID [2022-02-21 03:09:49,919 INFO L272 TraceCheckUtils]: 2: Hoare triple {4366#true} call main_#t~ret22#1 := base2flt(0, 0); {4368#(= |base2flt_#in~e| 0)} is VALID [2022-02-21 03:09:49,920 INFO L290 TraceCheckUtils]: 3: Hoare triple {4368#(= |base2flt_#in~e| 0)} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {4369#(= base2flt_~e 0)} is VALID [2022-02-21 03:09:49,920 INFO L290 TraceCheckUtils]: 4: Hoare triple {4369#(= base2flt_~e 0)} assume !(0 == ~m % 4294967296); {4369#(= base2flt_~e 0)} is VALID [2022-02-21 03:09:49,920 INFO L290 TraceCheckUtils]: 5: Hoare triple {4369#(= base2flt_~e 0)} assume !(~m % 4294967296 < 16777216); {4369#(= base2flt_~e 0)} is VALID [2022-02-21 03:09:49,921 INFO L290 TraceCheckUtils]: 6: Hoare triple {4369#(= base2flt_~e 0)} assume !false; {4369#(= base2flt_~e 0)} is VALID [2022-02-21 03:09:49,921 INFO L290 TraceCheckUtils]: 7: Hoare triple {4369#(= base2flt_~e 0)} assume ~m % 4294967296 >= 33554432; {4369#(= base2flt_~e 0)} is VALID [2022-02-21 03:09:49,921 INFO L290 TraceCheckUtils]: 8: Hoare triple {4369#(= base2flt_~e 0)} assume !(~e >= 127); {4369#(= base2flt_~e 0)} is VALID [2022-02-21 03:09:49,922 INFO L290 TraceCheckUtils]: 9: Hoare triple {4369#(= base2flt_~e 0)} assume 1 + ~e <= 2147483647; {4369#(= base2flt_~e 0)} is VALID [2022-02-21 03:09:49,922 INFO L290 TraceCheckUtils]: 10: Hoare triple {4369#(= base2flt_~e 0)} assume 1 + ~e >= -2147483648;~e := 1 + ~e;~m := ~m / 2; {4370#(<= base2flt_~e 1)} is VALID [2022-02-21 03:09:49,923 INFO L290 TraceCheckUtils]: 11: Hoare triple {4370#(<= base2flt_~e 1)} assume !false; {4370#(<= base2flt_~e 1)} is VALID [2022-02-21 03:09:49,923 INFO L290 TraceCheckUtils]: 12: Hoare triple {4370#(<= base2flt_~e 1)} assume !(~m % 4294967296 >= 33554432); {4370#(<= base2flt_~e 1)} is VALID [2022-02-21 03:09:49,923 INFO L290 TraceCheckUtils]: 13: Hoare triple {4370#(<= base2flt_~e 1)} assume 0 == ~m || 0 == ~bitwiseComplement(16777216);~m := 0; {4370#(<= base2flt_~e 1)} is VALID [2022-02-21 03:09:49,924 INFO L290 TraceCheckUtils]: 14: Hoare triple {4370#(<= base2flt_~e 1)} assume !(128 + ~e <= 2147483647); {4367#false} is VALID [2022-02-21 03:09:49,924 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:09:49,924 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:09:49,924 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283262239] [2022-02-21 03:09:49,924 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [283262239] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:09:49,925 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1216264689] [2022-02-21 03:09:49,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:09:49,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:09:49,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:09:49,926 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:09:49,930 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:09:49,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:09:49,963 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-21 03:09:49,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:09:49,973 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:09:50,032 INFO L290 TraceCheckUtils]: 0: Hoare triple {4366#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(24, 2);call #Ultimate.allocInit(12, 3); {4366#true} is VALID [2022-02-21 03:09:50,033 INFO L290 TraceCheckUtils]: 1: Hoare triple {4366#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_~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_add~0#1, main_~zero~0#1, main_~sa~0#1, main_~sb~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~tmp___1~0#1, main_~tmp___2~0#1, main_~tmp___3~0#1, main_~tmp___4~0#1, main_~tmp___5~0#1, main_~tmp___6~0#1, main_~tmp___7~0#1, main_~tmp___8~0#1, main_~tmp___9~0#1, main_~__retres23~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_add~0#1;havoc main_~zero~0#1;havoc main_~sa~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_~tmp___2~0#1;havoc main_~tmp___3~0#1;havoc main_~tmp___4~0#1;havoc main_~tmp___5~0#1;havoc main_~tmp___6~0#1;havoc main_~tmp___7~0#1;havoc main_~tmp___8~0#1;havoc main_~tmp___9~0#1;havoc main_~__retres23~0#1; {4366#true} is VALID [2022-02-21 03:09:50,033 INFO L272 TraceCheckUtils]: 2: Hoare triple {4366#true} call main_#t~ret22#1 := base2flt(0, 0); {4366#true} is VALID [2022-02-21 03:09:50,033 INFO L290 TraceCheckUtils]: 3: Hoare triple {4366#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {4366#true} is VALID [2022-02-21 03:09:50,033 INFO L290 TraceCheckUtils]: 4: Hoare triple {4366#true} assume !(0 == ~m % 4294967296); {4366#true} is VALID [2022-02-21 03:09:50,033 INFO L290 TraceCheckUtils]: 5: Hoare triple {4366#true} assume !(~m % 4294967296 < 16777216); {4366#true} is VALID [2022-02-21 03:09:50,034 INFO L290 TraceCheckUtils]: 6: Hoare triple {4366#true} assume !false; {4366#true} is VALID [2022-02-21 03:09:50,034 INFO L290 TraceCheckUtils]: 7: Hoare triple {4366#true} assume ~m % 4294967296 >= 33554432; {4366#true} is VALID [2022-02-21 03:09:50,034 INFO L290 TraceCheckUtils]: 8: Hoare triple {4366#true} assume !(~e >= 127); {4398#(not (<= 127 base2flt_~e))} is VALID [2022-02-21 03:09:50,036 INFO L290 TraceCheckUtils]: 9: Hoare triple {4398#(not (<= 127 base2flt_~e))} assume 1 + ~e <= 2147483647; {4398#(not (<= 127 base2flt_~e))} is VALID [2022-02-21 03:09:50,036 INFO L290 TraceCheckUtils]: 10: Hoare triple {4398#(not (<= 127 base2flt_~e))} assume 1 + ~e >= -2147483648;~e := 1 + ~e;~m := ~m / 2; {4405#(< base2flt_~e 128)} is VALID [2022-02-21 03:09:50,037 INFO L290 TraceCheckUtils]: 11: Hoare triple {4405#(< base2flt_~e 128)} assume !false; {4405#(< base2flt_~e 128)} is VALID [2022-02-21 03:09:50,037 INFO L290 TraceCheckUtils]: 12: Hoare triple {4405#(< base2flt_~e 128)} assume !(~m % 4294967296 >= 33554432); {4405#(< base2flt_~e 128)} is VALID [2022-02-21 03:09:50,037 INFO L290 TraceCheckUtils]: 13: Hoare triple {4405#(< base2flt_~e 128)} assume 0 == ~m || 0 == ~bitwiseComplement(16777216);~m := 0; {4405#(< base2flt_~e 128)} is VALID [2022-02-21 03:09:50,038 INFO L290 TraceCheckUtils]: 14: Hoare triple {4405#(< base2flt_~e 128)} assume !(128 + ~e <= 2147483647); {4367#false} is VALID [2022-02-21 03:09:50,038 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:09:50,038 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-21 03:09:50,038 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1216264689] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:09:50,038 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-21 03:09:50,038 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2022-02-21 03:09:50,039 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808719475] [2022-02-21 03:09:50,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:09:50,039 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-02-21 03:09:50,039 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:09:50,039 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:09:50,047 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:09:50,048 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-21 03:09:50,048 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:09:50,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-21 03:09:50,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-02-21 03:09:50,049 INFO L87 Difference]: Start difference. First operand 203 states and 285 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:09:50,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:09:50,284 INFO L93 Difference]: Finished difference Result 255 states and 356 transitions. [2022-02-21 03:09:50,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-21 03:09:50,284 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-02-21 03:09:50,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:09:50,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:09:50,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 176 transitions. [2022-02-21 03:09:50,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:09:50,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 176 transitions. [2022-02-21 03:09:50,287 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 176 transitions. [2022-02-21 03:09:50,412 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 176 edges. 176 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:09:50,417 INFO L225 Difference]: With dead ends: 255 [2022-02-21 03:09:50,418 INFO L226 Difference]: Without dead ends: 253 [2022-02-21 03:09:50,418 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-02-21 03:09:50,423 INFO L933 BasicCegarLoop]: 151 mSDtfsCounter, 26 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 387 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:09:50,423 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 387 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:09:50,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2022-02-21 03:09:50,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 196. [2022-02-21 03:09:50,450 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:09:50,450 INFO L82 GeneralOperation]: Start isEquivalent. First operand 253 states. Second operand has 196 states, 170 states have (on average 1.5294117647058822) internal successors, (260), 186 states have internal predecessors, (260), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-21 03:09:50,451 INFO L74 IsIncluded]: Start isIncluded. First operand 253 states. Second operand has 196 states, 170 states have (on average 1.5294117647058822) internal successors, (260), 186 states have internal predecessors, (260), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-21 03:09:50,451 INFO L87 Difference]: Start difference. First operand 253 states. Second operand has 196 states, 170 states have (on average 1.5294117647058822) internal successors, (260), 186 states have internal predecessors, (260), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-21 03:09:50,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:09:50,456 INFO L93 Difference]: Finished difference Result 253 states and 350 transitions. [2022-02-21 03:09:50,456 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 350 transitions. [2022-02-21 03:09:50,457 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:09:50,457 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:09:50,457 INFO L74 IsIncluded]: Start isIncluded. First operand has 196 states, 170 states have (on average 1.5294117647058822) internal successors, (260), 186 states have internal predecessors, (260), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 253 states. [2022-02-21 03:09:50,458 INFO L87 Difference]: Start difference. First operand has 196 states, 170 states have (on average 1.5294117647058822) internal successors, (260), 186 states have internal predecessors, (260), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 253 states. [2022-02-21 03:09:50,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:09:50,462 INFO L93 Difference]: Finished difference Result 253 states and 350 transitions. [2022-02-21 03:09:50,463 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 350 transitions. [2022-02-21 03:09:50,463 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:09:50,463 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:09:50,463 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:09:50,463 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:09:50,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 170 states have (on average 1.5294117647058822) internal successors, (260), 186 states have internal predecessors, (260), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-21 03:09:50,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 270 transitions. [2022-02-21 03:09:50,467 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 270 transitions. Word has length 15 [2022-02-21 03:09:50,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:09:50,468 INFO L470 AbstractCegarLoop]: Abstraction has 196 states and 270 transitions. [2022-02-21 03:09:50,468 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:09:50,468 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 270 transitions. [2022-02-21 03:09:50,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-02-21 03:09:50,468 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:09:50,468 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:09:50,487 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:09:50,685 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-02-21 03:09:50,685 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-02-21 03:09:50,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:09:50,685 INFO L85 PathProgramCache]: Analyzing trace with hash 90161249, now seen corresponding path program 1 times [2022-02-21 03:09:50,686 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:09:50,686 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120207911] [2022-02-21 03:09:50,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:09:50,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:09:50,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:09:50,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-21 03:09:50,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:09:50,735 INFO L290 TraceCheckUtils]: 0: Hoare triple {5445#(and (= abs_77 |old(abs_77)|) (= abs_78 |old(abs_78)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {5437#true} is VALID [2022-02-21 03:09:50,735 INFO L290 TraceCheckUtils]: 1: Hoare triple {5437#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {5437#true} is VALID [2022-02-21 03:09:50,736 INFO L290 TraceCheckUtils]: 2: Hoare triple {5437#true} #res := ~__retres4~0; {5437#true} is VALID [2022-02-21 03:09:50,737 INFO L290 TraceCheckUtils]: 3: Hoare triple {5437#true} assume true; {5437#true} is VALID [2022-02-21 03:09:50,737 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {5437#true} {5437#true} #453#return; {5437#true} is VALID [2022-02-21 03:09:50,739 INFO L290 TraceCheckUtils]: 0: Hoare triple {5437#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(24, 2);call #Ultimate.allocInit(12, 3); {5437#true} is VALID [2022-02-21 03:09:50,739 INFO L290 TraceCheckUtils]: 1: Hoare triple {5437#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_~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_add~0#1, main_~zero~0#1, main_~sa~0#1, main_~sb~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~tmp___1~0#1, main_~tmp___2~0#1, main_~tmp___3~0#1, main_~tmp___4~0#1, main_~tmp___5~0#1, main_~tmp___6~0#1, main_~tmp___7~0#1, main_~tmp___8~0#1, main_~tmp___9~0#1, main_~__retres23~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_add~0#1;havoc main_~zero~0#1;havoc main_~sa~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_~tmp___2~0#1;havoc main_~tmp___3~0#1;havoc main_~tmp___4~0#1;havoc main_~tmp___5~0#1;havoc main_~tmp___6~0#1;havoc main_~tmp___7~0#1;havoc main_~tmp___8~0#1;havoc main_~tmp___9~0#1;havoc main_~__retres23~0#1; {5437#true} is VALID [2022-02-21 03:09:50,746 INFO L272 TraceCheckUtils]: 2: Hoare triple {5437#true} call main_#t~ret22#1 := base2flt(0, 0); {5445#(and (= abs_77 |old(abs_77)|) (= abs_78 |old(abs_78)|))} is VALID [2022-02-21 03:09:50,747 INFO L290 TraceCheckUtils]: 3: Hoare triple {5445#(and (= abs_77 |old(abs_77)|) (= abs_78 |old(abs_78)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {5437#true} is VALID [2022-02-21 03:09:50,747 INFO L290 TraceCheckUtils]: 4: Hoare triple {5437#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {5437#true} is VALID [2022-02-21 03:09:50,747 INFO L290 TraceCheckUtils]: 5: Hoare triple {5437#true} #res := ~__retres4~0; {5437#true} is VALID [2022-02-21 03:09:50,747 INFO L290 TraceCheckUtils]: 6: Hoare triple {5437#true} assume true; {5437#true} is VALID [2022-02-21 03:09:50,747 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {5437#true} {5437#true} #453#return; {5437#true} is VALID [2022-02-21 03:09:50,749 INFO L290 TraceCheckUtils]: 8: Hoare triple {5437#true} main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1; {5437#true} is VALID [2022-02-21 03:09:50,749 INFO L272 TraceCheckUtils]: 9: Hoare triple {5437#true} call main_#t~ret23#1 := base2flt(main_~ma~2#1, main_~ea~2#1); {5437#true} is VALID [2022-02-21 03:09:50,749 INFO L290 TraceCheckUtils]: 10: Hoare triple {5437#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {5437#true} is VALID [2022-02-21 03:09:50,750 INFO L290 TraceCheckUtils]: 11: Hoare triple {5437#true} assume !(0 == ~m % 4294967296); {5437#true} is VALID [2022-02-21 03:09:50,750 INFO L290 TraceCheckUtils]: 12: Hoare triple {5437#true} assume ~m % 4294967296 < 16777216; {5437#true} is VALID [2022-02-21 03:09:50,750 INFO L290 TraceCheckUtils]: 13: Hoare triple {5437#true} assume !false; {5437#true} is VALID [2022-02-21 03:09:50,751 INFO L290 TraceCheckUtils]: 14: Hoare triple {5437#true} assume !(~e <= -128); {5444#(<= 0 (+ base2flt_~e 127))} is VALID [2022-02-21 03:09:50,751 INFO L290 TraceCheckUtils]: 15: Hoare triple {5444#(<= 0 (+ base2flt_~e 127))} assume ~e - 1 <= 2147483647; {5444#(<= 0 (+ base2flt_~e 127))} is VALID [2022-02-21 03:09:50,752 INFO L290 TraceCheckUtils]: 16: Hoare triple {5444#(<= 0 (+ base2flt_~e 127))} assume !(~e - 1 >= -2147483648); {5438#false} is VALID [2022-02-21 03:09:50,752 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-21 03:09:50,753 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:09:50,753 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120207911] [2022-02-21 03:09:50,753 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1120207911] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:09:50,753 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [895101202] [2022-02-21 03:09:50,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:09:50,754 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:09:50,754 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:09:50,755 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:09:50,756 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:09:50,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:09:50,793 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:09:50,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:09:50,802 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:09:50,841 INFO L290 TraceCheckUtils]: 0: Hoare triple {5437#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(24, 2);call #Ultimate.allocInit(12, 3); {5437#true} is VALID [2022-02-21 03:09:50,841 INFO L290 TraceCheckUtils]: 1: Hoare triple {5437#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_~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_add~0#1, main_~zero~0#1, main_~sa~0#1, main_~sb~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~tmp___1~0#1, main_~tmp___2~0#1, main_~tmp___3~0#1, main_~tmp___4~0#1, main_~tmp___5~0#1, main_~tmp___6~0#1, main_~tmp___7~0#1, main_~tmp___8~0#1, main_~tmp___9~0#1, main_~__retres23~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_add~0#1;havoc main_~zero~0#1;havoc main_~sa~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_~tmp___2~0#1;havoc main_~tmp___3~0#1;havoc main_~tmp___4~0#1;havoc main_~tmp___5~0#1;havoc main_~tmp___6~0#1;havoc main_~tmp___7~0#1;havoc main_~tmp___8~0#1;havoc main_~tmp___9~0#1;havoc main_~__retres23~0#1; {5437#true} is VALID [2022-02-21 03:09:50,842 INFO L272 TraceCheckUtils]: 2: Hoare triple {5437#true} call main_#t~ret22#1 := base2flt(0, 0); {5437#true} is VALID [2022-02-21 03:09:50,842 INFO L290 TraceCheckUtils]: 3: Hoare triple {5437#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {5437#true} is VALID [2022-02-21 03:09:50,842 INFO L290 TraceCheckUtils]: 4: Hoare triple {5437#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {5437#true} is VALID [2022-02-21 03:09:50,842 INFO L290 TraceCheckUtils]: 5: Hoare triple {5437#true} #res := ~__retres4~0; {5437#true} is VALID [2022-02-21 03:09:50,842 INFO L290 TraceCheckUtils]: 6: Hoare triple {5437#true} assume true; {5437#true} is VALID [2022-02-21 03:09:50,842 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {5437#true} {5437#true} #453#return; {5437#true} is VALID [2022-02-21 03:09:50,843 INFO L290 TraceCheckUtils]: 8: Hoare triple {5437#true} main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1; {5437#true} is VALID [2022-02-21 03:09:50,843 INFO L272 TraceCheckUtils]: 9: Hoare triple {5437#true} call main_#t~ret23#1 := base2flt(main_~ma~2#1, main_~ea~2#1); {5437#true} is VALID [2022-02-21 03:09:50,843 INFO L290 TraceCheckUtils]: 10: Hoare triple {5437#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {5437#true} is VALID [2022-02-21 03:09:50,843 INFO L290 TraceCheckUtils]: 11: Hoare triple {5437#true} assume !(0 == ~m % 4294967296); {5437#true} is VALID [2022-02-21 03:09:50,843 INFO L290 TraceCheckUtils]: 12: Hoare triple {5437#true} assume ~m % 4294967296 < 16777216; {5437#true} is VALID [2022-02-21 03:09:50,843 INFO L290 TraceCheckUtils]: 13: Hoare triple {5437#true} assume !false; {5437#true} is VALID [2022-02-21 03:09:50,844 INFO L290 TraceCheckUtils]: 14: Hoare triple {5437#true} assume !(~e <= -128); {5444#(<= 0 (+ base2flt_~e 127))} is VALID [2022-02-21 03:09:50,844 INFO L290 TraceCheckUtils]: 15: Hoare triple {5444#(<= 0 (+ base2flt_~e 127))} assume ~e - 1 <= 2147483647; {5444#(<= 0 (+ base2flt_~e 127))} is VALID [2022-02-21 03:09:50,844 INFO L290 TraceCheckUtils]: 16: Hoare triple {5444#(<= 0 (+ base2flt_~e 127))} assume !(~e - 1 >= -2147483648); {5438#false} is VALID [2022-02-21 03:09:50,845 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:09:50,845 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-21 03:09:50,845 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [895101202] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:09:50,845 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-21 03:09:50,845 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 3 [2022-02-21 03:09:50,845 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749222666] [2022-02-21 03:09:50,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:09:50,846 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (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 17 [2022-02-21 03:09:50,846 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:09:50,846 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 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:09:50,855 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:09:50,856 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 03:09:50,856 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:09:50,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 03:09:50,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-21 03:09:50,857 INFO L87 Difference]: Start difference. First operand 196 states and 270 transitions. Second operand has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (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:09:50,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:09:50,996 INFO L93 Difference]: Finished difference Result 205 states and 279 transitions. [2022-02-21 03:09:50,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 03:09:50,997 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (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 17 [2022-02-21 03:09:50,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:09:50,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (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:09:50,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 140 transitions. [2022-02-21 03:09:50,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (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:09:50,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 140 transitions. [2022-02-21 03:09:50,999 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 140 transitions. [2022-02-21 03:09:51,081 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 140 edges. 140 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:09:51,084 INFO L225 Difference]: With dead ends: 205 [2022-02-21 03:09:51,084 INFO L226 Difference]: Without dead ends: 204 [2022-02-21 03:09:51,085 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-21 03:09:51,085 INFO L933 BasicCegarLoop]: 136 mSDtfsCounter, 3 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:09:51,085 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 246 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:09:51,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2022-02-21 03:09:51,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 193. [2022-02-21 03:09:51,109 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:09:51,109 INFO L82 GeneralOperation]: Start isEquivalent. First operand 204 states. Second operand has 193 states, 168 states have (on average 1.5178571428571428) internal successors, (255), 183 states have internal predecessors, (255), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-21 03:09:51,110 INFO L74 IsIncluded]: Start isIncluded. First operand 204 states. Second operand has 193 states, 168 states have (on average 1.5178571428571428) internal successors, (255), 183 states have internal predecessors, (255), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-21 03:09:51,110 INFO L87 Difference]: Start difference. First operand 204 states. Second operand has 193 states, 168 states have (on average 1.5178571428571428) internal successors, (255), 183 states have internal predecessors, (255), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-21 03:09:51,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:09:51,114 INFO L93 Difference]: Finished difference Result 204 states and 276 transitions. [2022-02-21 03:09:51,114 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 276 transitions. [2022-02-21 03:09:51,114 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:09:51,114 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:09:51,115 INFO L74 IsIncluded]: Start isIncluded. First operand has 193 states, 168 states have (on average 1.5178571428571428) internal successors, (255), 183 states have internal predecessors, (255), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 204 states. [2022-02-21 03:09:51,115 INFO L87 Difference]: Start difference. First operand has 193 states, 168 states have (on average 1.5178571428571428) internal successors, (255), 183 states have internal predecessors, (255), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 204 states. [2022-02-21 03:09:51,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:09:51,118 INFO L93 Difference]: Finished difference Result 204 states and 276 transitions. [2022-02-21 03:09:51,118 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 276 transitions. [2022-02-21 03:09:51,119 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:09:51,119 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:09:51,119 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:09:51,119 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:09:51,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 168 states have (on average 1.5178571428571428) internal successors, (255), 183 states have internal predecessors, (255), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-21 03:09:51,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 265 transitions. [2022-02-21 03:09:51,123 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 265 transitions. Word has length 17 [2022-02-21 03:09:51,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:09:51,123 INFO L470 AbstractCegarLoop]: Abstraction has 193 states and 265 transitions. [2022-02-21 03:09:51,123 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (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:09:51,123 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 265 transitions. [2022-02-21 03:09:51,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-02-21 03:09:51,124 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:09:51,124 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:09:51,180 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-02-21 03:09:51,339 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:09:51,342 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting base2fltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-02-21 03:09:51,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:09:51,342 INFO L85 PathProgramCache]: Analyzing trace with hash -612520448, now seen corresponding path program 1 times [2022-02-21 03:09:51,342 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:09:51,342 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445551172] [2022-02-21 03:09:51,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:09:51,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:09:51,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:09:51,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-21 03:09:51,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:09:51,404 INFO L290 TraceCheckUtils]: 0: Hoare triple {6369#(and (= abs_77 |old(abs_77)|) (= abs_78 |old(abs_78)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {6359#true} is VALID [2022-02-21 03:09:51,404 INFO L290 TraceCheckUtils]: 1: Hoare triple {6359#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {6359#true} is VALID [2022-02-21 03:09:51,404 INFO L290 TraceCheckUtils]: 2: Hoare triple {6359#true} #res := ~__retres4~0; {6359#true} is VALID [2022-02-21 03:09:51,404 INFO L290 TraceCheckUtils]: 3: Hoare triple {6359#true} assume true; {6359#true} is VALID [2022-02-21 03:09:51,405 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {6359#true} {6361#(<= 0 (+ |ULTIMATE.start_main_~ea~2#1| 128))} #453#return; {6361#(<= 0 (+ |ULTIMATE.start_main_~ea~2#1| 128))} is VALID [2022-02-21 03:09:51,405 INFO L290 TraceCheckUtils]: 0: Hoare triple {6359#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(24, 2);call #Ultimate.allocInit(12, 3); {6359#true} is VALID [2022-02-21 03:09:51,405 INFO L290 TraceCheckUtils]: 1: Hoare triple {6359#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_~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_add~0#1, main_~zero~0#1, main_~sa~0#1, main_~sb~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~tmp___1~0#1, main_~tmp___2~0#1, main_~tmp___3~0#1, main_~tmp___4~0#1, main_~tmp___5~0#1, main_~tmp___6~0#1, main_~tmp___7~0#1, main_~tmp___8~0#1, main_~tmp___9~0#1, main_~__retres23~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_add~0#1;havoc main_~zero~0#1;havoc main_~sa~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_~tmp___2~0#1;havoc main_~tmp___3~0#1;havoc main_~tmp___4~0#1;havoc main_~tmp___5~0#1;havoc main_~tmp___6~0#1;havoc main_~tmp___7~0#1;havoc main_~tmp___8~0#1;havoc main_~tmp___9~0#1;havoc main_~__retres23~0#1; {6361#(<= 0 (+ |ULTIMATE.start_main_~ea~2#1| 128))} is VALID [2022-02-21 03:09:51,406 INFO L272 TraceCheckUtils]: 2: Hoare triple {6361#(<= 0 (+ |ULTIMATE.start_main_~ea~2#1| 128))} call main_#t~ret22#1 := base2flt(0, 0); {6369#(and (= abs_77 |old(abs_77)|) (= abs_78 |old(abs_78)|))} is VALID [2022-02-21 03:09:51,406 INFO L290 TraceCheckUtils]: 3: Hoare triple {6369#(and (= abs_77 |old(abs_77)|) (= abs_78 |old(abs_78)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {6359#true} is VALID [2022-02-21 03:09:51,406 INFO L290 TraceCheckUtils]: 4: Hoare triple {6359#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {6359#true} is VALID [2022-02-21 03:09:51,406 INFO L290 TraceCheckUtils]: 5: Hoare triple {6359#true} #res := ~__retres4~0; {6359#true} is VALID [2022-02-21 03:09:51,406 INFO L290 TraceCheckUtils]: 6: Hoare triple {6359#true} assume true; {6359#true} is VALID [2022-02-21 03:09:51,407 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {6359#true} {6361#(<= 0 (+ |ULTIMATE.start_main_~ea~2#1| 128))} #453#return; {6361#(<= 0 (+ |ULTIMATE.start_main_~ea~2#1| 128))} is VALID [2022-02-21 03:09:51,407 INFO L290 TraceCheckUtils]: 8: Hoare triple {6361#(<= 0 (+ |ULTIMATE.start_main_~ea~2#1| 128))} main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1; {6361#(<= 0 (+ |ULTIMATE.start_main_~ea~2#1| 128))} is VALID [2022-02-21 03:09:51,408 INFO L272 TraceCheckUtils]: 9: Hoare triple {6361#(<= 0 (+ |ULTIMATE.start_main_~ea~2#1| 128))} call main_#t~ret23#1 := base2flt(main_~ma~2#1, main_~ea~2#1); {6367#(<= 0 (+ 128 |base2flt_#in~e|))} is VALID [2022-02-21 03:09:51,408 INFO L290 TraceCheckUtils]: 10: Hoare triple {6367#(<= 0 (+ 128 |base2flt_#in~e|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {6368#(<= 0 (+ 128 base2flt_~e))} is VALID [2022-02-21 03:09:51,408 INFO L290 TraceCheckUtils]: 11: Hoare triple {6368#(<= 0 (+ 128 base2flt_~e))} assume !(0 == ~m % 4294967296); {6368#(<= 0 (+ 128 base2flt_~e))} is VALID [2022-02-21 03:09:51,409 INFO L290 TraceCheckUtils]: 12: Hoare triple {6368#(<= 0 (+ 128 base2flt_~e))} assume !(~m % 4294967296 < 16777216); {6368#(<= 0 (+ 128 base2flt_~e))} is VALID [2022-02-21 03:09:51,409 INFO L290 TraceCheckUtils]: 13: Hoare triple {6368#(<= 0 (+ 128 base2flt_~e))} assume !false; {6368#(<= 0 (+ 128 base2flt_~e))} is VALID [2022-02-21 03:09:51,410 INFO L290 TraceCheckUtils]: 14: Hoare triple {6368#(<= 0 (+ 128 base2flt_~e))} assume ~m % 4294967296 >= 33554432; {6368#(<= 0 (+ 128 base2flt_~e))} is VALID [2022-02-21 03:09:51,410 INFO L290 TraceCheckUtils]: 15: Hoare triple {6368#(<= 0 (+ 128 base2flt_~e))} assume !(~e >= 127); {6368#(<= 0 (+ 128 base2flt_~e))} is VALID [2022-02-21 03:09:51,410 INFO L290 TraceCheckUtils]: 16: Hoare triple {6368#(<= 0 (+ 128 base2flt_~e))} assume 1 + ~e <= 2147483647; {6368#(<= 0 (+ 128 base2flt_~e))} is VALID [2022-02-21 03:09:51,411 INFO L290 TraceCheckUtils]: 17: Hoare triple {6368#(<= 0 (+ 128 base2flt_~e))} assume !(1 + ~e >= -2147483648); {6360#false} is VALID [2022-02-21 03:09:51,411 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:09:51,411 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:09:51,411 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445551172] [2022-02-21 03:09:51,411 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [445551172] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:09:51,411 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [959157785] [2022-02-21 03:09:51,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:09:51,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:09:51,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:09:51,413 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:09:51,421 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:09:51,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:09:51,455 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 03:09:51,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:09:51,465 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:09:51,535 INFO L290 TraceCheckUtils]: 0: Hoare triple {6359#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(24, 2);call #Ultimate.allocInit(12, 3); {6359#true} is VALID [2022-02-21 03:09:51,536 INFO L290 TraceCheckUtils]: 1: Hoare triple {6359#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_~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_add~0#1, main_~zero~0#1, main_~sa~0#1, main_~sb~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~tmp___1~0#1, main_~tmp___2~0#1, main_~tmp___3~0#1, main_~tmp___4~0#1, main_~tmp___5~0#1, main_~tmp___6~0#1, main_~tmp___7~0#1, main_~tmp___8~0#1, main_~tmp___9~0#1, main_~__retres23~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_add~0#1;havoc main_~zero~0#1;havoc main_~sa~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_~tmp___2~0#1;havoc main_~tmp___3~0#1;havoc main_~tmp___4~0#1;havoc main_~tmp___5~0#1;havoc main_~tmp___6~0#1;havoc main_~tmp___7~0#1;havoc main_~tmp___8~0#1;havoc main_~tmp___9~0#1;havoc main_~__retres23~0#1; {6361#(<= 0 (+ |ULTIMATE.start_main_~ea~2#1| 128))} is VALID [2022-02-21 03:09:51,536 INFO L272 TraceCheckUtils]: 2: Hoare triple {6361#(<= 0 (+ |ULTIMATE.start_main_~ea~2#1| 128))} call main_#t~ret22#1 := base2flt(0, 0); {6359#true} is VALID [2022-02-21 03:09:51,536 INFO L290 TraceCheckUtils]: 3: Hoare triple {6359#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {6359#true} is VALID [2022-02-21 03:09:51,536 INFO L290 TraceCheckUtils]: 4: Hoare triple {6359#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {6359#true} is VALID [2022-02-21 03:09:51,536 INFO L290 TraceCheckUtils]: 5: Hoare triple {6359#true} #res := ~__retres4~0; {6359#true} is VALID [2022-02-21 03:09:51,536 INFO L290 TraceCheckUtils]: 6: Hoare triple {6359#true} assume true; {6359#true} is VALID [2022-02-21 03:09:51,537 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {6359#true} {6361#(<= 0 (+ |ULTIMATE.start_main_~ea~2#1| 128))} #453#return; {6361#(<= 0 (+ |ULTIMATE.start_main_~ea~2#1| 128))} is VALID [2022-02-21 03:09:51,537 INFO L290 TraceCheckUtils]: 8: Hoare triple {6361#(<= 0 (+ |ULTIMATE.start_main_~ea~2#1| 128))} main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1; {6361#(<= 0 (+ |ULTIMATE.start_main_~ea~2#1| 128))} is VALID [2022-02-21 03:09:51,538 INFO L272 TraceCheckUtils]: 9: Hoare triple {6361#(<= 0 (+ |ULTIMATE.start_main_~ea~2#1| 128))} call main_#t~ret23#1 := base2flt(main_~ma~2#1, main_~ea~2#1); {6367#(<= 0 (+ 128 |base2flt_#in~e|))} is VALID [2022-02-21 03:09:51,538 INFO L290 TraceCheckUtils]: 10: Hoare triple {6367#(<= 0 (+ 128 |base2flt_#in~e|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {6368#(<= 0 (+ 128 base2flt_~e))} is VALID [2022-02-21 03:09:51,539 INFO L290 TraceCheckUtils]: 11: Hoare triple {6368#(<= 0 (+ 128 base2flt_~e))} assume !(0 == ~m % 4294967296); {6368#(<= 0 (+ 128 base2flt_~e))} is VALID [2022-02-21 03:09:51,541 INFO L290 TraceCheckUtils]: 12: Hoare triple {6368#(<= 0 (+ 128 base2flt_~e))} assume !(~m % 4294967296 < 16777216); {6368#(<= 0 (+ 128 base2flt_~e))} is VALID [2022-02-21 03:09:51,541 INFO L290 TraceCheckUtils]: 13: Hoare triple {6368#(<= 0 (+ 128 base2flt_~e))} assume !false; {6368#(<= 0 (+ 128 base2flt_~e))} is VALID [2022-02-21 03:09:51,541 INFO L290 TraceCheckUtils]: 14: Hoare triple {6368#(<= 0 (+ 128 base2flt_~e))} assume ~m % 4294967296 >= 33554432; {6368#(<= 0 (+ 128 base2flt_~e))} is VALID [2022-02-21 03:09:51,542 INFO L290 TraceCheckUtils]: 15: Hoare triple {6368#(<= 0 (+ 128 base2flt_~e))} assume !(~e >= 127); {6368#(<= 0 (+ 128 base2flt_~e))} is VALID [2022-02-21 03:09:51,542 INFO L290 TraceCheckUtils]: 16: Hoare triple {6368#(<= 0 (+ 128 base2flt_~e))} assume 1 + ~e <= 2147483647; {6368#(<= 0 (+ 128 base2flt_~e))} is VALID [2022-02-21 03:09:51,543 INFO L290 TraceCheckUtils]: 17: Hoare triple {6368#(<= 0 (+ 128 base2flt_~e))} assume !(1 + ~e >= -2147483648); {6360#false} is VALID [2022-02-21 03:09:51,543 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:09:51,543 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-21 03:09:51,543 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [959157785] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:09:51,543 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-21 03:09:51,543 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2022-02-21 03:09:51,543 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975400431] [2022-02-21 03:09:51,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:09:51,544 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (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 18 [2022-02-21 03:09:51,544 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:09:51,544 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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:09:51,554 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:09:51,554 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-21 03:09:51,554 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:09:51,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-21 03:09:51,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-21 03:09:51,555 INFO L87 Difference]: Start difference. First operand 193 states and 265 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (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:09:51,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:09:51,886 INFO L93 Difference]: Finished difference Result 236 states and 319 transitions. [2022-02-21 03:09:51,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-21 03:09:51,887 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (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 18 [2022-02-21 03:09:51,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:09:51,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (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:09:51,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 213 transitions. [2022-02-21 03:09:51,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (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:09:51,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 213 transitions. [2022-02-21 03:09:51,890 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 213 transitions. [2022-02-21 03:09:52,023 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 213 edges. 213 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:09:52,027 INFO L225 Difference]: With dead ends: 236 [2022-02-21 03:09:52,027 INFO L226 Difference]: Without dead ends: 233 [2022-02-21 03:09:52,027 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 20 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:09:52,028 INFO L933 BasicCegarLoop]: 111 mSDtfsCounter, 174 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 380 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-21 03:09:52,028 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [179 Valid, 380 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-21 03:09:52,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2022-02-21 03:09:52,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 201. [2022-02-21 03:09:52,070 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:09:52,071 INFO L82 GeneralOperation]: Start isEquivalent. First operand 233 states. Second operand has 201 states, 176 states have (on average 1.5113636363636365) internal successors, (266), 191 states have internal predecessors, (266), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-21 03:09:52,071 INFO L74 IsIncluded]: Start isIncluded. First operand 233 states. Second operand has 201 states, 176 states have (on average 1.5113636363636365) internal successors, (266), 191 states have internal predecessors, (266), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-21 03:09:52,072 INFO L87 Difference]: Start difference. First operand 233 states. Second operand has 201 states, 176 states have (on average 1.5113636363636365) internal successors, (266), 191 states have internal predecessors, (266), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-21 03:09:52,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:09:52,076 INFO L93 Difference]: Finished difference Result 233 states and 316 transitions. [2022-02-21 03:09:52,076 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 316 transitions. [2022-02-21 03:09:52,076 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:09:52,076 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:09:52,078 INFO L74 IsIncluded]: Start isIncluded. First operand has 201 states, 176 states have (on average 1.5113636363636365) internal successors, (266), 191 states have internal predecessors, (266), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 233 states. [2022-02-21 03:09:52,078 INFO L87 Difference]: Start difference. First operand has 201 states, 176 states have (on average 1.5113636363636365) internal successors, (266), 191 states have internal predecessors, (266), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 233 states. [2022-02-21 03:09:52,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:09:52,082 INFO L93 Difference]: Finished difference Result 233 states and 316 transitions. [2022-02-21 03:09:52,082 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 316 transitions. [2022-02-21 03:09:52,083 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:09:52,083 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:09:52,083 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:09:52,083 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:09:52,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 176 states have (on average 1.5113636363636365) internal successors, (266), 191 states have internal predecessors, (266), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-21 03:09:52,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 276 transitions. [2022-02-21 03:09:52,087 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 276 transitions. Word has length 18 [2022-02-21 03:09:52,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:09:52,087 INFO L470 AbstractCegarLoop]: Abstraction has 201 states and 276 transitions. [2022-02-21 03:09:52,087 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (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:09:52,087 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 276 transitions. [2022-02-21 03:09:52,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-02-21 03:09:52,088 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:09:52,088 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:09:52,107 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:09:52,305 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:09:52,306 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-02-21 03:09:52,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:09:52,306 INFO L85 PathProgramCache]: Analyzing trace with hash -738180446, now seen corresponding path program 1 times [2022-02-21 03:09:52,306 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:09:52,306 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519712374] [2022-02-21 03:09:52,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:09:52,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:09:52,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:09:52,347 INFO L290 TraceCheckUtils]: 0: Hoare triple {7390#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(24, 2);call #Ultimate.allocInit(12, 3); {7390#true} is VALID [2022-02-21 03:09:52,348 INFO L290 TraceCheckUtils]: 1: Hoare triple {7390#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_~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_add~0#1, main_~zero~0#1, main_~sa~0#1, main_~sb~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~tmp___1~0#1, main_~tmp___2~0#1, main_~tmp___3~0#1, main_~tmp___4~0#1, main_~tmp___5~0#1, main_~tmp___6~0#1, main_~tmp___7~0#1, main_~tmp___8~0#1, main_~tmp___9~0#1, main_~__retres23~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_add~0#1;havoc main_~zero~0#1;havoc main_~sa~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_~tmp___2~0#1;havoc main_~tmp___3~0#1;havoc main_~tmp___4~0#1;havoc main_~tmp___5~0#1;havoc main_~tmp___6~0#1;havoc main_~tmp___7~0#1;havoc main_~tmp___8~0#1;havoc main_~tmp___9~0#1;havoc main_~__retres23~0#1; {7390#true} is VALID [2022-02-21 03:09:52,348 INFO L272 TraceCheckUtils]: 2: Hoare triple {7390#true} call main_#t~ret22#1 := base2flt(0, 0); {7390#true} is VALID [2022-02-21 03:09:52,348 INFO L290 TraceCheckUtils]: 3: Hoare triple {7390#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {7390#true} is VALID [2022-02-21 03:09:52,348 INFO L290 TraceCheckUtils]: 4: Hoare triple {7390#true} assume !(0 == ~m % 4294967296); {7390#true} is VALID [2022-02-21 03:09:52,348 INFO L290 TraceCheckUtils]: 5: Hoare triple {7390#true} assume ~m % 4294967296 < 16777216; {7390#true} is VALID [2022-02-21 03:09:52,348 INFO L290 TraceCheckUtils]: 6: Hoare triple {7390#true} assume !false; {7390#true} is VALID [2022-02-21 03:09:52,348 INFO L290 TraceCheckUtils]: 7: Hoare triple {7390#true} assume !(~e <= -128); {7390#true} is VALID [2022-02-21 03:09:52,348 INFO L290 TraceCheckUtils]: 8: Hoare triple {7390#true} assume ~e - 1 <= 2147483647; {7390#true} is VALID [2022-02-21 03:09:52,348 INFO L290 TraceCheckUtils]: 9: Hoare triple {7390#true} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {7390#true} is VALID [2022-02-21 03:09:52,348 INFO L290 TraceCheckUtils]: 10: Hoare triple {7390#true} assume ~m % 4294967296 < 16777216; {7390#true} is VALID [2022-02-21 03:09:52,349 INFO L290 TraceCheckUtils]: 11: Hoare triple {7390#true} assume !false; {7390#true} is VALID [2022-02-21 03:09:52,349 INFO L290 TraceCheckUtils]: 12: Hoare triple {7390#true} assume !(~e <= -128); {7392#(<= 0 (+ base2flt_~e 127))} is VALID [2022-02-21 03:09:52,349 INFO L290 TraceCheckUtils]: 13: Hoare triple {7392#(<= 0 (+ base2flt_~e 127))} assume ~e - 1 <= 2147483647; {7392#(<= 0 (+ base2flt_~e 127))} is VALID [2022-02-21 03:09:52,350 INFO L290 TraceCheckUtils]: 14: Hoare triple {7392#(<= 0 (+ base2flt_~e 127))} assume ~e - 1 >= -2147483648;~e := ~e - 1;~m := 2 * ~m; {7393#(<= 0 (+ 128 base2flt_~e))} is VALID [2022-02-21 03:09:52,350 INFO L290 TraceCheckUtils]: 15: Hoare triple {7393#(<= 0 (+ 128 base2flt_~e))} assume !(~m % 4294967296 < 16777216); {7393#(<= 0 (+ 128 base2flt_~e))} is VALID [2022-02-21 03:09:52,350 INFO L290 TraceCheckUtils]: 16: Hoare triple {7393#(<= 0 (+ 128 base2flt_~e))} assume 0 == ~m || 0 == ~bitwiseComplement(16777216);~m := 0; {7393#(<= 0 (+ 128 base2flt_~e))} is VALID [2022-02-21 03:09:52,351 INFO L290 TraceCheckUtils]: 17: Hoare triple {7393#(<= 0 (+ 128 base2flt_~e))} assume 128 + ~e <= 2147483647; {7393#(<= 0 (+ 128 base2flt_~e))} is VALID [2022-02-21 03:09:52,351 INFO L290 TraceCheckUtils]: 18: Hoare triple {7393#(<= 0 (+ 128 base2flt_~e))} assume !(128 + ~e >= -2147483648); {7391#false} is VALID [2022-02-21 03:09:52,351 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-21 03:09:52,352 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:09:52,352 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519712374] [2022-02-21 03:09:52,352 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [519712374] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:09:52,352 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:09:52,352 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 03:09:52,352 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952621092] [2022-02-21 03:09:52,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:09:52,352 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-02-21 03:09:52,352 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:09:52,352 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, (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:09:52,362 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:09:52,362 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-21 03:09:52,362 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:09:52,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-21 03:09:52,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-02-21 03:09:52,362 INFO L87 Difference]: Start difference. First operand 201 states and 276 transitions. Second operand has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:09:52,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:09:52,638 INFO L93 Difference]: Finished difference Result 256 states and 352 transitions. [2022-02-21 03:09:52,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-21 03:09:52,638 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-02-21 03:09:52,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:09:52,639 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, (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:09:52,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 172 transitions. [2022-02-21 03:09:52,640 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, (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:09:52,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 172 transitions. [2022-02-21 03:09:52,641 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 172 transitions. [2022-02-21 03:09:52,744 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 172 edges. 172 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:09:52,748 INFO L225 Difference]: With dead ends: 256 [2022-02-21 03:09:52,748 INFO L226 Difference]: Without dead ends: 254 [2022-02-21 03:09:52,749 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-02-21 03:09:52,749 INFO L933 BasicCegarLoop]: 145 mSDtfsCounter, 24 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 374 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:09:52,749 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 374 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:09:52,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2022-02-21 03:09:52,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 201. [2022-02-21 03:09:52,786 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:09:52,786 INFO L82 GeneralOperation]: Start isEquivalent. First operand 254 states. Second operand has 201 states, 176 states have (on average 1.5) internal successors, (264), 191 states have internal predecessors, (264), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-21 03:09:52,787 INFO L74 IsIncluded]: Start isIncluded. First operand 254 states. Second operand has 201 states, 176 states have (on average 1.5) internal successors, (264), 191 states have internal predecessors, (264), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-21 03:09:52,787 INFO L87 Difference]: Start difference. First operand 254 states. Second operand has 201 states, 176 states have (on average 1.5) internal successors, (264), 191 states have internal predecessors, (264), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-21 03:09:52,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:09:52,791 INFO L93 Difference]: Finished difference Result 254 states and 346 transitions. [2022-02-21 03:09:52,791 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 346 transitions. [2022-02-21 03:09:52,792 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:09:52,792 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:09:52,792 INFO L74 IsIncluded]: Start isIncluded. First operand has 201 states, 176 states have (on average 1.5) internal successors, (264), 191 states have internal predecessors, (264), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 254 states. [2022-02-21 03:09:52,793 INFO L87 Difference]: Start difference. First operand has 201 states, 176 states have (on average 1.5) internal successors, (264), 191 states have internal predecessors, (264), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 254 states. [2022-02-21 03:09:52,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:09:52,797 INFO L93 Difference]: Finished difference Result 254 states and 346 transitions. [2022-02-21 03:09:52,797 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 346 transitions. [2022-02-21 03:09:52,797 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:09:52,797 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:09:52,798 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:09:52,798 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:09:52,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 176 states have (on average 1.5) internal successors, (264), 191 states have internal predecessors, (264), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-21 03:09:52,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 274 transitions. [2022-02-21 03:09:52,801 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 274 transitions. Word has length 19 [2022-02-21 03:09:52,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:09:52,801 INFO L470 AbstractCegarLoop]: Abstraction has 201 states and 274 transitions. [2022-02-21 03:09:52,802 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, (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:09:52,802 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 274 transitions. [2022-02-21 03:09:52,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-02-21 03:09:52,802 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:09:52,802 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:09:52,803 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-02-21 03:09:52,803 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-02-21 03:09:52,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:09:52,803 INFO L85 PathProgramCache]: Analyzing trace with hash 894698226, now seen corresponding path program 1 times [2022-02-21 03:09:52,803 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:09:52,803 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560422064] [2022-02-21 03:09:52,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:09:52,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:09:52,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:09:52,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-21 03:09:52,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:09:52,839 INFO L290 TraceCheckUtils]: 0: Hoare triple {8442#(and (= abs_77 |old(abs_77)|) (= abs_78 |old(abs_78)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {8427#true} is VALID [2022-02-21 03:09:52,840 INFO L290 TraceCheckUtils]: 1: Hoare triple {8427#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {8427#true} is VALID [2022-02-21 03:09:52,840 INFO L290 TraceCheckUtils]: 2: Hoare triple {8427#true} #res := ~__retres4~0; {8427#true} is VALID [2022-02-21 03:09:52,840 INFO L290 TraceCheckUtils]: 3: Hoare triple {8427#true} assume true; {8427#true} is VALID [2022-02-21 03:09:52,841 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {8427#true} {8429#(<= |ULTIMATE.start_main_~eb~2#1| 127)} #453#return; {8429#(<= |ULTIMATE.start_main_~eb~2#1| 127)} is VALID [2022-02-21 03:09:52,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-02-21 03:09:52,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:09:52,845 INFO L290 TraceCheckUtils]: 0: Hoare triple {8442#(and (= abs_77 |old(abs_77)|) (= abs_78 |old(abs_78)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {8427#true} is VALID [2022-02-21 03:09:52,845 INFO L290 TraceCheckUtils]: 1: Hoare triple {8427#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {8427#true} is VALID [2022-02-21 03:09:52,846 INFO L290 TraceCheckUtils]: 2: Hoare triple {8427#true} #res := ~__retres4~0; {8427#true} is VALID [2022-02-21 03:09:52,846 INFO L290 TraceCheckUtils]: 3: Hoare triple {8427#true} assume true; {8427#true} is VALID [2022-02-21 03:09:52,846 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {8427#true} {8429#(<= |ULTIMATE.start_main_~eb~2#1| 127)} #455#return; {8429#(<= |ULTIMATE.start_main_~eb~2#1| 127)} is VALID [2022-02-21 03:09:52,847 INFO L290 TraceCheckUtils]: 0: Hoare triple {8427#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(24, 2);call #Ultimate.allocInit(12, 3); {8427#true} is VALID [2022-02-21 03:09:52,847 INFO L290 TraceCheckUtils]: 1: Hoare triple {8427#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_~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_add~0#1, main_~zero~0#1, main_~sa~0#1, main_~sb~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~tmp___1~0#1, main_~tmp___2~0#1, main_~tmp___3~0#1, main_~tmp___4~0#1, main_~tmp___5~0#1, main_~tmp___6~0#1, main_~tmp___7~0#1, main_~tmp___8~0#1, main_~tmp___9~0#1, main_~__retres23~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_add~0#1;havoc main_~zero~0#1;havoc main_~sa~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_~tmp___2~0#1;havoc main_~tmp___3~0#1;havoc main_~tmp___4~0#1;havoc main_~tmp___5~0#1;havoc main_~tmp___6~0#1;havoc main_~tmp___7~0#1;havoc main_~tmp___8~0#1;havoc main_~tmp___9~0#1;havoc main_~__retres23~0#1; {8429#(<= |ULTIMATE.start_main_~eb~2#1| 127)} is VALID [2022-02-21 03:09:52,847 INFO L272 TraceCheckUtils]: 2: Hoare triple {8429#(<= |ULTIMATE.start_main_~eb~2#1| 127)} call main_#t~ret22#1 := base2flt(0, 0); {8442#(and (= abs_77 |old(abs_77)|) (= abs_78 |old(abs_78)|))} is VALID [2022-02-21 03:09:52,848 INFO L290 TraceCheckUtils]: 3: Hoare triple {8442#(and (= abs_77 |old(abs_77)|) (= abs_78 |old(abs_78)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {8427#true} is VALID [2022-02-21 03:09:52,848 INFO L290 TraceCheckUtils]: 4: Hoare triple {8427#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {8427#true} is VALID [2022-02-21 03:09:52,848 INFO L290 TraceCheckUtils]: 5: Hoare triple {8427#true} #res := ~__retres4~0; {8427#true} is VALID [2022-02-21 03:09:52,848 INFO L290 TraceCheckUtils]: 6: Hoare triple {8427#true} assume true; {8427#true} is VALID [2022-02-21 03:09:52,848 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {8427#true} {8429#(<= |ULTIMATE.start_main_~eb~2#1| 127)} #453#return; {8429#(<= |ULTIMATE.start_main_~eb~2#1| 127)} is VALID [2022-02-21 03:09:52,849 INFO L290 TraceCheckUtils]: 8: Hoare triple {8429#(<= |ULTIMATE.start_main_~eb~2#1| 127)} main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1; {8429#(<= |ULTIMATE.start_main_~eb~2#1| 127)} is VALID [2022-02-21 03:09:52,849 INFO L272 TraceCheckUtils]: 9: Hoare triple {8429#(<= |ULTIMATE.start_main_~eb~2#1| 127)} call main_#t~ret23#1 := base2flt(main_~ma~2#1, main_~ea~2#1); {8442#(and (= abs_77 |old(abs_77)|) (= abs_78 |old(abs_78)|))} is VALID [2022-02-21 03:09:52,849 INFO L290 TraceCheckUtils]: 10: Hoare triple {8442#(and (= abs_77 |old(abs_77)|) (= abs_78 |old(abs_78)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {8427#true} is VALID [2022-02-21 03:09:52,850 INFO L290 TraceCheckUtils]: 11: Hoare triple {8427#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {8427#true} is VALID [2022-02-21 03:09:52,850 INFO L290 TraceCheckUtils]: 12: Hoare triple {8427#true} #res := ~__retres4~0; {8427#true} is VALID [2022-02-21 03:09:52,850 INFO L290 TraceCheckUtils]: 13: Hoare triple {8427#true} assume true; {8427#true} is VALID [2022-02-21 03:09:52,850 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {8427#true} {8429#(<= |ULTIMATE.start_main_~eb~2#1| 127)} #455#return; {8429#(<= |ULTIMATE.start_main_~eb~2#1| 127)} is VALID [2022-02-21 03:09:52,851 INFO L290 TraceCheckUtils]: 15: Hoare triple {8429#(<= |ULTIMATE.start_main_~eb~2#1| 127)} main_~a~0#1 := main_#t~ret23#1;havoc main_#t~ret23#1; {8429#(<= |ULTIMATE.start_main_~eb~2#1| 127)} is VALID [2022-02-21 03:09:52,851 INFO L272 TraceCheckUtils]: 16: Hoare triple {8429#(<= |ULTIMATE.start_main_~eb~2#1| 127)} call main_#t~ret24#1 := base2flt(main_~mb~2#1, main_~eb~2#1); {8440#(<= |base2flt_#in~e| 127)} is VALID [2022-02-21 03:09:52,852 INFO L290 TraceCheckUtils]: 17: Hoare triple {8440#(<= |base2flt_#in~e| 127)} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {8441#(<= base2flt_~e 127)} is VALID [2022-02-21 03:09:52,852 INFO L290 TraceCheckUtils]: 18: Hoare triple {8441#(<= base2flt_~e 127)} assume !(0 == ~m % 4294967296); {8441#(<= base2flt_~e 127)} is VALID [2022-02-21 03:09:52,852 INFO L290 TraceCheckUtils]: 19: Hoare triple {8441#(<= base2flt_~e 127)} assume ~m % 4294967296 < 16777216; {8441#(<= base2flt_~e 127)} is VALID [2022-02-21 03:09:52,852 INFO L290 TraceCheckUtils]: 20: Hoare triple {8441#(<= base2flt_~e 127)} assume !false; {8441#(<= base2flt_~e 127)} is VALID [2022-02-21 03:09:52,853 INFO L290 TraceCheckUtils]: 21: Hoare triple {8441#(<= base2flt_~e 127)} assume !(~e <= -128); {8441#(<= base2flt_~e 127)} is VALID [2022-02-21 03:09:52,853 INFO L290 TraceCheckUtils]: 22: Hoare triple {8441#(<= base2flt_~e 127)} assume !(~e - 1 <= 2147483647); {8428#false} is VALID [2022-02-21 03:09:52,853 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-02-21 03:09:52,853 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:09:52,853 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560422064] [2022-02-21 03:09:52,854 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [560422064] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:09:52,854 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [411405318] [2022-02-21 03:09:52,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:09:52,854 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:09:52,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:09:52,855 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:09:52,856 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:09:52,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:09:52,895 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 03:09:52,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:09:52,902 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:09:52,967 INFO L290 TraceCheckUtils]: 0: Hoare triple {8427#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(24, 2);call #Ultimate.allocInit(12, 3); {8427#true} is VALID [2022-02-21 03:09:52,967 INFO L290 TraceCheckUtils]: 1: Hoare triple {8427#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_~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_add~0#1, main_~zero~0#1, main_~sa~0#1, main_~sb~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~tmp___1~0#1, main_~tmp___2~0#1, main_~tmp___3~0#1, main_~tmp___4~0#1, main_~tmp___5~0#1, main_~tmp___6~0#1, main_~tmp___7~0#1, main_~tmp___8~0#1, main_~tmp___9~0#1, main_~__retres23~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_add~0#1;havoc main_~zero~0#1;havoc main_~sa~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_~tmp___2~0#1;havoc main_~tmp___3~0#1;havoc main_~tmp___4~0#1;havoc main_~tmp___5~0#1;havoc main_~tmp___6~0#1;havoc main_~tmp___7~0#1;havoc main_~tmp___8~0#1;havoc main_~tmp___9~0#1;havoc main_~__retres23~0#1; {8429#(<= |ULTIMATE.start_main_~eb~2#1| 127)} is VALID [2022-02-21 03:09:52,967 INFO L272 TraceCheckUtils]: 2: Hoare triple {8429#(<= |ULTIMATE.start_main_~eb~2#1| 127)} call main_#t~ret22#1 := base2flt(0, 0); {8427#true} is VALID [2022-02-21 03:09:52,967 INFO L290 TraceCheckUtils]: 3: Hoare triple {8427#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {8427#true} is VALID [2022-02-21 03:09:52,967 INFO L290 TraceCheckUtils]: 4: Hoare triple {8427#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {8427#true} is VALID [2022-02-21 03:09:52,968 INFO L290 TraceCheckUtils]: 5: Hoare triple {8427#true} #res := ~__retres4~0; {8427#true} is VALID [2022-02-21 03:09:52,968 INFO L290 TraceCheckUtils]: 6: Hoare triple {8427#true} assume true; {8427#true} is VALID [2022-02-21 03:09:52,968 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {8427#true} {8429#(<= |ULTIMATE.start_main_~eb~2#1| 127)} #453#return; {8429#(<= |ULTIMATE.start_main_~eb~2#1| 127)} is VALID [2022-02-21 03:09:52,969 INFO L290 TraceCheckUtils]: 8: Hoare triple {8429#(<= |ULTIMATE.start_main_~eb~2#1| 127)} main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1; {8429#(<= |ULTIMATE.start_main_~eb~2#1| 127)} is VALID [2022-02-21 03:09:52,969 INFO L272 TraceCheckUtils]: 9: Hoare triple {8429#(<= |ULTIMATE.start_main_~eb~2#1| 127)} call main_#t~ret23#1 := base2flt(main_~ma~2#1, main_~ea~2#1); {8427#true} is VALID [2022-02-21 03:09:52,969 INFO L290 TraceCheckUtils]: 10: Hoare triple {8427#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {8427#true} is VALID [2022-02-21 03:09:52,969 INFO L290 TraceCheckUtils]: 11: Hoare triple {8427#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {8427#true} is VALID [2022-02-21 03:09:52,969 INFO L290 TraceCheckUtils]: 12: Hoare triple {8427#true} #res := ~__retres4~0; {8427#true} is VALID [2022-02-21 03:09:52,969 INFO L290 TraceCheckUtils]: 13: Hoare triple {8427#true} assume true; {8427#true} is VALID [2022-02-21 03:09:52,972 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {8427#true} {8429#(<= |ULTIMATE.start_main_~eb~2#1| 127)} #455#return; {8429#(<= |ULTIMATE.start_main_~eb~2#1| 127)} is VALID [2022-02-21 03:09:52,972 INFO L290 TraceCheckUtils]: 15: Hoare triple {8429#(<= |ULTIMATE.start_main_~eb~2#1| 127)} main_~a~0#1 := main_#t~ret23#1;havoc main_#t~ret23#1; {8429#(<= |ULTIMATE.start_main_~eb~2#1| 127)} is VALID [2022-02-21 03:09:52,973 INFO L272 TraceCheckUtils]: 16: Hoare triple {8429#(<= |ULTIMATE.start_main_~eb~2#1| 127)} call main_#t~ret24#1 := base2flt(main_~mb~2#1, main_~eb~2#1); {8440#(<= |base2flt_#in~e| 127)} is VALID [2022-02-21 03:09:52,973 INFO L290 TraceCheckUtils]: 17: Hoare triple {8440#(<= |base2flt_#in~e| 127)} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {8441#(<= base2flt_~e 127)} is VALID [2022-02-21 03:09:52,973 INFO L290 TraceCheckUtils]: 18: Hoare triple {8441#(<= base2flt_~e 127)} assume !(0 == ~m % 4294967296); {8441#(<= base2flt_~e 127)} is VALID [2022-02-21 03:09:52,973 INFO L290 TraceCheckUtils]: 19: Hoare triple {8441#(<= base2flt_~e 127)} assume ~m % 4294967296 < 16777216; {8441#(<= base2flt_~e 127)} is VALID [2022-02-21 03:09:52,974 INFO L290 TraceCheckUtils]: 20: Hoare triple {8441#(<= base2flt_~e 127)} assume !false; {8441#(<= base2flt_~e 127)} is VALID [2022-02-21 03:09:52,974 INFO L290 TraceCheckUtils]: 21: Hoare triple {8441#(<= base2flt_~e 127)} assume !(~e <= -128); {8441#(<= base2flt_~e 127)} is VALID [2022-02-21 03:09:52,974 INFO L290 TraceCheckUtils]: 22: Hoare triple {8441#(<= base2flt_~e 127)} assume !(~e - 1 <= 2147483647); {8428#false} is VALID [2022-02-21 03:09:52,975 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-02-21 03:09:52,975 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-21 03:09:52,975 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [411405318] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:09:52,975 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-21 03:09:52,975 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2022-02-21 03:09:52,975 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766794727] [2022-02-21 03:09:52,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:09:52,976 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (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 23 [2022-02-21 03:09:52,976 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:09:52,976 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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:09:52,987 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:09:52,988 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-21 03:09:52,988 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:09:52,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-21 03:09:52,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-21 03:09:52,988 INFO L87 Difference]: Start difference. First operand 201 states and 274 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (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:09:53,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:09:53,311 INFO L93 Difference]: Finished difference Result 231 states and 315 transitions. [2022-02-21 03:09:53,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-21 03:09:53,311 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (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 23 [2022-02-21 03:09:53,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:09:53,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (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:09:53,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 212 transitions. [2022-02-21 03:09:53,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (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:09:53,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 212 transitions. [2022-02-21 03:09:53,315 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 212 transitions. [2022-02-21 03:09:53,447 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 212 edges. 212 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:09:53,450 INFO L225 Difference]: With dead ends: 231 [2022-02-21 03:09:53,450 INFO L226 Difference]: Without dead ends: 228 [2022-02-21 03:09:53,450 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 27 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:09:53,451 INFO L933 BasicCegarLoop]: 111 mSDtfsCounter, 179 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:09:53,451 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [183 Valid, 377 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:09:53,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2022-02-21 03:09:53,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 189. [2022-02-21 03:09:53,495 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:09:53,496 INFO L82 GeneralOperation]: Start isEquivalent. First operand 228 states. Second operand has 189 states, 167 states have (on average 1.4610778443113772) internal successors, (244), 179 states have internal predecessors, (244), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-21 03:09:53,496 INFO L74 IsIncluded]: Start isIncluded. First operand 228 states. Second operand has 189 states, 167 states have (on average 1.4610778443113772) internal successors, (244), 179 states have internal predecessors, (244), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-21 03:09:53,497 INFO L87 Difference]: Start difference. First operand 228 states. Second operand has 189 states, 167 states have (on average 1.4610778443113772) internal successors, (244), 179 states have internal predecessors, (244), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-21 03:09:53,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:09:53,501 INFO L93 Difference]: Finished difference Result 228 states and 310 transitions. [2022-02-21 03:09:53,501 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 310 transitions. [2022-02-21 03:09:53,501 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:09:53,501 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:09:53,502 INFO L74 IsIncluded]: Start isIncluded. First operand has 189 states, 167 states have (on average 1.4610778443113772) internal successors, (244), 179 states have internal predecessors, (244), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 228 states. [2022-02-21 03:09:53,502 INFO L87 Difference]: Start difference. First operand has 189 states, 167 states have (on average 1.4610778443113772) internal successors, (244), 179 states have internal predecessors, (244), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 228 states. [2022-02-21 03:09:53,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:09:53,506 INFO L93 Difference]: Finished difference Result 228 states and 310 transitions. [2022-02-21 03:09:53,506 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 310 transitions. [2022-02-21 03:09:53,506 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:09:53,506 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:09:53,507 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:09:53,507 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:09:53,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 167 states have (on average 1.4610778443113772) internal successors, (244), 179 states have internal predecessors, (244), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-21 03:09:53,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 254 transitions. [2022-02-21 03:09:53,510 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 254 transitions. Word has length 23 [2022-02-21 03:09:53,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:09:53,510 INFO L470 AbstractCegarLoop]: Abstraction has 189 states and 254 transitions. [2022-02-21 03:09:53,511 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (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:09:53,511 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 254 transitions. [2022-02-21 03:09:53,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-02-21 03:09:53,511 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:09:53,511 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] [2022-02-21 03:09:53,533 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:09:53,734 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-02-21 03:09:53,734 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting base2fltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-02-21 03:09:53,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:09:53,735 INFO L85 PathProgramCache]: Analyzing trace with hash 1698985882, now seen corresponding path program 1 times [2022-02-21 03:09:53,735 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:09:53,735 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703566396] [2022-02-21 03:09:53,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:09:53,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:09:53,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:09:53,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-21 03:09:53,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:09:53,774 INFO L290 TraceCheckUtils]: 0: Hoare triple {9463#(and (= abs_77 |old(abs_77)|) (= abs_78 |old(abs_78)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {9448#true} is VALID [2022-02-21 03:09:53,775 INFO L290 TraceCheckUtils]: 1: Hoare triple {9448#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {9448#true} is VALID [2022-02-21 03:09:53,775 INFO L290 TraceCheckUtils]: 2: Hoare triple {9448#true} #res := ~__retres4~0; {9448#true} is VALID [2022-02-21 03:09:53,775 INFO L290 TraceCheckUtils]: 3: Hoare triple {9448#true} assume true; {9448#true} is VALID [2022-02-21 03:09:53,775 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {9448#true} {9450#(<= 0 (+ |ULTIMATE.start_main_~eb~2#1| 128))} #453#return; {9450#(<= 0 (+ |ULTIMATE.start_main_~eb~2#1| 128))} is VALID [2022-02-21 03:09:53,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-02-21 03:09:53,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:09:53,780 INFO L290 TraceCheckUtils]: 0: Hoare triple {9463#(and (= abs_77 |old(abs_77)|) (= abs_78 |old(abs_78)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {9448#true} is VALID [2022-02-21 03:09:53,780 INFO L290 TraceCheckUtils]: 1: Hoare triple {9448#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {9448#true} is VALID [2022-02-21 03:09:53,780 INFO L290 TraceCheckUtils]: 2: Hoare triple {9448#true} #res := ~__retres4~0; {9448#true} is VALID [2022-02-21 03:09:53,780 INFO L290 TraceCheckUtils]: 3: Hoare triple {9448#true} assume true; {9448#true} is VALID [2022-02-21 03:09:53,781 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {9448#true} {9450#(<= 0 (+ |ULTIMATE.start_main_~eb~2#1| 128))} #455#return; {9450#(<= 0 (+ |ULTIMATE.start_main_~eb~2#1| 128))} is VALID [2022-02-21 03:09:53,781 INFO L290 TraceCheckUtils]: 0: Hoare triple {9448#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(24, 2);call #Ultimate.allocInit(12, 3); {9448#true} is VALID [2022-02-21 03:09:53,782 INFO L290 TraceCheckUtils]: 1: Hoare triple {9448#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_~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_add~0#1, main_~zero~0#1, main_~sa~0#1, main_~sb~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~tmp___1~0#1, main_~tmp___2~0#1, main_~tmp___3~0#1, main_~tmp___4~0#1, main_~tmp___5~0#1, main_~tmp___6~0#1, main_~tmp___7~0#1, main_~tmp___8~0#1, main_~tmp___9~0#1, main_~__retres23~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_add~0#1;havoc main_~zero~0#1;havoc main_~sa~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_~tmp___2~0#1;havoc main_~tmp___3~0#1;havoc main_~tmp___4~0#1;havoc main_~tmp___5~0#1;havoc main_~tmp___6~0#1;havoc main_~tmp___7~0#1;havoc main_~tmp___8~0#1;havoc main_~tmp___9~0#1;havoc main_~__retres23~0#1; {9450#(<= 0 (+ |ULTIMATE.start_main_~eb~2#1| 128))} is VALID [2022-02-21 03:09:53,782 INFO L272 TraceCheckUtils]: 2: Hoare triple {9450#(<= 0 (+ |ULTIMATE.start_main_~eb~2#1| 128))} call main_#t~ret22#1 := base2flt(0, 0); {9463#(and (= abs_77 |old(abs_77)|) (= abs_78 |old(abs_78)|))} is VALID [2022-02-21 03:09:53,782 INFO L290 TraceCheckUtils]: 3: Hoare triple {9463#(and (= abs_77 |old(abs_77)|) (= abs_78 |old(abs_78)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {9448#true} is VALID [2022-02-21 03:09:53,782 INFO L290 TraceCheckUtils]: 4: Hoare triple {9448#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {9448#true} is VALID [2022-02-21 03:09:53,783 INFO L290 TraceCheckUtils]: 5: Hoare triple {9448#true} #res := ~__retres4~0; {9448#true} is VALID [2022-02-21 03:09:53,783 INFO L290 TraceCheckUtils]: 6: Hoare triple {9448#true} assume true; {9448#true} is VALID [2022-02-21 03:09:53,783 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {9448#true} {9450#(<= 0 (+ |ULTIMATE.start_main_~eb~2#1| 128))} #453#return; {9450#(<= 0 (+ |ULTIMATE.start_main_~eb~2#1| 128))} is VALID [2022-02-21 03:09:53,784 INFO L290 TraceCheckUtils]: 8: Hoare triple {9450#(<= 0 (+ |ULTIMATE.start_main_~eb~2#1| 128))} main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1; {9450#(<= 0 (+ |ULTIMATE.start_main_~eb~2#1| 128))} is VALID [2022-02-21 03:09:53,784 INFO L272 TraceCheckUtils]: 9: Hoare triple {9450#(<= 0 (+ |ULTIMATE.start_main_~eb~2#1| 128))} call main_#t~ret23#1 := base2flt(main_~ma~2#1, main_~ea~2#1); {9463#(and (= abs_77 |old(abs_77)|) (= abs_78 |old(abs_78)|))} is VALID [2022-02-21 03:09:53,784 INFO L290 TraceCheckUtils]: 10: Hoare triple {9463#(and (= abs_77 |old(abs_77)|) (= abs_78 |old(abs_78)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {9448#true} is VALID [2022-02-21 03:09:53,785 INFO L290 TraceCheckUtils]: 11: Hoare triple {9448#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {9448#true} is VALID [2022-02-21 03:09:53,785 INFO L290 TraceCheckUtils]: 12: Hoare triple {9448#true} #res := ~__retres4~0; {9448#true} is VALID [2022-02-21 03:09:53,785 INFO L290 TraceCheckUtils]: 13: Hoare triple {9448#true} assume true; {9448#true} is VALID [2022-02-21 03:09:53,785 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {9448#true} {9450#(<= 0 (+ |ULTIMATE.start_main_~eb~2#1| 128))} #455#return; {9450#(<= 0 (+ |ULTIMATE.start_main_~eb~2#1| 128))} is VALID [2022-02-21 03:09:53,786 INFO L290 TraceCheckUtils]: 15: Hoare triple {9450#(<= 0 (+ |ULTIMATE.start_main_~eb~2#1| 128))} main_~a~0#1 := main_#t~ret23#1;havoc main_#t~ret23#1; {9450#(<= 0 (+ |ULTIMATE.start_main_~eb~2#1| 128))} is VALID [2022-02-21 03:09:53,786 INFO L272 TraceCheckUtils]: 16: Hoare triple {9450#(<= 0 (+ |ULTIMATE.start_main_~eb~2#1| 128))} call main_#t~ret24#1 := base2flt(main_~mb~2#1, main_~eb~2#1); {9461#(<= 0 (+ 128 |base2flt_#in~e|))} is VALID [2022-02-21 03:09:53,787 INFO L290 TraceCheckUtils]: 17: Hoare triple {9461#(<= 0 (+ 128 |base2flt_#in~e|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {9462#(<= 0 (+ 128 base2flt_~e))} is VALID [2022-02-21 03:09:53,787 INFO L290 TraceCheckUtils]: 18: Hoare triple {9462#(<= 0 (+ 128 base2flt_~e))} assume !(0 == ~m % 4294967296); {9462#(<= 0 (+ 128 base2flt_~e))} is VALID [2022-02-21 03:09:53,787 INFO L290 TraceCheckUtils]: 19: Hoare triple {9462#(<= 0 (+ 128 base2flt_~e))} assume !(~m % 4294967296 < 16777216); {9462#(<= 0 (+ 128 base2flt_~e))} is VALID [2022-02-21 03:09:53,788 INFO L290 TraceCheckUtils]: 20: Hoare triple {9462#(<= 0 (+ 128 base2flt_~e))} assume !false; {9462#(<= 0 (+ 128 base2flt_~e))} is VALID [2022-02-21 03:09:53,788 INFO L290 TraceCheckUtils]: 21: Hoare triple {9462#(<= 0 (+ 128 base2flt_~e))} assume ~m % 4294967296 >= 33554432; {9462#(<= 0 (+ 128 base2flt_~e))} is VALID [2022-02-21 03:09:53,788 INFO L290 TraceCheckUtils]: 22: Hoare triple {9462#(<= 0 (+ 128 base2flt_~e))} assume !(~e >= 127); {9462#(<= 0 (+ 128 base2flt_~e))} is VALID [2022-02-21 03:09:53,789 INFO L290 TraceCheckUtils]: 23: Hoare triple {9462#(<= 0 (+ 128 base2flt_~e))} assume 1 + ~e <= 2147483647; {9462#(<= 0 (+ 128 base2flt_~e))} is VALID [2022-02-21 03:09:53,789 INFO L290 TraceCheckUtils]: 24: Hoare triple {9462#(<= 0 (+ 128 base2flt_~e))} assume !(1 + ~e >= -2147483648); {9449#false} is VALID [2022-02-21 03:09:53,789 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-02-21 03:09:53,789 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:09:53,790 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703566396] [2022-02-21 03:09:53,790 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [703566396] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:09:53,790 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1679507537] [2022-02-21 03:09:53,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:09:53,790 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:09:53,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:09:53,791 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:09:53,792 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:09:53,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:09:53,829 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 03:09:53,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:09:53,839 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:09:53,929 INFO L290 TraceCheckUtils]: 0: Hoare triple {9448#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(24, 2);call #Ultimate.allocInit(12, 3); {9448#true} is VALID [2022-02-21 03:09:53,930 INFO L290 TraceCheckUtils]: 1: Hoare triple {9448#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_~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_add~0#1, main_~zero~0#1, main_~sa~0#1, main_~sb~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~tmp___1~0#1, main_~tmp___2~0#1, main_~tmp___3~0#1, main_~tmp___4~0#1, main_~tmp___5~0#1, main_~tmp___6~0#1, main_~tmp___7~0#1, main_~tmp___8~0#1, main_~tmp___9~0#1, main_~__retres23~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_add~0#1;havoc main_~zero~0#1;havoc main_~sa~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_~tmp___2~0#1;havoc main_~tmp___3~0#1;havoc main_~tmp___4~0#1;havoc main_~tmp___5~0#1;havoc main_~tmp___6~0#1;havoc main_~tmp___7~0#1;havoc main_~tmp___8~0#1;havoc main_~tmp___9~0#1;havoc main_~__retres23~0#1; {9450#(<= 0 (+ |ULTIMATE.start_main_~eb~2#1| 128))} is VALID [2022-02-21 03:09:53,930 INFO L272 TraceCheckUtils]: 2: Hoare triple {9450#(<= 0 (+ |ULTIMATE.start_main_~eb~2#1| 128))} call main_#t~ret22#1 := base2flt(0, 0); {9448#true} is VALID [2022-02-21 03:09:53,931 INFO L290 TraceCheckUtils]: 3: Hoare triple {9448#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {9448#true} is VALID [2022-02-21 03:09:53,931 INFO L290 TraceCheckUtils]: 4: Hoare triple {9448#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {9448#true} is VALID [2022-02-21 03:09:53,931 INFO L290 TraceCheckUtils]: 5: Hoare triple {9448#true} #res := ~__retres4~0; {9448#true} is VALID [2022-02-21 03:09:53,931 INFO L290 TraceCheckUtils]: 6: Hoare triple {9448#true} assume true; {9448#true} is VALID [2022-02-21 03:09:53,932 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {9448#true} {9450#(<= 0 (+ |ULTIMATE.start_main_~eb~2#1| 128))} #453#return; {9450#(<= 0 (+ |ULTIMATE.start_main_~eb~2#1| 128))} is VALID [2022-02-21 03:09:53,932 INFO L290 TraceCheckUtils]: 8: Hoare triple {9450#(<= 0 (+ |ULTIMATE.start_main_~eb~2#1| 128))} main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1; {9450#(<= 0 (+ |ULTIMATE.start_main_~eb~2#1| 128))} is VALID [2022-02-21 03:09:53,932 INFO L272 TraceCheckUtils]: 9: Hoare triple {9450#(<= 0 (+ |ULTIMATE.start_main_~eb~2#1| 128))} call main_#t~ret23#1 := base2flt(main_~ma~2#1, main_~ea~2#1); {9448#true} is VALID [2022-02-21 03:09:53,933 INFO L290 TraceCheckUtils]: 10: Hoare triple {9448#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {9448#true} is VALID [2022-02-21 03:09:53,933 INFO L290 TraceCheckUtils]: 11: Hoare triple {9448#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {9448#true} is VALID [2022-02-21 03:09:53,933 INFO L290 TraceCheckUtils]: 12: Hoare triple {9448#true} #res := ~__retres4~0; {9448#true} is VALID [2022-02-21 03:09:53,933 INFO L290 TraceCheckUtils]: 13: Hoare triple {9448#true} assume true; {9448#true} is VALID [2022-02-21 03:09:53,934 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {9448#true} {9450#(<= 0 (+ |ULTIMATE.start_main_~eb~2#1| 128))} #455#return; {9450#(<= 0 (+ |ULTIMATE.start_main_~eb~2#1| 128))} is VALID [2022-02-21 03:09:53,934 INFO L290 TraceCheckUtils]: 15: Hoare triple {9450#(<= 0 (+ |ULTIMATE.start_main_~eb~2#1| 128))} main_~a~0#1 := main_#t~ret23#1;havoc main_#t~ret23#1; {9450#(<= 0 (+ |ULTIMATE.start_main_~eb~2#1| 128))} is VALID [2022-02-21 03:09:53,934 INFO L272 TraceCheckUtils]: 16: Hoare triple {9450#(<= 0 (+ |ULTIMATE.start_main_~eb~2#1| 128))} call main_#t~ret24#1 := base2flt(main_~mb~2#1, main_~eb~2#1); {9461#(<= 0 (+ 128 |base2flt_#in~e|))} is VALID [2022-02-21 03:09:53,935 INFO L290 TraceCheckUtils]: 17: Hoare triple {9461#(<= 0 (+ 128 |base2flt_#in~e|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {9462#(<= 0 (+ 128 base2flt_~e))} is VALID [2022-02-21 03:09:53,935 INFO L290 TraceCheckUtils]: 18: Hoare triple {9462#(<= 0 (+ 128 base2flt_~e))} assume !(0 == ~m % 4294967296); {9462#(<= 0 (+ 128 base2flt_~e))} is VALID [2022-02-21 03:09:53,935 INFO L290 TraceCheckUtils]: 19: Hoare triple {9462#(<= 0 (+ 128 base2flt_~e))} assume !(~m % 4294967296 < 16777216); {9462#(<= 0 (+ 128 base2flt_~e))} is VALID [2022-02-21 03:09:53,936 INFO L290 TraceCheckUtils]: 20: Hoare triple {9462#(<= 0 (+ 128 base2flt_~e))} assume !false; {9462#(<= 0 (+ 128 base2flt_~e))} is VALID [2022-02-21 03:09:53,936 INFO L290 TraceCheckUtils]: 21: Hoare triple {9462#(<= 0 (+ 128 base2flt_~e))} assume ~m % 4294967296 >= 33554432; {9462#(<= 0 (+ 128 base2flt_~e))} is VALID [2022-02-21 03:09:53,936 INFO L290 TraceCheckUtils]: 22: Hoare triple {9462#(<= 0 (+ 128 base2flt_~e))} assume !(~e >= 127); {9462#(<= 0 (+ 128 base2flt_~e))} is VALID [2022-02-21 03:09:53,937 INFO L290 TraceCheckUtils]: 23: Hoare triple {9462#(<= 0 (+ 128 base2flt_~e))} assume 1 + ~e <= 2147483647; {9462#(<= 0 (+ 128 base2flt_~e))} is VALID [2022-02-21 03:09:53,937 INFO L290 TraceCheckUtils]: 24: Hoare triple {9462#(<= 0 (+ 128 base2flt_~e))} assume !(1 + ~e >= -2147483648); {9449#false} is VALID [2022-02-21 03:09:53,937 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-02-21 03:09:53,937 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-21 03:09:53,938 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1679507537] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:09:53,938 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-21 03:09:53,938 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2022-02-21 03:09:53,938 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813467347] [2022-02-21 03:09:53,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:09:53,938 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (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 25 [2022-02-21 03:09:53,939 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:09:53,939 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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:09:53,951 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:09:53,951 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-21 03:09:53,951 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:09:53,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-21 03:09:53,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-21 03:09:53,952 INFO L87 Difference]: Start difference. First operand 189 states and 254 transitions. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (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:09:54,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:09:54,303 INFO L93 Difference]: Finished difference Result 219 states and 294 transitions. [2022-02-21 03:09:54,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-21 03:09:54,303 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (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 25 [2022-02-21 03:09:54,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:09:54,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (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:09:54,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 205 transitions. [2022-02-21 03:09:54,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (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:09:54,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 205 transitions. [2022-02-21 03:09:54,307 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 205 transitions. [2022-02-21 03:09:54,443 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 205 edges. 205 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:09:54,446 INFO L225 Difference]: With dead ends: 219 [2022-02-21 03:09:54,447 INFO L226 Difference]: Without dead ends: 216 [2022-02-21 03:09:54,447 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 29 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:09:54,447 INFO L933 BasicCegarLoop]: 114 mSDtfsCounter, 163 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 383 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:09:54,448 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [167 Valid, 383 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:09:54,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2022-02-21 03:09:54,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 178. [2022-02-21 03:09:54,513 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:09:54,513 INFO L82 GeneralOperation]: Start isEquivalent. First operand 216 states. Second operand has 178 states, 159 states have (on average 1.440251572327044) internal successors, (229), 168 states have internal predecessors, (229), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-21 03:09:54,514 INFO L74 IsIncluded]: Start isIncluded. First operand 216 states. Second operand has 178 states, 159 states have (on average 1.440251572327044) internal successors, (229), 168 states have internal predecessors, (229), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-21 03:09:54,514 INFO L87 Difference]: Start difference. First operand 216 states. Second operand has 178 states, 159 states have (on average 1.440251572327044) internal successors, (229), 168 states have internal predecessors, (229), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-21 03:09:54,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:09:54,521 INFO L93 Difference]: Finished difference Result 216 states and 291 transitions. [2022-02-21 03:09:54,521 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 291 transitions. [2022-02-21 03:09:54,521 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:09:54,521 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:09:54,522 INFO L74 IsIncluded]: Start isIncluded. First operand has 178 states, 159 states have (on average 1.440251572327044) internal successors, (229), 168 states have internal predecessors, (229), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 216 states. [2022-02-21 03:09:54,524 INFO L87 Difference]: Start difference. First operand has 178 states, 159 states have (on average 1.440251572327044) internal successors, (229), 168 states have internal predecessors, (229), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 216 states. [2022-02-21 03:09:54,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:09:54,528 INFO L93 Difference]: Finished difference Result 216 states and 291 transitions. [2022-02-21 03:09:54,528 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 291 transitions. [2022-02-21 03:09:54,529 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:09:54,529 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:09:54,529 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:09:54,529 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:09:54,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 159 states have (on average 1.440251572327044) internal successors, (229), 168 states have internal predecessors, (229), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-21 03:09:54,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 239 transitions. [2022-02-21 03:09:54,533 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 239 transitions. Word has length 25 [2022-02-21 03:09:54,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:09:54,533 INFO L470 AbstractCegarLoop]: Abstraction has 178 states and 239 transitions. [2022-02-21 03:09:54,533 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (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:09:54,533 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 239 transitions. [2022-02-21 03:09:54,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-02-21 03:09:54,534 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:09:54,534 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:09:54,553 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:09:54,751 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:09:54,751 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-02-21 03:09:54,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:09:54,751 INFO L85 PathProgramCache]: Analyzing trace with hash 1113378165, now seen corresponding path program 1 times [2022-02-21 03:09:54,751 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:09:54,751 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851146810] [2022-02-21 03:09:54,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:09:54,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:09:54,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:09:54,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-21 03:09:54,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:09:54,832 INFO L290 TraceCheckUtils]: 0: Hoare triple {10446#(and (= abs_77 |old(abs_77)|) (= abs_78 |old(abs_78)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {10426#true} is VALID [2022-02-21 03:09:54,832 INFO L290 TraceCheckUtils]: 1: Hoare triple {10426#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {10426#true} is VALID [2022-02-21 03:09:54,832 INFO L290 TraceCheckUtils]: 2: Hoare triple {10426#true} #res := ~__retres4~0; {10426#true} is VALID [2022-02-21 03:09:54,833 INFO L290 TraceCheckUtils]: 3: Hoare triple {10426#true} assume true; {10426#true} is VALID [2022-02-21 03:09:54,833 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {10426#true} {10426#true} #453#return; {10426#true} is VALID [2022-02-21 03:09:54,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-02-21 03:09:54,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:09:54,837 INFO L290 TraceCheckUtils]: 0: Hoare triple {10446#(and (= abs_77 |old(abs_77)|) (= abs_78 |old(abs_78)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {10426#true} is VALID [2022-02-21 03:09:54,837 INFO L290 TraceCheckUtils]: 1: Hoare triple {10426#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {10426#true} is VALID [2022-02-21 03:09:54,841 INFO L290 TraceCheckUtils]: 2: Hoare triple {10426#true} #res := ~__retres4~0; {10426#true} is VALID [2022-02-21 03:09:54,842 INFO L290 TraceCheckUtils]: 3: Hoare triple {10426#true} assume true; {10426#true} is VALID [2022-02-21 03:09:54,842 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {10426#true} {10426#true} #455#return; {10426#true} is VALID [2022-02-21 03:09:54,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-02-21 03:09:54,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:09:54,883 INFO L290 TraceCheckUtils]: 0: Hoare triple {10446#(and (= abs_77 |old(abs_77)|) (= abs_78 |old(abs_78)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {10426#true} is VALID [2022-02-21 03:09:54,884 INFO L290 TraceCheckUtils]: 1: Hoare triple {10426#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {10447#(and (<= base2flt_~__retres4~0 0) (<= 0 base2flt_~__retres4~0))} is VALID [2022-02-21 03:09:54,884 INFO L290 TraceCheckUtils]: 2: Hoare triple {10447#(and (<= base2flt_~__retres4~0 0) (<= 0 base2flt_~__retres4~0))} #res := ~__retres4~0; {10448#(and (<= |base2flt_#res| 0) (<= 0 |base2flt_#res|))} is VALID [2022-02-21 03:09:54,885 INFO L290 TraceCheckUtils]: 3: Hoare triple {10448#(and (<= |base2flt_#res| 0) (<= 0 |base2flt_#res|))} assume true; {10448#(and (<= |base2flt_#res| 0) (<= 0 |base2flt_#res|))} is VALID [2022-02-21 03:09:54,886 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {10448#(and (<= |base2flt_#res| 0) (<= 0 |base2flt_#res|))} {10426#true} #457#return; {10443#(= |ULTIMATE.start_main_#t~ret24#1| 0)} is VALID [2022-02-21 03:09:54,886 INFO L290 TraceCheckUtils]: 0: Hoare triple {10426#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(24, 2);call #Ultimate.allocInit(12, 3); {10426#true} is VALID [2022-02-21 03:09:54,886 INFO L290 TraceCheckUtils]: 1: Hoare triple {10426#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_~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_add~0#1, main_~zero~0#1, main_~sa~0#1, main_~sb~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~tmp___1~0#1, main_~tmp___2~0#1, main_~tmp___3~0#1, main_~tmp___4~0#1, main_~tmp___5~0#1, main_~tmp___6~0#1, main_~tmp___7~0#1, main_~tmp___8~0#1, main_~tmp___9~0#1, main_~__retres23~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_add~0#1;havoc main_~zero~0#1;havoc main_~sa~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_~tmp___2~0#1;havoc main_~tmp___3~0#1;havoc main_~tmp___4~0#1;havoc main_~tmp___5~0#1;havoc main_~tmp___6~0#1;havoc main_~tmp___7~0#1;havoc main_~tmp___8~0#1;havoc main_~tmp___9~0#1;havoc main_~__retres23~0#1; {10426#true} is VALID [2022-02-21 03:09:54,887 INFO L272 TraceCheckUtils]: 2: Hoare triple {10426#true} call main_#t~ret22#1 := base2flt(0, 0); {10446#(and (= abs_77 |old(abs_77)|) (= abs_78 |old(abs_78)|))} is VALID [2022-02-21 03:09:54,887 INFO L290 TraceCheckUtils]: 3: Hoare triple {10446#(and (= abs_77 |old(abs_77)|) (= abs_78 |old(abs_78)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {10426#true} is VALID [2022-02-21 03:09:54,887 INFO L290 TraceCheckUtils]: 4: Hoare triple {10426#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {10426#true} is VALID [2022-02-21 03:09:54,887 INFO L290 TraceCheckUtils]: 5: Hoare triple {10426#true} #res := ~__retres4~0; {10426#true} is VALID [2022-02-21 03:09:54,887 INFO L290 TraceCheckUtils]: 6: Hoare triple {10426#true} assume true; {10426#true} is VALID [2022-02-21 03:09:54,887 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {10426#true} {10426#true} #453#return; {10426#true} is VALID [2022-02-21 03:09:54,887 INFO L290 TraceCheckUtils]: 8: Hoare triple {10426#true} main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1; {10426#true} is VALID [2022-02-21 03:09:54,888 INFO L272 TraceCheckUtils]: 9: Hoare triple {10426#true} call main_#t~ret23#1 := base2flt(main_~ma~2#1, main_~ea~2#1); {10446#(and (= abs_77 |old(abs_77)|) (= abs_78 |old(abs_78)|))} is VALID [2022-02-21 03:09:54,888 INFO L290 TraceCheckUtils]: 10: Hoare triple {10446#(and (= abs_77 |old(abs_77)|) (= abs_78 |old(abs_78)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {10426#true} is VALID [2022-02-21 03:09:54,888 INFO L290 TraceCheckUtils]: 11: Hoare triple {10426#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {10426#true} is VALID [2022-02-21 03:09:54,888 INFO L290 TraceCheckUtils]: 12: Hoare triple {10426#true} #res := ~__retres4~0; {10426#true} is VALID [2022-02-21 03:09:54,889 INFO L290 TraceCheckUtils]: 13: Hoare triple {10426#true} assume true; {10426#true} is VALID [2022-02-21 03:09:54,889 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {10426#true} {10426#true} #455#return; {10426#true} is VALID [2022-02-21 03:09:54,889 INFO L290 TraceCheckUtils]: 15: Hoare triple {10426#true} main_~a~0#1 := main_#t~ret23#1;havoc main_#t~ret23#1; {10426#true} is VALID [2022-02-21 03:09:54,890 INFO L272 TraceCheckUtils]: 16: Hoare triple {10426#true} call main_#t~ret24#1 := base2flt(main_~mb~2#1, main_~eb~2#1); {10446#(and (= abs_77 |old(abs_77)|) (= abs_78 |old(abs_78)|))} is VALID [2022-02-21 03:09:54,890 INFO L290 TraceCheckUtils]: 17: Hoare triple {10446#(and (= abs_77 |old(abs_77)|) (= abs_78 |old(abs_78)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {10426#true} is VALID [2022-02-21 03:09:54,890 INFO L290 TraceCheckUtils]: 18: Hoare triple {10426#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {10447#(and (<= base2flt_~__retres4~0 0) (<= 0 base2flt_~__retres4~0))} is VALID [2022-02-21 03:09:54,891 INFO L290 TraceCheckUtils]: 19: Hoare triple {10447#(and (<= base2flt_~__retres4~0 0) (<= 0 base2flt_~__retres4~0))} #res := ~__retres4~0; {10448#(and (<= |base2flt_#res| 0) (<= 0 |base2flt_#res|))} is VALID [2022-02-21 03:09:54,891 INFO L290 TraceCheckUtils]: 20: Hoare triple {10448#(and (<= |base2flt_#res| 0) (<= 0 |base2flt_#res|))} assume true; {10448#(and (<= |base2flt_#res| 0) (<= 0 |base2flt_#res|))} is VALID [2022-02-21 03:09:54,892 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {10448#(and (<= |base2flt_#res| 0) (<= 0 |base2flt_#res|))} {10426#true} #457#return; {10443#(= |ULTIMATE.start_main_#t~ret24#1| 0)} is VALID [2022-02-21 03:09:54,892 INFO L290 TraceCheckUtils]: 22: Hoare triple {10443#(= |ULTIMATE.start_main_#t~ret24#1| 0)} main_~b~0#1 := main_#t~ret24#1;havoc main_#t~ret24#1; {10444#(= |ULTIMATE.start_main_~b~0#1| 0)} is VALID [2022-02-21 03:09:54,892 INFO L290 TraceCheckUtils]: 23: Hoare triple {10444#(= |ULTIMATE.start_main_~b~0#1| 0)} assume main_~a~0#1 % 4294967296 < main_~zero~0#1 % 4294967296;main_~sa~0#1 := -1; {10444#(= |ULTIMATE.start_main_~b~0#1| 0)} is VALID [2022-02-21 03:09:54,893 INFO L290 TraceCheckUtils]: 24: Hoare triple {10444#(= |ULTIMATE.start_main_~b~0#1| 0)} assume main_~b~0#1 % 4294967296 < main_~zero~0#1 % 4294967296;main_~sb~0#1 := -1; {10444#(= |ULTIMATE.start_main_~b~0#1| 0)} is VALID [2022-02-21 03:09:54,893 INFO L290 TraceCheckUtils]: 25: Hoare triple {10444#(= |ULTIMATE.start_main_~b~0#1| 0)} assume { :begin_inline_addflt } true;addflt_#in~a#1, addflt_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc addflt_#res#1;havoc addflt_#t~nondet6#1, addflt_#t~nondet7#1, addflt_#t~nondet8#1, addflt_#t~nondet9#1, addflt_#t~nondet10#1, addflt_#t~nondet11#1, addflt_~a#1, addflt_~b#1, addflt_~res~1#1, addflt_~ma~0#1, addflt_~mb~0#1, addflt_~delta~0#1, addflt_~ea~0#1, addflt_~eb~0#1, addflt_~tmp~0#1, addflt_~__retres10~0#1;addflt_~a#1 := addflt_#in~a#1;addflt_~b#1 := addflt_#in~b#1;havoc addflt_~res~1#1;havoc addflt_~ma~0#1;havoc addflt_~mb~0#1;havoc addflt_~delta~0#1;havoc addflt_~ea~0#1;havoc addflt_~eb~0#1;havoc addflt_~tmp~0#1;havoc addflt_~__retres10~0#1; {10445#(= |ULTIMATE.start_addflt_~b#1| 0)} is VALID [2022-02-21 03:09:54,893 INFO L290 TraceCheckUtils]: 26: Hoare triple {10445#(= |ULTIMATE.start_addflt_~b#1| 0)} assume !(addflt_~a#1 % 4294967296 < addflt_~b#1 % 4294967296); {10445#(= |ULTIMATE.start_addflt_~b#1| 0)} is VALID [2022-02-21 03:09:54,894 INFO L290 TraceCheckUtils]: 27: Hoare triple {10445#(= |ULTIMATE.start_addflt_~b#1| 0)} assume !(0 == addflt_~b#1 % 4294967296); {10427#false} is VALID [2022-02-21 03:09:54,894 INFO L290 TraceCheckUtils]: 28: Hoare triple {10427#false} assume 0 == addflt_~a#1;addflt_~ma~0#1 := 0; {10427#false} is VALID [2022-02-21 03:09:54,898 INFO L290 TraceCheckUtils]: 29: Hoare triple {10427#false} assume (if addflt_~a#1 / 16777216 % 4294967296 % 4294967296 <= 2147483647 then addflt_~a#1 / 16777216 % 4294967296 % 4294967296 else addflt_~a#1 / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 <= 2147483647; {10427#false} is VALID [2022-02-21 03:09:54,898 INFO L290 TraceCheckUtils]: 30: Hoare triple {10427#false} assume !((if addflt_~a#1 / 16777216 % 4294967296 % 4294967296 <= 2147483647 then addflt_~a#1 / 16777216 % 4294967296 % 4294967296 else addflt_~a#1 / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 >= -2147483648); {10427#false} is VALID [2022-02-21 03:09:54,899 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-02-21 03:09:54,899 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:09:54,899 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851146810] [2022-02-21 03:09:54,899 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851146810] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:09:54,899 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:09:54,899 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-21 03:09:54,900 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019371966] [2022-02-21 03:09:54,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:09:54,900 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 31 [2022-02-21 03:09:54,900 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:09:54,900 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.5) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-21 03:09:54,916 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:09:54,916 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-21 03:09:54,916 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:09:54,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-21 03:09:54,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-02-21 03:09:54,917 INFO L87 Difference]: Start difference. First operand 178 states and 239 transitions. Second operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-21 03:09:55,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:09:55,496 INFO L93 Difference]: Finished difference Result 330 states and 422 transitions. [2022-02-21 03:09:55,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-21 03:09:55,498 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 31 [2022-02-21 03:09:55,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:09:55,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-21 03:09:55,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 270 transitions. [2022-02-21 03:09:55,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-21 03:09:55,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 270 transitions. [2022-02-21 03:09:55,504 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 270 transitions. [2022-02-21 03:09:55,677 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 270 edges. 270 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:09:55,681 INFO L225 Difference]: With dead ends: 330 [2022-02-21 03:09:55,681 INFO L226 Difference]: Without dead ends: 260 [2022-02-21 03:09:55,681 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-02-21 03:09:55,682 INFO L933 BasicCegarLoop]: 122 mSDtfsCounter, 89 mSDsluCounter, 639 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 761 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-21 03:09:55,682 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [91 Valid, 761 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-21 03:09:55,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2022-02-21 03:09:55,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 180. [2022-02-21 03:09:55,745 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:09:55,746 INFO L82 GeneralOperation]: Start isEquivalent. First operand 260 states. Second operand has 180 states, 161 states have (on average 1.4223602484472049) internal successors, (229), 170 states have internal predecessors, (229), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-21 03:09:55,746 INFO L74 IsIncluded]: Start isIncluded. First operand 260 states. Second operand has 180 states, 161 states have (on average 1.4223602484472049) internal successors, (229), 170 states have internal predecessors, (229), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-21 03:09:55,747 INFO L87 Difference]: Start difference. First operand 260 states. Second operand has 180 states, 161 states have (on average 1.4223602484472049) internal successors, (229), 170 states have internal predecessors, (229), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-21 03:09:55,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:09:55,751 INFO L93 Difference]: Finished difference Result 260 states and 335 transitions. [2022-02-21 03:09:55,751 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 335 transitions. [2022-02-21 03:09:55,752 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:09:55,752 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:09:55,752 INFO L74 IsIncluded]: Start isIncluded. First operand has 180 states, 161 states have (on average 1.4223602484472049) internal successors, (229), 170 states have internal predecessors, (229), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 260 states. [2022-02-21 03:09:55,753 INFO L87 Difference]: Start difference. First operand has 180 states, 161 states have (on average 1.4223602484472049) internal successors, (229), 170 states have internal predecessors, (229), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 260 states. [2022-02-21 03:09:55,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:09:55,758 INFO L93 Difference]: Finished difference Result 260 states and 335 transitions. [2022-02-21 03:09:55,758 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 335 transitions. [2022-02-21 03:09:55,759 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:09:55,759 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:09:55,759 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:09:55,760 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:09:55,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 161 states have (on average 1.4223602484472049) internal successors, (229), 170 states have internal predecessors, (229), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-21 03:09:55,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 239 transitions. [2022-02-21 03:09:55,764 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 239 transitions. Word has length 31 [2022-02-21 03:09:55,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:09:55,764 INFO L470 AbstractCegarLoop]: Abstraction has 180 states and 239 transitions. [2022-02-21 03:09:55,764 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 6 states have internal predecessors, (20), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-21 03:09:55,764 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 239 transitions. [2022-02-21 03:09:55,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-02-21 03:09:55,768 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:09:55,768 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 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] [2022-02-21 03:09:55,768 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-02-21 03:09:55,768 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-02-21 03:09:55,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:09:55,769 INFO L85 PathProgramCache]: Analyzing trace with hash -2056125210, now seen corresponding path program 1 times [2022-02-21 03:09:55,769 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:09:55,769 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818858077] [2022-02-21 03:09:55,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:09:55,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:09:55,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:09:55,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-21 03:09:55,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:09:55,876 INFO L290 TraceCheckUtils]: 0: Hoare triple {11572#(and (= abs_77 |old(abs_77)|) (= abs_78 |old(abs_78)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {11549#true} is VALID [2022-02-21 03:09:55,881 INFO L290 TraceCheckUtils]: 1: Hoare triple {11549#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {11573#(and (<= base2flt_~__retres4~0 0) (<= 0 base2flt_~__retres4~0))} is VALID [2022-02-21 03:09:55,883 INFO L290 TraceCheckUtils]: 2: Hoare triple {11573#(and (<= base2flt_~__retres4~0 0) (<= 0 base2flt_~__retres4~0))} #res := ~__retres4~0; {11574#(and (<= |base2flt_#res| 0) (<= 0 |base2flt_#res|))} is VALID [2022-02-21 03:09:55,884 INFO L290 TraceCheckUtils]: 3: Hoare triple {11574#(and (<= |base2flt_#res| 0) (<= 0 |base2flt_#res|))} assume true; {11574#(and (<= |base2flt_#res| 0) (<= 0 |base2flt_#res|))} is VALID [2022-02-21 03:09:55,885 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {11574#(and (<= |base2flt_#res| 0) (<= 0 |base2flt_#res|))} {11549#true} #453#return; {11556#(= |ULTIMATE.start_main_#t~ret22#1| 0)} is VALID [2022-02-21 03:09:55,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-02-21 03:09:55,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:09:55,897 INFO L290 TraceCheckUtils]: 0: Hoare triple {11572#(and (= abs_77 |old(abs_77)|) (= abs_78 |old(abs_78)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {11549#true} is VALID [2022-02-21 03:09:55,898 INFO L290 TraceCheckUtils]: 1: Hoare triple {11549#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {11549#true} is VALID [2022-02-21 03:09:55,898 INFO L290 TraceCheckUtils]: 2: Hoare triple {11549#true} #res := ~__retres4~0; {11549#true} is VALID [2022-02-21 03:09:55,898 INFO L290 TraceCheckUtils]: 3: Hoare triple {11549#true} assume true; {11549#true} is VALID [2022-02-21 03:09:55,899 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {11549#true} {11557#(= |ULTIMATE.start_main_~zero~0#1| 0)} #455#return; {11557#(= |ULTIMATE.start_main_~zero~0#1| 0)} is VALID [2022-02-21 03:09:55,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-02-21 03:09:55,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:09:55,906 INFO L290 TraceCheckUtils]: 0: Hoare triple {11572#(and (= abs_77 |old(abs_77)|) (= abs_78 |old(abs_78)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {11549#true} is VALID [2022-02-21 03:09:55,906 INFO L290 TraceCheckUtils]: 1: Hoare triple {11549#true} assume !(0 == ~m % 4294967296); {11549#true} is VALID [2022-02-21 03:09:55,907 INFO L290 TraceCheckUtils]: 2: Hoare triple {11549#true} assume !(~m % 4294967296 < 16777216); {11549#true} is VALID [2022-02-21 03:09:55,907 INFO L290 TraceCheckUtils]: 3: Hoare triple {11549#true} assume !false; {11549#true} is VALID [2022-02-21 03:09:55,907 INFO L290 TraceCheckUtils]: 4: Hoare triple {11549#true} assume ~m % 4294967296 >= 33554432; {11549#true} is VALID [2022-02-21 03:09:55,907 INFO L290 TraceCheckUtils]: 5: Hoare triple {11549#true} assume ~e >= 127;~__retres4~0 := 4294967295; {11549#true} is VALID [2022-02-21 03:09:55,907 INFO L290 TraceCheckUtils]: 6: Hoare triple {11549#true} #res := ~__retres4~0; {11549#true} is VALID [2022-02-21 03:09:55,907 INFO L290 TraceCheckUtils]: 7: Hoare triple {11549#true} assume true; {11549#true} is VALID [2022-02-21 03:09:55,908 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {11549#true} {11557#(= |ULTIMATE.start_main_~zero~0#1| 0)} #457#return; {11557#(= |ULTIMATE.start_main_~zero~0#1| 0)} is VALID [2022-02-21 03:09:55,908 INFO L290 TraceCheckUtils]: 0: Hoare triple {11549#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(24, 2);call #Ultimate.allocInit(12, 3); {11549#true} is VALID [2022-02-21 03:09:55,908 INFO L290 TraceCheckUtils]: 1: Hoare triple {11549#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_~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_add~0#1, main_~zero~0#1, main_~sa~0#1, main_~sb~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~tmp___1~0#1, main_~tmp___2~0#1, main_~tmp___3~0#1, main_~tmp___4~0#1, main_~tmp___5~0#1, main_~tmp___6~0#1, main_~tmp___7~0#1, main_~tmp___8~0#1, main_~tmp___9~0#1, main_~__retres23~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_add~0#1;havoc main_~zero~0#1;havoc main_~sa~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_~tmp___2~0#1;havoc main_~tmp___3~0#1;havoc main_~tmp___4~0#1;havoc main_~tmp___5~0#1;havoc main_~tmp___6~0#1;havoc main_~tmp___7~0#1;havoc main_~tmp___8~0#1;havoc main_~tmp___9~0#1;havoc main_~__retres23~0#1; {11549#true} is VALID [2022-02-21 03:09:55,909 INFO L272 TraceCheckUtils]: 2: Hoare triple {11549#true} call main_#t~ret22#1 := base2flt(0, 0); {11572#(and (= abs_77 |old(abs_77)|) (= abs_78 |old(abs_78)|))} is VALID [2022-02-21 03:09:55,909 INFO L290 TraceCheckUtils]: 3: Hoare triple {11572#(and (= abs_77 |old(abs_77)|) (= abs_78 |old(abs_78)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {11549#true} is VALID [2022-02-21 03:09:55,909 INFO L290 TraceCheckUtils]: 4: Hoare triple {11549#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {11573#(and (<= base2flt_~__retres4~0 0) (<= 0 base2flt_~__retres4~0))} is VALID [2022-02-21 03:09:55,910 INFO L290 TraceCheckUtils]: 5: Hoare triple {11573#(and (<= base2flt_~__retres4~0 0) (<= 0 base2flt_~__retres4~0))} #res := ~__retres4~0; {11574#(and (<= |base2flt_#res| 0) (<= 0 |base2flt_#res|))} is VALID [2022-02-21 03:09:55,910 INFO L290 TraceCheckUtils]: 6: Hoare triple {11574#(and (<= |base2flt_#res| 0) (<= 0 |base2flt_#res|))} assume true; {11574#(and (<= |base2flt_#res| 0) (<= 0 |base2flt_#res|))} is VALID [2022-02-21 03:09:55,911 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {11574#(and (<= |base2flt_#res| 0) (<= 0 |base2flt_#res|))} {11549#true} #453#return; {11556#(= |ULTIMATE.start_main_#t~ret22#1| 0)} is VALID [2022-02-21 03:09:55,911 INFO L290 TraceCheckUtils]: 8: Hoare triple {11556#(= |ULTIMATE.start_main_#t~ret22#1| 0)} main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1; {11557#(= |ULTIMATE.start_main_~zero~0#1| 0)} is VALID [2022-02-21 03:09:55,912 INFO L272 TraceCheckUtils]: 9: Hoare triple {11557#(= |ULTIMATE.start_main_~zero~0#1| 0)} call main_#t~ret23#1 := base2flt(main_~ma~2#1, main_~ea~2#1); {11572#(and (= abs_77 |old(abs_77)|) (= abs_78 |old(abs_78)|))} is VALID [2022-02-21 03:09:55,912 INFO L290 TraceCheckUtils]: 10: Hoare triple {11572#(and (= abs_77 |old(abs_77)|) (= abs_78 |old(abs_78)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {11549#true} is VALID [2022-02-21 03:09:55,912 INFO L290 TraceCheckUtils]: 11: Hoare triple {11549#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {11549#true} is VALID [2022-02-21 03:09:55,912 INFO L290 TraceCheckUtils]: 12: Hoare triple {11549#true} #res := ~__retres4~0; {11549#true} is VALID [2022-02-21 03:09:55,912 INFO L290 TraceCheckUtils]: 13: Hoare triple {11549#true} assume true; {11549#true} is VALID [2022-02-21 03:09:55,913 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {11549#true} {11557#(= |ULTIMATE.start_main_~zero~0#1| 0)} #455#return; {11557#(= |ULTIMATE.start_main_~zero~0#1| 0)} is VALID [2022-02-21 03:09:55,913 INFO L290 TraceCheckUtils]: 15: Hoare triple {11557#(= |ULTIMATE.start_main_~zero~0#1| 0)} main_~a~0#1 := main_#t~ret23#1;havoc main_#t~ret23#1; {11557#(= |ULTIMATE.start_main_~zero~0#1| 0)} is VALID [2022-02-21 03:09:55,914 INFO L272 TraceCheckUtils]: 16: Hoare triple {11557#(= |ULTIMATE.start_main_~zero~0#1| 0)} call main_#t~ret24#1 := base2flt(main_~mb~2#1, main_~eb~2#1); {11572#(and (= abs_77 |old(abs_77)|) (= abs_78 |old(abs_78)|))} is VALID [2022-02-21 03:09:55,914 INFO L290 TraceCheckUtils]: 17: Hoare triple {11572#(and (= abs_77 |old(abs_77)|) (= abs_78 |old(abs_78)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {11549#true} is VALID [2022-02-21 03:09:55,914 INFO L290 TraceCheckUtils]: 18: Hoare triple {11549#true} assume !(0 == ~m % 4294967296); {11549#true} is VALID [2022-02-21 03:09:55,914 INFO L290 TraceCheckUtils]: 19: Hoare triple {11549#true} assume !(~m % 4294967296 < 16777216); {11549#true} is VALID [2022-02-21 03:09:55,914 INFO L290 TraceCheckUtils]: 20: Hoare triple {11549#true} assume !false; {11549#true} is VALID [2022-02-21 03:09:55,914 INFO L290 TraceCheckUtils]: 21: Hoare triple {11549#true} assume ~m % 4294967296 >= 33554432; {11549#true} is VALID [2022-02-21 03:09:55,914 INFO L290 TraceCheckUtils]: 22: Hoare triple {11549#true} assume ~e >= 127;~__retres4~0 := 4294967295; {11549#true} is VALID [2022-02-21 03:09:55,915 INFO L290 TraceCheckUtils]: 23: Hoare triple {11549#true} #res := ~__retres4~0; {11549#true} is VALID [2022-02-21 03:09:55,915 INFO L290 TraceCheckUtils]: 24: Hoare triple {11549#true} assume true; {11549#true} is VALID [2022-02-21 03:09:55,915 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {11549#true} {11557#(= |ULTIMATE.start_main_~zero~0#1| 0)} #457#return; {11557#(= |ULTIMATE.start_main_~zero~0#1| 0)} is VALID [2022-02-21 03:09:55,916 INFO L290 TraceCheckUtils]: 26: Hoare triple {11557#(= |ULTIMATE.start_main_~zero~0#1| 0)} main_~b~0#1 := main_#t~ret24#1;havoc main_#t~ret24#1; {11557#(= |ULTIMATE.start_main_~zero~0#1| 0)} is VALID [2022-02-21 03:09:55,916 INFO L290 TraceCheckUtils]: 27: Hoare triple {11557#(= |ULTIMATE.start_main_~zero~0#1| 0)} assume main_~a~0#1 % 4294967296 < main_~zero~0#1 % 4294967296;main_~sa~0#1 := -1; {11550#false} is VALID [2022-02-21 03:09:55,916 INFO L290 TraceCheckUtils]: 28: Hoare triple {11550#false} assume main_~b~0#1 % 4294967296 < main_~zero~0#1 % 4294967296;main_~sb~0#1 := -1; {11550#false} is VALID [2022-02-21 03:09:55,916 INFO L290 TraceCheckUtils]: 29: Hoare triple {11550#false} assume { :begin_inline_addflt } true;addflt_#in~a#1, addflt_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc addflt_#res#1;havoc addflt_#t~nondet6#1, addflt_#t~nondet7#1, addflt_#t~nondet8#1, addflt_#t~nondet9#1, addflt_#t~nondet10#1, addflt_#t~nondet11#1, addflt_~a#1, addflt_~b#1, addflt_~res~1#1, addflt_~ma~0#1, addflt_~mb~0#1, addflt_~delta~0#1, addflt_~ea~0#1, addflt_~eb~0#1, addflt_~tmp~0#1, addflt_~__retres10~0#1;addflt_~a#1 := addflt_#in~a#1;addflt_~b#1 := addflt_#in~b#1;havoc addflt_~res~1#1;havoc addflt_~ma~0#1;havoc addflt_~mb~0#1;havoc addflt_~delta~0#1;havoc addflt_~ea~0#1;havoc addflt_~eb~0#1;havoc addflt_~tmp~0#1;havoc addflt_~__retres10~0#1; {11550#false} is VALID [2022-02-21 03:09:55,916 INFO L290 TraceCheckUtils]: 30: Hoare triple {11550#false} assume !(addflt_~a#1 % 4294967296 < addflt_~b#1 % 4294967296); {11550#false} is VALID [2022-02-21 03:09:55,917 INFO L290 TraceCheckUtils]: 31: Hoare triple {11550#false} assume !(0 == addflt_~b#1 % 4294967296); {11550#false} is VALID [2022-02-21 03:09:55,917 INFO L290 TraceCheckUtils]: 32: Hoare triple {11550#false} assume 0 == addflt_~a#1;addflt_~ma~0#1 := 0; {11550#false} is VALID [2022-02-21 03:09:55,917 INFO L290 TraceCheckUtils]: 33: Hoare triple {11550#false} assume (if addflt_~a#1 / 16777216 % 4294967296 % 4294967296 <= 2147483647 then addflt_~a#1 / 16777216 % 4294967296 % 4294967296 else addflt_~a#1 / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 <= 2147483647; {11550#false} is VALID [2022-02-21 03:09:55,917 INFO L290 TraceCheckUtils]: 34: Hoare triple {11550#false} assume !((if addflt_~a#1 / 16777216 % 4294967296 % 4294967296 <= 2147483647 then addflt_~a#1 / 16777216 % 4294967296 % 4294967296 else addflt_~a#1 / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 >= -2147483648); {11550#false} is VALID [2022-02-21 03:09:55,917 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-02-21 03:09:55,917 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:09:55,918 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818858077] [2022-02-21 03:09:55,918 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1818858077] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:09:55,918 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1252041921] [2022-02-21 03:09:55,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:09:55,918 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:09:55,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:09:55,920 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:09:55,924 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:09:55,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:09:55,984 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 9 conjunts are in the unsatisfiable core [2022-02-21 03:09:55,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:09:55,993 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:09:56,327 INFO L290 TraceCheckUtils]: 0: Hoare triple {11549#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(24, 2);call #Ultimate.allocInit(12, 3); {11549#true} is VALID [2022-02-21 03:09:56,327 INFO L290 TraceCheckUtils]: 1: Hoare triple {11549#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_~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_add~0#1, main_~zero~0#1, main_~sa~0#1, main_~sb~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~tmp___1~0#1, main_~tmp___2~0#1, main_~tmp___3~0#1, main_~tmp___4~0#1, main_~tmp___5~0#1, main_~tmp___6~0#1, main_~tmp___7~0#1, main_~tmp___8~0#1, main_~tmp___9~0#1, main_~__retres23~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_add~0#1;havoc main_~zero~0#1;havoc main_~sa~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_~tmp___2~0#1;havoc main_~tmp___3~0#1;havoc main_~tmp___4~0#1;havoc main_~tmp___5~0#1;havoc main_~tmp___6~0#1;havoc main_~tmp___7~0#1;havoc main_~tmp___8~0#1;havoc main_~tmp___9~0#1;havoc main_~__retres23~0#1; {11549#true} is VALID [2022-02-21 03:09:56,327 INFO L272 TraceCheckUtils]: 2: Hoare triple {11549#true} call main_#t~ret22#1 := base2flt(0, 0); {11549#true} is VALID [2022-02-21 03:09:56,330 INFO L290 TraceCheckUtils]: 3: Hoare triple {11549#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {11587#(= base2flt_~m |base2flt_#in~m|)} is VALID [2022-02-21 03:09:56,330 INFO L290 TraceCheckUtils]: 4: Hoare triple {11587#(= base2flt_~m |base2flt_#in~m|)} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {11591#(<= (mod |base2flt_#in~m| 4294967296) 0)} is VALID [2022-02-21 03:09:56,331 INFO L290 TraceCheckUtils]: 5: Hoare triple {11591#(<= (mod |base2flt_#in~m| 4294967296) 0)} #res := ~__retres4~0; {11591#(<= (mod |base2flt_#in~m| 4294967296) 0)} is VALID [2022-02-21 03:09:56,331 INFO L290 TraceCheckUtils]: 6: Hoare triple {11591#(<= (mod |base2flt_#in~m| 4294967296) 0)} assume true; {11591#(<= (mod |base2flt_#in~m| 4294967296) 0)} is VALID [2022-02-21 03:09:56,331 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {11591#(<= (mod |base2flt_#in~m| 4294967296) 0)} {11549#true} #453#return; {11549#true} is VALID [2022-02-21 03:09:56,331 INFO L290 TraceCheckUtils]: 8: Hoare triple {11549#true} main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1; {11549#true} is VALID [2022-02-21 03:09:56,331 INFO L272 TraceCheckUtils]: 9: Hoare triple {11549#true} call main_#t~ret23#1 := base2flt(main_~ma~2#1, main_~ea~2#1); {11549#true} is VALID [2022-02-21 03:09:56,331 INFO L290 TraceCheckUtils]: 10: Hoare triple {11549#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {11549#true} is VALID [2022-02-21 03:09:56,331 INFO L290 TraceCheckUtils]: 11: Hoare triple {11549#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {11549#true} is VALID [2022-02-21 03:09:56,331 INFO L290 TraceCheckUtils]: 12: Hoare triple {11549#true} #res := ~__retres4~0; {11549#true} is VALID [2022-02-21 03:09:56,331 INFO L290 TraceCheckUtils]: 13: Hoare triple {11549#true} assume true; {11549#true} is VALID [2022-02-21 03:09:56,332 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {11549#true} {11549#true} #455#return; {11549#true} is VALID [2022-02-21 03:09:56,332 INFO L290 TraceCheckUtils]: 15: Hoare triple {11549#true} main_~a~0#1 := main_#t~ret23#1;havoc main_#t~ret23#1; {11549#true} is VALID [2022-02-21 03:09:56,332 INFO L272 TraceCheckUtils]: 16: Hoare triple {11549#true} call main_#t~ret24#1 := base2flt(main_~mb~2#1, main_~eb~2#1); {11549#true} is VALID [2022-02-21 03:09:56,332 INFO L290 TraceCheckUtils]: 17: Hoare triple {11549#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {11549#true} is VALID [2022-02-21 03:09:56,332 INFO L290 TraceCheckUtils]: 18: Hoare triple {11549#true} assume !(0 == ~m % 4294967296); {11549#true} is VALID [2022-02-21 03:09:56,332 INFO L290 TraceCheckUtils]: 19: Hoare triple {11549#true} assume !(~m % 4294967296 < 16777216); {11549#true} is VALID [2022-02-21 03:09:56,332 INFO L290 TraceCheckUtils]: 20: Hoare triple {11549#true} assume !false; {11549#true} is VALID [2022-02-21 03:09:56,332 INFO L290 TraceCheckUtils]: 21: Hoare triple {11549#true} assume ~m % 4294967296 >= 33554432; {11549#true} is VALID [2022-02-21 03:09:56,332 INFO L290 TraceCheckUtils]: 22: Hoare triple {11549#true} assume ~e >= 127;~__retres4~0 := 4294967295; {11549#true} is VALID [2022-02-21 03:09:56,332 INFO L290 TraceCheckUtils]: 23: Hoare triple {11549#true} #res := ~__retres4~0; {11549#true} is VALID [2022-02-21 03:09:56,332 INFO L290 TraceCheckUtils]: 24: Hoare triple {11549#true} assume true; {11549#true} is VALID [2022-02-21 03:09:56,332 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {11549#true} {11549#true} #457#return; {11549#true} is VALID [2022-02-21 03:09:56,332 INFO L290 TraceCheckUtils]: 26: Hoare triple {11549#true} main_~b~0#1 := main_#t~ret24#1;havoc main_#t~ret24#1; {11549#true} is VALID [2022-02-21 03:09:56,332 INFO L290 TraceCheckUtils]: 27: Hoare triple {11549#true} assume main_~a~0#1 % 4294967296 < main_~zero~0#1 % 4294967296;main_~sa~0#1 := -1; {11549#true} is VALID [2022-02-21 03:09:56,332 INFO L290 TraceCheckUtils]: 28: Hoare triple {11549#true} assume main_~b~0#1 % 4294967296 < main_~zero~0#1 % 4294967296;main_~sb~0#1 := -1; {11549#true} is VALID [2022-02-21 03:09:56,332 INFO L290 TraceCheckUtils]: 29: Hoare triple {11549#true} assume { :begin_inline_addflt } true;addflt_#in~a#1, addflt_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc addflt_#res#1;havoc addflt_#t~nondet6#1, addflt_#t~nondet7#1, addflt_#t~nondet8#1, addflt_#t~nondet9#1, addflt_#t~nondet10#1, addflt_#t~nondet11#1, addflt_~a#1, addflt_~b#1, addflt_~res~1#1, addflt_~ma~0#1, addflt_~mb~0#1, addflt_~delta~0#1, addflt_~ea~0#1, addflt_~eb~0#1, addflt_~tmp~0#1, addflt_~__retres10~0#1;addflt_~a#1 := addflt_#in~a#1;addflt_~b#1 := addflt_#in~b#1;havoc addflt_~res~1#1;havoc addflt_~ma~0#1;havoc addflt_~mb~0#1;havoc addflt_~delta~0#1;havoc addflt_~ea~0#1;havoc addflt_~eb~0#1;havoc addflt_~tmp~0#1;havoc addflt_~__retres10~0#1; {11549#true} is VALID [2022-02-21 03:09:56,333 INFO L290 TraceCheckUtils]: 30: Hoare triple {11549#true} assume !(addflt_~a#1 % 4294967296 < addflt_~b#1 % 4294967296); {11670#(not (< (mod |ULTIMATE.start_addflt_~a#1| 4294967296) (mod |ULTIMATE.start_addflt_~b#1| 4294967296)))} is VALID [2022-02-21 03:09:56,333 INFO L290 TraceCheckUtils]: 31: Hoare triple {11670#(not (< (mod |ULTIMATE.start_addflt_~a#1| 4294967296) (mod |ULTIMATE.start_addflt_~b#1| 4294967296)))} assume !(0 == addflt_~b#1 % 4294967296); {11674#(< 0 (+ (div (+ (- 1) (mod |ULTIMATE.start_addflt_~a#1| 4294967296)) 4294967296) 1))} is VALID [2022-02-21 03:09:56,334 INFO L290 TraceCheckUtils]: 32: Hoare triple {11674#(< 0 (+ (div (+ (- 1) (mod |ULTIMATE.start_addflt_~a#1| 4294967296)) 4294967296) 1))} assume 0 == addflt_~a#1;addflt_~ma~0#1 := 0; {11550#false} is VALID [2022-02-21 03:09:56,334 INFO L290 TraceCheckUtils]: 33: Hoare triple {11550#false} assume (if addflt_~a#1 / 16777216 % 4294967296 % 4294967296 <= 2147483647 then addflt_~a#1 / 16777216 % 4294967296 % 4294967296 else addflt_~a#1 / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 <= 2147483647; {11550#false} is VALID [2022-02-21 03:09:56,334 INFO L290 TraceCheckUtils]: 34: Hoare triple {11550#false} assume !((if addflt_~a#1 / 16777216 % 4294967296 % 4294967296 <= 2147483647 then addflt_~a#1 / 16777216 % 4294967296 % 4294967296 else addflt_~a#1 / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 >= -2147483648); {11550#false} is VALID [2022-02-21 03:09:56,334 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-02-21 03:09:56,334 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:09:56,665 INFO L290 TraceCheckUtils]: 34: Hoare triple {11550#false} assume !((if addflt_~a#1 / 16777216 % 4294967296 % 4294967296 <= 2147483647 then addflt_~a#1 / 16777216 % 4294967296 % 4294967296 else addflt_~a#1 / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 >= -2147483648); {11550#false} is VALID [2022-02-21 03:09:56,665 INFO L290 TraceCheckUtils]: 33: Hoare triple {11550#false} assume (if addflt_~a#1 / 16777216 % 4294967296 % 4294967296 <= 2147483647 then addflt_~a#1 / 16777216 % 4294967296 % 4294967296 else addflt_~a#1 / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 <= 2147483647; {11550#false} is VALID [2022-02-21 03:09:56,666 INFO L290 TraceCheckUtils]: 32: Hoare triple {11690#(not (= |ULTIMATE.start_addflt_~a#1| 0))} assume 0 == addflt_~a#1;addflt_~ma~0#1 := 0; {11550#false} is VALID [2022-02-21 03:09:56,666 INFO L290 TraceCheckUtils]: 31: Hoare triple {11694#(or (not (= |ULTIMATE.start_addflt_~a#1| 0)) (= (mod |ULTIMATE.start_addflt_~b#1| 4294967296) 0))} assume !(0 == addflt_~b#1 % 4294967296); {11690#(not (= |ULTIMATE.start_addflt_~a#1| 0))} is VALID [2022-02-21 03:09:56,666 INFO L290 TraceCheckUtils]: 30: Hoare triple {11549#true} assume !(addflt_~a#1 % 4294967296 < addflt_~b#1 % 4294967296); {11694#(or (not (= |ULTIMATE.start_addflt_~a#1| 0)) (= (mod |ULTIMATE.start_addflt_~b#1| 4294967296) 0))} is VALID [2022-02-21 03:09:56,666 INFO L290 TraceCheckUtils]: 29: Hoare triple {11549#true} assume { :begin_inline_addflt } true;addflt_#in~a#1, addflt_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc addflt_#res#1;havoc addflt_#t~nondet6#1, addflt_#t~nondet7#1, addflt_#t~nondet8#1, addflt_#t~nondet9#1, addflt_#t~nondet10#1, addflt_#t~nondet11#1, addflt_~a#1, addflt_~b#1, addflt_~res~1#1, addflt_~ma~0#1, addflt_~mb~0#1, addflt_~delta~0#1, addflt_~ea~0#1, addflt_~eb~0#1, addflt_~tmp~0#1, addflt_~__retres10~0#1;addflt_~a#1 := addflt_#in~a#1;addflt_~b#1 := addflt_#in~b#1;havoc addflt_~res~1#1;havoc addflt_~ma~0#1;havoc addflt_~mb~0#1;havoc addflt_~delta~0#1;havoc addflt_~ea~0#1;havoc addflt_~eb~0#1;havoc addflt_~tmp~0#1;havoc addflt_~__retres10~0#1; {11549#true} is VALID [2022-02-21 03:09:56,667 INFO L290 TraceCheckUtils]: 28: Hoare triple {11549#true} assume main_~b~0#1 % 4294967296 < main_~zero~0#1 % 4294967296;main_~sb~0#1 := -1; {11549#true} is VALID [2022-02-21 03:09:56,667 INFO L290 TraceCheckUtils]: 27: Hoare triple {11549#true} assume main_~a~0#1 % 4294967296 < main_~zero~0#1 % 4294967296;main_~sa~0#1 := -1; {11549#true} is VALID [2022-02-21 03:09:56,667 INFO L290 TraceCheckUtils]: 26: Hoare triple {11549#true} main_~b~0#1 := main_#t~ret24#1;havoc main_#t~ret24#1; {11549#true} is VALID [2022-02-21 03:09:56,667 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {11549#true} {11549#true} #457#return; {11549#true} is VALID [2022-02-21 03:09:56,667 INFO L290 TraceCheckUtils]: 24: Hoare triple {11549#true} assume true; {11549#true} is VALID [2022-02-21 03:09:56,667 INFO L290 TraceCheckUtils]: 23: Hoare triple {11549#true} #res := ~__retres4~0; {11549#true} is VALID [2022-02-21 03:09:56,667 INFO L290 TraceCheckUtils]: 22: Hoare triple {11549#true} assume ~e >= 127;~__retres4~0 := 4294967295; {11549#true} is VALID [2022-02-21 03:09:56,667 INFO L290 TraceCheckUtils]: 21: Hoare triple {11549#true} assume ~m % 4294967296 >= 33554432; {11549#true} is VALID [2022-02-21 03:09:56,667 INFO L290 TraceCheckUtils]: 20: Hoare triple {11549#true} assume !false; {11549#true} is VALID [2022-02-21 03:09:56,667 INFO L290 TraceCheckUtils]: 19: Hoare triple {11549#true} assume !(~m % 4294967296 < 16777216); {11549#true} is VALID [2022-02-21 03:09:56,667 INFO L290 TraceCheckUtils]: 18: Hoare triple {11549#true} assume !(0 == ~m % 4294967296); {11549#true} is VALID [2022-02-21 03:09:56,667 INFO L290 TraceCheckUtils]: 17: Hoare triple {11549#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {11549#true} is VALID [2022-02-21 03:09:56,667 INFO L272 TraceCheckUtils]: 16: Hoare triple {11549#true} call main_#t~ret24#1 := base2flt(main_~mb~2#1, main_~eb~2#1); {11549#true} is VALID [2022-02-21 03:09:56,667 INFO L290 TraceCheckUtils]: 15: Hoare triple {11549#true} main_~a~0#1 := main_#t~ret23#1;havoc main_#t~ret23#1; {11549#true} is VALID [2022-02-21 03:09:56,668 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {11549#true} {11549#true} #455#return; {11549#true} is VALID [2022-02-21 03:09:56,668 INFO L290 TraceCheckUtils]: 13: Hoare triple {11549#true} assume true; {11549#true} is VALID [2022-02-21 03:09:56,668 INFO L290 TraceCheckUtils]: 12: Hoare triple {11549#true} #res := ~__retres4~0; {11549#true} is VALID [2022-02-21 03:09:56,668 INFO L290 TraceCheckUtils]: 11: Hoare triple {11549#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {11549#true} is VALID [2022-02-21 03:09:56,668 INFO L290 TraceCheckUtils]: 10: Hoare triple {11549#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {11549#true} is VALID [2022-02-21 03:09:56,668 INFO L272 TraceCheckUtils]: 9: Hoare triple {11549#true} call main_#t~ret23#1 := base2flt(main_~ma~2#1, main_~ea~2#1); {11549#true} is VALID [2022-02-21 03:09:56,668 INFO L290 TraceCheckUtils]: 8: Hoare triple {11549#true} main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1; {11549#true} is VALID [2022-02-21 03:09:56,668 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {11549#true} {11549#true} #453#return; {11549#true} is VALID [2022-02-21 03:09:56,668 INFO L290 TraceCheckUtils]: 6: Hoare triple {11549#true} assume true; {11549#true} is VALID [2022-02-21 03:09:56,668 INFO L290 TraceCheckUtils]: 5: Hoare triple {11549#true} #res := ~__retres4~0; {11549#true} is VALID [2022-02-21 03:09:56,668 INFO L290 TraceCheckUtils]: 4: Hoare triple {11549#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {11549#true} is VALID [2022-02-21 03:09:56,668 INFO L290 TraceCheckUtils]: 3: Hoare triple {11549#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {11549#true} is VALID [2022-02-21 03:09:56,668 INFO L272 TraceCheckUtils]: 2: Hoare triple {11549#true} call main_#t~ret22#1 := base2flt(0, 0); {11549#true} is VALID [2022-02-21 03:09:56,668 INFO L290 TraceCheckUtils]: 1: Hoare triple {11549#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_~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_add~0#1, main_~zero~0#1, main_~sa~0#1, main_~sb~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~tmp___1~0#1, main_~tmp___2~0#1, main_~tmp___3~0#1, main_~tmp___4~0#1, main_~tmp___5~0#1, main_~tmp___6~0#1, main_~tmp___7~0#1, main_~tmp___8~0#1, main_~tmp___9~0#1, main_~__retres23~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_add~0#1;havoc main_~zero~0#1;havoc main_~sa~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_~tmp___2~0#1;havoc main_~tmp___3~0#1;havoc main_~tmp___4~0#1;havoc main_~tmp___5~0#1;havoc main_~tmp___6~0#1;havoc main_~tmp___7~0#1;havoc main_~tmp___8~0#1;havoc main_~tmp___9~0#1;havoc main_~__retres23~0#1; {11549#true} is VALID [2022-02-21 03:09:56,668 INFO L290 TraceCheckUtils]: 0: Hoare triple {11549#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(24, 2);call #Ultimate.allocInit(12, 3); {11549#true} is VALID [2022-02-21 03:09:56,669 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-02-21 03:09:56,669 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1252041921] provided 1 perfect and 1 imperfect interpolant sequences [2022-02-21 03:09:56,669 INFO L191 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-02-21 03:09:56,669 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7, 6] total 13 [2022-02-21 03:09:56,669 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550155200] [2022-02-21 03:09:56,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:09:56,669 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 35 [2022-02-21 03:09:56,670 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:09:56,670 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-21 03:09:56,685 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:09:56,686 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-21 03:09:56,686 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:09:56,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-21 03:09:56,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2022-02-21 03:09:56,686 INFO L87 Difference]: Start difference. First operand 180 states and 239 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-21 03:09:56,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:09:56,872 INFO L93 Difference]: Finished difference Result 232 states and 297 transitions. [2022-02-21 03:09:56,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-21 03:09:56,872 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 35 [2022-02-21 03:09:56,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:09:56,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-21 03:09:56,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 184 transitions. [2022-02-21 03:09:56,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-21 03:09:56,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 184 transitions. [2022-02-21 03:09:56,875 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 184 transitions. [2022-02-21 03:09:56,978 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 184 edges. 184 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:09:56,980 INFO L225 Difference]: With dead ends: 232 [2022-02-21 03:09:56,980 INFO L226 Difference]: Without dead ends: 181 [2022-02-21 03:09:56,980 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2022-02-21 03:09:56,981 INFO L933 BasicCegarLoop]: 121 mSDtfsCounter, 54 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:09:56,981 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [56 Valid, 257 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:09:56,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2022-02-21 03:09:57,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 180. [2022-02-21 03:09:57,053 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:09:57,053 INFO L82 GeneralOperation]: Start isEquivalent. First operand 181 states. Second operand has 180 states, 161 states have (on average 1.4161490683229814) internal successors, (228), 170 states have internal predecessors, (228), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-21 03:09:57,053 INFO L74 IsIncluded]: Start isIncluded. First operand 181 states. Second operand has 180 states, 161 states have (on average 1.4161490683229814) internal successors, (228), 170 states have internal predecessors, (228), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-21 03:09:57,054 INFO L87 Difference]: Start difference. First operand 181 states. Second operand has 180 states, 161 states have (on average 1.4161490683229814) internal successors, (228), 170 states have internal predecessors, (228), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-21 03:09:57,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:09:57,056 INFO L93 Difference]: Finished difference Result 181 states and 239 transitions. [2022-02-21 03:09:57,056 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 239 transitions. [2022-02-21 03:09:57,057 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:09:57,057 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:09:57,057 INFO L74 IsIncluded]: Start isIncluded. First operand has 180 states, 161 states have (on average 1.4161490683229814) internal successors, (228), 170 states have internal predecessors, (228), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 181 states. [2022-02-21 03:09:57,058 INFO L87 Difference]: Start difference. First operand has 180 states, 161 states have (on average 1.4161490683229814) internal successors, (228), 170 states have internal predecessors, (228), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 181 states. [2022-02-21 03:09:57,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:09:57,060 INFO L93 Difference]: Finished difference Result 181 states and 239 transitions. [2022-02-21 03:09:57,060 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 239 transitions. [2022-02-21 03:09:57,060 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:09:57,060 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:09:57,060 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:09:57,061 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:09:57,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 161 states have (on average 1.4161490683229814) internal successors, (228), 170 states have internal predecessors, (228), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-21 03:09:57,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 238 transitions. [2022-02-21 03:09:57,063 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 238 transitions. Word has length 35 [2022-02-21 03:09:57,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:09:57,064 INFO L470 AbstractCegarLoop]: Abstraction has 180 states and 238 transitions. [2022-02-21 03:09:57,064 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-21 03:09:57,064 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 238 transitions. [2022-02-21 03:09:57,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-02-21 03:09:57,064 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:09:57,064 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 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:09:57,082 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:09:57,282 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:09:57,283 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-02-21 03:09:57,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:09:57,283 INFO L85 PathProgramCache]: Analyzing trace with hash 842612718, now seen corresponding path program 1 times [2022-02-21 03:09:57,284 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:09:57,284 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184418699] [2022-02-21 03:09:57,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:09:57,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:09:57,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:09:57,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-21 03:09:57,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:09:57,334 INFO L290 TraceCheckUtils]: 0: Hoare triple {12638#(and (= abs_77 |old(abs_77)|) (= abs_78 |old(abs_78)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {12614#true} is VALID [2022-02-21 03:09:57,334 INFO L290 TraceCheckUtils]: 1: Hoare triple {12614#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {12614#true} is VALID [2022-02-21 03:09:57,334 INFO L290 TraceCheckUtils]: 2: Hoare triple {12614#true} #res := ~__retres4~0; {12614#true} is VALID [2022-02-21 03:09:57,335 INFO L290 TraceCheckUtils]: 3: Hoare triple {12614#true} assume true; {12614#true} is VALID [2022-02-21 03:09:57,336 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {12614#true} {12614#true} #453#return; {12614#true} is VALID [2022-02-21 03:09:57,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-02-21 03:09:57,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:09:57,362 INFO L290 TraceCheckUtils]: 0: Hoare triple {12638#(and (= abs_77 |old(abs_77)|) (= abs_78 |old(abs_78)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {12614#true} is VALID [2022-02-21 03:09:57,363 INFO L290 TraceCheckUtils]: 1: Hoare triple {12614#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {12639#(and (<= base2flt_~__retres4~0 0) (<= 0 base2flt_~__retres4~0))} is VALID [2022-02-21 03:09:57,364 INFO L290 TraceCheckUtils]: 2: Hoare triple {12639#(and (<= base2flt_~__retres4~0 0) (<= 0 base2flt_~__retres4~0))} #res := ~__retres4~0; {12640#(and (<= |base2flt_#res| 0) (<= 0 |base2flt_#res|))} is VALID [2022-02-21 03:09:57,365 INFO L290 TraceCheckUtils]: 3: Hoare triple {12640#(and (<= |base2flt_#res| 0) (<= 0 |base2flt_#res|))} assume true; {12640#(and (<= |base2flt_#res| 0) (<= 0 |base2flt_#res|))} is VALID [2022-02-21 03:09:57,365 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {12640#(and (<= |base2flt_#res| 0) (<= 0 |base2flt_#res|))} {12614#true} #455#return; {12626#(= |ULTIMATE.start_main_#t~ret23#1| 0)} is VALID [2022-02-21 03:09:57,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-02-21 03:09:57,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:09:57,384 INFO L290 TraceCheckUtils]: 0: Hoare triple {12638#(and (= abs_77 |old(abs_77)|) (= abs_78 |old(abs_78)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {12614#true} is VALID [2022-02-21 03:09:57,384 INFO L290 TraceCheckUtils]: 1: Hoare triple {12614#true} assume !(0 == ~m % 4294967296); {12614#true} is VALID [2022-02-21 03:09:57,384 INFO L290 TraceCheckUtils]: 2: Hoare triple {12614#true} assume !(~m % 4294967296 < 16777216); {12614#true} is VALID [2022-02-21 03:09:57,384 INFO L290 TraceCheckUtils]: 3: Hoare triple {12614#true} assume !false; {12614#true} is VALID [2022-02-21 03:09:57,384 INFO L290 TraceCheckUtils]: 4: Hoare triple {12614#true} assume ~m % 4294967296 >= 33554432; {12614#true} is VALID [2022-02-21 03:09:57,384 INFO L290 TraceCheckUtils]: 5: Hoare triple {12614#true} assume ~e >= 127;~__retres4~0 := 4294967295; {12614#true} is VALID [2022-02-21 03:09:57,384 INFO L290 TraceCheckUtils]: 6: Hoare triple {12614#true} #res := ~__retres4~0; {12614#true} is VALID [2022-02-21 03:09:57,384 INFO L290 TraceCheckUtils]: 7: Hoare triple {12614#true} assume true; {12614#true} is VALID [2022-02-21 03:09:57,385 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {12614#true} {12627#(= |ULTIMATE.start_main_~a~0#1| 0)} #457#return; {12627#(= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-21 03:09:57,385 INFO L290 TraceCheckUtils]: 0: Hoare triple {12614#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(24, 2);call #Ultimate.allocInit(12, 3); {12614#true} is VALID [2022-02-21 03:09:57,385 INFO L290 TraceCheckUtils]: 1: Hoare triple {12614#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_~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_add~0#1, main_~zero~0#1, main_~sa~0#1, main_~sb~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~tmp___1~0#1, main_~tmp___2~0#1, main_~tmp___3~0#1, main_~tmp___4~0#1, main_~tmp___5~0#1, main_~tmp___6~0#1, main_~tmp___7~0#1, main_~tmp___8~0#1, main_~tmp___9~0#1, main_~__retres23~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_add~0#1;havoc main_~zero~0#1;havoc main_~sa~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_~tmp___2~0#1;havoc main_~tmp___3~0#1;havoc main_~tmp___4~0#1;havoc main_~tmp___5~0#1;havoc main_~tmp___6~0#1;havoc main_~tmp___7~0#1;havoc main_~tmp___8~0#1;havoc main_~tmp___9~0#1;havoc main_~__retres23~0#1; {12614#true} is VALID [2022-02-21 03:09:57,386 INFO L272 TraceCheckUtils]: 2: Hoare triple {12614#true} call main_#t~ret22#1 := base2flt(0, 0); {12638#(and (= abs_77 |old(abs_77)|) (= abs_78 |old(abs_78)|))} is VALID [2022-02-21 03:09:57,386 INFO L290 TraceCheckUtils]: 3: Hoare triple {12638#(and (= abs_77 |old(abs_77)|) (= abs_78 |old(abs_78)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {12614#true} is VALID [2022-02-21 03:09:57,386 INFO L290 TraceCheckUtils]: 4: Hoare triple {12614#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {12614#true} is VALID [2022-02-21 03:09:57,386 INFO L290 TraceCheckUtils]: 5: Hoare triple {12614#true} #res := ~__retres4~0; {12614#true} is VALID [2022-02-21 03:09:57,386 INFO L290 TraceCheckUtils]: 6: Hoare triple {12614#true} assume true; {12614#true} is VALID [2022-02-21 03:09:57,386 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {12614#true} {12614#true} #453#return; {12614#true} is VALID [2022-02-21 03:09:57,386 INFO L290 TraceCheckUtils]: 8: Hoare triple {12614#true} main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1; {12614#true} is VALID [2022-02-21 03:09:57,386 INFO L272 TraceCheckUtils]: 9: Hoare triple {12614#true} call main_#t~ret23#1 := base2flt(main_~ma~2#1, main_~ea~2#1); {12638#(and (= abs_77 |old(abs_77)|) (= abs_78 |old(abs_78)|))} is VALID [2022-02-21 03:09:57,387 INFO L290 TraceCheckUtils]: 10: Hoare triple {12638#(and (= abs_77 |old(abs_77)|) (= abs_78 |old(abs_78)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {12614#true} is VALID [2022-02-21 03:09:57,387 INFO L290 TraceCheckUtils]: 11: Hoare triple {12614#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {12639#(and (<= base2flt_~__retres4~0 0) (<= 0 base2flt_~__retres4~0))} is VALID [2022-02-21 03:09:57,387 INFO L290 TraceCheckUtils]: 12: Hoare triple {12639#(and (<= base2flt_~__retres4~0 0) (<= 0 base2flt_~__retres4~0))} #res := ~__retres4~0; {12640#(and (<= |base2flt_#res| 0) (<= 0 |base2flt_#res|))} is VALID [2022-02-21 03:09:57,388 INFO L290 TraceCheckUtils]: 13: Hoare triple {12640#(and (<= |base2flt_#res| 0) (<= 0 |base2flt_#res|))} assume true; {12640#(and (<= |base2flt_#res| 0) (<= 0 |base2flt_#res|))} is VALID [2022-02-21 03:09:57,388 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {12640#(and (<= |base2flt_#res| 0) (<= 0 |base2flt_#res|))} {12614#true} #455#return; {12626#(= |ULTIMATE.start_main_#t~ret23#1| 0)} is VALID [2022-02-21 03:09:57,389 INFO L290 TraceCheckUtils]: 15: Hoare triple {12626#(= |ULTIMATE.start_main_#t~ret23#1| 0)} main_~a~0#1 := main_#t~ret23#1;havoc main_#t~ret23#1; {12627#(= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-21 03:09:57,389 INFO L272 TraceCheckUtils]: 16: Hoare triple {12627#(= |ULTIMATE.start_main_~a~0#1| 0)} call main_#t~ret24#1 := base2flt(main_~mb~2#1, main_~eb~2#1); {12638#(and (= abs_77 |old(abs_77)|) (= abs_78 |old(abs_78)|))} is VALID [2022-02-21 03:09:57,389 INFO L290 TraceCheckUtils]: 17: Hoare triple {12638#(and (= abs_77 |old(abs_77)|) (= abs_78 |old(abs_78)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {12614#true} is VALID [2022-02-21 03:09:57,389 INFO L290 TraceCheckUtils]: 18: Hoare triple {12614#true} assume !(0 == ~m % 4294967296); {12614#true} is VALID [2022-02-21 03:09:57,389 INFO L290 TraceCheckUtils]: 19: Hoare triple {12614#true} assume !(~m % 4294967296 < 16777216); {12614#true} is VALID [2022-02-21 03:09:57,389 INFO L290 TraceCheckUtils]: 20: Hoare triple {12614#true} assume !false; {12614#true} is VALID [2022-02-21 03:09:57,389 INFO L290 TraceCheckUtils]: 21: Hoare triple {12614#true} assume ~m % 4294967296 >= 33554432; {12614#true} is VALID [2022-02-21 03:09:57,389 INFO L290 TraceCheckUtils]: 22: Hoare triple {12614#true} assume ~e >= 127;~__retres4~0 := 4294967295; {12614#true} is VALID [2022-02-21 03:09:57,390 INFO L290 TraceCheckUtils]: 23: Hoare triple {12614#true} #res := ~__retres4~0; {12614#true} is VALID [2022-02-21 03:09:57,390 INFO L290 TraceCheckUtils]: 24: Hoare triple {12614#true} assume true; {12614#true} is VALID [2022-02-21 03:09:57,390 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {12614#true} {12627#(= |ULTIMATE.start_main_~a~0#1| 0)} #457#return; {12627#(= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-21 03:09:57,390 INFO L290 TraceCheckUtils]: 26: Hoare triple {12627#(= |ULTIMATE.start_main_~a~0#1| 0)} main_~b~0#1 := main_#t~ret24#1;havoc main_#t~ret24#1; {12627#(= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-21 03:09:57,391 INFO L290 TraceCheckUtils]: 27: Hoare triple {12627#(= |ULTIMATE.start_main_~a~0#1| 0)} assume main_~a~0#1 % 4294967296 < main_~zero~0#1 % 4294967296;main_~sa~0#1 := -1; {12627#(= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-21 03:09:57,391 INFO L290 TraceCheckUtils]: 28: Hoare triple {12627#(= |ULTIMATE.start_main_~a~0#1| 0)} assume main_~b~0#1 % 4294967296 < main_~zero~0#1 % 4294967296;main_~sb~0#1 := -1; {12627#(= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-21 03:09:57,391 INFO L290 TraceCheckUtils]: 29: Hoare triple {12627#(= |ULTIMATE.start_main_~a~0#1| 0)} assume { :begin_inline_addflt } true;addflt_#in~a#1, addflt_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc addflt_#res#1;havoc addflt_#t~nondet6#1, addflt_#t~nondet7#1, addflt_#t~nondet8#1, addflt_#t~nondet9#1, addflt_#t~nondet10#1, addflt_#t~nondet11#1, addflt_~a#1, addflt_~b#1, addflt_~res~1#1, addflt_~ma~0#1, addflt_~mb~0#1, addflt_~delta~0#1, addflt_~ea~0#1, addflt_~eb~0#1, addflt_~tmp~0#1, addflt_~__retres10~0#1;addflt_~a#1 := addflt_#in~a#1;addflt_~b#1 := addflt_#in~b#1;havoc addflt_~res~1#1;havoc addflt_~ma~0#1;havoc addflt_~mb~0#1;havoc addflt_~delta~0#1;havoc addflt_~ea~0#1;havoc addflt_~eb~0#1;havoc addflt_~tmp~0#1;havoc addflt_~__retres10~0#1; {12637#(= |ULTIMATE.start_addflt_~a#1| 0)} is VALID [2022-02-21 03:09:57,391 INFO L290 TraceCheckUtils]: 30: Hoare triple {12637#(= |ULTIMATE.start_addflt_~a#1| 0)} assume !(addflt_~a#1 % 4294967296 < addflt_~b#1 % 4294967296); {12637#(= |ULTIMATE.start_addflt_~a#1| 0)} is VALID [2022-02-21 03:09:57,392 INFO L290 TraceCheckUtils]: 31: Hoare triple {12637#(= |ULTIMATE.start_addflt_~a#1| 0)} assume !(0 == addflt_~b#1 % 4294967296); {12637#(= |ULTIMATE.start_addflt_~a#1| 0)} is VALID [2022-02-21 03:09:57,392 INFO L290 TraceCheckUtils]: 32: Hoare triple {12637#(= |ULTIMATE.start_addflt_~a#1| 0)} assume !(0 == addflt_~a#1); {12615#false} is VALID [2022-02-21 03:09:57,392 INFO L290 TraceCheckUtils]: 33: Hoare triple {12615#false} assume !false; {12615#false} is VALID [2022-02-21 03:09:57,392 INFO L290 TraceCheckUtils]: 34: Hoare triple {12615#false} assume !false; {12615#false} is VALID [2022-02-21 03:09:57,392 INFO L290 TraceCheckUtils]: 35: Hoare triple {12615#false} assume addflt_~a#1 >= 0;abs_109 := (if addflt_~a#1 < 16777215 then addflt_~a#1 else 16777215);assume addflt_~a#1 >= 0;assume addflt_~ma~0#1 < abs_109; {12615#false} is VALID [2022-02-21 03:09:57,392 INFO L290 TraceCheckUtils]: 36: Hoare triple {12615#false} assume (if addflt_~a#1 / 16777216 % 4294967296 % 4294967296 <= 2147483647 then addflt_~a#1 / 16777216 % 4294967296 % 4294967296 else addflt_~a#1 / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 <= 2147483647; {12615#false} is VALID [2022-02-21 03:09:57,392 INFO L290 TraceCheckUtils]: 37: Hoare triple {12615#false} assume !((if addflt_~a#1 / 16777216 % 4294967296 % 4294967296 <= 2147483647 then addflt_~a#1 / 16777216 % 4294967296 % 4294967296 else addflt_~a#1 / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 >= -2147483648); {12615#false} is VALID [2022-02-21 03:09:57,392 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-02-21 03:09:57,393 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:09:57,393 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184418699] [2022-02-21 03:09:57,393 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [184418699] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:09:57,393 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [976265995] [2022-02-21 03:09:57,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:09:57,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:09:57,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:09:57,394 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:09:57,395 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:09:57,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:09:57,438 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-21 03:09:57,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:09:57,463 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:09:57,663 INFO L290 TraceCheckUtils]: 0: Hoare triple {12614#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(24, 2);call #Ultimate.allocInit(12, 3); {12614#true} is VALID [2022-02-21 03:09:57,664 INFO L290 TraceCheckUtils]: 1: Hoare triple {12614#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_~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_add~0#1, main_~zero~0#1, main_~sa~0#1, main_~sb~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~tmp___1~0#1, main_~tmp___2~0#1, main_~tmp___3~0#1, main_~tmp___4~0#1, main_~tmp___5~0#1, main_~tmp___6~0#1, main_~tmp___7~0#1, main_~tmp___8~0#1, main_~tmp___9~0#1, main_~__retres23~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_add~0#1;havoc main_~zero~0#1;havoc main_~sa~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_~tmp___2~0#1;havoc main_~tmp___3~0#1;havoc main_~tmp___4~0#1;havoc main_~tmp___5~0#1;havoc main_~tmp___6~0#1;havoc main_~tmp___7~0#1;havoc main_~tmp___8~0#1;havoc main_~tmp___9~0#1;havoc main_~__retres23~0#1; {12614#true} is VALID [2022-02-21 03:09:57,664 INFO L272 TraceCheckUtils]: 2: Hoare triple {12614#true} call main_#t~ret22#1 := base2flt(0, 0); {12614#true} is VALID [2022-02-21 03:09:57,664 INFO L290 TraceCheckUtils]: 3: Hoare triple {12614#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {12614#true} is VALID [2022-02-21 03:09:57,664 INFO L290 TraceCheckUtils]: 4: Hoare triple {12614#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {12614#true} is VALID [2022-02-21 03:09:57,664 INFO L290 TraceCheckUtils]: 5: Hoare triple {12614#true} #res := ~__retres4~0; {12614#true} is VALID [2022-02-21 03:09:57,664 INFO L290 TraceCheckUtils]: 6: Hoare triple {12614#true} assume true; {12614#true} is VALID [2022-02-21 03:09:57,664 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {12614#true} {12614#true} #453#return; {12614#true} is VALID [2022-02-21 03:09:57,664 INFO L290 TraceCheckUtils]: 8: Hoare triple {12614#true} main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1; {12614#true} is VALID [2022-02-21 03:09:57,664 INFO L272 TraceCheckUtils]: 9: Hoare triple {12614#true} call main_#t~ret23#1 := base2flt(main_~ma~2#1, main_~ea~2#1); {12614#true} is VALID [2022-02-21 03:09:57,664 INFO L290 TraceCheckUtils]: 10: Hoare triple {12614#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {12614#true} is VALID [2022-02-21 03:09:57,665 INFO L290 TraceCheckUtils]: 11: Hoare triple {12614#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {12677#(<= base2flt_~__retres4~0 0)} is VALID [2022-02-21 03:09:57,665 INFO L290 TraceCheckUtils]: 12: Hoare triple {12677#(<= base2flt_~__retres4~0 0)} #res := ~__retres4~0; {12681#(<= |base2flt_#res| 0)} is VALID [2022-02-21 03:09:57,665 INFO L290 TraceCheckUtils]: 13: Hoare triple {12681#(<= |base2flt_#res| 0)} assume true; {12681#(<= |base2flt_#res| 0)} is VALID [2022-02-21 03:09:57,666 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {12681#(<= |base2flt_#res| 0)} {12614#true} #455#return; {12688#(<= |ULTIMATE.start_main_#t~ret23#1| 0)} is VALID [2022-02-21 03:09:57,666 INFO L290 TraceCheckUtils]: 15: Hoare triple {12688#(<= |ULTIMATE.start_main_#t~ret23#1| 0)} main_~a~0#1 := main_#t~ret23#1;havoc main_#t~ret23#1; {12692#(<= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-21 03:09:57,666 INFO L272 TraceCheckUtils]: 16: Hoare triple {12692#(<= |ULTIMATE.start_main_~a~0#1| 0)} call main_#t~ret24#1 := base2flt(main_~mb~2#1, main_~eb~2#1); {12614#true} is VALID [2022-02-21 03:09:57,666 INFO L290 TraceCheckUtils]: 17: Hoare triple {12614#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {12614#true} is VALID [2022-02-21 03:09:57,666 INFO L290 TraceCheckUtils]: 18: Hoare triple {12614#true} assume !(0 == ~m % 4294967296); {12614#true} is VALID [2022-02-21 03:09:57,666 INFO L290 TraceCheckUtils]: 19: Hoare triple {12614#true} assume !(~m % 4294967296 < 16777216); {12614#true} is VALID [2022-02-21 03:09:57,666 INFO L290 TraceCheckUtils]: 20: Hoare triple {12614#true} assume !false; {12614#true} is VALID [2022-02-21 03:09:57,666 INFO L290 TraceCheckUtils]: 21: Hoare triple {12614#true} assume ~m % 4294967296 >= 33554432; {12614#true} is VALID [2022-02-21 03:09:57,666 INFO L290 TraceCheckUtils]: 22: Hoare triple {12614#true} assume ~e >= 127;~__retres4~0 := 4294967295; {12614#true} is VALID [2022-02-21 03:09:57,666 INFO L290 TraceCheckUtils]: 23: Hoare triple {12614#true} #res := ~__retres4~0; {12614#true} is VALID [2022-02-21 03:09:57,667 INFO L290 TraceCheckUtils]: 24: Hoare triple {12614#true} assume true; {12614#true} is VALID [2022-02-21 03:09:57,667 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {12614#true} {12692#(<= |ULTIMATE.start_main_~a~0#1| 0)} #457#return; {12692#(<= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-21 03:09:57,667 INFO L290 TraceCheckUtils]: 26: Hoare triple {12692#(<= |ULTIMATE.start_main_~a~0#1| 0)} main_~b~0#1 := main_#t~ret24#1;havoc main_#t~ret24#1; {12692#(<= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-21 03:09:57,668 INFO L290 TraceCheckUtils]: 27: Hoare triple {12692#(<= |ULTIMATE.start_main_~a~0#1| 0)} assume main_~a~0#1 % 4294967296 < main_~zero~0#1 % 4294967296;main_~sa~0#1 := -1; {12692#(<= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-21 03:09:57,668 INFO L290 TraceCheckUtils]: 28: Hoare triple {12692#(<= |ULTIMATE.start_main_~a~0#1| 0)} assume main_~b~0#1 % 4294967296 < main_~zero~0#1 % 4294967296;main_~sb~0#1 := -1; {12692#(<= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-21 03:09:57,668 INFO L290 TraceCheckUtils]: 29: Hoare triple {12692#(<= |ULTIMATE.start_main_~a~0#1| 0)} assume { :begin_inline_addflt } true;addflt_#in~a#1, addflt_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc addflt_#res#1;havoc addflt_#t~nondet6#1, addflt_#t~nondet7#1, addflt_#t~nondet8#1, addflt_#t~nondet9#1, addflt_#t~nondet10#1, addflt_#t~nondet11#1, addflt_~a#1, addflt_~b#1, addflt_~res~1#1, addflt_~ma~0#1, addflt_~mb~0#1, addflt_~delta~0#1, addflt_~ea~0#1, addflt_~eb~0#1, addflt_~tmp~0#1, addflt_~__retres10~0#1;addflt_~a#1 := addflt_#in~a#1;addflt_~b#1 := addflt_#in~b#1;havoc addflt_~res~1#1;havoc addflt_~ma~0#1;havoc addflt_~mb~0#1;havoc addflt_~delta~0#1;havoc addflt_~ea~0#1;havoc addflt_~eb~0#1;havoc addflt_~tmp~0#1;havoc addflt_~__retres10~0#1; {12735#(<= |ULTIMATE.start_addflt_~a#1| 0)} is VALID [2022-02-21 03:09:57,668 INFO L290 TraceCheckUtils]: 30: Hoare triple {12735#(<= |ULTIMATE.start_addflt_~a#1| 0)} assume !(addflt_~a#1 % 4294967296 < addflt_~b#1 % 4294967296); {12735#(<= |ULTIMATE.start_addflt_~a#1| 0)} is VALID [2022-02-21 03:09:57,669 INFO L290 TraceCheckUtils]: 31: Hoare triple {12735#(<= |ULTIMATE.start_addflt_~a#1| 0)} assume !(0 == addflt_~b#1 % 4294967296); {12735#(<= |ULTIMATE.start_addflt_~a#1| 0)} is VALID [2022-02-21 03:09:57,669 INFO L290 TraceCheckUtils]: 32: Hoare triple {12735#(<= |ULTIMATE.start_addflt_~a#1| 0)} assume !(0 == addflt_~a#1); {12745#(and (not (= |ULTIMATE.start_addflt_~a#1| 0)) (<= |ULTIMATE.start_addflt_~a#1| 0))} is VALID [2022-02-21 03:09:57,669 INFO L290 TraceCheckUtils]: 33: Hoare triple {12745#(and (not (= |ULTIMATE.start_addflt_~a#1| 0)) (<= |ULTIMATE.start_addflt_~a#1| 0))} assume !false; {12745#(and (not (= |ULTIMATE.start_addflt_~a#1| 0)) (<= |ULTIMATE.start_addflt_~a#1| 0))} is VALID [2022-02-21 03:09:57,669 INFO L290 TraceCheckUtils]: 34: Hoare triple {12745#(and (not (= |ULTIMATE.start_addflt_~a#1| 0)) (<= |ULTIMATE.start_addflt_~a#1| 0))} assume !false; {12745#(and (not (= |ULTIMATE.start_addflt_~a#1| 0)) (<= |ULTIMATE.start_addflt_~a#1| 0))} is VALID [2022-02-21 03:09:57,670 INFO L290 TraceCheckUtils]: 35: Hoare triple {12745#(and (not (= |ULTIMATE.start_addflt_~a#1| 0)) (<= |ULTIMATE.start_addflt_~a#1| 0))} assume addflt_~a#1 >= 0;abs_109 := (if addflt_~a#1 < 16777215 then addflt_~a#1 else 16777215);assume addflt_~a#1 >= 0;assume addflt_~ma~0#1 < abs_109; {12615#false} is VALID [2022-02-21 03:09:57,670 INFO L290 TraceCheckUtils]: 36: Hoare triple {12615#false} assume (if addflt_~a#1 / 16777216 % 4294967296 % 4294967296 <= 2147483647 then addflt_~a#1 / 16777216 % 4294967296 % 4294967296 else addflt_~a#1 / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 <= 2147483647; {12615#false} is VALID [2022-02-21 03:09:57,670 INFO L290 TraceCheckUtils]: 37: Hoare triple {12615#false} assume !((if addflt_~a#1 / 16777216 % 4294967296 % 4294967296 <= 2147483647 then addflt_~a#1 / 16777216 % 4294967296 % 4294967296 else addflt_~a#1 / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 >= -2147483648); {12615#false} is VALID [2022-02-21 03:09:57,670 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-02-21 03:09:57,670 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:09:57,870 INFO L290 TraceCheckUtils]: 37: Hoare triple {12615#false} assume !((if addflt_~a#1 / 16777216 % 4294967296 % 4294967296 <= 2147483647 then addflt_~a#1 / 16777216 % 4294967296 % 4294967296 else addflt_~a#1 / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 >= -2147483648); {12615#false} is VALID [2022-02-21 03:09:57,870 INFO L290 TraceCheckUtils]: 36: Hoare triple {12615#false} assume (if addflt_~a#1 / 16777216 % 4294967296 % 4294967296 <= 2147483647 then addflt_~a#1 / 16777216 % 4294967296 % 4294967296 else addflt_~a#1 / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 <= 2147483647; {12615#false} is VALID [2022-02-21 03:09:57,870 INFO L290 TraceCheckUtils]: 35: Hoare triple {12745#(and (not (= |ULTIMATE.start_addflt_~a#1| 0)) (<= |ULTIMATE.start_addflt_~a#1| 0))} assume addflt_~a#1 >= 0;abs_109 := (if addflt_~a#1 < 16777215 then addflt_~a#1 else 16777215);assume addflt_~a#1 >= 0;assume addflt_~ma~0#1 < abs_109; {12615#false} is VALID [2022-02-21 03:09:57,871 INFO L290 TraceCheckUtils]: 34: Hoare triple {12745#(and (not (= |ULTIMATE.start_addflt_~a#1| 0)) (<= |ULTIMATE.start_addflt_~a#1| 0))} assume !false; {12745#(and (not (= |ULTIMATE.start_addflt_~a#1| 0)) (<= |ULTIMATE.start_addflt_~a#1| 0))} is VALID [2022-02-21 03:09:57,871 INFO L290 TraceCheckUtils]: 33: Hoare triple {12745#(and (not (= |ULTIMATE.start_addflt_~a#1| 0)) (<= |ULTIMATE.start_addflt_~a#1| 0))} assume !false; {12745#(and (not (= |ULTIMATE.start_addflt_~a#1| 0)) (<= |ULTIMATE.start_addflt_~a#1| 0))} is VALID [2022-02-21 03:09:57,872 INFO L290 TraceCheckUtils]: 32: Hoare triple {12735#(<= |ULTIMATE.start_addflt_~a#1| 0)} assume !(0 == addflt_~a#1); {12745#(and (not (= |ULTIMATE.start_addflt_~a#1| 0)) (<= |ULTIMATE.start_addflt_~a#1| 0))} is VALID [2022-02-21 03:09:57,872 INFO L290 TraceCheckUtils]: 31: Hoare triple {12735#(<= |ULTIMATE.start_addflt_~a#1| 0)} assume !(0 == addflt_~b#1 % 4294967296); {12735#(<= |ULTIMATE.start_addflt_~a#1| 0)} is VALID [2022-02-21 03:09:57,872 INFO L290 TraceCheckUtils]: 30: Hoare triple {12735#(<= |ULTIMATE.start_addflt_~a#1| 0)} assume !(addflt_~a#1 % 4294967296 < addflt_~b#1 % 4294967296); {12735#(<= |ULTIMATE.start_addflt_~a#1| 0)} is VALID [2022-02-21 03:09:57,872 INFO L290 TraceCheckUtils]: 29: Hoare triple {12692#(<= |ULTIMATE.start_main_~a~0#1| 0)} assume { :begin_inline_addflt } true;addflt_#in~a#1, addflt_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc addflt_#res#1;havoc addflt_#t~nondet6#1, addflt_#t~nondet7#1, addflt_#t~nondet8#1, addflt_#t~nondet9#1, addflt_#t~nondet10#1, addflt_#t~nondet11#1, addflt_~a#1, addflt_~b#1, addflt_~res~1#1, addflt_~ma~0#1, addflt_~mb~0#1, addflt_~delta~0#1, addflt_~ea~0#1, addflt_~eb~0#1, addflt_~tmp~0#1, addflt_~__retres10~0#1;addflt_~a#1 := addflt_#in~a#1;addflt_~b#1 := addflt_#in~b#1;havoc addflt_~res~1#1;havoc addflt_~ma~0#1;havoc addflt_~mb~0#1;havoc addflt_~delta~0#1;havoc addflt_~ea~0#1;havoc addflt_~eb~0#1;havoc addflt_~tmp~0#1;havoc addflt_~__retres10~0#1; {12735#(<= |ULTIMATE.start_addflt_~a#1| 0)} is VALID [2022-02-21 03:09:57,873 INFO L290 TraceCheckUtils]: 28: Hoare triple {12692#(<= |ULTIMATE.start_main_~a~0#1| 0)} assume main_~b~0#1 % 4294967296 < main_~zero~0#1 % 4294967296;main_~sb~0#1 := -1; {12692#(<= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-21 03:09:57,873 INFO L290 TraceCheckUtils]: 27: Hoare triple {12692#(<= |ULTIMATE.start_main_~a~0#1| 0)} assume main_~a~0#1 % 4294967296 < main_~zero~0#1 % 4294967296;main_~sa~0#1 := -1; {12692#(<= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-21 03:09:57,873 INFO L290 TraceCheckUtils]: 26: Hoare triple {12692#(<= |ULTIMATE.start_main_~a~0#1| 0)} main_~b~0#1 := main_#t~ret24#1;havoc main_#t~ret24#1; {12692#(<= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-21 03:09:57,874 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {12614#true} {12692#(<= |ULTIMATE.start_main_~a~0#1| 0)} #457#return; {12692#(<= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-21 03:09:57,874 INFO L290 TraceCheckUtils]: 24: Hoare triple {12614#true} assume true; {12614#true} is VALID [2022-02-21 03:09:57,874 INFO L290 TraceCheckUtils]: 23: Hoare triple {12614#true} #res := ~__retres4~0; {12614#true} is VALID [2022-02-21 03:09:57,874 INFO L290 TraceCheckUtils]: 22: Hoare triple {12614#true} assume ~e >= 127;~__retres4~0 := 4294967295; {12614#true} is VALID [2022-02-21 03:09:57,874 INFO L290 TraceCheckUtils]: 21: Hoare triple {12614#true} assume ~m % 4294967296 >= 33554432; {12614#true} is VALID [2022-02-21 03:09:57,874 INFO L290 TraceCheckUtils]: 20: Hoare triple {12614#true} assume !false; {12614#true} is VALID [2022-02-21 03:09:57,874 INFO L290 TraceCheckUtils]: 19: Hoare triple {12614#true} assume !(~m % 4294967296 < 16777216); {12614#true} is VALID [2022-02-21 03:09:57,874 INFO L290 TraceCheckUtils]: 18: Hoare triple {12614#true} assume !(0 == ~m % 4294967296); {12614#true} is VALID [2022-02-21 03:09:57,874 INFO L290 TraceCheckUtils]: 17: Hoare triple {12614#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {12614#true} is VALID [2022-02-21 03:09:57,875 INFO L272 TraceCheckUtils]: 16: Hoare triple {12692#(<= |ULTIMATE.start_main_~a~0#1| 0)} call main_#t~ret24#1 := base2flt(main_~mb~2#1, main_~eb~2#1); {12614#true} is VALID [2022-02-21 03:09:57,875 INFO L290 TraceCheckUtils]: 15: Hoare triple {12688#(<= |ULTIMATE.start_main_#t~ret23#1| 0)} main_~a~0#1 := main_#t~ret23#1;havoc main_#t~ret23#1; {12692#(<= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-21 03:09:57,876 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {12681#(<= |base2flt_#res| 0)} {12614#true} #455#return; {12688#(<= |ULTIMATE.start_main_#t~ret23#1| 0)} is VALID [2022-02-21 03:09:57,876 INFO L290 TraceCheckUtils]: 13: Hoare triple {12681#(<= |base2flt_#res| 0)} assume true; {12681#(<= |base2flt_#res| 0)} is VALID [2022-02-21 03:09:57,876 INFO L290 TraceCheckUtils]: 12: Hoare triple {12677#(<= base2flt_~__retres4~0 0)} #res := ~__retres4~0; {12681#(<= |base2flt_#res| 0)} is VALID [2022-02-21 03:09:57,876 INFO L290 TraceCheckUtils]: 11: Hoare triple {12614#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {12677#(<= base2flt_~__retres4~0 0)} is VALID [2022-02-21 03:09:57,877 INFO L290 TraceCheckUtils]: 10: Hoare triple {12614#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {12614#true} is VALID [2022-02-21 03:09:57,877 INFO L272 TraceCheckUtils]: 9: Hoare triple {12614#true} call main_#t~ret23#1 := base2flt(main_~ma~2#1, main_~ea~2#1); {12614#true} is VALID [2022-02-21 03:09:57,877 INFO L290 TraceCheckUtils]: 8: Hoare triple {12614#true} main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1; {12614#true} is VALID [2022-02-21 03:09:57,877 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {12614#true} {12614#true} #453#return; {12614#true} is VALID [2022-02-21 03:09:57,877 INFO L290 TraceCheckUtils]: 6: Hoare triple {12614#true} assume true; {12614#true} is VALID [2022-02-21 03:09:57,877 INFO L290 TraceCheckUtils]: 5: Hoare triple {12614#true} #res := ~__retres4~0; {12614#true} is VALID [2022-02-21 03:09:57,877 INFO L290 TraceCheckUtils]: 4: Hoare triple {12614#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {12614#true} is VALID [2022-02-21 03:09:57,877 INFO L290 TraceCheckUtils]: 3: Hoare triple {12614#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {12614#true} is VALID [2022-02-21 03:09:57,877 INFO L272 TraceCheckUtils]: 2: Hoare triple {12614#true} call main_#t~ret22#1 := base2flt(0, 0); {12614#true} is VALID [2022-02-21 03:09:57,877 INFO L290 TraceCheckUtils]: 1: Hoare triple {12614#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_~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_add~0#1, main_~zero~0#1, main_~sa~0#1, main_~sb~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~tmp___1~0#1, main_~tmp___2~0#1, main_~tmp___3~0#1, main_~tmp___4~0#1, main_~tmp___5~0#1, main_~tmp___6~0#1, main_~tmp___7~0#1, main_~tmp___8~0#1, main_~tmp___9~0#1, main_~__retres23~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_add~0#1;havoc main_~zero~0#1;havoc main_~sa~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_~tmp___2~0#1;havoc main_~tmp___3~0#1;havoc main_~tmp___4~0#1;havoc main_~tmp___5~0#1;havoc main_~tmp___6~0#1;havoc main_~tmp___7~0#1;havoc main_~tmp___8~0#1;havoc main_~tmp___9~0#1;havoc main_~__retres23~0#1; {12614#true} is VALID [2022-02-21 03:09:57,877 INFO L290 TraceCheckUtils]: 0: Hoare triple {12614#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(24, 2);call #Ultimate.allocInit(12, 3); {12614#true} is VALID [2022-02-21 03:09:57,877 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-02-21 03:09:57,877 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [976265995] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:09:57,877 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:09:57,878 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 14 [2022-02-21 03:09:57,878 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847322572] [2022-02-21 03:09:57,878 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:09:57,878 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 11 states have internal predecessors, (43), 3 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Word has length 38 [2022-02-21 03:09:57,878 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:09:57,879 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 11 states have internal predecessors, (43), 3 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2022-02-21 03:09:57,915 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:09:57,916 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-02-21 03:09:57,916 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:09:57,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-02-21 03:09:57,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2022-02-21 03:09:57,916 INFO L87 Difference]: Start difference. First operand 180 states and 238 transitions. Second operand has 14 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 11 states have internal predecessors, (43), 3 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2022-02-21 03:09:59,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:09:59,203 INFO L93 Difference]: Finished difference Result 450 states and 559 transitions. [2022-02-21 03:09:59,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-21 03:09:59,204 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 11 states have internal predecessors, (43), 3 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Word has length 38 [2022-02-21 03:09:59,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:09:59,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 11 states have internal predecessors, (43), 3 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2022-02-21 03:09:59,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 401 transitions. [2022-02-21 03:09:59,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 11 states have internal predecessors, (43), 3 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2022-02-21 03:09:59,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 401 transitions. [2022-02-21 03:09:59,209 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 401 transitions. [2022-02-21 03:09:59,456 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 401 edges. 401 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:09:59,463 INFO L225 Difference]: With dead ends: 450 [2022-02-21 03:09:59,463 INFO L226 Difference]: Without dead ends: 386 [2022-02-21 03:09:59,463 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 75 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=250, Unknown=0, NotChecked=0, Total=306 [2022-02-21 03:09:59,464 INFO L933 BasicCegarLoop]: 162 mSDtfsCounter, 295 mSDsluCounter, 1523 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 299 SdHoareTripleChecker+Valid, 1685 SdHoareTripleChecker+Invalid, 282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-21 03:09:59,464 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [299 Valid, 1685 Invalid, 282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-21 03:09:59,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2022-02-21 03:09:59,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 194. [2022-02-21 03:09:59,516 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:09:59,517 INFO L82 GeneralOperation]: Start isEquivalent. First operand 386 states. Second operand has 194 states, 173 states have (on average 1.4046242774566473) internal successors, (243), 182 states have internal predecessors, (243), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (7), 7 states have call predecessors, (7), 6 states have call successors, (7) [2022-02-21 03:09:59,517 INFO L74 IsIncluded]: Start isIncluded. First operand 386 states. Second operand has 194 states, 173 states have (on average 1.4046242774566473) internal successors, (243), 182 states have internal predecessors, (243), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (7), 7 states have call predecessors, (7), 6 states have call successors, (7) [2022-02-21 03:09:59,517 INFO L87 Difference]: Start difference. First operand 386 states. Second operand has 194 states, 173 states have (on average 1.4046242774566473) internal successors, (243), 182 states have internal predecessors, (243), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (7), 7 states have call predecessors, (7), 6 states have call successors, (7) [2022-02-21 03:09:59,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:09:59,525 INFO L93 Difference]: Finished difference Result 386 states and 483 transitions. [2022-02-21 03:09:59,525 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 483 transitions. [2022-02-21 03:09:59,526 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:09:59,526 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:09:59,526 INFO L74 IsIncluded]: Start isIncluded. First operand has 194 states, 173 states have (on average 1.4046242774566473) internal successors, (243), 182 states have internal predecessors, (243), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (7), 7 states have call predecessors, (7), 6 states have call successors, (7) Second operand 386 states. [2022-02-21 03:09:59,527 INFO L87 Difference]: Start difference. First operand has 194 states, 173 states have (on average 1.4046242774566473) internal successors, (243), 182 states have internal predecessors, (243), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (7), 7 states have call predecessors, (7), 6 states have call successors, (7) Second operand 386 states. [2022-02-21 03:09:59,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:09:59,545 INFO L93 Difference]: Finished difference Result 386 states and 483 transitions. [2022-02-21 03:09:59,545 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 483 transitions. [2022-02-21 03:09:59,546 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:09:59,546 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:09:59,546 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:09:59,546 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:09:59,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 173 states have (on average 1.4046242774566473) internal successors, (243), 182 states have internal predecessors, (243), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (7), 7 states have call predecessors, (7), 6 states have call successors, (7) [2022-02-21 03:09:59,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 256 transitions. [2022-02-21 03:09:59,550 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 256 transitions. Word has length 38 [2022-02-21 03:09:59,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:09:59,550 INFO L470 AbstractCegarLoop]: Abstraction has 194 states and 256 transitions. [2022-02-21 03:09:59,550 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 11 states have internal predecessors, (43), 3 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2022-02-21 03:09:59,550 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 256 transitions. [2022-02-21 03:09:59,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-02-21 03:09:59,551 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:09:59,551 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 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:09:59,568 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:09:59,766 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,SelfDestructingSolverStorable13 [2022-02-21 03:09:59,766 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-02-21 03:09:59,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:09:59,767 INFO L85 PathProgramCache]: Analyzing trace with hash 1651959344, now seen corresponding path program 1 times [2022-02-21 03:09:59,767 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:09:59,767 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519763424] [2022-02-21 03:09:59,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:09:59,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:09:59,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:09:59,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-21 03:09:59,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:09:59,829 INFO L290 TraceCheckUtils]: 0: Hoare triple {14388#(and (= abs_77 |old(abs_77)|) (= abs_78 |old(abs_78)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {14363#true} is VALID [2022-02-21 03:09:59,829 INFO L290 TraceCheckUtils]: 1: Hoare triple {14363#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {14363#true} is VALID [2022-02-21 03:09:59,829 INFO L290 TraceCheckUtils]: 2: Hoare triple {14363#true} #res := ~__retres4~0; {14363#true} is VALID [2022-02-21 03:09:59,829 INFO L290 TraceCheckUtils]: 3: Hoare triple {14363#true} assume true; {14363#true} is VALID [2022-02-21 03:09:59,830 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {14363#true} {14363#true} #453#return; {14363#true} is VALID [2022-02-21 03:09:59,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-02-21 03:09:59,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:09:59,863 INFO L290 TraceCheckUtils]: 0: Hoare triple {14388#(and (= abs_77 |old(abs_77)|) (= abs_78 |old(abs_78)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {14363#true} is VALID [2022-02-21 03:09:59,864 INFO L290 TraceCheckUtils]: 1: Hoare triple {14363#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {14389#(and (<= base2flt_~__retres4~0 0) (<= 0 base2flt_~__retres4~0))} is VALID [2022-02-21 03:09:59,864 INFO L290 TraceCheckUtils]: 2: Hoare triple {14389#(and (<= base2flt_~__retres4~0 0) (<= 0 base2flt_~__retres4~0))} #res := ~__retres4~0; {14390#(and (<= |base2flt_#res| 0) (<= 0 |base2flt_#res|))} is VALID [2022-02-21 03:09:59,865 INFO L290 TraceCheckUtils]: 3: Hoare triple {14390#(and (<= |base2flt_#res| 0) (<= 0 |base2flt_#res|))} assume true; {14390#(and (<= |base2flt_#res| 0) (<= 0 |base2flt_#res|))} is VALID [2022-02-21 03:09:59,865 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {14390#(and (<= |base2flt_#res| 0) (<= 0 |base2flt_#res|))} {14363#true} #455#return; {14375#(= |ULTIMATE.start_main_#t~ret23#1| 0)} is VALID [2022-02-21 03:09:59,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-02-21 03:09:59,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:09:59,871 INFO L290 TraceCheckUtils]: 0: Hoare triple {14388#(and (= abs_77 |old(abs_77)|) (= abs_78 |old(abs_78)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {14363#true} is VALID [2022-02-21 03:09:59,871 INFO L290 TraceCheckUtils]: 1: Hoare triple {14363#true} assume !(0 == ~m % 4294967296); {14363#true} is VALID [2022-02-21 03:09:59,871 INFO L290 TraceCheckUtils]: 2: Hoare triple {14363#true} assume !(~m % 4294967296 < 16777216); {14363#true} is VALID [2022-02-21 03:09:59,871 INFO L290 TraceCheckUtils]: 3: Hoare triple {14363#true} assume !false; {14363#true} is VALID [2022-02-21 03:09:59,871 INFO L290 TraceCheckUtils]: 4: Hoare triple {14363#true} assume ~m % 4294967296 >= 33554432; {14363#true} is VALID [2022-02-21 03:09:59,871 INFO L290 TraceCheckUtils]: 5: Hoare triple {14363#true} assume ~e >= 127;~__retres4~0 := 4294967295; {14363#true} is VALID [2022-02-21 03:09:59,872 INFO L290 TraceCheckUtils]: 6: Hoare triple {14363#true} #res := ~__retres4~0; {14363#true} is VALID [2022-02-21 03:09:59,872 INFO L290 TraceCheckUtils]: 7: Hoare triple {14363#true} assume true; {14363#true} is VALID [2022-02-21 03:09:59,872 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {14363#true} {14376#(= |ULTIMATE.start_main_~a~0#1| 0)} #457#return; {14376#(= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-21 03:09:59,872 INFO L290 TraceCheckUtils]: 0: Hoare triple {14363#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(24, 2);call #Ultimate.allocInit(12, 3); {14363#true} is VALID [2022-02-21 03:09:59,873 INFO L290 TraceCheckUtils]: 1: Hoare triple {14363#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_~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_add~0#1, main_~zero~0#1, main_~sa~0#1, main_~sb~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~tmp___1~0#1, main_~tmp___2~0#1, main_~tmp___3~0#1, main_~tmp___4~0#1, main_~tmp___5~0#1, main_~tmp___6~0#1, main_~tmp___7~0#1, main_~tmp___8~0#1, main_~tmp___9~0#1, main_~__retres23~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_add~0#1;havoc main_~zero~0#1;havoc main_~sa~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_~tmp___2~0#1;havoc main_~tmp___3~0#1;havoc main_~tmp___4~0#1;havoc main_~tmp___5~0#1;havoc main_~tmp___6~0#1;havoc main_~tmp___7~0#1;havoc main_~tmp___8~0#1;havoc main_~tmp___9~0#1;havoc main_~__retres23~0#1; {14363#true} is VALID [2022-02-21 03:09:59,873 INFO L272 TraceCheckUtils]: 2: Hoare triple {14363#true} call main_#t~ret22#1 := base2flt(0, 0); {14388#(and (= abs_77 |old(abs_77)|) (= abs_78 |old(abs_78)|))} is VALID [2022-02-21 03:09:59,873 INFO L290 TraceCheckUtils]: 3: Hoare triple {14388#(and (= abs_77 |old(abs_77)|) (= abs_78 |old(abs_78)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {14363#true} is VALID [2022-02-21 03:09:59,873 INFO L290 TraceCheckUtils]: 4: Hoare triple {14363#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {14363#true} is VALID [2022-02-21 03:09:59,873 INFO L290 TraceCheckUtils]: 5: Hoare triple {14363#true} #res := ~__retres4~0; {14363#true} is VALID [2022-02-21 03:09:59,874 INFO L290 TraceCheckUtils]: 6: Hoare triple {14363#true} assume true; {14363#true} is VALID [2022-02-21 03:09:59,874 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {14363#true} {14363#true} #453#return; {14363#true} is VALID [2022-02-21 03:09:59,874 INFO L290 TraceCheckUtils]: 8: Hoare triple {14363#true} main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1; {14363#true} is VALID [2022-02-21 03:09:59,874 INFO L272 TraceCheckUtils]: 9: Hoare triple {14363#true} call main_#t~ret23#1 := base2flt(main_~ma~2#1, main_~ea~2#1); {14388#(and (= abs_77 |old(abs_77)|) (= abs_78 |old(abs_78)|))} is VALID [2022-02-21 03:09:59,875 INFO L290 TraceCheckUtils]: 10: Hoare triple {14388#(and (= abs_77 |old(abs_77)|) (= abs_78 |old(abs_78)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {14363#true} is VALID [2022-02-21 03:09:59,875 INFO L290 TraceCheckUtils]: 11: Hoare triple {14363#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {14389#(and (<= base2flt_~__retres4~0 0) (<= 0 base2flt_~__retres4~0))} is VALID [2022-02-21 03:09:59,875 INFO L290 TraceCheckUtils]: 12: Hoare triple {14389#(and (<= base2flt_~__retres4~0 0) (<= 0 base2flt_~__retres4~0))} #res := ~__retres4~0; {14390#(and (<= |base2flt_#res| 0) (<= 0 |base2flt_#res|))} is VALID [2022-02-21 03:09:59,876 INFO L290 TraceCheckUtils]: 13: Hoare triple {14390#(and (<= |base2flt_#res| 0) (<= 0 |base2flt_#res|))} assume true; {14390#(and (<= |base2flt_#res| 0) (<= 0 |base2flt_#res|))} is VALID [2022-02-21 03:09:59,876 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {14390#(and (<= |base2flt_#res| 0) (<= 0 |base2flt_#res|))} {14363#true} #455#return; {14375#(= |ULTIMATE.start_main_#t~ret23#1| 0)} is VALID [2022-02-21 03:09:59,877 INFO L290 TraceCheckUtils]: 15: Hoare triple {14375#(= |ULTIMATE.start_main_#t~ret23#1| 0)} main_~a~0#1 := main_#t~ret23#1;havoc main_#t~ret23#1; {14376#(= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-21 03:09:59,877 INFO L272 TraceCheckUtils]: 16: Hoare triple {14376#(= |ULTIMATE.start_main_~a~0#1| 0)} call main_#t~ret24#1 := base2flt(main_~mb~2#1, main_~eb~2#1); {14388#(and (= abs_77 |old(abs_77)|) (= abs_78 |old(abs_78)|))} is VALID [2022-02-21 03:09:59,877 INFO L290 TraceCheckUtils]: 17: Hoare triple {14388#(and (= abs_77 |old(abs_77)|) (= abs_78 |old(abs_78)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {14363#true} is VALID [2022-02-21 03:09:59,878 INFO L290 TraceCheckUtils]: 18: Hoare triple {14363#true} assume !(0 == ~m % 4294967296); {14363#true} is VALID [2022-02-21 03:09:59,878 INFO L290 TraceCheckUtils]: 19: Hoare triple {14363#true} assume !(~m % 4294967296 < 16777216); {14363#true} is VALID [2022-02-21 03:09:59,878 INFO L290 TraceCheckUtils]: 20: Hoare triple {14363#true} assume !false; {14363#true} is VALID [2022-02-21 03:09:59,878 INFO L290 TraceCheckUtils]: 21: Hoare triple {14363#true} assume ~m % 4294967296 >= 33554432; {14363#true} is VALID [2022-02-21 03:09:59,878 INFO L290 TraceCheckUtils]: 22: Hoare triple {14363#true} assume ~e >= 127;~__retres4~0 := 4294967295; {14363#true} is VALID [2022-02-21 03:09:59,878 INFO L290 TraceCheckUtils]: 23: Hoare triple {14363#true} #res := ~__retres4~0; {14363#true} is VALID [2022-02-21 03:09:59,878 INFO L290 TraceCheckUtils]: 24: Hoare triple {14363#true} assume true; {14363#true} is VALID [2022-02-21 03:09:59,879 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {14363#true} {14376#(= |ULTIMATE.start_main_~a~0#1| 0)} #457#return; {14376#(= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-21 03:09:59,879 INFO L290 TraceCheckUtils]: 26: Hoare triple {14376#(= |ULTIMATE.start_main_~a~0#1| 0)} main_~b~0#1 := main_#t~ret24#1;havoc main_#t~ret24#1; {14376#(= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-21 03:09:59,879 INFO L290 TraceCheckUtils]: 27: Hoare triple {14376#(= |ULTIMATE.start_main_~a~0#1| 0)} assume main_~a~0#1 % 4294967296 < main_~zero~0#1 % 4294967296;main_~sa~0#1 := -1; {14376#(= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-21 03:09:59,880 INFO L290 TraceCheckUtils]: 28: Hoare triple {14376#(= |ULTIMATE.start_main_~a~0#1| 0)} assume main_~b~0#1 % 4294967296 < main_~zero~0#1 % 4294967296;main_~sb~0#1 := -1; {14376#(= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-21 03:09:59,880 INFO L290 TraceCheckUtils]: 29: Hoare triple {14376#(= |ULTIMATE.start_main_~a~0#1| 0)} assume { :begin_inline_addflt } true;addflt_#in~a#1, addflt_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc addflt_#res#1;havoc addflt_#t~nondet6#1, addflt_#t~nondet7#1, addflt_#t~nondet8#1, addflt_#t~nondet9#1, addflt_#t~nondet10#1, addflt_#t~nondet11#1, addflt_~a#1, addflt_~b#1, addflt_~res~1#1, addflt_~ma~0#1, addflt_~mb~0#1, addflt_~delta~0#1, addflt_~ea~0#1, addflt_~eb~0#1, addflt_~tmp~0#1, addflt_~__retres10~0#1;addflt_~a#1 := addflt_#in~a#1;addflt_~b#1 := addflt_#in~b#1;havoc addflt_~res~1#1;havoc addflt_~ma~0#1;havoc addflt_~mb~0#1;havoc addflt_~delta~0#1;havoc addflt_~ea~0#1;havoc addflt_~eb~0#1;havoc addflt_~tmp~0#1;havoc addflt_~__retres10~0#1; {14386#(= |ULTIMATE.start_addflt_~a#1| 0)} is VALID [2022-02-21 03:09:59,880 INFO L290 TraceCheckUtils]: 30: Hoare triple {14386#(= |ULTIMATE.start_addflt_~a#1| 0)} assume addflt_~a#1 % 4294967296 < addflt_~b#1 % 4294967296;addflt_~tmp~0#1 := addflt_~a#1;addflt_~a#1 := addflt_~b#1;addflt_~b#1 := addflt_~tmp~0#1; {14387#(= |ULTIMATE.start_addflt_~b#1| 0)} is VALID [2022-02-21 03:09:59,881 INFO L290 TraceCheckUtils]: 31: Hoare triple {14387#(= |ULTIMATE.start_addflt_~b#1| 0)} assume !(0 == addflt_~b#1 % 4294967296); {14364#false} is VALID [2022-02-21 03:09:59,881 INFO L290 TraceCheckUtils]: 32: Hoare triple {14364#false} assume !(0 == addflt_~a#1); {14364#false} is VALID [2022-02-21 03:09:59,881 INFO L290 TraceCheckUtils]: 33: Hoare triple {14364#false} assume !false; {14364#false} is VALID [2022-02-21 03:09:59,881 INFO L290 TraceCheckUtils]: 34: Hoare triple {14364#false} assume !false; {14364#false} is VALID [2022-02-21 03:09:59,881 INFO L290 TraceCheckUtils]: 35: Hoare triple {14364#false} assume addflt_~a#1 >= 0;abs_109 := (if addflt_~a#1 < 16777215 then addflt_~a#1 else 16777215);assume addflt_~a#1 >= 0;assume addflt_~ma~0#1 < abs_109; {14364#false} is VALID [2022-02-21 03:09:59,881 INFO L290 TraceCheckUtils]: 36: Hoare triple {14364#false} assume (if addflt_~a#1 / 16777216 % 4294967296 % 4294967296 <= 2147483647 then addflt_~a#1 / 16777216 % 4294967296 % 4294967296 else addflt_~a#1 / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 <= 2147483647; {14364#false} is VALID [2022-02-21 03:09:59,881 INFO L290 TraceCheckUtils]: 37: Hoare triple {14364#false} assume !((if addflt_~a#1 / 16777216 % 4294967296 % 4294967296 <= 2147483647 then addflt_~a#1 / 16777216 % 4294967296 % 4294967296 else addflt_~a#1 / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 >= -2147483648); {14364#false} is VALID [2022-02-21 03:09:59,882 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-02-21 03:09:59,882 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:09:59,882 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519763424] [2022-02-21 03:09:59,882 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [519763424] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:09:59,882 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1244484961] [2022-02-21 03:09:59,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:09:59,882 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:09:59,883 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:09:59,884 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:09:59,885 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:09:59,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:09:59,928 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 22 conjunts are in the unsatisfiable core [2022-02-21 03:09:59,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:09:59,939 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:10:00,068 INFO L290 TraceCheckUtils]: 0: Hoare triple {14363#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(24, 2);call #Ultimate.allocInit(12, 3); {14363#true} is VALID [2022-02-21 03:10:00,068 INFO L290 TraceCheckUtils]: 1: Hoare triple {14363#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_~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_add~0#1, main_~zero~0#1, main_~sa~0#1, main_~sb~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~tmp___1~0#1, main_~tmp___2~0#1, main_~tmp___3~0#1, main_~tmp___4~0#1, main_~tmp___5~0#1, main_~tmp___6~0#1, main_~tmp___7~0#1, main_~tmp___8~0#1, main_~tmp___9~0#1, main_~__retres23~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_add~0#1;havoc main_~zero~0#1;havoc main_~sa~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_~tmp___2~0#1;havoc main_~tmp___3~0#1;havoc main_~tmp___4~0#1;havoc main_~tmp___5~0#1;havoc main_~tmp___6~0#1;havoc main_~tmp___7~0#1;havoc main_~tmp___8~0#1;havoc main_~tmp___9~0#1;havoc main_~__retres23~0#1; {14363#true} is VALID [2022-02-21 03:10:00,068 INFO L272 TraceCheckUtils]: 2: Hoare triple {14363#true} call main_#t~ret22#1 := base2flt(0, 0); {14363#true} is VALID [2022-02-21 03:10:00,068 INFO L290 TraceCheckUtils]: 3: Hoare triple {14363#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {14403#(= base2flt_~m |base2flt_#in~m|)} is VALID [2022-02-21 03:10:00,068 INFO L290 TraceCheckUtils]: 4: Hoare triple {14403#(= base2flt_~m |base2flt_#in~m|)} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {14407#(<= (mod |base2flt_#in~m| 4294967296) 0)} is VALID [2022-02-21 03:10:00,069 INFO L290 TraceCheckUtils]: 5: Hoare triple {14407#(<= (mod |base2flt_#in~m| 4294967296) 0)} #res := ~__retres4~0; {14407#(<= (mod |base2flt_#in~m| 4294967296) 0)} is VALID [2022-02-21 03:10:00,069 INFO L290 TraceCheckUtils]: 6: Hoare triple {14407#(<= (mod |base2flt_#in~m| 4294967296) 0)} assume true; {14407#(<= (mod |base2flt_#in~m| 4294967296) 0)} is VALID [2022-02-21 03:10:00,069 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {14407#(<= (mod |base2flt_#in~m| 4294967296) 0)} {14363#true} #453#return; {14363#true} is VALID [2022-02-21 03:10:00,069 INFO L290 TraceCheckUtils]: 8: Hoare triple {14363#true} main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1; {14363#true} is VALID [2022-02-21 03:10:00,069 INFO L272 TraceCheckUtils]: 9: Hoare triple {14363#true} call main_#t~ret23#1 := base2flt(main_~ma~2#1, main_~ea~2#1); {14363#true} is VALID [2022-02-21 03:10:00,069 INFO L290 TraceCheckUtils]: 10: Hoare triple {14363#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {14363#true} is VALID [2022-02-21 03:10:00,070 INFO L290 TraceCheckUtils]: 11: Hoare triple {14363#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {14389#(and (<= base2flt_~__retres4~0 0) (<= 0 base2flt_~__retres4~0))} is VALID [2022-02-21 03:10:00,070 INFO L290 TraceCheckUtils]: 12: Hoare triple {14389#(and (<= base2flt_~__retres4~0 0) (<= 0 base2flt_~__retres4~0))} #res := ~__retres4~0; {14390#(and (<= |base2flt_#res| 0) (<= 0 |base2flt_#res|))} is VALID [2022-02-21 03:10:00,070 INFO L290 TraceCheckUtils]: 13: Hoare triple {14390#(and (<= |base2flt_#res| 0) (<= 0 |base2flt_#res|))} assume true; {14390#(and (<= |base2flt_#res| 0) (<= 0 |base2flt_#res|))} is VALID [2022-02-21 03:10:00,071 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {14390#(and (<= |base2flt_#res| 0) (<= 0 |base2flt_#res|))} {14363#true} #455#return; {14375#(= |ULTIMATE.start_main_#t~ret23#1| 0)} is VALID [2022-02-21 03:10:00,071 INFO L290 TraceCheckUtils]: 15: Hoare triple {14375#(= |ULTIMATE.start_main_#t~ret23#1| 0)} main_~a~0#1 := main_#t~ret23#1;havoc main_#t~ret23#1; {14376#(= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-21 03:10:00,072 INFO L272 TraceCheckUtils]: 16: Hoare triple {14376#(= |ULTIMATE.start_main_~a~0#1| 0)} call main_#t~ret24#1 := base2flt(main_~mb~2#1, main_~eb~2#1); {14363#true} is VALID [2022-02-21 03:10:00,072 INFO L290 TraceCheckUtils]: 17: Hoare triple {14363#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {14363#true} is VALID [2022-02-21 03:10:00,075 INFO L290 TraceCheckUtils]: 18: Hoare triple {14363#true} assume !(0 == ~m % 4294967296); {14363#true} is VALID [2022-02-21 03:10:00,075 INFO L290 TraceCheckUtils]: 19: Hoare triple {14363#true} assume !(~m % 4294967296 < 16777216); {14363#true} is VALID [2022-02-21 03:10:00,075 INFO L290 TraceCheckUtils]: 20: Hoare triple {14363#true} assume !false; {14363#true} is VALID [2022-02-21 03:10:00,076 INFO L290 TraceCheckUtils]: 21: Hoare triple {14363#true} assume ~m % 4294967296 >= 33554432; {14363#true} is VALID [2022-02-21 03:10:00,076 INFO L290 TraceCheckUtils]: 22: Hoare triple {14363#true} assume ~e >= 127;~__retres4~0 := 4294967295; {14363#true} is VALID [2022-02-21 03:10:00,076 INFO L290 TraceCheckUtils]: 23: Hoare triple {14363#true} #res := ~__retres4~0; {14363#true} is VALID [2022-02-21 03:10:00,076 INFO L290 TraceCheckUtils]: 24: Hoare triple {14363#true} assume true; {14363#true} is VALID [2022-02-21 03:10:00,077 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {14363#true} {14376#(= |ULTIMATE.start_main_~a~0#1| 0)} #457#return; {14376#(= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-21 03:10:00,077 INFO L290 TraceCheckUtils]: 26: Hoare triple {14376#(= |ULTIMATE.start_main_~a~0#1| 0)} main_~b~0#1 := main_#t~ret24#1;havoc main_#t~ret24#1; {14376#(= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-21 03:10:00,077 INFO L290 TraceCheckUtils]: 27: Hoare triple {14376#(= |ULTIMATE.start_main_~a~0#1| 0)} assume main_~a~0#1 % 4294967296 < main_~zero~0#1 % 4294967296;main_~sa~0#1 := -1; {14376#(= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-21 03:10:00,078 INFO L290 TraceCheckUtils]: 28: Hoare triple {14376#(= |ULTIMATE.start_main_~a~0#1| 0)} assume main_~b~0#1 % 4294967296 < main_~zero~0#1 % 4294967296;main_~sb~0#1 := -1; {14376#(= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-21 03:10:00,078 INFO L290 TraceCheckUtils]: 29: Hoare triple {14376#(= |ULTIMATE.start_main_~a~0#1| 0)} assume { :begin_inline_addflt } true;addflt_#in~a#1, addflt_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc addflt_#res#1;havoc addflt_#t~nondet6#1, addflt_#t~nondet7#1, addflt_#t~nondet8#1, addflt_#t~nondet9#1, addflt_#t~nondet10#1, addflt_#t~nondet11#1, addflt_~a#1, addflt_~b#1, addflt_~res~1#1, addflt_~ma~0#1, addflt_~mb~0#1, addflt_~delta~0#1, addflt_~ea~0#1, addflt_~eb~0#1, addflt_~tmp~0#1, addflt_~__retres10~0#1;addflt_~a#1 := addflt_#in~a#1;addflt_~b#1 := addflt_#in~b#1;havoc addflt_~res~1#1;havoc addflt_~ma~0#1;havoc addflt_~mb~0#1;havoc addflt_~delta~0#1;havoc addflt_~ea~0#1;havoc addflt_~eb~0#1;havoc addflt_~tmp~0#1;havoc addflt_~__retres10~0#1; {14386#(= |ULTIMATE.start_addflt_~a#1| 0)} is VALID [2022-02-21 03:10:00,079 INFO L290 TraceCheckUtils]: 30: Hoare triple {14386#(= |ULTIMATE.start_addflt_~a#1| 0)} assume addflt_~a#1 % 4294967296 < addflt_~b#1 % 4294967296;addflt_~tmp~0#1 := addflt_~a#1;addflt_~a#1 := addflt_~b#1;addflt_~b#1 := addflt_~tmp~0#1; {14387#(= |ULTIMATE.start_addflt_~b#1| 0)} is VALID [2022-02-21 03:10:00,079 INFO L290 TraceCheckUtils]: 31: Hoare triple {14387#(= |ULTIMATE.start_addflt_~b#1| 0)} assume !(0 == addflt_~b#1 % 4294967296); {14364#false} is VALID [2022-02-21 03:10:00,079 INFO L290 TraceCheckUtils]: 32: Hoare triple {14364#false} assume !(0 == addflt_~a#1); {14364#false} is VALID [2022-02-21 03:10:00,079 INFO L290 TraceCheckUtils]: 33: Hoare triple {14364#false} assume !false; {14364#false} is VALID [2022-02-21 03:10:00,079 INFO L290 TraceCheckUtils]: 34: Hoare triple {14364#false} assume !false; {14364#false} is VALID [2022-02-21 03:10:00,080 INFO L290 TraceCheckUtils]: 35: Hoare triple {14364#false} assume addflt_~a#1 >= 0;abs_109 := (if addflt_~a#1 < 16777215 then addflt_~a#1 else 16777215);assume addflt_~a#1 >= 0;assume addflt_~ma~0#1 < abs_109; {14364#false} is VALID [2022-02-21 03:10:00,080 INFO L290 TraceCheckUtils]: 36: Hoare triple {14364#false} assume (if addflt_~a#1 / 16777216 % 4294967296 % 4294967296 <= 2147483647 then addflt_~a#1 / 16777216 % 4294967296 % 4294967296 else addflt_~a#1 / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 <= 2147483647; {14364#false} is VALID [2022-02-21 03:10:00,080 INFO L290 TraceCheckUtils]: 37: Hoare triple {14364#false} assume !((if addflt_~a#1 / 16777216 % 4294967296 % 4294967296 <= 2147483647 then addflt_~a#1 / 16777216 % 4294967296 % 4294967296 else addflt_~a#1 / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 >= -2147483648); {14364#false} is VALID [2022-02-21 03:10:00,080 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-21 03:10:00,080 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:10:00,257 INFO L290 TraceCheckUtils]: 37: Hoare triple {14364#false} assume !((if addflt_~a#1 / 16777216 % 4294967296 % 4294967296 <= 2147483647 then addflt_~a#1 / 16777216 % 4294967296 % 4294967296 else addflt_~a#1 / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 >= -2147483648); {14364#false} is VALID [2022-02-21 03:10:00,257 INFO L290 TraceCheckUtils]: 36: Hoare triple {14364#false} assume (if addflt_~a#1 / 16777216 % 4294967296 % 4294967296 <= 2147483647 then addflt_~a#1 / 16777216 % 4294967296 % 4294967296 else addflt_~a#1 / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 <= 2147483647; {14364#false} is VALID [2022-02-21 03:10:00,257 INFO L290 TraceCheckUtils]: 35: Hoare triple {14364#false} assume addflt_~a#1 >= 0;abs_109 := (if addflt_~a#1 < 16777215 then addflt_~a#1 else 16777215);assume addflt_~a#1 >= 0;assume addflt_~ma~0#1 < abs_109; {14364#false} is VALID [2022-02-21 03:10:00,257 INFO L290 TraceCheckUtils]: 34: Hoare triple {14364#false} assume !false; {14364#false} is VALID [2022-02-21 03:10:00,257 INFO L290 TraceCheckUtils]: 33: Hoare triple {14364#false} assume !false; {14364#false} is VALID [2022-02-21 03:10:00,257 INFO L290 TraceCheckUtils]: 32: Hoare triple {14364#false} assume !(0 == addflt_~a#1); {14364#false} is VALID [2022-02-21 03:10:00,257 INFO L290 TraceCheckUtils]: 31: Hoare triple {14525#(= (mod |ULTIMATE.start_addflt_~b#1| 4294967296) 0)} assume !(0 == addflt_~b#1 % 4294967296); {14364#false} is VALID [2022-02-21 03:10:00,258 INFO L290 TraceCheckUtils]: 30: Hoare triple {14529#(= (mod |ULTIMATE.start_addflt_~a#1| 4294967296) 0)} assume addflt_~a#1 % 4294967296 < addflt_~b#1 % 4294967296;addflt_~tmp~0#1 := addflt_~a#1;addflt_~a#1 := addflt_~b#1;addflt_~b#1 := addflt_~tmp~0#1; {14525#(= (mod |ULTIMATE.start_addflt_~b#1| 4294967296) 0)} is VALID [2022-02-21 03:10:00,258 INFO L290 TraceCheckUtils]: 29: Hoare triple {14533#(= (mod |ULTIMATE.start_main_~a~0#1| 4294967296) 0)} assume { :begin_inline_addflt } true;addflt_#in~a#1, addflt_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc addflt_#res#1;havoc addflt_#t~nondet6#1, addflt_#t~nondet7#1, addflt_#t~nondet8#1, addflt_#t~nondet9#1, addflt_#t~nondet10#1, addflt_#t~nondet11#1, addflt_~a#1, addflt_~b#1, addflt_~res~1#1, addflt_~ma~0#1, addflt_~mb~0#1, addflt_~delta~0#1, addflt_~ea~0#1, addflt_~eb~0#1, addflt_~tmp~0#1, addflt_~__retres10~0#1;addflt_~a#1 := addflt_#in~a#1;addflt_~b#1 := addflt_#in~b#1;havoc addflt_~res~1#1;havoc addflt_~ma~0#1;havoc addflt_~mb~0#1;havoc addflt_~delta~0#1;havoc addflt_~ea~0#1;havoc addflt_~eb~0#1;havoc addflt_~tmp~0#1;havoc addflt_~__retres10~0#1; {14529#(= (mod |ULTIMATE.start_addflt_~a#1| 4294967296) 0)} is VALID [2022-02-21 03:10:00,258 INFO L290 TraceCheckUtils]: 28: Hoare triple {14533#(= (mod |ULTIMATE.start_main_~a~0#1| 4294967296) 0)} assume main_~b~0#1 % 4294967296 < main_~zero~0#1 % 4294967296;main_~sb~0#1 := -1; {14533#(= (mod |ULTIMATE.start_main_~a~0#1| 4294967296) 0)} is VALID [2022-02-21 03:10:00,259 INFO L290 TraceCheckUtils]: 27: Hoare triple {14533#(= (mod |ULTIMATE.start_main_~a~0#1| 4294967296) 0)} assume main_~a~0#1 % 4294967296 < main_~zero~0#1 % 4294967296;main_~sa~0#1 := -1; {14533#(= (mod |ULTIMATE.start_main_~a~0#1| 4294967296) 0)} is VALID [2022-02-21 03:10:00,259 INFO L290 TraceCheckUtils]: 26: Hoare triple {14533#(= (mod |ULTIMATE.start_main_~a~0#1| 4294967296) 0)} main_~b~0#1 := main_#t~ret24#1;havoc main_#t~ret24#1; {14533#(= (mod |ULTIMATE.start_main_~a~0#1| 4294967296) 0)} is VALID [2022-02-21 03:10:00,260 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {14363#true} {14533#(= (mod |ULTIMATE.start_main_~a~0#1| 4294967296) 0)} #457#return; {14533#(= (mod |ULTIMATE.start_main_~a~0#1| 4294967296) 0)} is VALID [2022-02-21 03:10:00,260 INFO L290 TraceCheckUtils]: 24: Hoare triple {14363#true} assume true; {14363#true} is VALID [2022-02-21 03:10:00,260 INFO L290 TraceCheckUtils]: 23: Hoare triple {14363#true} #res := ~__retres4~0; {14363#true} is VALID [2022-02-21 03:10:00,260 INFO L290 TraceCheckUtils]: 22: Hoare triple {14363#true} assume ~e >= 127;~__retres4~0 := 4294967295; {14363#true} is VALID [2022-02-21 03:10:00,260 INFO L290 TraceCheckUtils]: 21: Hoare triple {14363#true} assume ~m % 4294967296 >= 33554432; {14363#true} is VALID [2022-02-21 03:10:00,260 INFO L290 TraceCheckUtils]: 20: Hoare triple {14363#true} assume !false; {14363#true} is VALID [2022-02-21 03:10:00,260 INFO L290 TraceCheckUtils]: 19: Hoare triple {14363#true} assume !(~m % 4294967296 < 16777216); {14363#true} is VALID [2022-02-21 03:10:00,260 INFO L290 TraceCheckUtils]: 18: Hoare triple {14363#true} assume !(0 == ~m % 4294967296); {14363#true} is VALID [2022-02-21 03:10:00,260 INFO L290 TraceCheckUtils]: 17: Hoare triple {14363#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {14363#true} is VALID [2022-02-21 03:10:00,260 INFO L272 TraceCheckUtils]: 16: Hoare triple {14533#(= (mod |ULTIMATE.start_main_~a~0#1| 4294967296) 0)} call main_#t~ret24#1 := base2flt(main_~mb~2#1, main_~eb~2#1); {14363#true} is VALID [2022-02-21 03:10:00,260 INFO L290 TraceCheckUtils]: 15: Hoare triple {14576#(= (mod |ULTIMATE.start_main_#t~ret23#1| 4294967296) 0)} main_~a~0#1 := main_#t~ret23#1;havoc main_#t~ret23#1; {14533#(= (mod |ULTIMATE.start_main_~a~0#1| 4294967296) 0)} is VALID [2022-02-21 03:10:00,261 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {14583#(= (mod |base2flt_#res| 4294967296) 0)} {14363#true} #455#return; {14576#(= (mod |ULTIMATE.start_main_#t~ret23#1| 4294967296) 0)} is VALID [2022-02-21 03:10:00,261 INFO L290 TraceCheckUtils]: 13: Hoare triple {14583#(= (mod |base2flt_#res| 4294967296) 0)} assume true; {14583#(= (mod |base2flt_#res| 4294967296) 0)} is VALID [2022-02-21 03:10:00,262 INFO L290 TraceCheckUtils]: 12: Hoare triple {14590#(= (mod base2flt_~__retres4~0 4294967296) 0)} #res := ~__retres4~0; {14583#(= (mod |base2flt_#res| 4294967296) 0)} is VALID [2022-02-21 03:10:00,262 INFO L290 TraceCheckUtils]: 11: Hoare triple {14363#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {14590#(= (mod base2flt_~__retres4~0 4294967296) 0)} is VALID [2022-02-21 03:10:00,262 INFO L290 TraceCheckUtils]: 10: Hoare triple {14363#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {14363#true} is VALID [2022-02-21 03:10:00,262 INFO L272 TraceCheckUtils]: 9: Hoare triple {14363#true} call main_#t~ret23#1 := base2flt(main_~ma~2#1, main_~ea~2#1); {14363#true} is VALID [2022-02-21 03:10:00,262 INFO L290 TraceCheckUtils]: 8: Hoare triple {14363#true} main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1; {14363#true} is VALID [2022-02-21 03:10:00,262 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {14363#true} {14363#true} #453#return; {14363#true} is VALID [2022-02-21 03:10:00,262 INFO L290 TraceCheckUtils]: 6: Hoare triple {14363#true} assume true; {14363#true} is VALID [2022-02-21 03:10:00,262 INFO L290 TraceCheckUtils]: 5: Hoare triple {14363#true} #res := ~__retres4~0; {14363#true} is VALID [2022-02-21 03:10:00,262 INFO L290 TraceCheckUtils]: 4: Hoare triple {14363#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {14363#true} is VALID [2022-02-21 03:10:00,263 INFO L290 TraceCheckUtils]: 3: Hoare triple {14363#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {14363#true} is VALID [2022-02-21 03:10:00,263 INFO L272 TraceCheckUtils]: 2: Hoare triple {14363#true} call main_#t~ret22#1 := base2flt(0, 0); {14363#true} is VALID [2022-02-21 03:10:00,263 INFO L290 TraceCheckUtils]: 1: Hoare triple {14363#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_~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_add~0#1, main_~zero~0#1, main_~sa~0#1, main_~sb~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~tmp___1~0#1, main_~tmp___2~0#1, main_~tmp___3~0#1, main_~tmp___4~0#1, main_~tmp___5~0#1, main_~tmp___6~0#1, main_~tmp___7~0#1, main_~tmp___8~0#1, main_~tmp___9~0#1, main_~__retres23~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_add~0#1;havoc main_~zero~0#1;havoc main_~sa~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_~tmp___2~0#1;havoc main_~tmp___3~0#1;havoc main_~tmp___4~0#1;havoc main_~tmp___5~0#1;havoc main_~tmp___6~0#1;havoc main_~tmp___7~0#1;havoc main_~tmp___8~0#1;havoc main_~tmp___9~0#1;havoc main_~__retres23~0#1; {14363#true} is VALID [2022-02-21 03:10:00,263 INFO L290 TraceCheckUtils]: 0: Hoare triple {14363#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(24, 2);call #Ultimate.allocInit(12, 3); {14363#true} is VALID [2022-02-21 03:10:00,263 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-02-21 03:10:00,263 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1244484961] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:10:00,263 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:10:00,263 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 8] total 17 [2022-02-21 03:10:00,263 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988319626] [2022-02-21 03:10:00,263 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:10:00,264 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.5294117647058822) internal successors, (43), 14 states have internal predecessors, (43), 3 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) Word has length 38 [2022-02-21 03:10:00,264 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:10:00,264 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 17 states, 17 states have (on average 2.5294117647058822) internal successors, (43), 14 states have internal predecessors, (43), 3 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2022-02-21 03:10:00,299 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:10:00,299 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-02-21 03:10:00,299 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:10:00,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-02-21 03:10:00,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2022-02-21 03:10:00,300 INFO L87 Difference]: Start difference. First operand 194 states and 256 transitions. Second operand has 17 states, 17 states have (on average 2.5294117647058822) internal successors, (43), 14 states have internal predecessors, (43), 3 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2022-02-21 03:10:01,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:01,907 INFO L93 Difference]: Finished difference Result 490 states and 640 transitions. [2022-02-21 03:10:01,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-02-21 03:10:01,907 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.5294117647058822) internal successors, (43), 14 states have internal predecessors, (43), 3 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) Word has length 38 [2022-02-21 03:10:01,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:10:01,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 2.5294117647058822) internal successors, (43), 14 states have internal predecessors, (43), 3 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2022-02-21 03:10:01,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 402 transitions. [2022-02-21 03:10:01,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 2.5294117647058822) internal successors, (43), 14 states have internal predecessors, (43), 3 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2022-02-21 03:10:01,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 402 transitions. [2022-02-21 03:10:01,913 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states and 402 transitions. [2022-02-21 03:10:02,173 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 402 edges. 402 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:10:02,178 INFO L225 Difference]: With dead ends: 490 [2022-02-21 03:10:02,178 INFO L226 Difference]: Without dead ends: 280 [2022-02-21 03:10:02,178 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 74 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=133, Invalid=679, Unknown=0, NotChecked=0, Total=812 [2022-02-21 03:10:02,179 INFO L933 BasicCegarLoop]: 106 mSDtfsCounter, 200 mSDsluCounter, 1120 mSDsCounter, 0 mSdLazyCounter, 606 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 1226 SdHoareTripleChecker+Invalid, 631 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 606 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-21 03:10:02,179 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [202 Valid, 1226 Invalid, 631 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 606 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-21 03:10:02,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2022-02-21 03:10:02,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 135. [2022-02-21 03:10:02,235 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:10:02,235 INFO L82 GeneralOperation]: Start isEquivalent. First operand 280 states. Second operand has 135 states, 116 states have (on average 1.3879310344827587) internal successors, (161), 125 states have internal predecessors, (161), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-21 03:10:02,236 INFO L74 IsIncluded]: Start isIncluded. First operand 280 states. Second operand has 135 states, 116 states have (on average 1.3879310344827587) internal successors, (161), 125 states have internal predecessors, (161), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-21 03:10:02,236 INFO L87 Difference]: Start difference. First operand 280 states. Second operand has 135 states, 116 states have (on average 1.3879310344827587) internal successors, (161), 125 states have internal predecessors, (161), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-21 03:10:02,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:02,240 INFO L93 Difference]: Finished difference Result 280 states and 356 transitions. [2022-02-21 03:10:02,241 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 356 transitions. [2022-02-21 03:10:02,241 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:10:02,241 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:10:02,242 INFO L74 IsIncluded]: Start isIncluded. First operand has 135 states, 116 states have (on average 1.3879310344827587) internal successors, (161), 125 states have internal predecessors, (161), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 280 states. [2022-02-21 03:10:02,242 INFO L87 Difference]: Start difference. First operand has 135 states, 116 states have (on average 1.3879310344827587) internal successors, (161), 125 states have internal predecessors, (161), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 280 states. [2022-02-21 03:10:02,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:02,246 INFO L93 Difference]: Finished difference Result 280 states and 356 transitions. [2022-02-21 03:10:02,246 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 356 transitions. [2022-02-21 03:10:02,247 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:10:02,247 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:10:02,247 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:10:02,247 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:10:02,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 116 states have (on average 1.3879310344827587) internal successors, (161), 125 states have internal predecessors, (161), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-21 03:10:02,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 171 transitions. [2022-02-21 03:10:02,249 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 171 transitions. Word has length 38 [2022-02-21 03:10:02,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:10:02,250 INFO L470 AbstractCegarLoop]: Abstraction has 135 states and 171 transitions. [2022-02-21 03:10:02,250 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.5294117647058822) internal successors, (43), 14 states have internal predecessors, (43), 3 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2022-02-21 03:10:02,250 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 171 transitions. [2022-02-21 03:10:02,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-02-21 03:10:02,252 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:10:02,252 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:10:02,280 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-02-21 03:10:02,469 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-02-21 03:10:02,470 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-02-21 03:10:02,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:10:02,470 INFO L85 PathProgramCache]: Analyzing trace with hash -931267937, now seen corresponding path program 2 times [2022-02-21 03:10:02,470 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:10:02,470 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798626089] [2022-02-21 03:10:02,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:10:02,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:10:02,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:02,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-21 03:10:02,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:02,544 INFO L290 TraceCheckUtils]: 0: Hoare triple {15945#(and (= abs_77 |old(abs_77)|) (= abs_78 |old(abs_78)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {15918#true} is VALID [2022-02-21 03:10:02,544 INFO L290 TraceCheckUtils]: 1: Hoare triple {15918#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {15946#(and (<= base2flt_~__retres4~0 0) (<= 0 base2flt_~__retres4~0))} is VALID [2022-02-21 03:10:02,545 INFO L290 TraceCheckUtils]: 2: Hoare triple {15946#(and (<= base2flt_~__retres4~0 0) (<= 0 base2flt_~__retres4~0))} #res := ~__retres4~0; {15947#(and (<= |base2flt_#res| 0) (<= 0 |base2flt_#res|))} is VALID [2022-02-21 03:10:02,545 INFO L290 TraceCheckUtils]: 3: Hoare triple {15947#(and (<= |base2flt_#res| 0) (<= 0 |base2flt_#res|))} assume true; {15947#(and (<= |base2flt_#res| 0) (<= 0 |base2flt_#res|))} is VALID [2022-02-21 03:10:02,546 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {15947#(and (<= |base2flt_#res| 0) (<= 0 |base2flt_#res|))} {15918#true} #453#return; {15925#(= |ULTIMATE.start_main_#t~ret22#1| 0)} is VALID [2022-02-21 03:10:02,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-02-21 03:10:02,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:02,557 INFO L290 TraceCheckUtils]: 0: Hoare triple {15945#(and (= abs_77 |old(abs_77)|) (= abs_78 |old(abs_78)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {15918#true} is VALID [2022-02-21 03:10:02,557 INFO L290 TraceCheckUtils]: 1: Hoare triple {15918#true} assume !(0 == ~m % 4294967296); {15918#true} is VALID [2022-02-21 03:10:02,557 INFO L290 TraceCheckUtils]: 2: Hoare triple {15918#true} assume !(~m % 4294967296 < 16777216); {15918#true} is VALID [2022-02-21 03:10:02,557 INFO L290 TraceCheckUtils]: 3: Hoare triple {15918#true} assume !false; {15918#true} is VALID [2022-02-21 03:10:02,557 INFO L290 TraceCheckUtils]: 4: Hoare triple {15918#true} assume ~m % 4294967296 >= 33554432; {15918#true} is VALID [2022-02-21 03:10:02,557 INFO L290 TraceCheckUtils]: 5: Hoare triple {15918#true} assume ~e >= 127;~__retres4~0 := 4294967295; {15918#true} is VALID [2022-02-21 03:10:02,558 INFO L290 TraceCheckUtils]: 6: Hoare triple {15918#true} #res := ~__retres4~0; {15918#true} is VALID [2022-02-21 03:10:02,558 INFO L290 TraceCheckUtils]: 7: Hoare triple {15918#true} assume true; {15918#true} is VALID [2022-02-21 03:10:02,558 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {15918#true} {15926#(= |ULTIMATE.start_main_~zero~0#1| 0)} #455#return; {15926#(= |ULTIMATE.start_main_~zero~0#1| 0)} is VALID [2022-02-21 03:10:02,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-02-21 03:10:02,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:02,562 INFO L290 TraceCheckUtils]: 0: Hoare triple {15945#(and (= abs_77 |old(abs_77)|) (= abs_78 |old(abs_78)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {15918#true} is VALID [2022-02-21 03:10:02,563 INFO L290 TraceCheckUtils]: 1: Hoare triple {15918#true} assume !(0 == ~m % 4294967296); {15918#true} is VALID [2022-02-21 03:10:02,563 INFO L290 TraceCheckUtils]: 2: Hoare triple {15918#true} assume !(~m % 4294967296 < 16777216); {15918#true} is VALID [2022-02-21 03:10:02,563 INFO L290 TraceCheckUtils]: 3: Hoare triple {15918#true} assume !false; {15918#true} is VALID [2022-02-21 03:10:02,563 INFO L290 TraceCheckUtils]: 4: Hoare triple {15918#true} assume ~m % 4294967296 >= 33554432; {15918#true} is VALID [2022-02-21 03:10:02,563 INFO L290 TraceCheckUtils]: 5: Hoare triple {15918#true} assume ~e >= 127;~__retres4~0 := 4294967295; {15918#true} is VALID [2022-02-21 03:10:02,563 INFO L290 TraceCheckUtils]: 6: Hoare triple {15918#true} #res := ~__retres4~0; {15918#true} is VALID [2022-02-21 03:10:02,563 INFO L290 TraceCheckUtils]: 7: Hoare triple {15918#true} assume true; {15918#true} is VALID [2022-02-21 03:10:02,564 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {15918#true} {15926#(= |ULTIMATE.start_main_~zero~0#1| 0)} #457#return; {15926#(= |ULTIMATE.start_main_~zero~0#1| 0)} is VALID [2022-02-21 03:10:02,564 INFO L290 TraceCheckUtils]: 0: Hoare triple {15918#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(24, 2);call #Ultimate.allocInit(12, 3); {15918#true} is VALID [2022-02-21 03:10:02,564 INFO L290 TraceCheckUtils]: 1: Hoare triple {15918#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_~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_add~0#1, main_~zero~0#1, main_~sa~0#1, main_~sb~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~tmp___1~0#1, main_~tmp___2~0#1, main_~tmp___3~0#1, main_~tmp___4~0#1, main_~tmp___5~0#1, main_~tmp___6~0#1, main_~tmp___7~0#1, main_~tmp___8~0#1, main_~tmp___9~0#1, main_~__retres23~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_add~0#1;havoc main_~zero~0#1;havoc main_~sa~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_~tmp___2~0#1;havoc main_~tmp___3~0#1;havoc main_~tmp___4~0#1;havoc main_~tmp___5~0#1;havoc main_~tmp___6~0#1;havoc main_~tmp___7~0#1;havoc main_~tmp___8~0#1;havoc main_~tmp___9~0#1;havoc main_~__retres23~0#1; {15918#true} is VALID [2022-02-21 03:10:02,565 INFO L272 TraceCheckUtils]: 2: Hoare triple {15918#true} call main_#t~ret22#1 := base2flt(0, 0); {15945#(and (= abs_77 |old(abs_77)|) (= abs_78 |old(abs_78)|))} is VALID [2022-02-21 03:10:02,565 INFO L290 TraceCheckUtils]: 3: Hoare triple {15945#(and (= abs_77 |old(abs_77)|) (= abs_78 |old(abs_78)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {15918#true} is VALID [2022-02-21 03:10:02,565 INFO L290 TraceCheckUtils]: 4: Hoare triple {15918#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {15946#(and (<= base2flt_~__retres4~0 0) (<= 0 base2flt_~__retres4~0))} is VALID [2022-02-21 03:10:02,565 INFO L290 TraceCheckUtils]: 5: Hoare triple {15946#(and (<= base2flt_~__retres4~0 0) (<= 0 base2flt_~__retres4~0))} #res := ~__retres4~0; {15947#(and (<= |base2flt_#res| 0) (<= 0 |base2flt_#res|))} is VALID [2022-02-21 03:10:02,566 INFO L290 TraceCheckUtils]: 6: Hoare triple {15947#(and (<= |base2flt_#res| 0) (<= 0 |base2flt_#res|))} assume true; {15947#(and (<= |base2flt_#res| 0) (<= 0 |base2flt_#res|))} is VALID [2022-02-21 03:10:02,566 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {15947#(and (<= |base2flt_#res| 0) (<= 0 |base2flt_#res|))} {15918#true} #453#return; {15925#(= |ULTIMATE.start_main_#t~ret22#1| 0)} is VALID [2022-02-21 03:10:02,567 INFO L290 TraceCheckUtils]: 8: Hoare triple {15925#(= |ULTIMATE.start_main_#t~ret22#1| 0)} main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1; {15926#(= |ULTIMATE.start_main_~zero~0#1| 0)} is VALID [2022-02-21 03:10:02,567 INFO L272 TraceCheckUtils]: 9: Hoare triple {15926#(= |ULTIMATE.start_main_~zero~0#1| 0)} call main_#t~ret23#1 := base2flt(main_~ma~2#1, main_~ea~2#1); {15945#(and (= abs_77 |old(abs_77)|) (= abs_78 |old(abs_78)|))} is VALID [2022-02-21 03:10:02,567 INFO L290 TraceCheckUtils]: 10: Hoare triple {15945#(and (= abs_77 |old(abs_77)|) (= abs_78 |old(abs_78)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {15918#true} is VALID [2022-02-21 03:10:02,567 INFO L290 TraceCheckUtils]: 11: Hoare triple {15918#true} assume !(0 == ~m % 4294967296); {15918#true} is VALID [2022-02-21 03:10:02,567 INFO L290 TraceCheckUtils]: 12: Hoare triple {15918#true} assume !(~m % 4294967296 < 16777216); {15918#true} is VALID [2022-02-21 03:10:02,567 INFO L290 TraceCheckUtils]: 13: Hoare triple {15918#true} assume !false; {15918#true} is VALID [2022-02-21 03:10:02,568 INFO L290 TraceCheckUtils]: 14: Hoare triple {15918#true} assume ~m % 4294967296 >= 33554432; {15918#true} is VALID [2022-02-21 03:10:02,568 INFO L290 TraceCheckUtils]: 15: Hoare triple {15918#true} assume ~e >= 127;~__retres4~0 := 4294967295; {15918#true} is VALID [2022-02-21 03:10:02,568 INFO L290 TraceCheckUtils]: 16: Hoare triple {15918#true} #res := ~__retres4~0; {15918#true} is VALID [2022-02-21 03:10:02,568 INFO L290 TraceCheckUtils]: 17: Hoare triple {15918#true} assume true; {15918#true} is VALID [2022-02-21 03:10:02,568 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {15918#true} {15926#(= |ULTIMATE.start_main_~zero~0#1| 0)} #455#return; {15926#(= |ULTIMATE.start_main_~zero~0#1| 0)} is VALID [2022-02-21 03:10:02,569 INFO L290 TraceCheckUtils]: 19: Hoare triple {15926#(= |ULTIMATE.start_main_~zero~0#1| 0)} main_~a~0#1 := main_#t~ret23#1;havoc main_#t~ret23#1; {15926#(= |ULTIMATE.start_main_~zero~0#1| 0)} is VALID [2022-02-21 03:10:02,569 INFO L272 TraceCheckUtils]: 20: Hoare triple {15926#(= |ULTIMATE.start_main_~zero~0#1| 0)} call main_#t~ret24#1 := base2flt(main_~mb~2#1, main_~eb~2#1); {15945#(and (= abs_77 |old(abs_77)|) (= abs_78 |old(abs_78)|))} is VALID [2022-02-21 03:10:02,569 INFO L290 TraceCheckUtils]: 21: Hoare triple {15945#(and (= abs_77 |old(abs_77)|) (= abs_78 |old(abs_78)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {15918#true} is VALID [2022-02-21 03:10:02,569 INFO L290 TraceCheckUtils]: 22: Hoare triple {15918#true} assume !(0 == ~m % 4294967296); {15918#true} is VALID [2022-02-21 03:10:02,569 INFO L290 TraceCheckUtils]: 23: Hoare triple {15918#true} assume !(~m % 4294967296 < 16777216); {15918#true} is VALID [2022-02-21 03:10:02,570 INFO L290 TraceCheckUtils]: 24: Hoare triple {15918#true} assume !false; {15918#true} is VALID [2022-02-21 03:10:02,570 INFO L290 TraceCheckUtils]: 25: Hoare triple {15918#true} assume ~m % 4294967296 >= 33554432; {15918#true} is VALID [2022-02-21 03:10:02,570 INFO L290 TraceCheckUtils]: 26: Hoare triple {15918#true} assume ~e >= 127;~__retres4~0 := 4294967295; {15918#true} is VALID [2022-02-21 03:10:02,570 INFO L290 TraceCheckUtils]: 27: Hoare triple {15918#true} #res := ~__retres4~0; {15918#true} is VALID [2022-02-21 03:10:02,570 INFO L290 TraceCheckUtils]: 28: Hoare triple {15918#true} assume true; {15918#true} is VALID [2022-02-21 03:10:02,570 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {15918#true} {15926#(= |ULTIMATE.start_main_~zero~0#1| 0)} #457#return; {15926#(= |ULTIMATE.start_main_~zero~0#1| 0)} is VALID [2022-02-21 03:10:02,571 INFO L290 TraceCheckUtils]: 30: Hoare triple {15926#(= |ULTIMATE.start_main_~zero~0#1| 0)} main_~b~0#1 := main_#t~ret24#1;havoc main_#t~ret24#1; {15926#(= |ULTIMATE.start_main_~zero~0#1| 0)} is VALID [2022-02-21 03:10:02,571 INFO L290 TraceCheckUtils]: 31: Hoare triple {15926#(= |ULTIMATE.start_main_~zero~0#1| 0)} assume main_~a~0#1 % 4294967296 < main_~zero~0#1 % 4294967296;main_~sa~0#1 := -1; {15919#false} is VALID [2022-02-21 03:10:02,571 INFO L290 TraceCheckUtils]: 32: Hoare triple {15919#false} assume main_~b~0#1 % 4294967296 < main_~zero~0#1 % 4294967296;main_~sb~0#1 := -1; {15919#false} is VALID [2022-02-21 03:10:02,571 INFO L290 TraceCheckUtils]: 33: Hoare triple {15919#false} assume { :begin_inline_addflt } true;addflt_#in~a#1, addflt_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc addflt_#res#1;havoc addflt_#t~nondet6#1, addflt_#t~nondet7#1, addflt_#t~nondet8#1, addflt_#t~nondet9#1, addflt_#t~nondet10#1, addflt_#t~nondet11#1, addflt_~a#1, addflt_~b#1, addflt_~res~1#1, addflt_~ma~0#1, addflt_~mb~0#1, addflt_~delta~0#1, addflt_~ea~0#1, addflt_~eb~0#1, addflt_~tmp~0#1, addflt_~__retres10~0#1;addflt_~a#1 := addflt_#in~a#1;addflt_~b#1 := addflt_#in~b#1;havoc addflt_~res~1#1;havoc addflt_~ma~0#1;havoc addflt_~mb~0#1;havoc addflt_~delta~0#1;havoc addflt_~ea~0#1;havoc addflt_~eb~0#1;havoc addflt_~tmp~0#1;havoc addflt_~__retres10~0#1; {15919#false} is VALID [2022-02-21 03:10:02,571 INFO L290 TraceCheckUtils]: 34: Hoare triple {15919#false} assume !(addflt_~a#1 % 4294967296 < addflt_~b#1 % 4294967296); {15919#false} is VALID [2022-02-21 03:10:02,572 INFO L290 TraceCheckUtils]: 35: Hoare triple {15919#false} assume !(0 == addflt_~b#1 % 4294967296); {15919#false} is VALID [2022-02-21 03:10:02,572 INFO L290 TraceCheckUtils]: 36: Hoare triple {15919#false} assume !(0 == addflt_~a#1); {15919#false} is VALID [2022-02-21 03:10:02,572 INFO L290 TraceCheckUtils]: 37: Hoare triple {15919#false} assume !false; {15919#false} is VALID [2022-02-21 03:10:02,572 INFO L290 TraceCheckUtils]: 38: Hoare triple {15919#false} assume !false; {15919#false} is VALID [2022-02-21 03:10:02,572 INFO L290 TraceCheckUtils]: 39: Hoare triple {15919#false} assume addflt_~a#1 >= 0;abs_109 := (if addflt_~a#1 < 16777215 then addflt_~a#1 else 16777215);assume addflt_~a#1 >= 0;assume addflt_~ma~0#1 < abs_109; {15919#false} is VALID [2022-02-21 03:10:02,572 INFO L290 TraceCheckUtils]: 40: Hoare triple {15919#false} assume (if addflt_~a#1 / 16777216 % 4294967296 % 4294967296 <= 2147483647 then addflt_~a#1 / 16777216 % 4294967296 % 4294967296 else addflt_~a#1 / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 <= 2147483647; {15919#false} is VALID [2022-02-21 03:10:02,572 INFO L290 TraceCheckUtils]: 41: Hoare triple {15919#false} assume !((if addflt_~a#1 / 16777216 % 4294967296 % 4294967296 <= 2147483647 then addflt_~a#1 / 16777216 % 4294967296 % 4294967296 else addflt_~a#1 / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 >= -2147483648); {15919#false} is VALID [2022-02-21 03:10:02,572 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-02-21 03:10:02,573 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:10:02,573 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798626089] [2022-02-21 03:10:02,573 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798626089] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:10:02,573 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [510424449] [2022-02-21 03:10:02,573 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-21 03:10:02,573 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:10:02,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:10:02,574 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:10:02,596 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-02-21 03:10:02,619 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-02-21 03:10:02,619 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-21 03:10:02,620 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 9 conjunts are in the unsatisfiable core [2022-02-21 03:10:02,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:02,630 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:10:02,719 INFO L290 TraceCheckUtils]: 0: Hoare triple {15918#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(24, 2);call #Ultimate.allocInit(12, 3); {15918#true} is VALID [2022-02-21 03:10:02,719 INFO L290 TraceCheckUtils]: 1: Hoare triple {15918#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_~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_add~0#1, main_~zero~0#1, main_~sa~0#1, main_~sb~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~tmp___1~0#1, main_~tmp___2~0#1, main_~tmp___3~0#1, main_~tmp___4~0#1, main_~tmp___5~0#1, main_~tmp___6~0#1, main_~tmp___7~0#1, main_~tmp___8~0#1, main_~tmp___9~0#1, main_~__retres23~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_add~0#1;havoc main_~zero~0#1;havoc main_~sa~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_~tmp___2~0#1;havoc main_~tmp___3~0#1;havoc main_~tmp___4~0#1;havoc main_~tmp___5~0#1;havoc main_~tmp___6~0#1;havoc main_~tmp___7~0#1;havoc main_~tmp___8~0#1;havoc main_~tmp___9~0#1;havoc main_~__retres23~0#1; {15918#true} is VALID [2022-02-21 03:10:02,719 INFO L272 TraceCheckUtils]: 2: Hoare triple {15918#true} call main_#t~ret22#1 := base2flt(0, 0); {15918#true} is VALID [2022-02-21 03:10:02,719 INFO L290 TraceCheckUtils]: 3: Hoare triple {15918#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {15918#true} is VALID [2022-02-21 03:10:02,719 INFO L290 TraceCheckUtils]: 4: Hoare triple {15918#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {15918#true} is VALID [2022-02-21 03:10:02,719 INFO L290 TraceCheckUtils]: 5: Hoare triple {15918#true} #res := ~__retres4~0; {15918#true} is VALID [2022-02-21 03:10:02,719 INFO L290 TraceCheckUtils]: 6: Hoare triple {15918#true} assume true; {15918#true} is VALID [2022-02-21 03:10:02,719 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {15918#true} {15918#true} #453#return; {15918#true} is VALID [2022-02-21 03:10:02,719 INFO L290 TraceCheckUtils]: 8: Hoare triple {15918#true} main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1; {15918#true} is VALID [2022-02-21 03:10:02,720 INFO L272 TraceCheckUtils]: 9: Hoare triple {15918#true} call main_#t~ret23#1 := base2flt(main_~ma~2#1, main_~ea~2#1); {15918#true} is VALID [2022-02-21 03:10:02,720 INFO L290 TraceCheckUtils]: 10: Hoare triple {15918#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {15918#true} is VALID [2022-02-21 03:10:02,720 INFO L290 TraceCheckUtils]: 11: Hoare triple {15918#true} assume !(0 == ~m % 4294967296); {15918#true} is VALID [2022-02-21 03:10:02,720 INFO L290 TraceCheckUtils]: 12: Hoare triple {15918#true} assume !(~m % 4294967296 < 16777216); {15918#true} is VALID [2022-02-21 03:10:02,720 INFO L290 TraceCheckUtils]: 13: Hoare triple {15918#true} assume !false; {15918#true} is VALID [2022-02-21 03:10:02,720 INFO L290 TraceCheckUtils]: 14: Hoare triple {15918#true} assume ~m % 4294967296 >= 33554432; {15918#true} is VALID [2022-02-21 03:10:02,720 INFO L290 TraceCheckUtils]: 15: Hoare triple {15918#true} assume ~e >= 127;~__retres4~0 := 4294967295; {15918#true} is VALID [2022-02-21 03:10:02,720 INFO L290 TraceCheckUtils]: 16: Hoare triple {15918#true} #res := ~__retres4~0; {15918#true} is VALID [2022-02-21 03:10:02,720 INFO L290 TraceCheckUtils]: 17: Hoare triple {15918#true} assume true; {15918#true} is VALID [2022-02-21 03:10:02,720 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {15918#true} {15918#true} #455#return; {15918#true} is VALID [2022-02-21 03:10:02,720 INFO L290 TraceCheckUtils]: 19: Hoare triple {15918#true} main_~a~0#1 := main_#t~ret23#1;havoc main_#t~ret23#1; {15918#true} is VALID [2022-02-21 03:10:02,720 INFO L272 TraceCheckUtils]: 20: Hoare triple {15918#true} call main_#t~ret24#1 := base2flt(main_~mb~2#1, main_~eb~2#1); {15918#true} is VALID [2022-02-21 03:10:02,720 INFO L290 TraceCheckUtils]: 21: Hoare triple {15918#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {15918#true} is VALID [2022-02-21 03:10:02,720 INFO L290 TraceCheckUtils]: 22: Hoare triple {15918#true} assume !(0 == ~m % 4294967296); {15918#true} is VALID [2022-02-21 03:10:02,720 INFO L290 TraceCheckUtils]: 23: Hoare triple {15918#true} assume !(~m % 4294967296 < 16777216); {15918#true} is VALID [2022-02-21 03:10:02,720 INFO L290 TraceCheckUtils]: 24: Hoare triple {15918#true} assume !false; {15918#true} is VALID [2022-02-21 03:10:02,721 INFO L290 TraceCheckUtils]: 25: Hoare triple {15918#true} assume ~m % 4294967296 >= 33554432; {15918#true} is VALID [2022-02-21 03:10:02,721 INFO L290 TraceCheckUtils]: 26: Hoare triple {15918#true} assume ~e >= 127;~__retres4~0 := 4294967295; {16029#(= 4294967295 base2flt_~__retres4~0)} is VALID [2022-02-21 03:10:02,721 INFO L290 TraceCheckUtils]: 27: Hoare triple {16029#(= 4294967295 base2flt_~__retres4~0)} #res := ~__retres4~0; {16033#(= |base2flt_#res| 4294967295)} is VALID [2022-02-21 03:10:02,721 INFO L290 TraceCheckUtils]: 28: Hoare triple {16033#(= |base2flt_#res| 4294967295)} assume true; {16033#(= |base2flt_#res| 4294967295)} is VALID [2022-02-21 03:10:02,732 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {16033#(= |base2flt_#res| 4294967295)} {15918#true} #457#return; {16040#(= 4294967295 |ULTIMATE.start_main_#t~ret24#1|)} is VALID [2022-02-21 03:10:02,732 INFO L290 TraceCheckUtils]: 30: Hoare triple {16040#(= 4294967295 |ULTIMATE.start_main_#t~ret24#1|)} main_~b~0#1 := main_#t~ret24#1;havoc main_#t~ret24#1; {16044#(= 4294967295 |ULTIMATE.start_main_~b~0#1|)} is VALID [2022-02-21 03:10:02,733 INFO L290 TraceCheckUtils]: 31: Hoare triple {16044#(= 4294967295 |ULTIMATE.start_main_~b~0#1|)} assume main_~a~0#1 % 4294967296 < main_~zero~0#1 % 4294967296;main_~sa~0#1 := -1; {16044#(= 4294967295 |ULTIMATE.start_main_~b~0#1|)} is VALID [2022-02-21 03:10:02,733 INFO L290 TraceCheckUtils]: 32: Hoare triple {16044#(= 4294967295 |ULTIMATE.start_main_~b~0#1|)} assume main_~b~0#1 % 4294967296 < main_~zero~0#1 % 4294967296;main_~sb~0#1 := -1; {15919#false} is VALID [2022-02-21 03:10:02,733 INFO L290 TraceCheckUtils]: 33: Hoare triple {15919#false} assume { :begin_inline_addflt } true;addflt_#in~a#1, addflt_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc addflt_#res#1;havoc addflt_#t~nondet6#1, addflt_#t~nondet7#1, addflt_#t~nondet8#1, addflt_#t~nondet9#1, addflt_#t~nondet10#1, addflt_#t~nondet11#1, addflt_~a#1, addflt_~b#1, addflt_~res~1#1, addflt_~ma~0#1, addflt_~mb~0#1, addflt_~delta~0#1, addflt_~ea~0#1, addflt_~eb~0#1, addflt_~tmp~0#1, addflt_~__retres10~0#1;addflt_~a#1 := addflt_#in~a#1;addflt_~b#1 := addflt_#in~b#1;havoc addflt_~res~1#1;havoc addflt_~ma~0#1;havoc addflt_~mb~0#1;havoc addflt_~delta~0#1;havoc addflt_~ea~0#1;havoc addflt_~eb~0#1;havoc addflt_~tmp~0#1;havoc addflt_~__retres10~0#1; {15919#false} is VALID [2022-02-21 03:10:02,733 INFO L290 TraceCheckUtils]: 34: Hoare triple {15919#false} assume !(addflt_~a#1 % 4294967296 < addflt_~b#1 % 4294967296); {15919#false} is VALID [2022-02-21 03:10:02,733 INFO L290 TraceCheckUtils]: 35: Hoare triple {15919#false} assume !(0 == addflt_~b#1 % 4294967296); {15919#false} is VALID [2022-02-21 03:10:02,733 INFO L290 TraceCheckUtils]: 36: Hoare triple {15919#false} assume !(0 == addflt_~a#1); {15919#false} is VALID [2022-02-21 03:10:02,734 INFO L290 TraceCheckUtils]: 37: Hoare triple {15919#false} assume !false; {15919#false} is VALID [2022-02-21 03:10:02,734 INFO L290 TraceCheckUtils]: 38: Hoare triple {15919#false} assume !false; {15919#false} is VALID [2022-02-21 03:10:02,734 INFO L290 TraceCheckUtils]: 39: Hoare triple {15919#false} assume addflt_~a#1 >= 0;abs_109 := (if addflt_~a#1 < 16777215 then addflt_~a#1 else 16777215);assume addflt_~a#1 >= 0;assume addflt_~ma~0#1 < abs_109; {15919#false} is VALID [2022-02-21 03:10:02,734 INFO L290 TraceCheckUtils]: 40: Hoare triple {15919#false} assume (if addflt_~a#1 / 16777216 % 4294967296 % 4294967296 <= 2147483647 then addflt_~a#1 / 16777216 % 4294967296 % 4294967296 else addflt_~a#1 / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 <= 2147483647; {15919#false} is VALID [2022-02-21 03:10:02,734 INFO L290 TraceCheckUtils]: 41: Hoare triple {15919#false} assume !((if addflt_~a#1 / 16777216 % 4294967296 % 4294967296 <= 2147483647 then addflt_~a#1 / 16777216 % 4294967296 % 4294967296 else addflt_~a#1 / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 >= -2147483648); {15919#false} is VALID [2022-02-21 03:10:02,734 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-02-21 03:10:02,734 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-21 03:10:02,735 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [510424449] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:10:02,735 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-21 03:10:02,735 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 11 [2022-02-21 03:10:02,735 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559221072] [2022-02-21 03:10:02,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:10:02,736 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 42 [2022-02-21 03:10:02,736 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:10:02,736 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-21 03:10:02,757 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:10:02,757 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-21 03:10:02,757 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:10:02,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-21 03:10:02,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2022-02-21 03:10:02,758 INFO L87 Difference]: Start difference. First operand 135 states and 171 transitions. Second operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-21 03:10:03,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:03,073 INFO L93 Difference]: Finished difference Result 260 states and 317 transitions. [2022-02-21 03:10:03,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-21 03:10:03,073 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 42 [2022-02-21 03:10:03,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:10:03,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-21 03:10:03,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 266 transitions. [2022-02-21 03:10:03,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-21 03:10:03,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 266 transitions. [2022-02-21 03:10:03,076 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 266 transitions. [2022-02-21 03:10:03,224 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 266 edges. 266 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:10:03,227 INFO L225 Difference]: With dead ends: 260 [2022-02-21 03:10:03,227 INFO L226 Difference]: Without dead ends: 202 [2022-02-21 03:10:03,227 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2022-02-21 03:10:03,227 INFO L933 BasicCegarLoop]: 124 mSDtfsCounter, 67 mSDsluCounter, 483 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 607 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:10:03,228 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [69 Valid, 607 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:10:03,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2022-02-21 03:10:03,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 143. [2022-02-21 03:10:03,277 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:10:03,277 INFO L82 GeneralOperation]: Start isEquivalent. First operand 202 states. Second operand has 143 states, 123 states have (on average 1.3821138211382114) internal successors, (170), 132 states have internal predecessors, (170), 5 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-02-21 03:10:03,277 INFO L74 IsIncluded]: Start isIncluded. First operand 202 states. Second operand has 143 states, 123 states have (on average 1.3821138211382114) internal successors, (170), 132 states have internal predecessors, (170), 5 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-02-21 03:10:03,278 INFO L87 Difference]: Start difference. First operand 202 states. Second operand has 143 states, 123 states have (on average 1.3821138211382114) internal successors, (170), 132 states have internal predecessors, (170), 5 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-02-21 03:10:03,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:03,281 INFO L93 Difference]: Finished difference Result 202 states and 250 transitions. [2022-02-21 03:10:03,281 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 250 transitions. [2022-02-21 03:10:03,281 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:10:03,281 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:10:03,282 INFO L74 IsIncluded]: Start isIncluded. First operand has 143 states, 123 states have (on average 1.3821138211382114) internal successors, (170), 132 states have internal predecessors, (170), 5 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Second operand 202 states. [2022-02-21 03:10:03,282 INFO L87 Difference]: Start difference. First operand has 143 states, 123 states have (on average 1.3821138211382114) internal successors, (170), 132 states have internal predecessors, (170), 5 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Second operand 202 states. [2022-02-21 03:10:03,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:03,285 INFO L93 Difference]: Finished difference Result 202 states and 250 transitions. [2022-02-21 03:10:03,285 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 250 transitions. [2022-02-21 03:10:03,285 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:10:03,286 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:10:03,286 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:10:03,286 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:10:03,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 123 states have (on average 1.3821138211382114) internal successors, (170), 132 states have internal predecessors, (170), 5 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-02-21 03:10:03,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 181 transitions. [2022-02-21 03:10:03,288 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 181 transitions. Word has length 42 [2022-02-21 03:10:03,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:10:03,288 INFO L470 AbstractCegarLoop]: Abstraction has 143 states and 181 transitions. [2022-02-21 03:10:03,288 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-21 03:10:03,288 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 181 transitions. [2022-02-21 03:10:03,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-02-21 03:10:03,289 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:10:03,289 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:10:03,309 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-02-21 03:10:03,506 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-02-21 03:10:03,507 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-02-21 03:10:03,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:10:03,507 INFO L85 PathProgramCache]: Analyzing trace with hash -1932658151, now seen corresponding path program 1 times [2022-02-21 03:10:03,507 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:10:03,507 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581667835] [2022-02-21 03:10:03,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:10:03,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:10:03,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:03,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-21 03:10:03,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:03,599 INFO L290 TraceCheckUtils]: 0: Hoare triple {16957#(and (= abs_77 |old(abs_77)|) (= abs_78 |old(abs_78)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {16930#true} is VALID [2022-02-21 03:10:03,600 INFO L290 TraceCheckUtils]: 1: Hoare triple {16930#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {16958#(and (<= base2flt_~__retres4~0 0) (<= 0 base2flt_~__retres4~0))} is VALID [2022-02-21 03:10:03,600 INFO L290 TraceCheckUtils]: 2: Hoare triple {16958#(and (<= base2flt_~__retres4~0 0) (<= 0 base2flt_~__retres4~0))} #res := ~__retres4~0; {16959#(and (<= |base2flt_#res| 0) (<= 0 |base2flt_#res|))} is VALID [2022-02-21 03:10:03,600 INFO L290 TraceCheckUtils]: 3: Hoare triple {16959#(and (<= |base2flt_#res| 0) (<= 0 |base2flt_#res|))} assume true; {16959#(and (<= |base2flt_#res| 0) (<= 0 |base2flt_#res|))} is VALID [2022-02-21 03:10:03,601 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {16959#(and (<= |base2flt_#res| 0) (<= 0 |base2flt_#res|))} {16930#true} #453#return; {16937#(= |ULTIMATE.start_main_#t~ret22#1| 0)} is VALID [2022-02-21 03:10:03,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-02-21 03:10:03,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:03,606 INFO L290 TraceCheckUtils]: 0: Hoare triple {16957#(and (= abs_77 |old(abs_77)|) (= abs_78 |old(abs_78)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {16930#true} is VALID [2022-02-21 03:10:03,607 INFO L290 TraceCheckUtils]: 1: Hoare triple {16930#true} assume !(0 == ~m % 4294967296); {16930#true} is VALID [2022-02-21 03:10:03,607 INFO L290 TraceCheckUtils]: 2: Hoare triple {16930#true} assume !(~m % 4294967296 < 16777216); {16930#true} is VALID [2022-02-21 03:10:03,607 INFO L290 TraceCheckUtils]: 3: Hoare triple {16930#true} assume !false; {16930#true} is VALID [2022-02-21 03:10:03,607 INFO L290 TraceCheckUtils]: 4: Hoare triple {16930#true} assume ~m % 4294967296 >= 33554432; {16930#true} is VALID [2022-02-21 03:10:03,607 INFO L290 TraceCheckUtils]: 5: Hoare triple {16930#true} assume ~e >= 127;~__retres4~0 := 4294967295; {16930#true} is VALID [2022-02-21 03:10:03,607 INFO L290 TraceCheckUtils]: 6: Hoare triple {16930#true} #res := ~__retres4~0; {16930#true} is VALID [2022-02-21 03:10:03,607 INFO L290 TraceCheckUtils]: 7: Hoare triple {16930#true} assume true; {16930#true} is VALID [2022-02-21 03:10:03,608 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {16930#true} {16938#(= |ULTIMATE.start_main_~zero~0#1| 0)} #455#return; {16938#(= |ULTIMATE.start_main_~zero~0#1| 0)} is VALID [2022-02-21 03:10:03,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-02-21 03:10:03,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:03,612 INFO L290 TraceCheckUtils]: 0: Hoare triple {16957#(and (= abs_77 |old(abs_77)|) (= abs_78 |old(abs_78)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {16930#true} is VALID [2022-02-21 03:10:03,612 INFO L290 TraceCheckUtils]: 1: Hoare triple {16930#true} assume !(0 == ~m % 4294967296); {16930#true} is VALID [2022-02-21 03:10:03,612 INFO L290 TraceCheckUtils]: 2: Hoare triple {16930#true} assume !(~m % 4294967296 < 16777216); {16930#true} is VALID [2022-02-21 03:10:03,612 INFO L290 TraceCheckUtils]: 3: Hoare triple {16930#true} assume !false; {16930#true} is VALID [2022-02-21 03:10:03,613 INFO L290 TraceCheckUtils]: 4: Hoare triple {16930#true} assume ~m % 4294967296 >= 33554432; {16930#true} is VALID [2022-02-21 03:10:03,613 INFO L290 TraceCheckUtils]: 5: Hoare triple {16930#true} assume ~e >= 127;~__retres4~0 := 4294967295; {16930#true} is VALID [2022-02-21 03:10:03,613 INFO L290 TraceCheckUtils]: 6: Hoare triple {16930#true} #res := ~__retres4~0; {16930#true} is VALID [2022-02-21 03:10:03,613 INFO L290 TraceCheckUtils]: 7: Hoare triple {16930#true} assume true; {16930#true} is VALID [2022-02-21 03:10:03,613 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {16930#true} {16938#(= |ULTIMATE.start_main_~zero~0#1| 0)} #457#return; {16938#(= |ULTIMATE.start_main_~zero~0#1| 0)} is VALID [2022-02-21 03:10:03,614 INFO L290 TraceCheckUtils]: 0: Hoare triple {16930#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(24, 2);call #Ultimate.allocInit(12, 3); {16930#true} is VALID [2022-02-21 03:10:03,614 INFO L290 TraceCheckUtils]: 1: Hoare triple {16930#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_~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_add~0#1, main_~zero~0#1, main_~sa~0#1, main_~sb~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~tmp___1~0#1, main_~tmp___2~0#1, main_~tmp___3~0#1, main_~tmp___4~0#1, main_~tmp___5~0#1, main_~tmp___6~0#1, main_~tmp___7~0#1, main_~tmp___8~0#1, main_~tmp___9~0#1, main_~__retres23~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_add~0#1;havoc main_~zero~0#1;havoc main_~sa~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_~tmp___2~0#1;havoc main_~tmp___3~0#1;havoc main_~tmp___4~0#1;havoc main_~tmp___5~0#1;havoc main_~tmp___6~0#1;havoc main_~tmp___7~0#1;havoc main_~tmp___8~0#1;havoc main_~tmp___9~0#1;havoc main_~__retres23~0#1; {16930#true} is VALID [2022-02-21 03:10:03,614 INFO L272 TraceCheckUtils]: 2: Hoare triple {16930#true} call main_#t~ret22#1 := base2flt(0, 0); {16957#(and (= abs_77 |old(abs_77)|) (= abs_78 |old(abs_78)|))} is VALID [2022-02-21 03:10:03,614 INFO L290 TraceCheckUtils]: 3: Hoare triple {16957#(and (= abs_77 |old(abs_77)|) (= abs_78 |old(abs_78)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {16930#true} is VALID [2022-02-21 03:10:03,615 INFO L290 TraceCheckUtils]: 4: Hoare triple {16930#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {16958#(and (<= base2flt_~__retres4~0 0) (<= 0 base2flt_~__retres4~0))} is VALID [2022-02-21 03:10:03,615 INFO L290 TraceCheckUtils]: 5: Hoare triple {16958#(and (<= base2flt_~__retres4~0 0) (<= 0 base2flt_~__retres4~0))} #res := ~__retres4~0; {16959#(and (<= |base2flt_#res| 0) (<= 0 |base2flt_#res|))} is VALID [2022-02-21 03:10:03,615 INFO L290 TraceCheckUtils]: 6: Hoare triple {16959#(and (<= |base2flt_#res| 0) (<= 0 |base2flt_#res|))} assume true; {16959#(and (<= |base2flt_#res| 0) (<= 0 |base2flt_#res|))} is VALID [2022-02-21 03:10:03,616 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {16959#(and (<= |base2flt_#res| 0) (<= 0 |base2flt_#res|))} {16930#true} #453#return; {16937#(= |ULTIMATE.start_main_#t~ret22#1| 0)} is VALID [2022-02-21 03:10:03,616 INFO L290 TraceCheckUtils]: 8: Hoare triple {16937#(= |ULTIMATE.start_main_#t~ret22#1| 0)} main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1; {16938#(= |ULTIMATE.start_main_~zero~0#1| 0)} is VALID [2022-02-21 03:10:03,617 INFO L272 TraceCheckUtils]: 9: Hoare triple {16938#(= |ULTIMATE.start_main_~zero~0#1| 0)} call main_#t~ret23#1 := base2flt(main_~ma~2#1, main_~ea~2#1); {16957#(and (= abs_77 |old(abs_77)|) (= abs_78 |old(abs_78)|))} is VALID [2022-02-21 03:10:03,617 INFO L290 TraceCheckUtils]: 10: Hoare triple {16957#(and (= abs_77 |old(abs_77)|) (= abs_78 |old(abs_78)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {16930#true} is VALID [2022-02-21 03:10:03,617 INFO L290 TraceCheckUtils]: 11: Hoare triple {16930#true} assume !(0 == ~m % 4294967296); {16930#true} is VALID [2022-02-21 03:10:03,617 INFO L290 TraceCheckUtils]: 12: Hoare triple {16930#true} assume !(~m % 4294967296 < 16777216); {16930#true} is VALID [2022-02-21 03:10:03,617 INFO L290 TraceCheckUtils]: 13: Hoare triple {16930#true} assume !false; {16930#true} is VALID [2022-02-21 03:10:03,617 INFO L290 TraceCheckUtils]: 14: Hoare triple {16930#true} assume ~m % 4294967296 >= 33554432; {16930#true} is VALID [2022-02-21 03:10:03,617 INFO L290 TraceCheckUtils]: 15: Hoare triple {16930#true} assume ~e >= 127;~__retres4~0 := 4294967295; {16930#true} is VALID [2022-02-21 03:10:03,617 INFO L290 TraceCheckUtils]: 16: Hoare triple {16930#true} #res := ~__retres4~0; {16930#true} is VALID [2022-02-21 03:10:03,618 INFO L290 TraceCheckUtils]: 17: Hoare triple {16930#true} assume true; {16930#true} is VALID [2022-02-21 03:10:03,618 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {16930#true} {16938#(= |ULTIMATE.start_main_~zero~0#1| 0)} #455#return; {16938#(= |ULTIMATE.start_main_~zero~0#1| 0)} is VALID [2022-02-21 03:10:03,618 INFO L290 TraceCheckUtils]: 19: Hoare triple {16938#(= |ULTIMATE.start_main_~zero~0#1| 0)} main_~a~0#1 := main_#t~ret23#1;havoc main_#t~ret23#1; {16938#(= |ULTIMATE.start_main_~zero~0#1| 0)} is VALID [2022-02-21 03:10:03,619 INFO L272 TraceCheckUtils]: 20: Hoare triple {16938#(= |ULTIMATE.start_main_~zero~0#1| 0)} call main_#t~ret24#1 := base2flt(main_~mb~2#1, main_~eb~2#1); {16957#(and (= abs_77 |old(abs_77)|) (= abs_78 |old(abs_78)|))} is VALID [2022-02-21 03:10:03,619 INFO L290 TraceCheckUtils]: 21: Hoare triple {16957#(and (= abs_77 |old(abs_77)|) (= abs_78 |old(abs_78)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {16930#true} is VALID [2022-02-21 03:10:03,619 INFO L290 TraceCheckUtils]: 22: Hoare triple {16930#true} assume !(0 == ~m % 4294967296); {16930#true} is VALID [2022-02-21 03:10:03,619 INFO L290 TraceCheckUtils]: 23: Hoare triple {16930#true} assume !(~m % 4294967296 < 16777216); {16930#true} is VALID [2022-02-21 03:10:03,619 INFO L290 TraceCheckUtils]: 24: Hoare triple {16930#true} assume !false; {16930#true} is VALID [2022-02-21 03:10:03,619 INFO L290 TraceCheckUtils]: 25: Hoare triple {16930#true} assume ~m % 4294967296 >= 33554432; {16930#true} is VALID [2022-02-21 03:10:03,620 INFO L290 TraceCheckUtils]: 26: Hoare triple {16930#true} assume ~e >= 127;~__retres4~0 := 4294967295; {16930#true} is VALID [2022-02-21 03:10:03,620 INFO L290 TraceCheckUtils]: 27: Hoare triple {16930#true} #res := ~__retres4~0; {16930#true} is VALID [2022-02-21 03:10:03,620 INFO L290 TraceCheckUtils]: 28: Hoare triple {16930#true} assume true; {16930#true} is VALID [2022-02-21 03:10:03,620 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {16930#true} {16938#(= |ULTIMATE.start_main_~zero~0#1| 0)} #457#return; {16938#(= |ULTIMATE.start_main_~zero~0#1| 0)} is VALID [2022-02-21 03:10:03,621 INFO L290 TraceCheckUtils]: 30: Hoare triple {16938#(= |ULTIMATE.start_main_~zero~0#1| 0)} main_~b~0#1 := main_#t~ret24#1;havoc main_#t~ret24#1; {16938#(= |ULTIMATE.start_main_~zero~0#1| 0)} is VALID [2022-02-21 03:10:03,621 INFO L290 TraceCheckUtils]: 31: Hoare triple {16938#(= |ULTIMATE.start_main_~zero~0#1| 0)} assume main_~a~0#1 % 4294967296 < main_~zero~0#1 % 4294967296;main_~sa~0#1 := -1; {16931#false} is VALID [2022-02-21 03:10:03,621 INFO L290 TraceCheckUtils]: 32: Hoare triple {16931#false} assume !(main_~b~0#1 % 4294967296 < main_~zero~0#1 % 4294967296); {16931#false} is VALID [2022-02-21 03:10:03,621 INFO L290 TraceCheckUtils]: 33: Hoare triple {16931#false} assume main_~b~0#1 % 4294967296 > main_~zero~0#1 % 4294967296;main_~tmp___0~0#1 := 1; {16931#false} is VALID [2022-02-21 03:10:03,621 INFO L290 TraceCheckUtils]: 34: Hoare triple {16931#false} main_~sb~0#1 := main_~tmp___0~0#1; {16931#false} is VALID [2022-02-21 03:10:03,621 INFO L290 TraceCheckUtils]: 35: Hoare triple {16931#false} assume { :begin_inline_addflt } true;addflt_#in~a#1, addflt_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc addflt_#res#1;havoc addflt_#t~nondet6#1, addflt_#t~nondet7#1, addflt_#t~nondet8#1, addflt_#t~nondet9#1, addflt_#t~nondet10#1, addflt_#t~nondet11#1, addflt_~a#1, addflt_~b#1, addflt_~res~1#1, addflt_~ma~0#1, addflt_~mb~0#1, addflt_~delta~0#1, addflt_~ea~0#1, addflt_~eb~0#1, addflt_~tmp~0#1, addflt_~__retres10~0#1;addflt_~a#1 := addflt_#in~a#1;addflt_~b#1 := addflt_#in~b#1;havoc addflt_~res~1#1;havoc addflt_~ma~0#1;havoc addflt_~mb~0#1;havoc addflt_~delta~0#1;havoc addflt_~ea~0#1;havoc addflt_~eb~0#1;havoc addflt_~tmp~0#1;havoc addflt_~__retres10~0#1; {16931#false} is VALID [2022-02-21 03:10:03,621 INFO L290 TraceCheckUtils]: 36: Hoare triple {16931#false} assume !(addflt_~a#1 % 4294967296 < addflt_~b#1 % 4294967296); {16931#false} is VALID [2022-02-21 03:10:03,622 INFO L290 TraceCheckUtils]: 37: Hoare triple {16931#false} assume !(0 == addflt_~b#1 % 4294967296); {16931#false} is VALID [2022-02-21 03:10:03,622 INFO L290 TraceCheckUtils]: 38: Hoare triple {16931#false} assume !(0 == addflt_~a#1); {16931#false} is VALID [2022-02-21 03:10:03,622 INFO L290 TraceCheckUtils]: 39: Hoare triple {16931#false} assume !false; {16931#false} is VALID [2022-02-21 03:10:03,622 INFO L290 TraceCheckUtils]: 40: Hoare triple {16931#false} assume !false; {16931#false} is VALID [2022-02-21 03:10:03,622 INFO L290 TraceCheckUtils]: 41: Hoare triple {16931#false} assume addflt_~a#1 >= 0;abs_109 := (if addflt_~a#1 < 16777215 then addflt_~a#1 else 16777215);assume addflt_~a#1 >= 0;assume addflt_~ma~0#1 < abs_109; {16931#false} is VALID [2022-02-21 03:10:03,622 INFO L290 TraceCheckUtils]: 42: Hoare triple {16931#false} assume (if addflt_~a#1 / 16777216 % 4294967296 % 4294967296 <= 2147483647 then addflt_~a#1 / 16777216 % 4294967296 % 4294967296 else addflt_~a#1 / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 <= 2147483647; {16931#false} is VALID [2022-02-21 03:10:03,622 INFO L290 TraceCheckUtils]: 43: Hoare triple {16931#false} assume !((if addflt_~a#1 / 16777216 % 4294967296 % 4294967296 <= 2147483647 then addflt_~a#1 / 16777216 % 4294967296 % 4294967296 else addflt_~a#1 / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 >= -2147483648); {16931#false} is VALID [2022-02-21 03:10:03,622 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-02-21 03:10:03,623 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:10:03,623 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581667835] [2022-02-21 03:10:03,623 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [581667835] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:10:03,623 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [844357562] [2022-02-21 03:10:03,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:10:03,623 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:10:03,623 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:10:03,624 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:10:03,625 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-02-21 03:10:03,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:03,670 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 14 conjunts are in the unsatisfiable core [2022-02-21 03:10:03,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:03,679 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:10:03,788 INFO L290 TraceCheckUtils]: 0: Hoare triple {16930#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(24, 2);call #Ultimate.allocInit(12, 3); {16930#true} is VALID [2022-02-21 03:10:03,788 INFO L290 TraceCheckUtils]: 1: Hoare triple {16930#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_~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_add~0#1, main_~zero~0#1, main_~sa~0#1, main_~sb~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~tmp___1~0#1, main_~tmp___2~0#1, main_~tmp___3~0#1, main_~tmp___4~0#1, main_~tmp___5~0#1, main_~tmp___6~0#1, main_~tmp___7~0#1, main_~tmp___8~0#1, main_~tmp___9~0#1, main_~__retres23~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_add~0#1;havoc main_~zero~0#1;havoc main_~sa~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_~tmp___2~0#1;havoc main_~tmp___3~0#1;havoc main_~tmp___4~0#1;havoc main_~tmp___5~0#1;havoc main_~tmp___6~0#1;havoc main_~tmp___7~0#1;havoc main_~tmp___8~0#1;havoc main_~tmp___9~0#1;havoc main_~__retres23~0#1; {16930#true} is VALID [2022-02-21 03:10:03,788 INFO L272 TraceCheckUtils]: 2: Hoare triple {16930#true} call main_#t~ret22#1 := base2flt(0, 0); {16930#true} is VALID [2022-02-21 03:10:03,789 INFO L290 TraceCheckUtils]: 3: Hoare triple {16930#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {16972#(= base2flt_~m |base2flt_#in~m|)} is VALID [2022-02-21 03:10:03,789 INFO L290 TraceCheckUtils]: 4: Hoare triple {16972#(= base2flt_~m |base2flt_#in~m|)} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {16976#(and (<= (mod |base2flt_#in~m| 4294967296) 0) (= base2flt_~__retres4~0 0))} is VALID [2022-02-21 03:10:03,789 INFO L290 TraceCheckUtils]: 5: Hoare triple {16976#(and (<= (mod |base2flt_#in~m| 4294967296) 0) (= base2flt_~__retres4~0 0))} #res := ~__retres4~0; {16980#(and (= |base2flt_#res| 0) (<= (mod |base2flt_#in~m| 4294967296) 0))} is VALID [2022-02-21 03:10:03,790 INFO L290 TraceCheckUtils]: 6: Hoare triple {16980#(and (= |base2flt_#res| 0) (<= (mod |base2flt_#in~m| 4294967296) 0))} assume true; {16980#(and (= |base2flt_#res| 0) (<= (mod |base2flt_#in~m| 4294967296) 0))} is VALID [2022-02-21 03:10:03,790 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {16980#(and (= |base2flt_#res| 0) (<= (mod |base2flt_#in~m| 4294967296) 0))} {16930#true} #453#return; {16937#(= |ULTIMATE.start_main_#t~ret22#1| 0)} is VALID [2022-02-21 03:10:03,791 INFO L290 TraceCheckUtils]: 8: Hoare triple {16937#(= |ULTIMATE.start_main_#t~ret22#1| 0)} main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1; {16938#(= |ULTIMATE.start_main_~zero~0#1| 0)} is VALID [2022-02-21 03:10:03,791 INFO L272 TraceCheckUtils]: 9: Hoare triple {16938#(= |ULTIMATE.start_main_~zero~0#1| 0)} call main_#t~ret23#1 := base2flt(main_~ma~2#1, main_~ea~2#1); {16930#true} is VALID [2022-02-21 03:10:03,791 INFO L290 TraceCheckUtils]: 10: Hoare triple {16930#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {16930#true} is VALID [2022-02-21 03:10:03,791 INFO L290 TraceCheckUtils]: 11: Hoare triple {16930#true} assume !(0 == ~m % 4294967296); {16930#true} is VALID [2022-02-21 03:10:03,791 INFO L290 TraceCheckUtils]: 12: Hoare triple {16930#true} assume !(~m % 4294967296 < 16777216); {16930#true} is VALID [2022-02-21 03:10:03,791 INFO L290 TraceCheckUtils]: 13: Hoare triple {16930#true} assume !false; {16930#true} is VALID [2022-02-21 03:10:03,791 INFO L290 TraceCheckUtils]: 14: Hoare triple {16930#true} assume ~m % 4294967296 >= 33554432; {16930#true} is VALID [2022-02-21 03:10:03,791 INFO L290 TraceCheckUtils]: 15: Hoare triple {16930#true} assume ~e >= 127;~__retres4~0 := 4294967295; {16930#true} is VALID [2022-02-21 03:10:03,792 INFO L290 TraceCheckUtils]: 16: Hoare triple {16930#true} #res := ~__retres4~0; {16930#true} is VALID [2022-02-21 03:10:03,792 INFO L290 TraceCheckUtils]: 17: Hoare triple {16930#true} assume true; {16930#true} is VALID [2022-02-21 03:10:03,792 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {16930#true} {16938#(= |ULTIMATE.start_main_~zero~0#1| 0)} #455#return; {16938#(= |ULTIMATE.start_main_~zero~0#1| 0)} is VALID [2022-02-21 03:10:03,793 INFO L290 TraceCheckUtils]: 19: Hoare triple {16938#(= |ULTIMATE.start_main_~zero~0#1| 0)} main_~a~0#1 := main_#t~ret23#1;havoc main_#t~ret23#1; {16938#(= |ULTIMATE.start_main_~zero~0#1| 0)} is VALID [2022-02-21 03:10:03,793 INFO L272 TraceCheckUtils]: 20: Hoare triple {16938#(= |ULTIMATE.start_main_~zero~0#1| 0)} call main_#t~ret24#1 := base2flt(main_~mb~2#1, main_~eb~2#1); {16930#true} is VALID [2022-02-21 03:10:03,793 INFO L290 TraceCheckUtils]: 21: Hoare triple {16930#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {16930#true} is VALID [2022-02-21 03:10:03,793 INFO L290 TraceCheckUtils]: 22: Hoare triple {16930#true} assume !(0 == ~m % 4294967296); {16930#true} is VALID [2022-02-21 03:10:03,793 INFO L290 TraceCheckUtils]: 23: Hoare triple {16930#true} assume !(~m % 4294967296 < 16777216); {16930#true} is VALID [2022-02-21 03:10:03,793 INFO L290 TraceCheckUtils]: 24: Hoare triple {16930#true} assume !false; {16930#true} is VALID [2022-02-21 03:10:03,793 INFO L290 TraceCheckUtils]: 25: Hoare triple {16930#true} assume ~m % 4294967296 >= 33554432; {16930#true} is VALID [2022-02-21 03:10:03,793 INFO L290 TraceCheckUtils]: 26: Hoare triple {16930#true} assume ~e >= 127;~__retres4~0 := 4294967295; {16930#true} is VALID [2022-02-21 03:10:03,793 INFO L290 TraceCheckUtils]: 27: Hoare triple {16930#true} #res := ~__retres4~0; {16930#true} is VALID [2022-02-21 03:10:03,794 INFO L290 TraceCheckUtils]: 28: Hoare triple {16930#true} assume true; {16930#true} is VALID [2022-02-21 03:10:03,794 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {16930#true} {16938#(= |ULTIMATE.start_main_~zero~0#1| 0)} #457#return; {16938#(= |ULTIMATE.start_main_~zero~0#1| 0)} is VALID [2022-02-21 03:10:03,794 INFO L290 TraceCheckUtils]: 30: Hoare triple {16938#(= |ULTIMATE.start_main_~zero~0#1| 0)} main_~b~0#1 := main_#t~ret24#1;havoc main_#t~ret24#1; {16938#(= |ULTIMATE.start_main_~zero~0#1| 0)} is VALID [2022-02-21 03:10:03,795 INFO L290 TraceCheckUtils]: 31: Hoare triple {16938#(= |ULTIMATE.start_main_~zero~0#1| 0)} assume main_~a~0#1 % 4294967296 < main_~zero~0#1 % 4294967296;main_~sa~0#1 := -1; {16931#false} is VALID [2022-02-21 03:10:03,795 INFO L290 TraceCheckUtils]: 32: Hoare triple {16931#false} assume !(main_~b~0#1 % 4294967296 < main_~zero~0#1 % 4294967296); {16931#false} is VALID [2022-02-21 03:10:03,795 INFO L290 TraceCheckUtils]: 33: Hoare triple {16931#false} assume main_~b~0#1 % 4294967296 > main_~zero~0#1 % 4294967296;main_~tmp___0~0#1 := 1; {16931#false} is VALID [2022-02-21 03:10:03,795 INFO L290 TraceCheckUtils]: 34: Hoare triple {16931#false} main_~sb~0#1 := main_~tmp___0~0#1; {16931#false} is VALID [2022-02-21 03:10:03,795 INFO L290 TraceCheckUtils]: 35: Hoare triple {16931#false} assume { :begin_inline_addflt } true;addflt_#in~a#1, addflt_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc addflt_#res#1;havoc addflt_#t~nondet6#1, addflt_#t~nondet7#1, addflt_#t~nondet8#1, addflt_#t~nondet9#1, addflt_#t~nondet10#1, addflt_#t~nondet11#1, addflt_~a#1, addflt_~b#1, addflt_~res~1#1, addflt_~ma~0#1, addflt_~mb~0#1, addflt_~delta~0#1, addflt_~ea~0#1, addflt_~eb~0#1, addflt_~tmp~0#1, addflt_~__retres10~0#1;addflt_~a#1 := addflt_#in~a#1;addflt_~b#1 := addflt_#in~b#1;havoc addflt_~res~1#1;havoc addflt_~ma~0#1;havoc addflt_~mb~0#1;havoc addflt_~delta~0#1;havoc addflt_~ea~0#1;havoc addflt_~eb~0#1;havoc addflt_~tmp~0#1;havoc addflt_~__retres10~0#1; {16931#false} is VALID [2022-02-21 03:10:03,795 INFO L290 TraceCheckUtils]: 36: Hoare triple {16931#false} assume !(addflt_~a#1 % 4294967296 < addflt_~b#1 % 4294967296); {16931#false} is VALID [2022-02-21 03:10:03,795 INFO L290 TraceCheckUtils]: 37: Hoare triple {16931#false} assume !(0 == addflt_~b#1 % 4294967296); {16931#false} is VALID [2022-02-21 03:10:03,796 INFO L290 TraceCheckUtils]: 38: Hoare triple {16931#false} assume !(0 == addflt_~a#1); {16931#false} is VALID [2022-02-21 03:10:03,796 INFO L290 TraceCheckUtils]: 39: Hoare triple {16931#false} assume !false; {16931#false} is VALID [2022-02-21 03:10:03,796 INFO L290 TraceCheckUtils]: 40: Hoare triple {16931#false} assume !false; {16931#false} is VALID [2022-02-21 03:10:03,796 INFO L290 TraceCheckUtils]: 41: Hoare triple {16931#false} assume addflt_~a#1 >= 0;abs_109 := (if addflt_~a#1 < 16777215 then addflt_~a#1 else 16777215);assume addflt_~a#1 >= 0;assume addflt_~ma~0#1 < abs_109; {16931#false} is VALID [2022-02-21 03:10:03,796 INFO L290 TraceCheckUtils]: 42: Hoare triple {16931#false} assume (if addflt_~a#1 / 16777216 % 4294967296 % 4294967296 <= 2147483647 then addflt_~a#1 / 16777216 % 4294967296 % 4294967296 else addflt_~a#1 / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 <= 2147483647; {16931#false} is VALID [2022-02-21 03:10:03,796 INFO L290 TraceCheckUtils]: 43: Hoare triple {16931#false} assume !((if addflt_~a#1 / 16777216 % 4294967296 % 4294967296 <= 2147483647 then addflt_~a#1 / 16777216 % 4294967296 % 4294967296 else addflt_~a#1 / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 >= -2147483648); {16931#false} is VALID [2022-02-21 03:10:03,796 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-02-21 03:10:03,796 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:10:04,047 INFO L290 TraceCheckUtils]: 43: Hoare triple {16931#false} assume !((if addflt_~a#1 / 16777216 % 4294967296 % 4294967296 <= 2147483647 then addflt_~a#1 / 16777216 % 4294967296 % 4294967296 else addflt_~a#1 / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 >= -2147483648); {16931#false} is VALID [2022-02-21 03:10:04,048 INFO L290 TraceCheckUtils]: 42: Hoare triple {16931#false} assume (if addflt_~a#1 / 16777216 % 4294967296 % 4294967296 <= 2147483647 then addflt_~a#1 / 16777216 % 4294967296 % 4294967296 else addflt_~a#1 / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 <= 2147483647; {16931#false} is VALID [2022-02-21 03:10:04,048 INFO L290 TraceCheckUtils]: 41: Hoare triple {16931#false} assume addflt_~a#1 >= 0;abs_109 := (if addflt_~a#1 < 16777215 then addflt_~a#1 else 16777215);assume addflt_~a#1 >= 0;assume addflt_~ma~0#1 < abs_109; {16931#false} is VALID [2022-02-21 03:10:04,048 INFO L290 TraceCheckUtils]: 40: Hoare triple {16931#false} assume !false; {16931#false} is VALID [2022-02-21 03:10:04,048 INFO L290 TraceCheckUtils]: 39: Hoare triple {16931#false} assume !false; {16931#false} is VALID [2022-02-21 03:10:04,048 INFO L290 TraceCheckUtils]: 38: Hoare triple {16931#false} assume !(0 == addflt_~a#1); {16931#false} is VALID [2022-02-21 03:10:04,049 INFO L290 TraceCheckUtils]: 37: Hoare triple {16931#false} assume !(0 == addflt_~b#1 % 4294967296); {16931#false} is VALID [2022-02-21 03:10:04,049 INFO L290 TraceCheckUtils]: 36: Hoare triple {16931#false} assume !(addflt_~a#1 % 4294967296 < addflt_~b#1 % 4294967296); {16931#false} is VALID [2022-02-21 03:10:04,049 INFO L290 TraceCheckUtils]: 35: Hoare triple {16931#false} assume { :begin_inline_addflt } true;addflt_#in~a#1, addflt_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc addflt_#res#1;havoc addflt_#t~nondet6#1, addflt_#t~nondet7#1, addflt_#t~nondet8#1, addflt_#t~nondet9#1, addflt_#t~nondet10#1, addflt_#t~nondet11#1, addflt_~a#1, addflt_~b#1, addflt_~res~1#1, addflt_~ma~0#1, addflt_~mb~0#1, addflt_~delta~0#1, addflt_~ea~0#1, addflt_~eb~0#1, addflt_~tmp~0#1, addflt_~__retres10~0#1;addflt_~a#1 := addflt_#in~a#1;addflt_~b#1 := addflt_#in~b#1;havoc addflt_~res~1#1;havoc addflt_~ma~0#1;havoc addflt_~mb~0#1;havoc addflt_~delta~0#1;havoc addflt_~ea~0#1;havoc addflt_~eb~0#1;havoc addflt_~tmp~0#1;havoc addflt_~__retres10~0#1; {16931#false} is VALID [2022-02-21 03:10:04,049 INFO L290 TraceCheckUtils]: 34: Hoare triple {16931#false} main_~sb~0#1 := main_~tmp___0~0#1; {16931#false} is VALID [2022-02-21 03:10:04,049 INFO L290 TraceCheckUtils]: 33: Hoare triple {16931#false} assume main_~b~0#1 % 4294967296 > main_~zero~0#1 % 4294967296;main_~tmp___0~0#1 := 1; {16931#false} is VALID [2022-02-21 03:10:04,049 INFO L290 TraceCheckUtils]: 32: Hoare triple {16931#false} assume !(main_~b~0#1 % 4294967296 < main_~zero~0#1 % 4294967296); {16931#false} is VALID [2022-02-21 03:10:04,049 INFO L290 TraceCheckUtils]: 31: Hoare triple {17131#(<= (mod |ULTIMATE.start_main_~zero~0#1| 4294967296) 0)} assume main_~a~0#1 % 4294967296 < main_~zero~0#1 % 4294967296;main_~sa~0#1 := -1; {16931#false} is VALID [2022-02-21 03:10:04,050 INFO L290 TraceCheckUtils]: 30: Hoare triple {17131#(<= (mod |ULTIMATE.start_main_~zero~0#1| 4294967296) 0)} main_~b~0#1 := main_#t~ret24#1;havoc main_#t~ret24#1; {17131#(<= (mod |ULTIMATE.start_main_~zero~0#1| 4294967296) 0)} is VALID [2022-02-21 03:10:04,050 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {16930#true} {17131#(<= (mod |ULTIMATE.start_main_~zero~0#1| 4294967296) 0)} #457#return; {17131#(<= (mod |ULTIMATE.start_main_~zero~0#1| 4294967296) 0)} is VALID [2022-02-21 03:10:04,050 INFO L290 TraceCheckUtils]: 28: Hoare triple {16930#true} assume true; {16930#true} is VALID [2022-02-21 03:10:04,050 INFO L290 TraceCheckUtils]: 27: Hoare triple {16930#true} #res := ~__retres4~0; {16930#true} is VALID [2022-02-21 03:10:04,050 INFO L290 TraceCheckUtils]: 26: Hoare triple {16930#true} assume ~e >= 127;~__retres4~0 := 4294967295; {16930#true} is VALID [2022-02-21 03:10:04,050 INFO L290 TraceCheckUtils]: 25: Hoare triple {16930#true} assume ~m % 4294967296 >= 33554432; {16930#true} is VALID [2022-02-21 03:10:04,051 INFO L290 TraceCheckUtils]: 24: Hoare triple {16930#true} assume !false; {16930#true} is VALID [2022-02-21 03:10:04,051 INFO L290 TraceCheckUtils]: 23: Hoare triple {16930#true} assume !(~m % 4294967296 < 16777216); {16930#true} is VALID [2022-02-21 03:10:04,051 INFO L290 TraceCheckUtils]: 22: Hoare triple {16930#true} assume !(0 == ~m % 4294967296); {16930#true} is VALID [2022-02-21 03:10:04,051 INFO L290 TraceCheckUtils]: 21: Hoare triple {16930#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {16930#true} is VALID [2022-02-21 03:10:04,051 INFO L272 TraceCheckUtils]: 20: Hoare triple {17131#(<= (mod |ULTIMATE.start_main_~zero~0#1| 4294967296) 0)} call main_#t~ret24#1 := base2flt(main_~mb~2#1, main_~eb~2#1); {16930#true} is VALID [2022-02-21 03:10:04,051 INFO L290 TraceCheckUtils]: 19: Hoare triple {17131#(<= (mod |ULTIMATE.start_main_~zero~0#1| 4294967296) 0)} main_~a~0#1 := main_#t~ret23#1;havoc main_#t~ret23#1; {17131#(<= (mod |ULTIMATE.start_main_~zero~0#1| 4294967296) 0)} is VALID [2022-02-21 03:10:04,052 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {16930#true} {17131#(<= (mod |ULTIMATE.start_main_~zero~0#1| 4294967296) 0)} #455#return; {17131#(<= (mod |ULTIMATE.start_main_~zero~0#1| 4294967296) 0)} is VALID [2022-02-21 03:10:04,052 INFO L290 TraceCheckUtils]: 17: Hoare triple {16930#true} assume true; {16930#true} is VALID [2022-02-21 03:10:04,052 INFO L290 TraceCheckUtils]: 16: Hoare triple {16930#true} #res := ~__retres4~0; {16930#true} is VALID [2022-02-21 03:10:04,052 INFO L290 TraceCheckUtils]: 15: Hoare triple {16930#true} assume ~e >= 127;~__retres4~0 := 4294967295; {16930#true} is VALID [2022-02-21 03:10:04,052 INFO L290 TraceCheckUtils]: 14: Hoare triple {16930#true} assume ~m % 4294967296 >= 33554432; {16930#true} is VALID [2022-02-21 03:10:04,053 INFO L290 TraceCheckUtils]: 13: Hoare triple {16930#true} assume !false; {16930#true} is VALID [2022-02-21 03:10:04,053 INFO L290 TraceCheckUtils]: 12: Hoare triple {16930#true} assume !(~m % 4294967296 < 16777216); {16930#true} is VALID [2022-02-21 03:10:04,054 INFO L290 TraceCheckUtils]: 11: Hoare triple {16930#true} assume !(0 == ~m % 4294967296); {16930#true} is VALID [2022-02-21 03:10:04,054 INFO L290 TraceCheckUtils]: 10: Hoare triple {16930#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {16930#true} is VALID [2022-02-21 03:10:04,054 INFO L272 TraceCheckUtils]: 9: Hoare triple {17131#(<= (mod |ULTIMATE.start_main_~zero~0#1| 4294967296) 0)} call main_#t~ret23#1 := base2flt(main_~ma~2#1, main_~ea~2#1); {16930#true} is VALID [2022-02-21 03:10:04,054 INFO L290 TraceCheckUtils]: 8: Hoare triple {17201#(<= (mod |ULTIMATE.start_main_#t~ret22#1| 4294967296) 0)} main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1; {17131#(<= (mod |ULTIMATE.start_main_~zero~0#1| 4294967296) 0)} is VALID [2022-02-21 03:10:04,057 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {17208#(or (not (= |base2flt_#in~m| 0)) (<= (mod |base2flt_#res| 4294967296) 0))} {16930#true} #453#return; {17201#(<= (mod |ULTIMATE.start_main_#t~ret22#1| 4294967296) 0)} is VALID [2022-02-21 03:10:04,058 INFO L290 TraceCheckUtils]: 6: Hoare triple {17208#(or (not (= |base2flt_#in~m| 0)) (<= (mod |base2flt_#res| 4294967296) 0))} assume true; {17208#(or (not (= |base2flt_#in~m| 0)) (<= (mod |base2flt_#res| 4294967296) 0))} is VALID [2022-02-21 03:10:04,058 INFO L290 TraceCheckUtils]: 5: Hoare triple {17215#(or (<= (mod base2flt_~__retres4~0 4294967296) 0) (not (= |base2flt_#in~m| 0)))} #res := ~__retres4~0; {17208#(or (not (= |base2flt_#in~m| 0)) (<= (mod |base2flt_#res| 4294967296) 0))} is VALID [2022-02-21 03:10:04,059 INFO L290 TraceCheckUtils]: 4: Hoare triple {16930#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {17215#(or (<= (mod base2flt_~__retres4~0 4294967296) 0) (not (= |base2flt_#in~m| 0)))} is VALID [2022-02-21 03:10:04,059 INFO L290 TraceCheckUtils]: 3: Hoare triple {16930#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {16930#true} is VALID [2022-02-21 03:10:04,059 INFO L272 TraceCheckUtils]: 2: Hoare triple {16930#true} call main_#t~ret22#1 := base2flt(0, 0); {16930#true} is VALID [2022-02-21 03:10:04,059 INFO L290 TraceCheckUtils]: 1: Hoare triple {16930#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_~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_add~0#1, main_~zero~0#1, main_~sa~0#1, main_~sb~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~tmp___1~0#1, main_~tmp___2~0#1, main_~tmp___3~0#1, main_~tmp___4~0#1, main_~tmp___5~0#1, main_~tmp___6~0#1, main_~tmp___7~0#1, main_~tmp___8~0#1, main_~tmp___9~0#1, main_~__retres23~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_add~0#1;havoc main_~zero~0#1;havoc main_~sa~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_~tmp___2~0#1;havoc main_~tmp___3~0#1;havoc main_~tmp___4~0#1;havoc main_~tmp___5~0#1;havoc main_~tmp___6~0#1;havoc main_~tmp___7~0#1;havoc main_~tmp___8~0#1;havoc main_~tmp___9~0#1;havoc main_~__retres23~0#1; {16930#true} is VALID [2022-02-21 03:10:04,059 INFO L290 TraceCheckUtils]: 0: Hoare triple {16930#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(24, 2);call #Ultimate.allocInit(12, 3); {16930#true} is VALID [2022-02-21 03:10:04,059 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-02-21 03:10:04,059 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [844357562] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:10:04,059 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:10:04,059 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 6] total 14 [2022-02-21 03:10:04,060 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386558650] [2022-02-21 03:10:04,060 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:10:04,062 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.9285714285714284) internal successors, (41), 11 states have internal predecessors, (41), 3 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) Word has length 44 [2022-02-21 03:10:04,063 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:10:04,063 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 2.9285714285714284) internal successors, (41), 11 states have internal predecessors, (41), 3 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-21 03:10:04,096 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:10:04,096 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-02-21 03:10:04,096 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:10:04,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-02-21 03:10:04,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2022-02-21 03:10:04,097 INFO L87 Difference]: Start difference. First operand 143 states and 181 transitions. Second operand has 14 states, 14 states have (on average 2.9285714285714284) internal successors, (41), 11 states have internal predecessors, (41), 3 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-21 03:10:05,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:05,072 INFO L93 Difference]: Finished difference Result 306 states and 390 transitions. [2022-02-21 03:10:05,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-02-21 03:10:05,072 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.9285714285714284) internal successors, (41), 11 states have internal predecessors, (41), 3 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) Word has length 44 [2022-02-21 03:10:05,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:10:05,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 2.9285714285714284) internal successors, (41), 11 states have internal predecessors, (41), 3 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-21 03:10:05,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 267 transitions. [2022-02-21 03:10:05,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 2.9285714285714284) internal successors, (41), 11 states have internal predecessors, (41), 3 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-21 03:10:05,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 267 transitions. [2022-02-21 03:10:05,079 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 267 transitions. [2022-02-21 03:10:05,262 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 267 edges. 267 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:10:05,265 INFO L225 Difference]: With dead ends: 306 [2022-02-21 03:10:05,266 INFO L226 Difference]: Without dead ends: 244 [2022-02-21 03:10:05,266 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=111, Invalid=441, Unknown=0, NotChecked=0, Total=552 [2022-02-21 03:10:05,267 INFO L933 BasicCegarLoop]: 103 mSDtfsCounter, 381 mSDsluCounter, 537 mSDsCounter, 0 mSdLazyCounter, 277 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 383 SdHoareTripleChecker+Valid, 640 SdHoareTripleChecker+Invalid, 307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-21 03:10:05,267 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [383 Valid, 640 Invalid, 307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 277 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-21 03:10:05,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2022-02-21 03:10:05,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 135. [2022-02-21 03:10:05,315 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:10:05,316 INFO L82 GeneralOperation]: Start isEquivalent. First operand 244 states. Second operand has 135 states, 116 states have (on average 1.3706896551724137) internal successors, (159), 125 states have internal predecessors, (159), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-21 03:10:05,316 INFO L74 IsIncluded]: Start isIncluded. First operand 244 states. Second operand has 135 states, 116 states have (on average 1.3706896551724137) internal successors, (159), 125 states have internal predecessors, (159), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-21 03:10:05,316 INFO L87 Difference]: Start difference. First operand 244 states. Second operand has 135 states, 116 states have (on average 1.3706896551724137) internal successors, (159), 125 states have internal predecessors, (159), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-21 03:10:05,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:05,320 INFO L93 Difference]: Finished difference Result 244 states and 315 transitions. [2022-02-21 03:10:05,320 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 315 transitions. [2022-02-21 03:10:05,320 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:10:05,320 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:10:05,321 INFO L74 IsIncluded]: Start isIncluded. First operand has 135 states, 116 states have (on average 1.3706896551724137) internal successors, (159), 125 states have internal predecessors, (159), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 244 states. [2022-02-21 03:10:05,321 INFO L87 Difference]: Start difference. First operand has 135 states, 116 states have (on average 1.3706896551724137) internal successors, (159), 125 states have internal predecessors, (159), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 244 states. [2022-02-21 03:10:05,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:05,324 INFO L93 Difference]: Finished difference Result 244 states and 315 transitions. [2022-02-21 03:10:05,325 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 315 transitions. [2022-02-21 03:10:05,325 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:10:05,325 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:10:05,325 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:10:05,325 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:10:05,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 116 states have (on average 1.3706896551724137) internal successors, (159), 125 states have internal predecessors, (159), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-21 03:10:05,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 169 transitions. [2022-02-21 03:10:05,327 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 169 transitions. Word has length 44 [2022-02-21 03:10:05,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:10:05,327 INFO L470 AbstractCegarLoop]: Abstraction has 135 states and 169 transitions. [2022-02-21 03:10:05,328 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.9285714285714284) internal successors, (41), 11 states have internal predecessors, (41), 3 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2022-02-21 03:10:05,328 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 169 transitions. [2022-02-21 03:10:05,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-02-21 03:10:05,328 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:10:05,328 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:10:05,353 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-02-21 03:10:05,545 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-02-21 03:10:05,545 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-02-21 03:10:05,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:10:05,545 INFO L85 PathProgramCache]: Analyzing trace with hash -1236341633, now seen corresponding path program 1 times [2022-02-21 03:10:05,545 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:10:05,545 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663403999] [2022-02-21 03:10:05,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:10:05,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:10:05,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:05,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-21 03:10:05,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:05,651 INFO L290 TraceCheckUtils]: 0: Hoare triple {18262#(and (= abs_77 |old(abs_77)|) (= abs_78 |old(abs_78)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {18233#true} is VALID [2022-02-21 03:10:05,651 INFO L290 TraceCheckUtils]: 1: Hoare triple {18233#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {18233#true} is VALID [2022-02-21 03:10:05,651 INFO L290 TraceCheckUtils]: 2: Hoare triple {18233#true} #res := ~__retres4~0; {18233#true} is VALID [2022-02-21 03:10:05,651 INFO L290 TraceCheckUtils]: 3: Hoare triple {18233#true} assume true; {18233#true} is VALID [2022-02-21 03:10:05,651 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {18233#true} {18233#true} #453#return; {18233#true} is VALID [2022-02-21 03:10:05,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-02-21 03:10:05,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:05,677 INFO L290 TraceCheckUtils]: 0: Hoare triple {18262#(and (= abs_77 |old(abs_77)|) (= abs_78 |old(abs_78)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {18233#true} is VALID [2022-02-21 03:10:05,677 INFO L290 TraceCheckUtils]: 1: Hoare triple {18233#true} assume !(0 == ~m % 4294967296); {18233#true} is VALID [2022-02-21 03:10:05,677 INFO L290 TraceCheckUtils]: 2: Hoare triple {18233#true} assume !(~m % 4294967296 < 16777216); {18233#true} is VALID [2022-02-21 03:10:05,677 INFO L290 TraceCheckUtils]: 3: Hoare triple {18233#true} assume !false; {18233#true} is VALID [2022-02-21 03:10:05,677 INFO L290 TraceCheckUtils]: 4: Hoare triple {18233#true} assume ~m % 4294967296 >= 33554432; {18233#true} is VALID [2022-02-21 03:10:05,678 INFO L290 TraceCheckUtils]: 5: Hoare triple {18233#true} assume ~e >= 127;~__retres4~0 := 4294967295; {18263#(and (<= base2flt_~__retres4~0 4294967295) (<= 4294967295 base2flt_~__retres4~0))} is VALID [2022-02-21 03:10:05,678 INFO L290 TraceCheckUtils]: 6: Hoare triple {18263#(and (<= base2flt_~__retres4~0 4294967295) (<= 4294967295 base2flt_~__retres4~0))} #res := ~__retres4~0; {18264#(and (<= |base2flt_#res| 4294967295) (<= 4294967295 |base2flt_#res|))} is VALID [2022-02-21 03:10:05,678 INFO L290 TraceCheckUtils]: 7: Hoare triple {18264#(and (<= |base2flt_#res| 4294967295) (<= 4294967295 |base2flt_#res|))} assume true; {18264#(and (<= |base2flt_#res| 4294967295) (<= 4294967295 |base2flt_#res|))} is VALID [2022-02-21 03:10:05,679 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {18264#(and (<= |base2flt_#res| 4294967295) (<= 4294967295 |base2flt_#res|))} {18233#true} #455#return; {18249#(and (<= 4294967295 |ULTIMATE.start_main_#t~ret23#1|) (<= |ULTIMATE.start_main_#t~ret23#1| 4294967295))} is VALID [2022-02-21 03:10:05,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-02-21 03:10:05,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:05,693 INFO L290 TraceCheckUtils]: 0: Hoare triple {18262#(and (= abs_77 |old(abs_77)|) (= abs_78 |old(abs_78)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {18233#true} is VALID [2022-02-21 03:10:05,693 INFO L290 TraceCheckUtils]: 1: Hoare triple {18233#true} assume !(0 == ~m % 4294967296); {18233#true} is VALID [2022-02-21 03:10:05,693 INFO L290 TraceCheckUtils]: 2: Hoare triple {18233#true} assume !(~m % 4294967296 < 16777216); {18233#true} is VALID [2022-02-21 03:10:05,694 INFO L290 TraceCheckUtils]: 3: Hoare triple {18233#true} assume !false; {18233#true} is VALID [2022-02-21 03:10:05,694 INFO L290 TraceCheckUtils]: 4: Hoare triple {18233#true} assume ~m % 4294967296 >= 33554432; {18233#true} is VALID [2022-02-21 03:10:05,694 INFO L290 TraceCheckUtils]: 5: Hoare triple {18233#true} assume ~e >= 127;~__retres4~0 := 4294967295; {18233#true} is VALID [2022-02-21 03:10:05,694 INFO L290 TraceCheckUtils]: 6: Hoare triple {18233#true} #res := ~__retres4~0; {18233#true} is VALID [2022-02-21 03:10:05,694 INFO L290 TraceCheckUtils]: 7: Hoare triple {18233#true} assume true; {18233#true} is VALID [2022-02-21 03:10:05,695 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {18233#true} {18250#(and (<= 4294967295 |ULTIMATE.start_main_~a~0#1|) (<= |ULTIMATE.start_main_~a~0#1| 4294967295))} #457#return; {18250#(and (<= 4294967295 |ULTIMATE.start_main_~a~0#1|) (<= |ULTIMATE.start_main_~a~0#1| 4294967295))} is VALID [2022-02-21 03:10:05,695 INFO L290 TraceCheckUtils]: 0: Hoare triple {18233#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(24, 2);call #Ultimate.allocInit(12, 3); {18233#true} is VALID [2022-02-21 03:10:05,695 INFO L290 TraceCheckUtils]: 1: Hoare triple {18233#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_~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_add~0#1, main_~zero~0#1, main_~sa~0#1, main_~sb~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~tmp___1~0#1, main_~tmp___2~0#1, main_~tmp___3~0#1, main_~tmp___4~0#1, main_~tmp___5~0#1, main_~tmp___6~0#1, main_~tmp___7~0#1, main_~tmp___8~0#1, main_~tmp___9~0#1, main_~__retres23~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_add~0#1;havoc main_~zero~0#1;havoc main_~sa~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_~tmp___2~0#1;havoc main_~tmp___3~0#1;havoc main_~tmp___4~0#1;havoc main_~tmp___5~0#1;havoc main_~tmp___6~0#1;havoc main_~tmp___7~0#1;havoc main_~tmp___8~0#1;havoc main_~tmp___9~0#1;havoc main_~__retres23~0#1; {18233#true} is VALID [2022-02-21 03:10:05,695 INFO L272 TraceCheckUtils]: 2: Hoare triple {18233#true} call main_#t~ret22#1 := base2flt(0, 0); {18262#(and (= abs_77 |old(abs_77)|) (= abs_78 |old(abs_78)|))} is VALID [2022-02-21 03:10:05,695 INFO L290 TraceCheckUtils]: 3: Hoare triple {18262#(and (= abs_77 |old(abs_77)|) (= abs_78 |old(abs_78)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {18233#true} is VALID [2022-02-21 03:10:05,696 INFO L290 TraceCheckUtils]: 4: Hoare triple {18233#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {18233#true} is VALID [2022-02-21 03:10:05,696 INFO L290 TraceCheckUtils]: 5: Hoare triple {18233#true} #res := ~__retres4~0; {18233#true} is VALID [2022-02-21 03:10:05,696 INFO L290 TraceCheckUtils]: 6: Hoare triple {18233#true} assume true; {18233#true} is VALID [2022-02-21 03:10:05,696 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {18233#true} {18233#true} #453#return; {18233#true} is VALID [2022-02-21 03:10:05,696 INFO L290 TraceCheckUtils]: 8: Hoare triple {18233#true} main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1; {18233#true} is VALID [2022-02-21 03:10:05,696 INFO L272 TraceCheckUtils]: 9: Hoare triple {18233#true} call main_#t~ret23#1 := base2flt(main_~ma~2#1, main_~ea~2#1); {18262#(and (= abs_77 |old(abs_77)|) (= abs_78 |old(abs_78)|))} is VALID [2022-02-21 03:10:05,697 INFO L290 TraceCheckUtils]: 10: Hoare triple {18262#(and (= abs_77 |old(abs_77)|) (= abs_78 |old(abs_78)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {18233#true} is VALID [2022-02-21 03:10:05,697 INFO L290 TraceCheckUtils]: 11: Hoare triple {18233#true} assume !(0 == ~m % 4294967296); {18233#true} is VALID [2022-02-21 03:10:05,697 INFO L290 TraceCheckUtils]: 12: Hoare triple {18233#true} assume !(~m % 4294967296 < 16777216); {18233#true} is VALID [2022-02-21 03:10:05,697 INFO L290 TraceCheckUtils]: 13: Hoare triple {18233#true} assume !false; {18233#true} is VALID [2022-02-21 03:10:05,697 INFO L290 TraceCheckUtils]: 14: Hoare triple {18233#true} assume ~m % 4294967296 >= 33554432; {18233#true} is VALID [2022-02-21 03:10:05,697 INFO L290 TraceCheckUtils]: 15: Hoare triple {18233#true} assume ~e >= 127;~__retres4~0 := 4294967295; {18263#(and (<= base2flt_~__retres4~0 4294967295) (<= 4294967295 base2flt_~__retres4~0))} is VALID [2022-02-21 03:10:05,698 INFO L290 TraceCheckUtils]: 16: Hoare triple {18263#(and (<= base2flt_~__retres4~0 4294967295) (<= 4294967295 base2flt_~__retres4~0))} #res := ~__retres4~0; {18264#(and (<= |base2flt_#res| 4294967295) (<= 4294967295 |base2flt_#res|))} is VALID [2022-02-21 03:10:05,698 INFO L290 TraceCheckUtils]: 17: Hoare triple {18264#(and (<= |base2flt_#res| 4294967295) (<= 4294967295 |base2flt_#res|))} assume true; {18264#(and (<= |base2flt_#res| 4294967295) (<= 4294967295 |base2flt_#res|))} is VALID [2022-02-21 03:10:05,699 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {18264#(and (<= |base2flt_#res| 4294967295) (<= 4294967295 |base2flt_#res|))} {18233#true} #455#return; {18249#(and (<= 4294967295 |ULTIMATE.start_main_#t~ret23#1|) (<= |ULTIMATE.start_main_#t~ret23#1| 4294967295))} is VALID [2022-02-21 03:10:05,699 INFO L290 TraceCheckUtils]: 19: Hoare triple {18249#(and (<= 4294967295 |ULTIMATE.start_main_#t~ret23#1|) (<= |ULTIMATE.start_main_#t~ret23#1| 4294967295))} main_~a~0#1 := main_#t~ret23#1;havoc main_#t~ret23#1; {18250#(and (<= 4294967295 |ULTIMATE.start_main_~a~0#1|) (<= |ULTIMATE.start_main_~a~0#1| 4294967295))} is VALID [2022-02-21 03:10:05,699 INFO L272 TraceCheckUtils]: 20: Hoare triple {18250#(and (<= 4294967295 |ULTIMATE.start_main_~a~0#1|) (<= |ULTIMATE.start_main_~a~0#1| 4294967295))} call main_#t~ret24#1 := base2flt(main_~mb~2#1, main_~eb~2#1); {18262#(and (= abs_77 |old(abs_77)|) (= abs_78 |old(abs_78)|))} is VALID [2022-02-21 03:10:05,700 INFO L290 TraceCheckUtils]: 21: Hoare triple {18262#(and (= abs_77 |old(abs_77)|) (= abs_78 |old(abs_78)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {18233#true} is VALID [2022-02-21 03:10:05,700 INFO L290 TraceCheckUtils]: 22: Hoare triple {18233#true} assume !(0 == ~m % 4294967296); {18233#true} is VALID [2022-02-21 03:10:05,700 INFO L290 TraceCheckUtils]: 23: Hoare triple {18233#true} assume !(~m % 4294967296 < 16777216); {18233#true} is VALID [2022-02-21 03:10:05,700 INFO L290 TraceCheckUtils]: 24: Hoare triple {18233#true} assume !false; {18233#true} is VALID [2022-02-21 03:10:05,700 INFO L290 TraceCheckUtils]: 25: Hoare triple {18233#true} assume ~m % 4294967296 >= 33554432; {18233#true} is VALID [2022-02-21 03:10:05,700 INFO L290 TraceCheckUtils]: 26: Hoare triple {18233#true} assume ~e >= 127;~__retres4~0 := 4294967295; {18233#true} is VALID [2022-02-21 03:10:05,700 INFO L290 TraceCheckUtils]: 27: Hoare triple {18233#true} #res := ~__retres4~0; {18233#true} is VALID [2022-02-21 03:10:05,700 INFO L290 TraceCheckUtils]: 28: Hoare triple {18233#true} assume true; {18233#true} is VALID [2022-02-21 03:10:05,701 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {18233#true} {18250#(and (<= 4294967295 |ULTIMATE.start_main_~a~0#1|) (<= |ULTIMATE.start_main_~a~0#1| 4294967295))} #457#return; {18250#(and (<= 4294967295 |ULTIMATE.start_main_~a~0#1|) (<= |ULTIMATE.start_main_~a~0#1| 4294967295))} is VALID [2022-02-21 03:10:05,701 INFO L290 TraceCheckUtils]: 30: Hoare triple {18250#(and (<= 4294967295 |ULTIMATE.start_main_~a~0#1|) (<= |ULTIMATE.start_main_~a~0#1| 4294967295))} main_~b~0#1 := main_#t~ret24#1;havoc main_#t~ret24#1; {18250#(and (<= 4294967295 |ULTIMATE.start_main_~a~0#1|) (<= |ULTIMATE.start_main_~a~0#1| 4294967295))} is VALID [2022-02-21 03:10:05,701 INFO L290 TraceCheckUtils]: 31: Hoare triple {18250#(and (<= 4294967295 |ULTIMATE.start_main_~a~0#1|) (<= |ULTIMATE.start_main_~a~0#1| 4294967295))} assume !(main_~a~0#1 % 4294967296 < main_~zero~0#1 % 4294967296); {18250#(and (<= 4294967295 |ULTIMATE.start_main_~a~0#1|) (<= |ULTIMATE.start_main_~a~0#1| 4294967295))} is VALID [2022-02-21 03:10:05,702 INFO L290 TraceCheckUtils]: 32: Hoare triple {18250#(and (<= 4294967295 |ULTIMATE.start_main_~a~0#1|) (<= |ULTIMATE.start_main_~a~0#1| 4294967295))} assume main_~a~0#1 % 4294967296 > main_~zero~0#1 % 4294967296;main_~tmp~2#1 := 1; {18250#(and (<= 4294967295 |ULTIMATE.start_main_~a~0#1|) (<= |ULTIMATE.start_main_~a~0#1| 4294967295))} is VALID [2022-02-21 03:10:05,702 INFO L290 TraceCheckUtils]: 33: Hoare triple {18250#(and (<= 4294967295 |ULTIMATE.start_main_~a~0#1|) (<= |ULTIMATE.start_main_~a~0#1| 4294967295))} main_~sa~0#1 := main_~tmp~2#1; {18250#(and (<= 4294967295 |ULTIMATE.start_main_~a~0#1|) (<= |ULTIMATE.start_main_~a~0#1| 4294967295))} is VALID [2022-02-21 03:10:05,702 INFO L290 TraceCheckUtils]: 34: Hoare triple {18250#(and (<= 4294967295 |ULTIMATE.start_main_~a~0#1|) (<= |ULTIMATE.start_main_~a~0#1| 4294967295))} assume !(main_~b~0#1 % 4294967296 < main_~zero~0#1 % 4294967296); {18250#(and (<= 4294967295 |ULTIMATE.start_main_~a~0#1|) (<= |ULTIMATE.start_main_~a~0#1| 4294967295))} is VALID [2022-02-21 03:10:05,703 INFO L290 TraceCheckUtils]: 35: Hoare triple {18250#(and (<= 4294967295 |ULTIMATE.start_main_~a~0#1|) (<= |ULTIMATE.start_main_~a~0#1| 4294967295))} assume main_~b~0#1 % 4294967296 > main_~zero~0#1 % 4294967296;main_~tmp___0~0#1 := 1; {18250#(and (<= 4294967295 |ULTIMATE.start_main_~a~0#1|) (<= |ULTIMATE.start_main_~a~0#1| 4294967295))} is VALID [2022-02-21 03:10:05,703 INFO L290 TraceCheckUtils]: 36: Hoare triple {18250#(and (<= 4294967295 |ULTIMATE.start_main_~a~0#1|) (<= |ULTIMATE.start_main_~a~0#1| 4294967295))} main_~sb~0#1 := main_~tmp___0~0#1; {18250#(and (<= 4294967295 |ULTIMATE.start_main_~a~0#1|) (<= |ULTIMATE.start_main_~a~0#1| 4294967295))} is VALID [2022-02-21 03:10:05,704 INFO L290 TraceCheckUtils]: 37: Hoare triple {18250#(and (<= 4294967295 |ULTIMATE.start_main_~a~0#1|) (<= |ULTIMATE.start_main_~a~0#1| 4294967295))} assume { :begin_inline_addflt } true;addflt_#in~a#1, addflt_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc addflt_#res#1;havoc addflt_#t~nondet6#1, addflt_#t~nondet7#1, addflt_#t~nondet8#1, addflt_#t~nondet9#1, addflt_#t~nondet10#1, addflt_#t~nondet11#1, addflt_~a#1, addflt_~b#1, addflt_~res~1#1, addflt_~ma~0#1, addflt_~mb~0#1, addflt_~delta~0#1, addflt_~ea~0#1, addflt_~eb~0#1, addflt_~tmp~0#1, addflt_~__retres10~0#1;addflt_~a#1 := addflt_#in~a#1;addflt_~b#1 := addflt_#in~b#1;havoc addflt_~res~1#1;havoc addflt_~ma~0#1;havoc addflt_~mb~0#1;havoc addflt_~delta~0#1;havoc addflt_~ea~0#1;havoc addflt_~eb~0#1;havoc addflt_~tmp~0#1;havoc addflt_~__retres10~0#1; {18260#(and (not (<= (+ (div (div |ULTIMATE.start_addflt_~a#1| 16777216) 4294967296) 1) 0)) (<= |ULTIMATE.start_addflt_~a#1| 4294967295))} is VALID [2022-02-21 03:10:05,704 INFO L290 TraceCheckUtils]: 38: Hoare triple {18260#(and (not (<= (+ (div (div |ULTIMATE.start_addflt_~a#1| 16777216) 4294967296) 1) 0)) (<= |ULTIMATE.start_addflt_~a#1| 4294967295))} assume !(addflt_~a#1 % 4294967296 < addflt_~b#1 % 4294967296); {18260#(and (not (<= (+ (div (div |ULTIMATE.start_addflt_~a#1| 16777216) 4294967296) 1) 0)) (<= |ULTIMATE.start_addflt_~a#1| 4294967295))} is VALID [2022-02-21 03:10:05,704 INFO L290 TraceCheckUtils]: 39: Hoare triple {18260#(and (not (<= (+ (div (div |ULTIMATE.start_addflt_~a#1| 16777216) 4294967296) 1) 0)) (<= |ULTIMATE.start_addflt_~a#1| 4294967295))} assume !(0 == addflt_~b#1 % 4294967296); {18260#(and (not (<= (+ (div (div |ULTIMATE.start_addflt_~a#1| 16777216) 4294967296) 1) 0)) (<= |ULTIMATE.start_addflt_~a#1| 4294967295))} is VALID [2022-02-21 03:10:05,705 INFO L290 TraceCheckUtils]: 40: Hoare triple {18260#(and (not (<= (+ (div (div |ULTIMATE.start_addflt_~a#1| 16777216) 4294967296) 1) 0)) (<= |ULTIMATE.start_addflt_~a#1| 4294967295))} assume !(0 == addflt_~a#1); {18260#(and (not (<= (+ (div (div |ULTIMATE.start_addflt_~a#1| 16777216) 4294967296) 1) 0)) (<= |ULTIMATE.start_addflt_~a#1| 4294967295))} is VALID [2022-02-21 03:10:05,705 INFO L290 TraceCheckUtils]: 41: Hoare triple {18260#(and (not (<= (+ (div (div |ULTIMATE.start_addflt_~a#1| 16777216) 4294967296) 1) 0)) (<= |ULTIMATE.start_addflt_~a#1| 4294967295))} assume !false; {18260#(and (not (<= (+ (div (div |ULTIMATE.start_addflt_~a#1| 16777216) 4294967296) 1) 0)) (<= |ULTIMATE.start_addflt_~a#1| 4294967295))} is VALID [2022-02-21 03:10:05,705 INFO L290 TraceCheckUtils]: 42: Hoare triple {18260#(and (not (<= (+ (div (div |ULTIMATE.start_addflt_~a#1| 16777216) 4294967296) 1) 0)) (<= |ULTIMATE.start_addflt_~a#1| 4294967295))} assume !false; {18260#(and (not (<= (+ (div (div |ULTIMATE.start_addflt_~a#1| 16777216) 4294967296) 1) 0)) (<= |ULTIMATE.start_addflt_~a#1| 4294967295))} is VALID [2022-02-21 03:10:05,706 INFO L290 TraceCheckUtils]: 43: Hoare triple {18260#(and (not (<= (+ (div (div |ULTIMATE.start_addflt_~a#1| 16777216) 4294967296) 1) 0)) (<= |ULTIMATE.start_addflt_~a#1| 4294967295))} assume addflt_~a#1 >= 0;abs_109 := (if addflt_~a#1 < 16777215 then addflt_~a#1 else 16777215);assume addflt_~a#1 >= 0;assume addflt_~ma~0#1 < abs_109; {18260#(and (not (<= (+ (div (div |ULTIMATE.start_addflt_~a#1| 16777216) 4294967296) 1) 0)) (<= |ULTIMATE.start_addflt_~a#1| 4294967295))} is VALID [2022-02-21 03:10:05,706 INFO L290 TraceCheckUtils]: 44: Hoare triple {18260#(and (not (<= (+ (div (div |ULTIMATE.start_addflt_~a#1| 16777216) 4294967296) 1) 0)) (<= |ULTIMATE.start_addflt_~a#1| 4294967295))} assume (if addflt_~a#1 / 16777216 % 4294967296 % 4294967296 <= 2147483647 then addflt_~a#1 / 16777216 % 4294967296 % 4294967296 else addflt_~a#1 / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 <= 2147483647; {18261#(<= (div |ULTIMATE.start_addflt_~a#1| 16777216) (+ 2147483647 (* 4294967296 (div (div |ULTIMATE.start_addflt_~a#1| 16777216) 4294967296))))} is VALID [2022-02-21 03:10:05,707 INFO L290 TraceCheckUtils]: 45: Hoare triple {18261#(<= (div |ULTIMATE.start_addflt_~a#1| 16777216) (+ 2147483647 (* 4294967296 (div (div |ULTIMATE.start_addflt_~a#1| 16777216) 4294967296))))} assume !((if addflt_~a#1 / 16777216 % 4294967296 % 4294967296 <= 2147483647 then addflt_~a#1 / 16777216 % 4294967296 % 4294967296 else addflt_~a#1 / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 >= -2147483648); {18234#false} is VALID [2022-02-21 03:10:05,707 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-02-21 03:10:05,707 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:10:05,707 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663403999] [2022-02-21 03:10:05,708 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1663403999] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:10:05,708 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [792704040] [2022-02-21 03:10:05,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:10:05,708 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:10:05,708 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:10:05,709 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:10:05,710 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-02-21 03:10:05,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:05,827 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 13 conjunts are in the unsatisfiable core [2022-02-21 03:10:05,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:05,840 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:10:06,093 INFO L290 TraceCheckUtils]: 0: Hoare triple {18233#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(24, 2);call #Ultimate.allocInit(12, 3); {18233#true} is VALID [2022-02-21 03:10:06,094 INFO L290 TraceCheckUtils]: 1: Hoare triple {18233#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_~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_add~0#1, main_~zero~0#1, main_~sa~0#1, main_~sb~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~tmp___1~0#1, main_~tmp___2~0#1, main_~tmp___3~0#1, main_~tmp___4~0#1, main_~tmp___5~0#1, main_~tmp___6~0#1, main_~tmp___7~0#1, main_~tmp___8~0#1, main_~tmp___9~0#1, main_~__retres23~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_add~0#1;havoc main_~zero~0#1;havoc main_~sa~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_~tmp___2~0#1;havoc main_~tmp___3~0#1;havoc main_~tmp___4~0#1;havoc main_~tmp___5~0#1;havoc main_~tmp___6~0#1;havoc main_~tmp___7~0#1;havoc main_~tmp___8~0#1;havoc main_~tmp___9~0#1;havoc main_~__retres23~0#1; {18233#true} is VALID [2022-02-21 03:10:06,094 INFO L272 TraceCheckUtils]: 2: Hoare triple {18233#true} call main_#t~ret22#1 := base2flt(0, 0); {18233#true} is VALID [2022-02-21 03:10:06,094 INFO L290 TraceCheckUtils]: 3: Hoare triple {18233#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {18233#true} is VALID [2022-02-21 03:10:06,094 INFO L290 TraceCheckUtils]: 4: Hoare triple {18233#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {18233#true} is VALID [2022-02-21 03:10:06,094 INFO L290 TraceCheckUtils]: 5: Hoare triple {18233#true} #res := ~__retres4~0; {18233#true} is VALID [2022-02-21 03:10:06,094 INFO L290 TraceCheckUtils]: 6: Hoare triple {18233#true} assume true; {18233#true} is VALID [2022-02-21 03:10:06,094 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {18233#true} {18233#true} #453#return; {18233#true} is VALID [2022-02-21 03:10:06,095 INFO L290 TraceCheckUtils]: 8: Hoare triple {18233#true} main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1; {18233#true} is VALID [2022-02-21 03:10:06,095 INFO L272 TraceCheckUtils]: 9: Hoare triple {18233#true} call main_#t~ret23#1 := base2flt(main_~ma~2#1, main_~ea~2#1); {18233#true} is VALID [2022-02-21 03:10:06,095 INFO L290 TraceCheckUtils]: 10: Hoare triple {18233#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {18233#true} is VALID [2022-02-21 03:10:06,095 INFO L290 TraceCheckUtils]: 11: Hoare triple {18233#true} assume !(0 == ~m % 4294967296); {18233#true} is VALID [2022-02-21 03:10:06,095 INFO L290 TraceCheckUtils]: 12: Hoare triple {18233#true} assume !(~m % 4294967296 < 16777216); {18233#true} is VALID [2022-02-21 03:10:06,095 INFO L290 TraceCheckUtils]: 13: Hoare triple {18233#true} assume !false; {18233#true} is VALID [2022-02-21 03:10:06,095 INFO L290 TraceCheckUtils]: 14: Hoare triple {18233#true} assume ~m % 4294967296 >= 33554432; {18233#true} is VALID [2022-02-21 03:10:06,096 INFO L290 TraceCheckUtils]: 15: Hoare triple {18233#true} assume ~e >= 127;~__retres4~0 := 4294967295; {18263#(and (<= base2flt_~__retres4~0 4294967295) (<= 4294967295 base2flt_~__retres4~0))} is VALID [2022-02-21 03:10:06,096 INFO L290 TraceCheckUtils]: 16: Hoare triple {18263#(and (<= base2flt_~__retres4~0 4294967295) (<= 4294967295 base2flt_~__retres4~0))} #res := ~__retres4~0; {18264#(and (<= |base2flt_#res| 4294967295) (<= 4294967295 |base2flt_#res|))} is VALID [2022-02-21 03:10:06,097 INFO L290 TraceCheckUtils]: 17: Hoare triple {18264#(and (<= |base2flt_#res| 4294967295) (<= 4294967295 |base2flt_#res|))} assume true; {18264#(and (<= |base2flt_#res| 4294967295) (<= 4294967295 |base2flt_#res|))} is VALID [2022-02-21 03:10:06,097 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {18264#(and (<= |base2flt_#res| 4294967295) (<= 4294967295 |base2flt_#res|))} {18233#true} #455#return; {18249#(and (<= 4294967295 |ULTIMATE.start_main_#t~ret23#1|) (<= |ULTIMATE.start_main_#t~ret23#1| 4294967295))} is VALID [2022-02-21 03:10:06,098 INFO L290 TraceCheckUtils]: 19: Hoare triple {18249#(and (<= 4294967295 |ULTIMATE.start_main_#t~ret23#1|) (<= |ULTIMATE.start_main_#t~ret23#1| 4294967295))} main_~a~0#1 := main_#t~ret23#1;havoc main_#t~ret23#1; {18250#(and (<= 4294967295 |ULTIMATE.start_main_~a~0#1|) (<= |ULTIMATE.start_main_~a~0#1| 4294967295))} is VALID [2022-02-21 03:10:06,098 INFO L272 TraceCheckUtils]: 20: Hoare triple {18250#(and (<= 4294967295 |ULTIMATE.start_main_~a~0#1|) (<= |ULTIMATE.start_main_~a~0#1| 4294967295))} call main_#t~ret24#1 := base2flt(main_~mb~2#1, main_~eb~2#1); {18233#true} is VALID [2022-02-21 03:10:06,098 INFO L290 TraceCheckUtils]: 21: Hoare triple {18233#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {18233#true} is VALID [2022-02-21 03:10:06,098 INFO L290 TraceCheckUtils]: 22: Hoare triple {18233#true} assume !(0 == ~m % 4294967296); {18233#true} is VALID [2022-02-21 03:10:06,098 INFO L290 TraceCheckUtils]: 23: Hoare triple {18233#true} assume !(~m % 4294967296 < 16777216); {18233#true} is VALID [2022-02-21 03:10:06,098 INFO L290 TraceCheckUtils]: 24: Hoare triple {18233#true} assume !false; {18233#true} is VALID [2022-02-21 03:10:06,098 INFO L290 TraceCheckUtils]: 25: Hoare triple {18233#true} assume ~m % 4294967296 >= 33554432; {18233#true} is VALID [2022-02-21 03:10:06,099 INFO L290 TraceCheckUtils]: 26: Hoare triple {18233#true} assume ~e >= 127;~__retres4~0 := 4294967295; {18233#true} is VALID [2022-02-21 03:10:06,099 INFO L290 TraceCheckUtils]: 27: Hoare triple {18233#true} #res := ~__retres4~0; {18233#true} is VALID [2022-02-21 03:10:06,099 INFO L290 TraceCheckUtils]: 28: Hoare triple {18233#true} assume true; {18233#true} is VALID [2022-02-21 03:10:06,100 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {18233#true} {18250#(and (<= 4294967295 |ULTIMATE.start_main_~a~0#1|) (<= |ULTIMATE.start_main_~a~0#1| 4294967295))} #457#return; {18250#(and (<= 4294967295 |ULTIMATE.start_main_~a~0#1|) (<= |ULTIMATE.start_main_~a~0#1| 4294967295))} is VALID [2022-02-21 03:10:06,100 INFO L290 TraceCheckUtils]: 30: Hoare triple {18250#(and (<= 4294967295 |ULTIMATE.start_main_~a~0#1|) (<= |ULTIMATE.start_main_~a~0#1| 4294967295))} main_~b~0#1 := main_#t~ret24#1;havoc main_#t~ret24#1; {18250#(and (<= 4294967295 |ULTIMATE.start_main_~a~0#1|) (<= |ULTIMATE.start_main_~a~0#1| 4294967295))} is VALID [2022-02-21 03:10:06,100 INFO L290 TraceCheckUtils]: 31: Hoare triple {18250#(and (<= 4294967295 |ULTIMATE.start_main_~a~0#1|) (<= |ULTIMATE.start_main_~a~0#1| 4294967295))} assume !(main_~a~0#1 % 4294967296 < main_~zero~0#1 % 4294967296); {18250#(and (<= 4294967295 |ULTIMATE.start_main_~a~0#1|) (<= |ULTIMATE.start_main_~a~0#1| 4294967295))} is VALID [2022-02-21 03:10:06,101 INFO L290 TraceCheckUtils]: 32: Hoare triple {18250#(and (<= 4294967295 |ULTIMATE.start_main_~a~0#1|) (<= |ULTIMATE.start_main_~a~0#1| 4294967295))} assume main_~a~0#1 % 4294967296 > main_~zero~0#1 % 4294967296;main_~tmp~2#1 := 1; {18250#(and (<= 4294967295 |ULTIMATE.start_main_~a~0#1|) (<= |ULTIMATE.start_main_~a~0#1| 4294967295))} is VALID [2022-02-21 03:10:06,101 INFO L290 TraceCheckUtils]: 33: Hoare triple {18250#(and (<= 4294967295 |ULTIMATE.start_main_~a~0#1|) (<= |ULTIMATE.start_main_~a~0#1| 4294967295))} main_~sa~0#1 := main_~tmp~2#1; {18250#(and (<= 4294967295 |ULTIMATE.start_main_~a~0#1|) (<= |ULTIMATE.start_main_~a~0#1| 4294967295))} is VALID [2022-02-21 03:10:06,102 INFO L290 TraceCheckUtils]: 34: Hoare triple {18250#(and (<= 4294967295 |ULTIMATE.start_main_~a~0#1|) (<= |ULTIMATE.start_main_~a~0#1| 4294967295))} assume !(main_~b~0#1 % 4294967296 < main_~zero~0#1 % 4294967296); {18250#(and (<= 4294967295 |ULTIMATE.start_main_~a~0#1|) (<= |ULTIMATE.start_main_~a~0#1| 4294967295))} is VALID [2022-02-21 03:10:06,102 INFO L290 TraceCheckUtils]: 35: Hoare triple {18250#(and (<= 4294967295 |ULTIMATE.start_main_~a~0#1|) (<= |ULTIMATE.start_main_~a~0#1| 4294967295))} assume main_~b~0#1 % 4294967296 > main_~zero~0#1 % 4294967296;main_~tmp___0~0#1 := 1; {18250#(and (<= 4294967295 |ULTIMATE.start_main_~a~0#1|) (<= |ULTIMATE.start_main_~a~0#1| 4294967295))} is VALID [2022-02-21 03:10:06,102 INFO L290 TraceCheckUtils]: 36: Hoare triple {18250#(and (<= 4294967295 |ULTIMATE.start_main_~a~0#1|) (<= |ULTIMATE.start_main_~a~0#1| 4294967295))} main_~sb~0#1 := main_~tmp___0~0#1; {18250#(and (<= 4294967295 |ULTIMATE.start_main_~a~0#1|) (<= |ULTIMATE.start_main_~a~0#1| 4294967295))} is VALID [2022-02-21 03:10:06,103 INFO L290 TraceCheckUtils]: 37: Hoare triple {18250#(and (<= 4294967295 |ULTIMATE.start_main_~a~0#1|) (<= |ULTIMATE.start_main_~a~0#1| 4294967295))} assume { :begin_inline_addflt } true;addflt_#in~a#1, addflt_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc addflt_#res#1;havoc addflt_#t~nondet6#1, addflt_#t~nondet7#1, addflt_#t~nondet8#1, addflt_#t~nondet9#1, addflt_#t~nondet10#1, addflt_#t~nondet11#1, addflt_~a#1, addflt_~b#1, addflt_~res~1#1, addflt_~ma~0#1, addflt_~mb~0#1, addflt_~delta~0#1, addflt_~ea~0#1, addflt_~eb~0#1, addflt_~tmp~0#1, addflt_~__retres10~0#1;addflt_~a#1 := addflt_#in~a#1;addflt_~b#1 := addflt_#in~b#1;havoc addflt_~res~1#1;havoc addflt_~ma~0#1;havoc addflt_~mb~0#1;havoc addflt_~delta~0#1;havoc addflt_~ea~0#1;havoc addflt_~eb~0#1;havoc addflt_~tmp~0#1;havoc addflt_~__retres10~0#1; {18379#(and (<= 4294967295 |ULTIMATE.start_addflt_~a#1|) (<= |ULTIMATE.start_addflt_~a#1| 4294967295))} is VALID [2022-02-21 03:10:06,103 INFO L290 TraceCheckUtils]: 38: Hoare triple {18379#(and (<= 4294967295 |ULTIMATE.start_addflt_~a#1|) (<= |ULTIMATE.start_addflt_~a#1| 4294967295))} assume !(addflt_~a#1 % 4294967296 < addflt_~b#1 % 4294967296); {18379#(and (<= 4294967295 |ULTIMATE.start_addflt_~a#1|) (<= |ULTIMATE.start_addflt_~a#1| 4294967295))} is VALID [2022-02-21 03:10:06,103 INFO L290 TraceCheckUtils]: 39: Hoare triple {18379#(and (<= 4294967295 |ULTIMATE.start_addflt_~a#1|) (<= |ULTIMATE.start_addflt_~a#1| 4294967295))} assume !(0 == addflt_~b#1 % 4294967296); {18379#(and (<= 4294967295 |ULTIMATE.start_addflt_~a#1|) (<= |ULTIMATE.start_addflt_~a#1| 4294967295))} is VALID [2022-02-21 03:10:06,104 INFO L290 TraceCheckUtils]: 40: Hoare triple {18379#(and (<= 4294967295 |ULTIMATE.start_addflt_~a#1|) (<= |ULTIMATE.start_addflt_~a#1| 4294967295))} assume !(0 == addflt_~a#1); {18379#(and (<= 4294967295 |ULTIMATE.start_addflt_~a#1|) (<= |ULTIMATE.start_addflt_~a#1| 4294967295))} is VALID [2022-02-21 03:10:06,104 INFO L290 TraceCheckUtils]: 41: Hoare triple {18379#(and (<= 4294967295 |ULTIMATE.start_addflt_~a#1|) (<= |ULTIMATE.start_addflt_~a#1| 4294967295))} assume !false; {18379#(and (<= 4294967295 |ULTIMATE.start_addflt_~a#1|) (<= |ULTIMATE.start_addflt_~a#1| 4294967295))} is VALID [2022-02-21 03:10:06,104 INFO L290 TraceCheckUtils]: 42: Hoare triple {18379#(and (<= 4294967295 |ULTIMATE.start_addflt_~a#1|) (<= |ULTIMATE.start_addflt_~a#1| 4294967295))} assume !false; {18379#(and (<= 4294967295 |ULTIMATE.start_addflt_~a#1|) (<= |ULTIMATE.start_addflt_~a#1| 4294967295))} is VALID [2022-02-21 03:10:06,105 INFO L290 TraceCheckUtils]: 43: Hoare triple {18379#(and (<= 4294967295 |ULTIMATE.start_addflt_~a#1|) (<= |ULTIMATE.start_addflt_~a#1| 4294967295))} assume addflt_~a#1 >= 0;abs_109 := (if addflt_~a#1 < 16777215 then addflt_~a#1 else 16777215);assume addflt_~a#1 >= 0;assume addflt_~ma~0#1 < abs_109; {18379#(and (<= 4294967295 |ULTIMATE.start_addflt_~a#1|) (<= |ULTIMATE.start_addflt_~a#1| 4294967295))} is VALID [2022-02-21 03:10:06,105 INFO L290 TraceCheckUtils]: 44: Hoare triple {18379#(and (<= 4294967295 |ULTIMATE.start_addflt_~a#1|) (<= |ULTIMATE.start_addflt_~a#1| 4294967295))} assume (if addflt_~a#1 / 16777216 % 4294967296 % 4294967296 <= 2147483647 then addflt_~a#1 / 16777216 % 4294967296 % 4294967296 else addflt_~a#1 / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 <= 2147483647; {18379#(and (<= 4294967295 |ULTIMATE.start_addflt_~a#1|) (<= |ULTIMATE.start_addflt_~a#1| 4294967295))} is VALID [2022-02-21 03:10:06,106 INFO L290 TraceCheckUtils]: 45: Hoare triple {18379#(and (<= 4294967295 |ULTIMATE.start_addflt_~a#1|) (<= |ULTIMATE.start_addflt_~a#1| 4294967295))} assume !((if addflt_~a#1 / 16777216 % 4294967296 % 4294967296 <= 2147483647 then addflt_~a#1 / 16777216 % 4294967296 % 4294967296 else addflt_~a#1 / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 >= -2147483648); {18234#false} is VALID [2022-02-21 03:10:06,106 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-02-21 03:10:06,106 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:10:06,419 INFO L290 TraceCheckUtils]: 45: Hoare triple {18404#(or (<= 2147483776 (mod (div |ULTIMATE.start_addflt_~a#1| 16777216) 4294967296)) (<= (mod (div |ULTIMATE.start_addflt_~a#1| 16777216) 4294967296) 2147483647))} assume !((if addflt_~a#1 / 16777216 % 4294967296 % 4294967296 <= 2147483647 then addflt_~a#1 / 16777216 % 4294967296 % 4294967296 else addflt_~a#1 / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 >= -2147483648); {18234#false} is VALID [2022-02-21 03:10:06,419 INFO L290 TraceCheckUtils]: 44: Hoare triple {18404#(or (<= 2147483776 (mod (div |ULTIMATE.start_addflt_~a#1| 16777216) 4294967296)) (<= (mod (div |ULTIMATE.start_addflt_~a#1| 16777216) 4294967296) 2147483647))} assume (if addflt_~a#1 / 16777216 % 4294967296 % 4294967296 <= 2147483647 then addflt_~a#1 / 16777216 % 4294967296 % 4294967296 else addflt_~a#1 / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 <= 2147483647; {18404#(or (<= 2147483776 (mod (div |ULTIMATE.start_addflt_~a#1| 16777216) 4294967296)) (<= (mod (div |ULTIMATE.start_addflt_~a#1| 16777216) 4294967296) 2147483647))} is VALID [2022-02-21 03:10:06,420 INFO L290 TraceCheckUtils]: 43: Hoare triple {18404#(or (<= 2147483776 (mod (div |ULTIMATE.start_addflt_~a#1| 16777216) 4294967296)) (<= (mod (div |ULTIMATE.start_addflt_~a#1| 16777216) 4294967296) 2147483647))} assume addflt_~a#1 >= 0;abs_109 := (if addflt_~a#1 < 16777215 then addflt_~a#1 else 16777215);assume addflt_~a#1 >= 0;assume addflt_~ma~0#1 < abs_109; {18404#(or (<= 2147483776 (mod (div |ULTIMATE.start_addflt_~a#1| 16777216) 4294967296)) (<= (mod (div |ULTIMATE.start_addflt_~a#1| 16777216) 4294967296) 2147483647))} is VALID [2022-02-21 03:10:06,420 INFO L290 TraceCheckUtils]: 42: Hoare triple {18404#(or (<= 2147483776 (mod (div |ULTIMATE.start_addflt_~a#1| 16777216) 4294967296)) (<= (mod (div |ULTIMATE.start_addflt_~a#1| 16777216) 4294967296) 2147483647))} assume !false; {18404#(or (<= 2147483776 (mod (div |ULTIMATE.start_addflt_~a#1| 16777216) 4294967296)) (<= (mod (div |ULTIMATE.start_addflt_~a#1| 16777216) 4294967296) 2147483647))} is VALID [2022-02-21 03:10:06,420 INFO L290 TraceCheckUtils]: 41: Hoare triple {18404#(or (<= 2147483776 (mod (div |ULTIMATE.start_addflt_~a#1| 16777216) 4294967296)) (<= (mod (div |ULTIMATE.start_addflt_~a#1| 16777216) 4294967296) 2147483647))} assume !false; {18404#(or (<= 2147483776 (mod (div |ULTIMATE.start_addflt_~a#1| 16777216) 4294967296)) (<= (mod (div |ULTIMATE.start_addflt_~a#1| 16777216) 4294967296) 2147483647))} is VALID [2022-02-21 03:10:06,421 INFO L290 TraceCheckUtils]: 40: Hoare triple {18404#(or (<= 2147483776 (mod (div |ULTIMATE.start_addflt_~a#1| 16777216) 4294967296)) (<= (mod (div |ULTIMATE.start_addflt_~a#1| 16777216) 4294967296) 2147483647))} assume !(0 == addflt_~a#1); {18404#(or (<= 2147483776 (mod (div |ULTIMATE.start_addflt_~a#1| 16777216) 4294967296)) (<= (mod (div |ULTIMATE.start_addflt_~a#1| 16777216) 4294967296) 2147483647))} is VALID [2022-02-21 03:10:06,421 INFO L290 TraceCheckUtils]: 39: Hoare triple {18404#(or (<= 2147483776 (mod (div |ULTIMATE.start_addflt_~a#1| 16777216) 4294967296)) (<= (mod (div |ULTIMATE.start_addflt_~a#1| 16777216) 4294967296) 2147483647))} assume !(0 == addflt_~b#1 % 4294967296); {18404#(or (<= 2147483776 (mod (div |ULTIMATE.start_addflt_~a#1| 16777216) 4294967296)) (<= (mod (div |ULTIMATE.start_addflt_~a#1| 16777216) 4294967296) 2147483647))} is VALID [2022-02-21 03:10:06,421 INFO L290 TraceCheckUtils]: 38: Hoare triple {18404#(or (<= 2147483776 (mod (div |ULTIMATE.start_addflt_~a#1| 16777216) 4294967296)) (<= (mod (div |ULTIMATE.start_addflt_~a#1| 16777216) 4294967296) 2147483647))} assume !(addflt_~a#1 % 4294967296 < addflt_~b#1 % 4294967296); {18404#(or (<= 2147483776 (mod (div |ULTIMATE.start_addflt_~a#1| 16777216) 4294967296)) (<= (mod (div |ULTIMATE.start_addflt_~a#1| 16777216) 4294967296) 2147483647))} is VALID [2022-02-21 03:10:06,422 INFO L290 TraceCheckUtils]: 37: Hoare triple {18429#(or (<= (mod (div |ULTIMATE.start_main_~a~0#1| 16777216) 4294967296) 2147483647) (<= 2147483776 (mod (div |ULTIMATE.start_main_~a~0#1| 16777216) 4294967296)))} assume { :begin_inline_addflt } true;addflt_#in~a#1, addflt_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc addflt_#res#1;havoc addflt_#t~nondet6#1, addflt_#t~nondet7#1, addflt_#t~nondet8#1, addflt_#t~nondet9#1, addflt_#t~nondet10#1, addflt_#t~nondet11#1, addflt_~a#1, addflt_~b#1, addflt_~res~1#1, addflt_~ma~0#1, addflt_~mb~0#1, addflt_~delta~0#1, addflt_~ea~0#1, addflt_~eb~0#1, addflt_~tmp~0#1, addflt_~__retres10~0#1;addflt_~a#1 := addflt_#in~a#1;addflt_~b#1 := addflt_#in~b#1;havoc addflt_~res~1#1;havoc addflt_~ma~0#1;havoc addflt_~mb~0#1;havoc addflt_~delta~0#1;havoc addflt_~ea~0#1;havoc addflt_~eb~0#1;havoc addflt_~tmp~0#1;havoc addflt_~__retres10~0#1; {18404#(or (<= 2147483776 (mod (div |ULTIMATE.start_addflt_~a#1| 16777216) 4294967296)) (<= (mod (div |ULTIMATE.start_addflt_~a#1| 16777216) 4294967296) 2147483647))} is VALID [2022-02-21 03:10:06,422 INFO L290 TraceCheckUtils]: 36: Hoare triple {18429#(or (<= (mod (div |ULTIMATE.start_main_~a~0#1| 16777216) 4294967296) 2147483647) (<= 2147483776 (mod (div |ULTIMATE.start_main_~a~0#1| 16777216) 4294967296)))} main_~sb~0#1 := main_~tmp___0~0#1; {18429#(or (<= (mod (div |ULTIMATE.start_main_~a~0#1| 16777216) 4294967296) 2147483647) (<= 2147483776 (mod (div |ULTIMATE.start_main_~a~0#1| 16777216) 4294967296)))} is VALID [2022-02-21 03:10:06,423 INFO L290 TraceCheckUtils]: 35: Hoare triple {18429#(or (<= (mod (div |ULTIMATE.start_main_~a~0#1| 16777216) 4294967296) 2147483647) (<= 2147483776 (mod (div |ULTIMATE.start_main_~a~0#1| 16777216) 4294967296)))} assume main_~b~0#1 % 4294967296 > main_~zero~0#1 % 4294967296;main_~tmp___0~0#1 := 1; {18429#(or (<= (mod (div |ULTIMATE.start_main_~a~0#1| 16777216) 4294967296) 2147483647) (<= 2147483776 (mod (div |ULTIMATE.start_main_~a~0#1| 16777216) 4294967296)))} is VALID [2022-02-21 03:10:06,423 INFO L290 TraceCheckUtils]: 34: Hoare triple {18429#(or (<= (mod (div |ULTIMATE.start_main_~a~0#1| 16777216) 4294967296) 2147483647) (<= 2147483776 (mod (div |ULTIMATE.start_main_~a~0#1| 16777216) 4294967296)))} assume !(main_~b~0#1 % 4294967296 < main_~zero~0#1 % 4294967296); {18429#(or (<= (mod (div |ULTIMATE.start_main_~a~0#1| 16777216) 4294967296) 2147483647) (<= 2147483776 (mod (div |ULTIMATE.start_main_~a~0#1| 16777216) 4294967296)))} is VALID [2022-02-21 03:10:06,423 INFO L290 TraceCheckUtils]: 33: Hoare triple {18429#(or (<= (mod (div |ULTIMATE.start_main_~a~0#1| 16777216) 4294967296) 2147483647) (<= 2147483776 (mod (div |ULTIMATE.start_main_~a~0#1| 16777216) 4294967296)))} main_~sa~0#1 := main_~tmp~2#1; {18429#(or (<= (mod (div |ULTIMATE.start_main_~a~0#1| 16777216) 4294967296) 2147483647) (<= 2147483776 (mod (div |ULTIMATE.start_main_~a~0#1| 16777216) 4294967296)))} is VALID [2022-02-21 03:10:06,424 INFO L290 TraceCheckUtils]: 32: Hoare triple {18429#(or (<= (mod (div |ULTIMATE.start_main_~a~0#1| 16777216) 4294967296) 2147483647) (<= 2147483776 (mod (div |ULTIMATE.start_main_~a~0#1| 16777216) 4294967296)))} assume main_~a~0#1 % 4294967296 > main_~zero~0#1 % 4294967296;main_~tmp~2#1 := 1; {18429#(or (<= (mod (div |ULTIMATE.start_main_~a~0#1| 16777216) 4294967296) 2147483647) (<= 2147483776 (mod (div |ULTIMATE.start_main_~a~0#1| 16777216) 4294967296)))} is VALID [2022-02-21 03:10:06,424 INFO L290 TraceCheckUtils]: 31: Hoare triple {18429#(or (<= (mod (div |ULTIMATE.start_main_~a~0#1| 16777216) 4294967296) 2147483647) (<= 2147483776 (mod (div |ULTIMATE.start_main_~a~0#1| 16777216) 4294967296)))} assume !(main_~a~0#1 % 4294967296 < main_~zero~0#1 % 4294967296); {18429#(or (<= (mod (div |ULTIMATE.start_main_~a~0#1| 16777216) 4294967296) 2147483647) (<= 2147483776 (mod (div |ULTIMATE.start_main_~a~0#1| 16777216) 4294967296)))} is VALID [2022-02-21 03:10:06,424 INFO L290 TraceCheckUtils]: 30: Hoare triple {18429#(or (<= (mod (div |ULTIMATE.start_main_~a~0#1| 16777216) 4294967296) 2147483647) (<= 2147483776 (mod (div |ULTIMATE.start_main_~a~0#1| 16777216) 4294967296)))} main_~b~0#1 := main_#t~ret24#1;havoc main_#t~ret24#1; {18429#(or (<= (mod (div |ULTIMATE.start_main_~a~0#1| 16777216) 4294967296) 2147483647) (<= 2147483776 (mod (div |ULTIMATE.start_main_~a~0#1| 16777216) 4294967296)))} is VALID [2022-02-21 03:10:06,425 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {18233#true} {18429#(or (<= (mod (div |ULTIMATE.start_main_~a~0#1| 16777216) 4294967296) 2147483647) (<= 2147483776 (mod (div |ULTIMATE.start_main_~a~0#1| 16777216) 4294967296)))} #457#return; {18429#(or (<= (mod (div |ULTIMATE.start_main_~a~0#1| 16777216) 4294967296) 2147483647) (<= 2147483776 (mod (div |ULTIMATE.start_main_~a~0#1| 16777216) 4294967296)))} is VALID [2022-02-21 03:10:06,425 INFO L290 TraceCheckUtils]: 28: Hoare triple {18233#true} assume true; {18233#true} is VALID [2022-02-21 03:10:06,425 INFO L290 TraceCheckUtils]: 27: Hoare triple {18233#true} #res := ~__retres4~0; {18233#true} is VALID [2022-02-21 03:10:06,425 INFO L290 TraceCheckUtils]: 26: Hoare triple {18233#true} assume ~e >= 127;~__retres4~0 := 4294967295; {18233#true} is VALID [2022-02-21 03:10:06,425 INFO L290 TraceCheckUtils]: 25: Hoare triple {18233#true} assume ~m % 4294967296 >= 33554432; {18233#true} is VALID [2022-02-21 03:10:06,425 INFO L290 TraceCheckUtils]: 24: Hoare triple {18233#true} assume !false; {18233#true} is VALID [2022-02-21 03:10:06,425 INFO L290 TraceCheckUtils]: 23: Hoare triple {18233#true} assume !(~m % 4294967296 < 16777216); {18233#true} is VALID [2022-02-21 03:10:06,426 INFO L290 TraceCheckUtils]: 22: Hoare triple {18233#true} assume !(0 == ~m % 4294967296); {18233#true} is VALID [2022-02-21 03:10:06,426 INFO L290 TraceCheckUtils]: 21: Hoare triple {18233#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {18233#true} is VALID [2022-02-21 03:10:06,426 INFO L272 TraceCheckUtils]: 20: Hoare triple {18429#(or (<= (mod (div |ULTIMATE.start_main_~a~0#1| 16777216) 4294967296) 2147483647) (<= 2147483776 (mod (div |ULTIMATE.start_main_~a~0#1| 16777216) 4294967296)))} call main_#t~ret24#1 := base2flt(main_~mb~2#1, main_~eb~2#1); {18233#true} is VALID [2022-02-21 03:10:06,426 INFO L290 TraceCheckUtils]: 19: Hoare triple {18484#(or (<= 2147483776 (mod (div |ULTIMATE.start_main_#t~ret23#1| 16777216) 4294967296)) (<= (mod (div |ULTIMATE.start_main_#t~ret23#1| 16777216) 4294967296) 2147483647))} main_~a~0#1 := main_#t~ret23#1;havoc main_#t~ret23#1; {18429#(or (<= (mod (div |ULTIMATE.start_main_~a~0#1| 16777216) 4294967296) 2147483647) (<= 2147483776 (mod (div |ULTIMATE.start_main_~a~0#1| 16777216) 4294967296)))} is VALID [2022-02-21 03:10:06,427 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {18491#(or (<= (mod (div |base2flt_#res| 16777216) 4294967296) 2147483647) (<= 2147483776 (mod (div |base2flt_#res| 16777216) 4294967296)))} {18233#true} #455#return; {18484#(or (<= 2147483776 (mod (div |ULTIMATE.start_main_#t~ret23#1| 16777216) 4294967296)) (<= (mod (div |ULTIMATE.start_main_#t~ret23#1| 16777216) 4294967296) 2147483647))} is VALID [2022-02-21 03:10:06,427 INFO L290 TraceCheckUtils]: 17: Hoare triple {18491#(or (<= (mod (div |base2flt_#res| 16777216) 4294967296) 2147483647) (<= 2147483776 (mod (div |base2flt_#res| 16777216) 4294967296)))} assume true; {18491#(or (<= (mod (div |base2flt_#res| 16777216) 4294967296) 2147483647) (<= 2147483776 (mod (div |base2flt_#res| 16777216) 4294967296)))} is VALID [2022-02-21 03:10:06,435 INFO L290 TraceCheckUtils]: 16: Hoare triple {18498#(or (<= 2147483776 (mod (div base2flt_~__retres4~0 16777216) 4294967296)) (<= (mod (div base2flt_~__retres4~0 16777216) 4294967296) 2147483647))} #res := ~__retres4~0; {18491#(or (<= (mod (div |base2flt_#res| 16777216) 4294967296) 2147483647) (<= 2147483776 (mod (div |base2flt_#res| 16777216) 4294967296)))} is VALID [2022-02-21 03:10:06,436 INFO L290 TraceCheckUtils]: 15: Hoare triple {18233#true} assume ~e >= 127;~__retres4~0 := 4294967295; {18498#(or (<= 2147483776 (mod (div base2flt_~__retres4~0 16777216) 4294967296)) (<= (mod (div base2flt_~__retres4~0 16777216) 4294967296) 2147483647))} is VALID [2022-02-21 03:10:06,436 INFO L290 TraceCheckUtils]: 14: Hoare triple {18233#true} assume ~m % 4294967296 >= 33554432; {18233#true} is VALID [2022-02-21 03:10:06,436 INFO L290 TraceCheckUtils]: 13: Hoare triple {18233#true} assume !false; {18233#true} is VALID [2022-02-21 03:10:06,437 INFO L290 TraceCheckUtils]: 12: Hoare triple {18233#true} assume !(~m % 4294967296 < 16777216); {18233#true} is VALID [2022-02-21 03:10:06,437 INFO L290 TraceCheckUtils]: 11: Hoare triple {18233#true} assume !(0 == ~m % 4294967296); {18233#true} is VALID [2022-02-21 03:10:06,437 INFO L290 TraceCheckUtils]: 10: Hoare triple {18233#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {18233#true} is VALID [2022-02-21 03:10:06,437 INFO L272 TraceCheckUtils]: 9: Hoare triple {18233#true} call main_#t~ret23#1 := base2flt(main_~ma~2#1, main_~ea~2#1); {18233#true} is VALID [2022-02-21 03:10:06,437 INFO L290 TraceCheckUtils]: 8: Hoare triple {18233#true} main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1; {18233#true} is VALID [2022-02-21 03:10:06,437 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {18233#true} {18233#true} #453#return; {18233#true} is VALID [2022-02-21 03:10:06,437 INFO L290 TraceCheckUtils]: 6: Hoare triple {18233#true} assume true; {18233#true} is VALID [2022-02-21 03:10:06,437 INFO L290 TraceCheckUtils]: 5: Hoare triple {18233#true} #res := ~__retres4~0; {18233#true} is VALID [2022-02-21 03:10:06,437 INFO L290 TraceCheckUtils]: 4: Hoare triple {18233#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {18233#true} is VALID [2022-02-21 03:10:06,438 INFO L290 TraceCheckUtils]: 3: Hoare triple {18233#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {18233#true} is VALID [2022-02-21 03:10:06,438 INFO L272 TraceCheckUtils]: 2: Hoare triple {18233#true} call main_#t~ret22#1 := base2flt(0, 0); {18233#true} is VALID [2022-02-21 03:10:06,438 INFO L290 TraceCheckUtils]: 1: Hoare triple {18233#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_~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_add~0#1, main_~zero~0#1, main_~sa~0#1, main_~sb~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~tmp___1~0#1, main_~tmp___2~0#1, main_~tmp___3~0#1, main_~tmp___4~0#1, main_~tmp___5~0#1, main_~tmp___6~0#1, main_~tmp___7~0#1, main_~tmp___8~0#1, main_~tmp___9~0#1, main_~__retres23~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_add~0#1;havoc main_~zero~0#1;havoc main_~sa~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_~tmp___2~0#1;havoc main_~tmp___3~0#1;havoc main_~tmp___4~0#1;havoc main_~tmp___5~0#1;havoc main_~tmp___6~0#1;havoc main_~tmp___7~0#1;havoc main_~tmp___8~0#1;havoc main_~tmp___9~0#1;havoc main_~__retres23~0#1; {18233#true} is VALID [2022-02-21 03:10:06,438 INFO L290 TraceCheckUtils]: 0: Hoare triple {18233#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(24, 2);call #Ultimate.allocInit(12, 3); {18233#true} is VALID [2022-02-21 03:10:06,438 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-02-21 03:10:06,438 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [792704040] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:10:06,439 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:10:06,439 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 14 [2022-02-21 03:10:06,439 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983432353] [2022-02-21 03:10:06,439 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:10:06,440 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 4.428571428571429) internal successors, (62), 12 states have internal predecessors, (62), 3 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Word has length 46 [2022-02-21 03:10:06,440 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:10:06,440 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 15 states, 14 states have (on average 4.428571428571429) internal successors, (62), 12 states have internal predecessors, (62), 3 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2022-02-21 03:10:06,491 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:10:06,491 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-02-21 03:10:06,491 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:10:06,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-02-21 03:10:06,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2022-02-21 03:10:06,492 INFO L87 Difference]: Start difference. First operand 135 states and 169 transitions. Second operand has 15 states, 14 states have (on average 4.428571428571429) internal successors, (62), 12 states have internal predecessors, (62), 3 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2022-02-21 03:10:07,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:07,525 INFO L93 Difference]: Finished difference Result 283 states and 347 transitions. [2022-02-21 03:10:07,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-21 03:10:07,525 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 4.428571428571429) internal successors, (62), 12 states have internal predecessors, (62), 3 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Word has length 46 [2022-02-21 03:10:07,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:10:07,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 4.428571428571429) internal successors, (62), 12 states have internal predecessors, (62), 3 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2022-02-21 03:10:07,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 283 transitions. [2022-02-21 03:10:07,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 4.428571428571429) internal successors, (62), 12 states have internal predecessors, (62), 3 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2022-02-21 03:10:07,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 283 transitions. [2022-02-21 03:10:07,529 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 283 transitions. [2022-02-21 03:10:07,711 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 283 edges. 283 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:10:07,714 INFO L225 Difference]: With dead ends: 283 [2022-02-21 03:10:07,714 INFO L226 Difference]: Without dead ends: 227 [2022-02-21 03:10:07,714 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 89 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=309, Unknown=0, NotChecked=0, Total=380 [2022-02-21 03:10:07,714 INFO L933 BasicCegarLoop]: 117 mSDtfsCounter, 340 mSDsluCounter, 840 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 342 SdHoareTripleChecker+Valid, 957 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-21 03:10:07,715 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [342 Valid, 957 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-21 03:10:07,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2022-02-21 03:10:07,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 156. [2022-02-21 03:10:07,775 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:10:07,776 INFO L82 GeneralOperation]: Start isEquivalent. First operand 227 states. Second operand has 156 states, 135 states have (on average 1.3333333333333333) internal successors, (180), 144 states have internal predecessors, (180), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (7), 7 states have call predecessors, (7), 6 states have call successors, (7) [2022-02-21 03:10:07,776 INFO L74 IsIncluded]: Start isIncluded. First operand 227 states. Second operand has 156 states, 135 states have (on average 1.3333333333333333) internal successors, (180), 144 states have internal predecessors, (180), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (7), 7 states have call predecessors, (7), 6 states have call successors, (7) [2022-02-21 03:10:07,776 INFO L87 Difference]: Start difference. First operand 227 states. Second operand has 156 states, 135 states have (on average 1.3333333333333333) internal successors, (180), 144 states have internal predecessors, (180), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (7), 7 states have call predecessors, (7), 6 states have call successors, (7) [2022-02-21 03:10:07,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:07,779 INFO L93 Difference]: Finished difference Result 227 states and 281 transitions. [2022-02-21 03:10:07,779 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 281 transitions. [2022-02-21 03:10:07,780 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:10:07,780 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:10:07,780 INFO L74 IsIncluded]: Start isIncluded. First operand has 156 states, 135 states have (on average 1.3333333333333333) internal successors, (180), 144 states have internal predecessors, (180), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (7), 7 states have call predecessors, (7), 6 states have call successors, (7) Second operand 227 states. [2022-02-21 03:10:07,780 INFO L87 Difference]: Start difference. First operand has 156 states, 135 states have (on average 1.3333333333333333) internal successors, (180), 144 states have internal predecessors, (180), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (7), 7 states have call predecessors, (7), 6 states have call successors, (7) Second operand 227 states. [2022-02-21 03:10:07,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:07,783 INFO L93 Difference]: Finished difference Result 227 states and 281 transitions. [2022-02-21 03:10:07,783 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 281 transitions. [2022-02-21 03:10:07,784 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:10:07,784 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:10:07,784 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:10:07,784 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:10:07,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 135 states have (on average 1.3333333333333333) internal successors, (180), 144 states have internal predecessors, (180), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (7), 7 states have call predecessors, (7), 6 states have call successors, (7) [2022-02-21 03:10:07,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 193 transitions. [2022-02-21 03:10:07,787 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 193 transitions. Word has length 46 [2022-02-21 03:10:07,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:10:07,787 INFO L470 AbstractCegarLoop]: Abstraction has 156 states and 193 transitions. [2022-02-21 03:10:07,787 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 4.428571428571429) internal successors, (62), 12 states have internal predecessors, (62), 3 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2022-02-21 03:10:07,787 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 193 transitions. [2022-02-21 03:10:07,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-02-21 03:10:07,789 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:10:07,789 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:10:07,806 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-02-21 03:10:08,006 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-02-21 03:10:08,006 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-02-21 03:10:08,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:10:08,007 INFO L85 PathProgramCache]: Analyzing trace with hash 1527027040, now seen corresponding path program 1 times [2022-02-21 03:10:08,007 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:10:08,007 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266399845] [2022-02-21 03:10:08,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:10:08,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:10:08,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:08,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-21 03:10:08,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:08,030 INFO L290 TraceCheckUtils]: 0: Hoare triple {19525#(and (= abs_77 |old(abs_77)|) (= abs_78 |old(abs_78)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {19494#true} is VALID [2022-02-21 03:10:08,031 INFO L290 TraceCheckUtils]: 1: Hoare triple {19494#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {19494#true} is VALID [2022-02-21 03:10:08,031 INFO L290 TraceCheckUtils]: 2: Hoare triple {19494#true} #res := ~__retres4~0; {19494#true} is VALID [2022-02-21 03:10:08,031 INFO L290 TraceCheckUtils]: 3: Hoare triple {19494#true} assume true; {19494#true} is VALID [2022-02-21 03:10:08,031 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {19494#true} {19494#true} #453#return; {19494#true} is VALID [2022-02-21 03:10:08,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-02-21 03:10:08,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:08,042 INFO L290 TraceCheckUtils]: 0: Hoare triple {19525#(and (= abs_77 |old(abs_77)|) (= abs_78 |old(abs_78)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {19494#true} is VALID [2022-02-21 03:10:08,042 INFO L290 TraceCheckUtils]: 1: Hoare triple {19494#true} assume !(0 == ~m % 4294967296); {19494#true} is VALID [2022-02-21 03:10:08,042 INFO L290 TraceCheckUtils]: 2: Hoare triple {19494#true} assume !(~m % 4294967296 < 16777216); {19494#true} is VALID [2022-02-21 03:10:08,043 INFO L290 TraceCheckUtils]: 3: Hoare triple {19494#true} assume !false; {19494#true} is VALID [2022-02-21 03:10:08,043 INFO L290 TraceCheckUtils]: 4: Hoare triple {19494#true} assume !(~m % 4294967296 >= 33554432); {19494#true} is VALID [2022-02-21 03:10:08,043 INFO L290 TraceCheckUtils]: 5: Hoare triple {19494#true} assume 0 == ~m || 0 == ~bitwiseComplement(16777216);~m := 0; {19526#(<= base2flt_~m 0)} is VALID [2022-02-21 03:10:08,043 INFO L290 TraceCheckUtils]: 6: Hoare triple {19526#(<= base2flt_~m 0)} assume 128 + ~e <= 2147483647; {19526#(<= base2flt_~m 0)} is VALID [2022-02-21 03:10:08,044 INFO L290 TraceCheckUtils]: 7: Hoare triple {19526#(<= base2flt_~m 0)} assume 128 + ~e >= -2147483648; {19526#(<= base2flt_~m 0)} is VALID [2022-02-21 03:10:08,044 INFO L290 TraceCheckUtils]: 8: Hoare triple {19526#(<= base2flt_~m 0)} assume 128 + ~e <= 2147483647; {19526#(<= base2flt_~m 0)} is VALID [2022-02-21 03:10:08,044 INFO L290 TraceCheckUtils]: 9: Hoare triple {19526#(<= base2flt_~m 0)} assume 128 + ~e >= -2147483648; {19526#(<= base2flt_~m 0)} is VALID [2022-02-21 03:10:08,045 INFO L290 TraceCheckUtils]: 10: Hoare triple {19526#(<= base2flt_~m 0)} assume (1 == ~m && (0 == 16777216 * (128 + ~e) || 1 == 16777216 * (128 + ~e))) || ((0 == ~m || 1 == ~m) && 1 == 16777216 * (128 + ~e));~res~0 := 1; {19495#false} is VALID [2022-02-21 03:10:08,045 INFO L290 TraceCheckUtils]: 11: Hoare triple {19495#false} ~__retres4~0 := ~res~0; {19495#false} is VALID [2022-02-21 03:10:08,045 INFO L290 TraceCheckUtils]: 12: Hoare triple {19495#false} #res := ~__retres4~0; {19495#false} is VALID [2022-02-21 03:10:08,045 INFO L290 TraceCheckUtils]: 13: Hoare triple {19495#false} assume true; {19495#false} is VALID [2022-02-21 03:10:08,045 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {19495#false} {19494#true} #455#return; {19495#false} is VALID [2022-02-21 03:10:08,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-02-21 03:10:08,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:08,050 INFO L290 TraceCheckUtils]: 0: Hoare triple {19525#(and (= abs_77 |old(abs_77)|) (= abs_78 |old(abs_78)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {19494#true} is VALID [2022-02-21 03:10:08,050 INFO L290 TraceCheckUtils]: 1: Hoare triple {19494#true} assume !(0 == ~m % 4294967296); {19494#true} is VALID [2022-02-21 03:10:08,050 INFO L290 TraceCheckUtils]: 2: Hoare triple {19494#true} assume !(~m % 4294967296 < 16777216); {19494#true} is VALID [2022-02-21 03:10:08,050 INFO L290 TraceCheckUtils]: 3: Hoare triple {19494#true} assume !false; {19494#true} is VALID [2022-02-21 03:10:08,051 INFO L290 TraceCheckUtils]: 4: Hoare triple {19494#true} assume ~m % 4294967296 >= 33554432; {19494#true} is VALID [2022-02-21 03:10:08,051 INFO L290 TraceCheckUtils]: 5: Hoare triple {19494#true} assume ~e >= 127;~__retres4~0 := 4294967295; {19494#true} is VALID [2022-02-21 03:10:08,051 INFO L290 TraceCheckUtils]: 6: Hoare triple {19494#true} #res := ~__retres4~0; {19494#true} is VALID [2022-02-21 03:10:08,051 INFO L290 TraceCheckUtils]: 7: Hoare triple {19494#true} assume true; {19494#true} is VALID [2022-02-21 03:10:08,051 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {19494#true} {19495#false} #457#return; {19495#false} is VALID [2022-02-21 03:10:08,051 INFO L290 TraceCheckUtils]: 0: Hoare triple {19494#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(24, 2);call #Ultimate.allocInit(12, 3); {19494#true} is VALID [2022-02-21 03:10:08,051 INFO L290 TraceCheckUtils]: 1: Hoare triple {19494#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_~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_add~0#1, main_~zero~0#1, main_~sa~0#1, main_~sb~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~tmp___1~0#1, main_~tmp___2~0#1, main_~tmp___3~0#1, main_~tmp___4~0#1, main_~tmp___5~0#1, main_~tmp___6~0#1, main_~tmp___7~0#1, main_~tmp___8~0#1, main_~tmp___9~0#1, main_~__retres23~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_add~0#1;havoc main_~zero~0#1;havoc main_~sa~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_~tmp___2~0#1;havoc main_~tmp___3~0#1;havoc main_~tmp___4~0#1;havoc main_~tmp___5~0#1;havoc main_~tmp___6~0#1;havoc main_~tmp___7~0#1;havoc main_~tmp___8~0#1;havoc main_~tmp___9~0#1;havoc main_~__retres23~0#1; {19494#true} is VALID [2022-02-21 03:10:08,052 INFO L272 TraceCheckUtils]: 2: Hoare triple {19494#true} call main_#t~ret22#1 := base2flt(0, 0); {19525#(and (= abs_77 |old(abs_77)|) (= abs_78 |old(abs_78)|))} is VALID [2022-02-21 03:10:08,052 INFO L290 TraceCheckUtils]: 3: Hoare triple {19525#(and (= abs_77 |old(abs_77)|) (= abs_78 |old(abs_78)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {19494#true} is VALID [2022-02-21 03:10:08,052 INFO L290 TraceCheckUtils]: 4: Hoare triple {19494#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {19494#true} is VALID [2022-02-21 03:10:08,052 INFO L290 TraceCheckUtils]: 5: Hoare triple {19494#true} #res := ~__retres4~0; {19494#true} is VALID [2022-02-21 03:10:08,052 INFO L290 TraceCheckUtils]: 6: Hoare triple {19494#true} assume true; {19494#true} is VALID [2022-02-21 03:10:08,053 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {19494#true} {19494#true} #453#return; {19494#true} is VALID [2022-02-21 03:10:08,053 INFO L290 TraceCheckUtils]: 8: Hoare triple {19494#true} main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1; {19494#true} is VALID [2022-02-21 03:10:08,053 INFO L272 TraceCheckUtils]: 9: Hoare triple {19494#true} call main_#t~ret23#1 := base2flt(main_~ma~2#1, main_~ea~2#1); {19525#(and (= abs_77 |old(abs_77)|) (= abs_78 |old(abs_78)|))} is VALID [2022-02-21 03:10:08,053 INFO L290 TraceCheckUtils]: 10: Hoare triple {19525#(and (= abs_77 |old(abs_77)|) (= abs_78 |old(abs_78)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {19494#true} is VALID [2022-02-21 03:10:08,053 INFO L290 TraceCheckUtils]: 11: Hoare triple {19494#true} assume !(0 == ~m % 4294967296); {19494#true} is VALID [2022-02-21 03:10:08,054 INFO L290 TraceCheckUtils]: 12: Hoare triple {19494#true} assume !(~m % 4294967296 < 16777216); {19494#true} is VALID [2022-02-21 03:10:08,054 INFO L290 TraceCheckUtils]: 13: Hoare triple {19494#true} assume !false; {19494#true} is VALID [2022-02-21 03:10:08,054 INFO L290 TraceCheckUtils]: 14: Hoare triple {19494#true} assume !(~m % 4294967296 >= 33554432); {19494#true} is VALID [2022-02-21 03:10:08,054 INFO L290 TraceCheckUtils]: 15: Hoare triple {19494#true} assume 0 == ~m || 0 == ~bitwiseComplement(16777216);~m := 0; {19526#(<= base2flt_~m 0)} is VALID [2022-02-21 03:10:08,054 INFO L290 TraceCheckUtils]: 16: Hoare triple {19526#(<= base2flt_~m 0)} assume 128 + ~e <= 2147483647; {19526#(<= base2flt_~m 0)} is VALID [2022-02-21 03:10:08,055 INFO L290 TraceCheckUtils]: 17: Hoare triple {19526#(<= base2flt_~m 0)} assume 128 + ~e >= -2147483648; {19526#(<= base2flt_~m 0)} is VALID [2022-02-21 03:10:08,055 INFO L290 TraceCheckUtils]: 18: Hoare triple {19526#(<= base2flt_~m 0)} assume 128 + ~e <= 2147483647; {19526#(<= base2flt_~m 0)} is VALID [2022-02-21 03:10:08,055 INFO L290 TraceCheckUtils]: 19: Hoare triple {19526#(<= base2flt_~m 0)} assume 128 + ~e >= -2147483648; {19526#(<= base2flt_~m 0)} is VALID [2022-02-21 03:10:08,056 INFO L290 TraceCheckUtils]: 20: Hoare triple {19526#(<= base2flt_~m 0)} assume (1 == ~m && (0 == 16777216 * (128 + ~e) || 1 == 16777216 * (128 + ~e))) || ((0 == ~m || 1 == ~m) && 1 == 16777216 * (128 + ~e));~res~0 := 1; {19495#false} is VALID [2022-02-21 03:10:08,056 INFO L290 TraceCheckUtils]: 21: Hoare triple {19495#false} ~__retres4~0 := ~res~0; {19495#false} is VALID [2022-02-21 03:10:08,056 INFO L290 TraceCheckUtils]: 22: Hoare triple {19495#false} #res := ~__retres4~0; {19495#false} is VALID [2022-02-21 03:10:08,056 INFO L290 TraceCheckUtils]: 23: Hoare triple {19495#false} assume true; {19495#false} is VALID [2022-02-21 03:10:08,056 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {19495#false} {19494#true} #455#return; {19495#false} is VALID [2022-02-21 03:10:08,056 INFO L290 TraceCheckUtils]: 25: Hoare triple {19495#false} main_~a~0#1 := main_#t~ret23#1;havoc main_#t~ret23#1; {19495#false} is VALID [2022-02-21 03:10:08,056 INFO L272 TraceCheckUtils]: 26: Hoare triple {19495#false} call main_#t~ret24#1 := base2flt(main_~mb~2#1, main_~eb~2#1); {19525#(and (= abs_77 |old(abs_77)|) (= abs_78 |old(abs_78)|))} is VALID [2022-02-21 03:10:08,056 INFO L290 TraceCheckUtils]: 27: Hoare triple {19525#(and (= abs_77 |old(abs_77)|) (= abs_78 |old(abs_78)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {19494#true} is VALID [2022-02-21 03:10:08,057 INFO L290 TraceCheckUtils]: 28: Hoare triple {19494#true} assume !(0 == ~m % 4294967296); {19494#true} is VALID [2022-02-21 03:10:08,057 INFO L290 TraceCheckUtils]: 29: Hoare triple {19494#true} assume !(~m % 4294967296 < 16777216); {19494#true} is VALID [2022-02-21 03:10:08,057 INFO L290 TraceCheckUtils]: 30: Hoare triple {19494#true} assume !false; {19494#true} is VALID [2022-02-21 03:10:08,057 INFO L290 TraceCheckUtils]: 31: Hoare triple {19494#true} assume ~m % 4294967296 >= 33554432; {19494#true} is VALID [2022-02-21 03:10:08,057 INFO L290 TraceCheckUtils]: 32: Hoare triple {19494#true} assume ~e >= 127;~__retres4~0 := 4294967295; {19494#true} is VALID [2022-02-21 03:10:08,057 INFO L290 TraceCheckUtils]: 33: Hoare triple {19494#true} #res := ~__retres4~0; {19494#true} is VALID [2022-02-21 03:10:08,057 INFO L290 TraceCheckUtils]: 34: Hoare triple {19494#true} assume true; {19494#true} is VALID [2022-02-21 03:10:08,057 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {19494#true} {19495#false} #457#return; {19495#false} is VALID [2022-02-21 03:10:08,057 INFO L290 TraceCheckUtils]: 36: Hoare triple {19495#false} main_~b~0#1 := main_#t~ret24#1;havoc main_#t~ret24#1; {19495#false} is VALID [2022-02-21 03:10:08,058 INFO L290 TraceCheckUtils]: 37: Hoare triple {19495#false} assume !(main_~a~0#1 % 4294967296 < main_~zero~0#1 % 4294967296); {19495#false} is VALID [2022-02-21 03:10:08,058 INFO L290 TraceCheckUtils]: 38: Hoare triple {19495#false} assume main_~a~0#1 % 4294967296 > main_~zero~0#1 % 4294967296;main_~tmp~2#1 := 1; {19495#false} is VALID [2022-02-21 03:10:08,058 INFO L290 TraceCheckUtils]: 39: Hoare triple {19495#false} main_~sa~0#1 := main_~tmp~2#1; {19495#false} is VALID [2022-02-21 03:10:08,058 INFO L290 TraceCheckUtils]: 40: Hoare triple {19495#false} assume !(main_~b~0#1 % 4294967296 < main_~zero~0#1 % 4294967296); {19495#false} is VALID [2022-02-21 03:10:08,058 INFO L290 TraceCheckUtils]: 41: Hoare triple {19495#false} assume main_~b~0#1 % 4294967296 > main_~zero~0#1 % 4294967296;main_~tmp___0~0#1 := 1; {19495#false} is VALID [2022-02-21 03:10:08,058 INFO L290 TraceCheckUtils]: 42: Hoare triple {19495#false} main_~sb~0#1 := main_~tmp___0~0#1; {19495#false} is VALID [2022-02-21 03:10:08,058 INFO L290 TraceCheckUtils]: 43: Hoare triple {19495#false} assume { :begin_inline_addflt } true;addflt_#in~a#1, addflt_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc addflt_#res#1;havoc addflt_#t~nondet6#1, addflt_#t~nondet7#1, addflt_#t~nondet8#1, addflt_#t~nondet9#1, addflt_#t~nondet10#1, addflt_#t~nondet11#1, addflt_~a#1, addflt_~b#1, addflt_~res~1#1, addflt_~ma~0#1, addflt_~mb~0#1, addflt_~delta~0#1, addflt_~ea~0#1, addflt_~eb~0#1, addflt_~tmp~0#1, addflt_~__retres10~0#1;addflt_~a#1 := addflt_#in~a#1;addflt_~b#1 := addflt_#in~b#1;havoc addflt_~res~1#1;havoc addflt_~ma~0#1;havoc addflt_~mb~0#1;havoc addflt_~delta~0#1;havoc addflt_~ea~0#1;havoc addflt_~eb~0#1;havoc addflt_~tmp~0#1;havoc addflt_~__retres10~0#1; {19495#false} is VALID [2022-02-21 03:10:08,058 INFO L290 TraceCheckUtils]: 44: Hoare triple {19495#false} assume !(addflt_~a#1 % 4294967296 < addflt_~b#1 % 4294967296); {19495#false} is VALID [2022-02-21 03:10:08,059 INFO L290 TraceCheckUtils]: 45: Hoare triple {19495#false} assume !(0 == addflt_~b#1 % 4294967296); {19495#false} is VALID [2022-02-21 03:10:08,059 INFO L290 TraceCheckUtils]: 46: Hoare triple {19495#false} assume !(0 == addflt_~a#1); {19495#false} is VALID [2022-02-21 03:10:08,059 INFO L290 TraceCheckUtils]: 47: Hoare triple {19495#false} assume !false; {19495#false} is VALID [2022-02-21 03:10:08,059 INFO L290 TraceCheckUtils]: 48: Hoare triple {19495#false} assume !false; {19495#false} is VALID [2022-02-21 03:10:08,059 INFO L290 TraceCheckUtils]: 49: Hoare triple {19495#false} assume addflt_~a#1 >= 0;abs_109 := (if addflt_~a#1 < 16777215 then addflt_~a#1 else 16777215);assume addflt_~a#1 >= 0;assume addflt_~ma~0#1 < abs_109; {19495#false} is VALID [2022-02-21 03:10:08,059 INFO L290 TraceCheckUtils]: 50: Hoare triple {19495#false} assume (if addflt_~a#1 / 16777216 % 4294967296 % 4294967296 <= 2147483647 then addflt_~a#1 / 16777216 % 4294967296 % 4294967296 else addflt_~a#1 / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 <= 2147483647; {19495#false} is VALID [2022-02-21 03:10:08,059 INFO L290 TraceCheckUtils]: 51: Hoare triple {19495#false} assume !((if addflt_~a#1 / 16777216 % 4294967296 % 4294967296 <= 2147483647 then addflt_~a#1 / 16777216 % 4294967296 % 4294967296 else addflt_~a#1 / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 >= -2147483648); {19495#false} is VALID [2022-02-21 03:10:08,059 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-02-21 03:10:08,060 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:10:08,060 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266399845] [2022-02-21 03:10:08,060 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266399845] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:10:08,060 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [655356677] [2022-02-21 03:10:08,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:10:08,060 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:10:08,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:10:08,061 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:10:08,063 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-02-21 03:10:08,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:08,111 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:10:08,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:08,122 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:10:08,200 INFO L290 TraceCheckUtils]: 0: Hoare triple {19494#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(24, 2);call #Ultimate.allocInit(12, 3); {19494#true} is VALID [2022-02-21 03:10:08,200 INFO L290 TraceCheckUtils]: 1: Hoare triple {19494#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_~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_add~0#1, main_~zero~0#1, main_~sa~0#1, main_~sb~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~tmp___1~0#1, main_~tmp___2~0#1, main_~tmp___3~0#1, main_~tmp___4~0#1, main_~tmp___5~0#1, main_~tmp___6~0#1, main_~tmp___7~0#1, main_~tmp___8~0#1, main_~tmp___9~0#1, main_~__retres23~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_add~0#1;havoc main_~zero~0#1;havoc main_~sa~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_~tmp___2~0#1;havoc main_~tmp___3~0#1;havoc main_~tmp___4~0#1;havoc main_~tmp___5~0#1;havoc main_~tmp___6~0#1;havoc main_~tmp___7~0#1;havoc main_~tmp___8~0#1;havoc main_~tmp___9~0#1;havoc main_~__retres23~0#1; {19494#true} is VALID [2022-02-21 03:10:08,200 INFO L272 TraceCheckUtils]: 2: Hoare triple {19494#true} call main_#t~ret22#1 := base2flt(0, 0); {19494#true} is VALID [2022-02-21 03:10:08,201 INFO L290 TraceCheckUtils]: 3: Hoare triple {19494#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {19494#true} is VALID [2022-02-21 03:10:08,201 INFO L290 TraceCheckUtils]: 4: Hoare triple {19494#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {19494#true} is VALID [2022-02-21 03:10:08,201 INFO L290 TraceCheckUtils]: 5: Hoare triple {19494#true} #res := ~__retres4~0; {19494#true} is VALID [2022-02-21 03:10:08,201 INFO L290 TraceCheckUtils]: 6: Hoare triple {19494#true} assume true; {19494#true} is VALID [2022-02-21 03:10:08,201 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {19494#true} {19494#true} #453#return; {19494#true} is VALID [2022-02-21 03:10:08,201 INFO L290 TraceCheckUtils]: 8: Hoare triple {19494#true} main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1; {19494#true} is VALID [2022-02-21 03:10:08,201 INFO L272 TraceCheckUtils]: 9: Hoare triple {19494#true} call main_#t~ret23#1 := base2flt(main_~ma~2#1, main_~ea~2#1); {19494#true} is VALID [2022-02-21 03:10:08,201 INFO L290 TraceCheckUtils]: 10: Hoare triple {19494#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {19494#true} is VALID [2022-02-21 03:10:08,202 INFO L290 TraceCheckUtils]: 11: Hoare triple {19494#true} assume !(0 == ~m % 4294967296); {19494#true} is VALID [2022-02-21 03:10:08,202 INFO L290 TraceCheckUtils]: 12: Hoare triple {19494#true} assume !(~m % 4294967296 < 16777216); {19494#true} is VALID [2022-02-21 03:10:08,202 INFO L290 TraceCheckUtils]: 13: Hoare triple {19494#true} assume !false; {19494#true} is VALID [2022-02-21 03:10:08,202 INFO L290 TraceCheckUtils]: 14: Hoare triple {19494#true} assume !(~m % 4294967296 >= 33554432); {19494#true} is VALID [2022-02-21 03:10:08,202 INFO L290 TraceCheckUtils]: 15: Hoare triple {19494#true} assume 0 == ~m || 0 == ~bitwiseComplement(16777216);~m := 0; {19526#(<= base2flt_~m 0)} is VALID [2022-02-21 03:10:08,203 INFO L290 TraceCheckUtils]: 16: Hoare triple {19526#(<= base2flt_~m 0)} assume 128 + ~e <= 2147483647; {19526#(<= base2flt_~m 0)} is VALID [2022-02-21 03:10:08,203 INFO L290 TraceCheckUtils]: 17: Hoare triple {19526#(<= base2flt_~m 0)} assume 128 + ~e >= -2147483648; {19526#(<= base2flt_~m 0)} is VALID [2022-02-21 03:10:08,203 INFO L290 TraceCheckUtils]: 18: Hoare triple {19526#(<= base2flt_~m 0)} assume 128 + ~e <= 2147483647; {19526#(<= base2flt_~m 0)} is VALID [2022-02-21 03:10:08,204 INFO L290 TraceCheckUtils]: 19: Hoare triple {19526#(<= base2flt_~m 0)} assume 128 + ~e >= -2147483648; {19526#(<= base2flt_~m 0)} is VALID [2022-02-21 03:10:08,204 INFO L290 TraceCheckUtils]: 20: Hoare triple {19526#(<= base2flt_~m 0)} assume (1 == ~m && (0 == 16777216 * (128 + ~e) || 1 == 16777216 * (128 + ~e))) || ((0 == ~m || 1 == ~m) && 1 == 16777216 * (128 + ~e));~res~0 := 1; {19495#false} is VALID [2022-02-21 03:10:08,204 INFO L290 TraceCheckUtils]: 21: Hoare triple {19495#false} ~__retres4~0 := ~res~0; {19495#false} is VALID [2022-02-21 03:10:08,204 INFO L290 TraceCheckUtils]: 22: Hoare triple {19495#false} #res := ~__retres4~0; {19495#false} is VALID [2022-02-21 03:10:08,204 INFO L290 TraceCheckUtils]: 23: Hoare triple {19495#false} assume true; {19495#false} is VALID [2022-02-21 03:10:08,204 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {19495#false} {19494#true} #455#return; {19495#false} is VALID [2022-02-21 03:10:08,205 INFO L290 TraceCheckUtils]: 25: Hoare triple {19495#false} main_~a~0#1 := main_#t~ret23#1;havoc main_#t~ret23#1; {19495#false} is VALID [2022-02-21 03:10:08,205 INFO L272 TraceCheckUtils]: 26: Hoare triple {19495#false} call main_#t~ret24#1 := base2flt(main_~mb~2#1, main_~eb~2#1); {19495#false} is VALID [2022-02-21 03:10:08,205 INFO L290 TraceCheckUtils]: 27: Hoare triple {19495#false} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {19495#false} is VALID [2022-02-21 03:10:08,205 INFO L290 TraceCheckUtils]: 28: Hoare triple {19495#false} assume !(0 == ~m % 4294967296); {19495#false} is VALID [2022-02-21 03:10:08,205 INFO L290 TraceCheckUtils]: 29: Hoare triple {19495#false} assume !(~m % 4294967296 < 16777216); {19495#false} is VALID [2022-02-21 03:10:08,205 INFO L290 TraceCheckUtils]: 30: Hoare triple {19495#false} assume !false; {19495#false} is VALID [2022-02-21 03:10:08,205 INFO L290 TraceCheckUtils]: 31: Hoare triple {19495#false} assume ~m % 4294967296 >= 33554432; {19495#false} is VALID [2022-02-21 03:10:08,205 INFO L290 TraceCheckUtils]: 32: Hoare triple {19495#false} assume ~e >= 127;~__retres4~0 := 4294967295; {19495#false} is VALID [2022-02-21 03:10:08,206 INFO L290 TraceCheckUtils]: 33: Hoare triple {19495#false} #res := ~__retres4~0; {19495#false} is VALID [2022-02-21 03:10:08,206 INFO L290 TraceCheckUtils]: 34: Hoare triple {19495#false} assume true; {19495#false} is VALID [2022-02-21 03:10:08,206 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {19495#false} {19495#false} #457#return; {19495#false} is VALID [2022-02-21 03:10:08,206 INFO L290 TraceCheckUtils]: 36: Hoare triple {19495#false} main_~b~0#1 := main_#t~ret24#1;havoc main_#t~ret24#1; {19495#false} is VALID [2022-02-21 03:10:08,206 INFO L290 TraceCheckUtils]: 37: Hoare triple {19495#false} assume !(main_~a~0#1 % 4294967296 < main_~zero~0#1 % 4294967296); {19495#false} is VALID [2022-02-21 03:10:08,206 INFO L290 TraceCheckUtils]: 38: Hoare triple {19495#false} assume main_~a~0#1 % 4294967296 > main_~zero~0#1 % 4294967296;main_~tmp~2#1 := 1; {19495#false} is VALID [2022-02-21 03:10:08,206 INFO L290 TraceCheckUtils]: 39: Hoare triple {19495#false} main_~sa~0#1 := main_~tmp~2#1; {19495#false} is VALID [2022-02-21 03:10:08,206 INFO L290 TraceCheckUtils]: 40: Hoare triple {19495#false} assume !(main_~b~0#1 % 4294967296 < main_~zero~0#1 % 4294967296); {19495#false} is VALID [2022-02-21 03:10:08,206 INFO L290 TraceCheckUtils]: 41: Hoare triple {19495#false} assume main_~b~0#1 % 4294967296 > main_~zero~0#1 % 4294967296;main_~tmp___0~0#1 := 1; {19495#false} is VALID [2022-02-21 03:10:08,207 INFO L290 TraceCheckUtils]: 42: Hoare triple {19495#false} main_~sb~0#1 := main_~tmp___0~0#1; {19495#false} is VALID [2022-02-21 03:10:08,207 INFO L290 TraceCheckUtils]: 43: Hoare triple {19495#false} assume { :begin_inline_addflt } true;addflt_#in~a#1, addflt_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc addflt_#res#1;havoc addflt_#t~nondet6#1, addflt_#t~nondet7#1, addflt_#t~nondet8#1, addflt_#t~nondet9#1, addflt_#t~nondet10#1, addflt_#t~nondet11#1, addflt_~a#1, addflt_~b#1, addflt_~res~1#1, addflt_~ma~0#1, addflt_~mb~0#1, addflt_~delta~0#1, addflt_~ea~0#1, addflt_~eb~0#1, addflt_~tmp~0#1, addflt_~__retres10~0#1;addflt_~a#1 := addflt_#in~a#1;addflt_~b#1 := addflt_#in~b#1;havoc addflt_~res~1#1;havoc addflt_~ma~0#1;havoc addflt_~mb~0#1;havoc addflt_~delta~0#1;havoc addflt_~ea~0#1;havoc addflt_~eb~0#1;havoc addflt_~tmp~0#1;havoc addflt_~__retres10~0#1; {19495#false} is VALID [2022-02-21 03:10:08,207 INFO L290 TraceCheckUtils]: 44: Hoare triple {19495#false} assume !(addflt_~a#1 % 4294967296 < addflt_~b#1 % 4294967296); {19495#false} is VALID [2022-02-21 03:10:08,207 INFO L290 TraceCheckUtils]: 45: Hoare triple {19495#false} assume !(0 == addflt_~b#1 % 4294967296); {19495#false} is VALID [2022-02-21 03:10:08,207 INFO L290 TraceCheckUtils]: 46: Hoare triple {19495#false} assume !(0 == addflt_~a#1); {19495#false} is VALID [2022-02-21 03:10:08,207 INFO L290 TraceCheckUtils]: 47: Hoare triple {19495#false} assume !false; {19495#false} is VALID [2022-02-21 03:10:08,207 INFO L290 TraceCheckUtils]: 48: Hoare triple {19495#false} assume !false; {19495#false} is VALID [2022-02-21 03:10:08,207 INFO L290 TraceCheckUtils]: 49: Hoare triple {19495#false} assume addflt_~a#1 >= 0;abs_109 := (if addflt_~a#1 < 16777215 then addflt_~a#1 else 16777215);assume addflt_~a#1 >= 0;assume addflt_~ma~0#1 < abs_109; {19495#false} is VALID [2022-02-21 03:10:08,208 INFO L290 TraceCheckUtils]: 50: Hoare triple {19495#false} assume (if addflt_~a#1 / 16777216 % 4294967296 % 4294967296 <= 2147483647 then addflt_~a#1 / 16777216 % 4294967296 % 4294967296 else addflt_~a#1 / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 <= 2147483647; {19495#false} is VALID [2022-02-21 03:10:08,208 INFO L290 TraceCheckUtils]: 51: Hoare triple {19495#false} assume !((if addflt_~a#1 / 16777216 % 4294967296 % 4294967296 <= 2147483647 then addflt_~a#1 / 16777216 % 4294967296 % 4294967296 else addflt_~a#1 / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 >= -2147483648); {19495#false} is VALID [2022-02-21 03:10:08,208 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-02-21 03:10:08,208 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-21 03:10:08,208 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [655356677] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:10:08,208 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-21 03:10:08,208 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 4 [2022-02-21 03:10:08,209 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344500202] [2022-02-21 03:10:08,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:10:08,210 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 52 [2022-02-21 03:10:08,210 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:10:08,210 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-21 03:10:08,236 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:10:08,237 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 03:10:08,237 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:10:08,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 03:10:08,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-21 03:10:08,238 INFO L87 Difference]: Start difference. First operand 156 states and 193 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-21 03:10:08,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:08,437 INFO L93 Difference]: Finished difference Result 296 states and 368 transitions. [2022-02-21 03:10:08,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 03:10:08,438 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 52 [2022-02-21 03:10:08,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:10:08,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-21 03:10:08,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 259 transitions. [2022-02-21 03:10:08,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-21 03:10:08,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 259 transitions. [2022-02-21 03:10:08,441 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 259 transitions. [2022-02-21 03:10:08,590 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 259 edges. 259 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:10:08,592 INFO L225 Difference]: With dead ends: 296 [2022-02-21 03:10:08,592 INFO L226 Difference]: Without dead ends: 180 [2022-02-21 03:10:08,593 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-21 03:10:08,593 INFO L933 BasicCegarLoop]: 121 mSDtfsCounter, 10 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:10:08,593 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 220 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:10:08,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2022-02-21 03:10:08,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 166. [2022-02-21 03:10:08,668 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:10:08,668 INFO L82 GeneralOperation]: Start isEquivalent. First operand 180 states. Second operand has 166 states, 145 states have (on average 1.3103448275862069) internal successors, (190), 154 states have internal predecessors, (190), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (7), 7 states have call predecessors, (7), 6 states have call successors, (7) [2022-02-21 03:10:08,668 INFO L74 IsIncluded]: Start isIncluded. First operand 180 states. Second operand has 166 states, 145 states have (on average 1.3103448275862069) internal successors, (190), 154 states have internal predecessors, (190), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (7), 7 states have call predecessors, (7), 6 states have call successors, (7) [2022-02-21 03:10:08,668 INFO L87 Difference]: Start difference. First operand 180 states. Second operand has 166 states, 145 states have (on average 1.3103448275862069) internal successors, (190), 154 states have internal predecessors, (190), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (7), 7 states have call predecessors, (7), 6 states have call successors, (7) [2022-02-21 03:10:08,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:08,671 INFO L93 Difference]: Finished difference Result 180 states and 224 transitions. [2022-02-21 03:10:08,671 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 224 transitions. [2022-02-21 03:10:08,671 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:10:08,671 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:10:08,672 INFO L74 IsIncluded]: Start isIncluded. First operand has 166 states, 145 states have (on average 1.3103448275862069) internal successors, (190), 154 states have internal predecessors, (190), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (7), 7 states have call predecessors, (7), 6 states have call successors, (7) Second operand 180 states. [2022-02-21 03:10:08,672 INFO L87 Difference]: Start difference. First operand has 166 states, 145 states have (on average 1.3103448275862069) internal successors, (190), 154 states have internal predecessors, (190), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (7), 7 states have call predecessors, (7), 6 states have call successors, (7) Second operand 180 states. [2022-02-21 03:10:08,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:08,674 INFO L93 Difference]: Finished difference Result 180 states and 224 transitions. [2022-02-21 03:10:08,674 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 224 transitions. [2022-02-21 03:10:08,674 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:10:08,674 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:10:08,674 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:10:08,674 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:10:08,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 145 states have (on average 1.3103448275862069) internal successors, (190), 154 states have internal predecessors, (190), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (7), 7 states have call predecessors, (7), 6 states have call successors, (7) [2022-02-21 03:10:08,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 203 transitions. [2022-02-21 03:10:08,678 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 203 transitions. Word has length 52 [2022-02-21 03:10:08,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:10:08,678 INFO L470 AbstractCegarLoop]: Abstraction has 166 states and 203 transitions. [2022-02-21 03:10:08,678 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-21 03:10:08,679 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 203 transitions. [2022-02-21 03:10:08,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-02-21 03:10:08,680 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:10:08,680 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:10:08,701 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2022-02-21 03:10:08,892 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:10:08,893 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-02-21 03:10:08,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:10:08,893 INFO L85 PathProgramCache]: Analyzing trace with hash -782219223, now seen corresponding path program 1 times [2022-02-21 03:10:08,893 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:10:08,893 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834135398] [2022-02-21 03:10:08,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:10:08,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:10:08,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:08,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-21 03:10:08,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:08,973 INFO L290 TraceCheckUtils]: 0: Hoare triple {20592#(and (= abs_77 |old(abs_77)|) (= abs_78 |old(abs_78)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {20556#true} is VALID [2022-02-21 03:10:08,973 INFO L290 TraceCheckUtils]: 1: Hoare triple {20556#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {20556#true} is VALID [2022-02-21 03:10:08,973 INFO L290 TraceCheckUtils]: 2: Hoare triple {20556#true} #res := ~__retres4~0; {20556#true} is VALID [2022-02-21 03:10:08,973 INFO L290 TraceCheckUtils]: 3: Hoare triple {20556#true} assume true; {20556#true} is VALID [2022-02-21 03:10:08,973 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {20556#true} {20556#true} #453#return; {20556#true} is VALID [2022-02-21 03:10:08,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-02-21 03:10:08,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:09,010 INFO L290 TraceCheckUtils]: 0: Hoare triple {20592#(and (= abs_77 |old(abs_77)|) (= abs_78 |old(abs_78)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {20556#true} is VALID [2022-02-21 03:10:09,010 INFO L290 TraceCheckUtils]: 1: Hoare triple {20556#true} assume !(0 == ~m % 4294967296); {20556#true} is VALID [2022-02-21 03:10:09,010 INFO L290 TraceCheckUtils]: 2: Hoare triple {20556#true} assume !(~m % 4294967296 < 16777216); {20556#true} is VALID [2022-02-21 03:10:09,010 INFO L290 TraceCheckUtils]: 3: Hoare triple {20556#true} assume !false; {20556#true} is VALID [2022-02-21 03:10:09,010 INFO L290 TraceCheckUtils]: 4: Hoare triple {20556#true} assume !(~m % 4294967296 >= 33554432); {20556#true} is VALID [2022-02-21 03:10:09,010 INFO L290 TraceCheckUtils]: 5: Hoare triple {20556#true} assume 0 == ~m || 0 == ~bitwiseComplement(16777216);~m := 0; {20556#true} is VALID [2022-02-21 03:10:09,010 INFO L290 TraceCheckUtils]: 6: Hoare triple {20556#true} assume 128 + ~e <= 2147483647; {20556#true} is VALID [2022-02-21 03:10:09,010 INFO L290 TraceCheckUtils]: 7: Hoare triple {20556#true} assume 128 + ~e >= -2147483648; {20556#true} is VALID [2022-02-21 03:10:09,011 INFO L290 TraceCheckUtils]: 8: Hoare triple {20556#true} assume 128 + ~e <= 2147483647; {20556#true} is VALID [2022-02-21 03:10:09,011 INFO L290 TraceCheckUtils]: 9: Hoare triple {20556#true} assume 128 + ~e >= -2147483648; {20556#true} is VALID [2022-02-21 03:10:09,011 INFO L290 TraceCheckUtils]: 10: Hoare triple {20556#true} assume !((1 == ~m && (0 == 16777216 * (128 + ~e) || 1 == 16777216 * (128 + ~e))) || ((0 == ~m || 1 == ~m) && 1 == 16777216 * (128 + ~e))); {20556#true} is VALID [2022-02-21 03:10:09,011 INFO L290 TraceCheckUtils]: 11: Hoare triple {20556#true} assume 0 == ~m && (0 == 16777216 * (128 + ~e) || 1 == 16777216 * (128 + ~e));~res~0 := 16777216 * (128 + ~e); {20593#(<= base2flt_~res~0 0)} is VALID [2022-02-21 03:10:09,011 INFO L290 TraceCheckUtils]: 12: Hoare triple {20593#(<= base2flt_~res~0 0)} ~__retres4~0 := ~res~0; {20594#(<= base2flt_~__retres4~0 0)} is VALID [2022-02-21 03:10:09,012 INFO L290 TraceCheckUtils]: 13: Hoare triple {20594#(<= base2flt_~__retres4~0 0)} #res := ~__retres4~0; {20595#(<= |base2flt_#res| 0)} is VALID [2022-02-21 03:10:09,012 INFO L290 TraceCheckUtils]: 14: Hoare triple {20595#(<= |base2flt_#res| 0)} assume true; {20595#(<= |base2flt_#res| 0)} is VALID [2022-02-21 03:10:09,013 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {20595#(<= |base2flt_#res| 0)} {20556#true} #455#return; {20579#(<= |ULTIMATE.start_main_#t~ret23#1| 0)} is VALID [2022-02-21 03:10:09,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-02-21 03:10:09,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:09,019 INFO L290 TraceCheckUtils]: 0: Hoare triple {20592#(and (= abs_77 |old(abs_77)|) (= abs_78 |old(abs_78)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {20556#true} is VALID [2022-02-21 03:10:09,019 INFO L290 TraceCheckUtils]: 1: Hoare triple {20556#true} assume !(0 == ~m % 4294967296); {20556#true} is VALID [2022-02-21 03:10:09,019 INFO L290 TraceCheckUtils]: 2: Hoare triple {20556#true} assume !(~m % 4294967296 < 16777216); {20556#true} is VALID [2022-02-21 03:10:09,019 INFO L290 TraceCheckUtils]: 3: Hoare triple {20556#true} assume !false; {20556#true} is VALID [2022-02-21 03:10:09,019 INFO L290 TraceCheckUtils]: 4: Hoare triple {20556#true} assume ~m % 4294967296 >= 33554432; {20556#true} is VALID [2022-02-21 03:10:09,019 INFO L290 TraceCheckUtils]: 5: Hoare triple {20556#true} assume ~e >= 127;~__retres4~0 := 4294967295; {20556#true} is VALID [2022-02-21 03:10:09,019 INFO L290 TraceCheckUtils]: 6: Hoare triple {20556#true} #res := ~__retres4~0; {20556#true} is VALID [2022-02-21 03:10:09,019 INFO L290 TraceCheckUtils]: 7: Hoare triple {20556#true} assume true; {20556#true} is VALID [2022-02-21 03:10:09,020 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {20556#true} {20580#(<= |ULTIMATE.start_main_~a~0#1| 0)} #457#return; {20580#(<= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-21 03:10:09,020 INFO L290 TraceCheckUtils]: 0: Hoare triple {20556#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(24, 2);call #Ultimate.allocInit(12, 3); {20556#true} is VALID [2022-02-21 03:10:09,020 INFO L290 TraceCheckUtils]: 1: Hoare triple {20556#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_~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_add~0#1, main_~zero~0#1, main_~sa~0#1, main_~sb~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~tmp___1~0#1, main_~tmp___2~0#1, main_~tmp___3~0#1, main_~tmp___4~0#1, main_~tmp___5~0#1, main_~tmp___6~0#1, main_~tmp___7~0#1, main_~tmp___8~0#1, main_~tmp___9~0#1, main_~__retres23~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_add~0#1;havoc main_~zero~0#1;havoc main_~sa~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_~tmp___2~0#1;havoc main_~tmp___3~0#1;havoc main_~tmp___4~0#1;havoc main_~tmp___5~0#1;havoc main_~tmp___6~0#1;havoc main_~tmp___7~0#1;havoc main_~tmp___8~0#1;havoc main_~tmp___9~0#1;havoc main_~__retres23~0#1; {20556#true} is VALID [2022-02-21 03:10:09,021 INFO L272 TraceCheckUtils]: 2: Hoare triple {20556#true} call main_#t~ret22#1 := base2flt(0, 0); {20592#(and (= abs_77 |old(abs_77)|) (= abs_78 |old(abs_78)|))} is VALID [2022-02-21 03:10:09,021 INFO L290 TraceCheckUtils]: 3: Hoare triple {20592#(and (= abs_77 |old(abs_77)|) (= abs_78 |old(abs_78)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {20556#true} is VALID [2022-02-21 03:10:09,021 INFO L290 TraceCheckUtils]: 4: Hoare triple {20556#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {20556#true} is VALID [2022-02-21 03:10:09,021 INFO L290 TraceCheckUtils]: 5: Hoare triple {20556#true} #res := ~__retres4~0; {20556#true} is VALID [2022-02-21 03:10:09,021 INFO L290 TraceCheckUtils]: 6: Hoare triple {20556#true} assume true; {20556#true} is VALID [2022-02-21 03:10:09,021 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {20556#true} {20556#true} #453#return; {20556#true} is VALID [2022-02-21 03:10:09,022 INFO L290 TraceCheckUtils]: 8: Hoare triple {20556#true} main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1; {20556#true} is VALID [2022-02-21 03:10:09,022 INFO L272 TraceCheckUtils]: 9: Hoare triple {20556#true} call main_#t~ret23#1 := base2flt(main_~ma~2#1, main_~ea~2#1); {20592#(and (= abs_77 |old(abs_77)|) (= abs_78 |old(abs_78)|))} is VALID [2022-02-21 03:10:09,022 INFO L290 TraceCheckUtils]: 10: Hoare triple {20592#(and (= abs_77 |old(abs_77)|) (= abs_78 |old(abs_78)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {20556#true} is VALID [2022-02-21 03:10:09,022 INFO L290 TraceCheckUtils]: 11: Hoare triple {20556#true} assume !(0 == ~m % 4294967296); {20556#true} is VALID [2022-02-21 03:10:09,022 INFO L290 TraceCheckUtils]: 12: Hoare triple {20556#true} assume !(~m % 4294967296 < 16777216); {20556#true} is VALID [2022-02-21 03:10:09,022 INFO L290 TraceCheckUtils]: 13: Hoare triple {20556#true} assume !false; {20556#true} is VALID [2022-02-21 03:10:09,023 INFO L290 TraceCheckUtils]: 14: Hoare triple {20556#true} assume !(~m % 4294967296 >= 33554432); {20556#true} is VALID [2022-02-21 03:10:09,023 INFO L290 TraceCheckUtils]: 15: Hoare triple {20556#true} assume 0 == ~m || 0 == ~bitwiseComplement(16777216);~m := 0; {20556#true} is VALID [2022-02-21 03:10:09,023 INFO L290 TraceCheckUtils]: 16: Hoare triple {20556#true} assume 128 + ~e <= 2147483647; {20556#true} is VALID [2022-02-21 03:10:09,023 INFO L290 TraceCheckUtils]: 17: Hoare triple {20556#true} assume 128 + ~e >= -2147483648; {20556#true} is VALID [2022-02-21 03:10:09,023 INFO L290 TraceCheckUtils]: 18: Hoare triple {20556#true} assume 128 + ~e <= 2147483647; {20556#true} is VALID [2022-02-21 03:10:09,023 INFO L290 TraceCheckUtils]: 19: Hoare triple {20556#true} assume 128 + ~e >= -2147483648; {20556#true} is VALID [2022-02-21 03:10:09,023 INFO L290 TraceCheckUtils]: 20: Hoare triple {20556#true} assume !((1 == ~m && (0 == 16777216 * (128 + ~e) || 1 == 16777216 * (128 + ~e))) || ((0 == ~m || 1 == ~m) && 1 == 16777216 * (128 + ~e))); {20556#true} is VALID [2022-02-21 03:10:09,024 INFO L290 TraceCheckUtils]: 21: Hoare triple {20556#true} assume 0 == ~m && (0 == 16777216 * (128 + ~e) || 1 == 16777216 * (128 + ~e));~res~0 := 16777216 * (128 + ~e); {20593#(<= base2flt_~res~0 0)} is VALID [2022-02-21 03:10:09,024 INFO L290 TraceCheckUtils]: 22: Hoare triple {20593#(<= base2flt_~res~0 0)} ~__retres4~0 := ~res~0; {20594#(<= base2flt_~__retres4~0 0)} is VALID [2022-02-21 03:10:09,024 INFO L290 TraceCheckUtils]: 23: Hoare triple {20594#(<= base2flt_~__retres4~0 0)} #res := ~__retres4~0; {20595#(<= |base2flt_#res| 0)} is VALID [2022-02-21 03:10:09,025 INFO L290 TraceCheckUtils]: 24: Hoare triple {20595#(<= |base2flt_#res| 0)} assume true; {20595#(<= |base2flt_#res| 0)} is VALID [2022-02-21 03:10:09,025 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {20595#(<= |base2flt_#res| 0)} {20556#true} #455#return; {20579#(<= |ULTIMATE.start_main_#t~ret23#1| 0)} is VALID [2022-02-21 03:10:09,025 INFO L290 TraceCheckUtils]: 26: Hoare triple {20579#(<= |ULTIMATE.start_main_#t~ret23#1| 0)} main_~a~0#1 := main_#t~ret23#1;havoc main_#t~ret23#1; {20580#(<= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-21 03:10:09,026 INFO L272 TraceCheckUtils]: 27: Hoare triple {20580#(<= |ULTIMATE.start_main_~a~0#1| 0)} call main_#t~ret24#1 := base2flt(main_~mb~2#1, main_~eb~2#1); {20592#(and (= abs_77 |old(abs_77)|) (= abs_78 |old(abs_78)|))} is VALID [2022-02-21 03:10:09,026 INFO L290 TraceCheckUtils]: 28: Hoare triple {20592#(and (= abs_77 |old(abs_77)|) (= abs_78 |old(abs_78)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {20556#true} is VALID [2022-02-21 03:10:09,026 INFO L290 TraceCheckUtils]: 29: Hoare triple {20556#true} assume !(0 == ~m % 4294967296); {20556#true} is VALID [2022-02-21 03:10:09,026 INFO L290 TraceCheckUtils]: 30: Hoare triple {20556#true} assume !(~m % 4294967296 < 16777216); {20556#true} is VALID [2022-02-21 03:10:09,026 INFO L290 TraceCheckUtils]: 31: Hoare triple {20556#true} assume !false; {20556#true} is VALID [2022-02-21 03:10:09,026 INFO L290 TraceCheckUtils]: 32: Hoare triple {20556#true} assume ~m % 4294967296 >= 33554432; {20556#true} is VALID [2022-02-21 03:10:09,027 INFO L290 TraceCheckUtils]: 33: Hoare triple {20556#true} assume ~e >= 127;~__retres4~0 := 4294967295; {20556#true} is VALID [2022-02-21 03:10:09,027 INFO L290 TraceCheckUtils]: 34: Hoare triple {20556#true} #res := ~__retres4~0; {20556#true} is VALID [2022-02-21 03:10:09,027 INFO L290 TraceCheckUtils]: 35: Hoare triple {20556#true} assume true; {20556#true} is VALID [2022-02-21 03:10:09,027 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {20556#true} {20580#(<= |ULTIMATE.start_main_~a~0#1| 0)} #457#return; {20580#(<= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-21 03:10:09,028 INFO L290 TraceCheckUtils]: 37: Hoare triple {20580#(<= |ULTIMATE.start_main_~a~0#1| 0)} main_~b~0#1 := main_#t~ret24#1;havoc main_#t~ret24#1; {20580#(<= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-21 03:10:09,028 INFO L290 TraceCheckUtils]: 38: Hoare triple {20580#(<= |ULTIMATE.start_main_~a~0#1| 0)} assume !(main_~a~0#1 % 4294967296 < main_~zero~0#1 % 4294967296); {20580#(<= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-21 03:10:09,028 INFO L290 TraceCheckUtils]: 39: Hoare triple {20580#(<= |ULTIMATE.start_main_~a~0#1| 0)} assume main_~a~0#1 % 4294967296 > main_~zero~0#1 % 4294967296;main_~tmp~2#1 := 1; {20580#(<= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-21 03:10:09,028 INFO L290 TraceCheckUtils]: 40: Hoare triple {20580#(<= |ULTIMATE.start_main_~a~0#1| 0)} main_~sa~0#1 := main_~tmp~2#1; {20580#(<= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-21 03:10:09,029 INFO L290 TraceCheckUtils]: 41: Hoare triple {20580#(<= |ULTIMATE.start_main_~a~0#1| 0)} assume !(main_~b~0#1 % 4294967296 < main_~zero~0#1 % 4294967296); {20580#(<= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-21 03:10:09,029 INFO L290 TraceCheckUtils]: 42: Hoare triple {20580#(<= |ULTIMATE.start_main_~a~0#1| 0)} assume main_~b~0#1 % 4294967296 > main_~zero~0#1 % 4294967296;main_~tmp___0~0#1 := 1; {20580#(<= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-21 03:10:09,029 INFO L290 TraceCheckUtils]: 43: Hoare triple {20580#(<= |ULTIMATE.start_main_~a~0#1| 0)} main_~sb~0#1 := main_~tmp___0~0#1; {20580#(<= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-21 03:10:09,029 INFO L290 TraceCheckUtils]: 44: Hoare triple {20580#(<= |ULTIMATE.start_main_~a~0#1| 0)} assume { :begin_inline_addflt } true;addflt_#in~a#1, addflt_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc addflt_#res#1;havoc addflt_#t~nondet6#1, addflt_#t~nondet7#1, addflt_#t~nondet8#1, addflt_#t~nondet9#1, addflt_#t~nondet10#1, addflt_#t~nondet11#1, addflt_~a#1, addflt_~b#1, addflt_~res~1#1, addflt_~ma~0#1, addflt_~mb~0#1, addflt_~delta~0#1, addflt_~ea~0#1, addflt_~eb~0#1, addflt_~tmp~0#1, addflt_~__retres10~0#1;addflt_~a#1 := addflt_#in~a#1;addflt_~b#1 := addflt_#in~b#1;havoc addflt_~res~1#1;havoc addflt_~ma~0#1;havoc addflt_~mb~0#1;havoc addflt_~delta~0#1;havoc addflt_~ea~0#1;havoc addflt_~eb~0#1;havoc addflt_~tmp~0#1;havoc addflt_~__retres10~0#1; {20590#(<= |ULTIMATE.start_addflt_~a#1| 0)} is VALID [2022-02-21 03:10:09,030 INFO L290 TraceCheckUtils]: 45: Hoare triple {20590#(<= |ULTIMATE.start_addflt_~a#1| 0)} assume !(addflt_~a#1 % 4294967296 < addflt_~b#1 % 4294967296); {20590#(<= |ULTIMATE.start_addflt_~a#1| 0)} is VALID [2022-02-21 03:10:09,030 INFO L290 TraceCheckUtils]: 46: Hoare triple {20590#(<= |ULTIMATE.start_addflt_~a#1| 0)} assume !(0 == addflt_~b#1 % 4294967296); {20590#(<= |ULTIMATE.start_addflt_~a#1| 0)} is VALID [2022-02-21 03:10:09,030 INFO L290 TraceCheckUtils]: 47: Hoare triple {20590#(<= |ULTIMATE.start_addflt_~a#1| 0)} assume !(0 == addflt_~a#1); {20591#(and (not (= |ULTIMATE.start_addflt_~a#1| 0)) (<= |ULTIMATE.start_addflt_~a#1| 0))} is VALID [2022-02-21 03:10:09,031 INFO L290 TraceCheckUtils]: 48: Hoare triple {20591#(and (not (= |ULTIMATE.start_addflt_~a#1| 0)) (<= |ULTIMATE.start_addflt_~a#1| 0))} assume !false; {20591#(and (not (= |ULTIMATE.start_addflt_~a#1| 0)) (<= |ULTIMATE.start_addflt_~a#1| 0))} is VALID [2022-02-21 03:10:09,031 INFO L290 TraceCheckUtils]: 49: Hoare triple {20591#(and (not (= |ULTIMATE.start_addflt_~a#1| 0)) (<= |ULTIMATE.start_addflt_~a#1| 0))} assume !false; {20591#(and (not (= |ULTIMATE.start_addflt_~a#1| 0)) (<= |ULTIMATE.start_addflt_~a#1| 0))} is VALID [2022-02-21 03:10:09,031 INFO L290 TraceCheckUtils]: 50: Hoare triple {20591#(and (not (= |ULTIMATE.start_addflt_~a#1| 0)) (<= |ULTIMATE.start_addflt_~a#1| 0))} assume addflt_~a#1 >= 0;abs_109 := (if addflt_~a#1 < 16777215 then addflt_~a#1 else 16777215);assume addflt_~a#1 >= 0;assume addflt_~ma~0#1 < abs_109; {20557#false} is VALID [2022-02-21 03:10:09,031 INFO L290 TraceCheckUtils]: 51: Hoare triple {20557#false} assume (if addflt_~a#1 / 16777216 % 4294967296 % 4294967296 <= 2147483647 then addflt_~a#1 / 16777216 % 4294967296 % 4294967296 else addflt_~a#1 / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 <= 2147483647; {20557#false} is VALID [2022-02-21 03:10:09,032 INFO L290 TraceCheckUtils]: 52: Hoare triple {20557#false} assume !((if addflt_~a#1 / 16777216 % 4294967296 % 4294967296 <= 2147483647 then addflt_~a#1 / 16777216 % 4294967296 % 4294967296 else addflt_~a#1 / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 >= -2147483648); {20557#false} is VALID [2022-02-21 03:10:09,032 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-02-21 03:10:09,032 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:10:09,032 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834135398] [2022-02-21 03:10:09,032 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834135398] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:10:09,032 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1615939790] [2022-02-21 03:10:09,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:10:09,033 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:10:09,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:10:09,034 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:10:09,035 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-02-21 03:10:09,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:09,081 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 10 conjunts are in the unsatisfiable core [2022-02-21 03:10:09,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:09,098 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:10:09,351 INFO L290 TraceCheckUtils]: 0: Hoare triple {20556#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(24, 2);call #Ultimate.allocInit(12, 3); {20556#true} is VALID [2022-02-21 03:10:09,351 INFO L290 TraceCheckUtils]: 1: Hoare triple {20556#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_~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_add~0#1, main_~zero~0#1, main_~sa~0#1, main_~sb~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~tmp___1~0#1, main_~tmp___2~0#1, main_~tmp___3~0#1, main_~tmp___4~0#1, main_~tmp___5~0#1, main_~tmp___6~0#1, main_~tmp___7~0#1, main_~tmp___8~0#1, main_~tmp___9~0#1, main_~__retres23~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_add~0#1;havoc main_~zero~0#1;havoc main_~sa~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_~tmp___2~0#1;havoc main_~tmp___3~0#1;havoc main_~tmp___4~0#1;havoc main_~tmp___5~0#1;havoc main_~tmp___6~0#1;havoc main_~tmp___7~0#1;havoc main_~tmp___8~0#1;havoc main_~tmp___9~0#1;havoc main_~__retres23~0#1; {20556#true} is VALID [2022-02-21 03:10:09,351 INFO L272 TraceCheckUtils]: 2: Hoare triple {20556#true} call main_#t~ret22#1 := base2flt(0, 0); {20556#true} is VALID [2022-02-21 03:10:09,351 INFO L290 TraceCheckUtils]: 3: Hoare triple {20556#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {20556#true} is VALID [2022-02-21 03:10:09,351 INFO L290 TraceCheckUtils]: 4: Hoare triple {20556#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {20556#true} is VALID [2022-02-21 03:10:09,352 INFO L290 TraceCheckUtils]: 5: Hoare triple {20556#true} #res := ~__retres4~0; {20556#true} is VALID [2022-02-21 03:10:09,352 INFO L290 TraceCheckUtils]: 6: Hoare triple {20556#true} assume true; {20556#true} is VALID [2022-02-21 03:10:09,352 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {20556#true} {20556#true} #453#return; {20556#true} is VALID [2022-02-21 03:10:09,352 INFO L290 TraceCheckUtils]: 8: Hoare triple {20556#true} main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1; {20556#true} is VALID [2022-02-21 03:10:09,352 INFO L272 TraceCheckUtils]: 9: Hoare triple {20556#true} call main_#t~ret23#1 := base2flt(main_~ma~2#1, main_~ea~2#1); {20556#true} is VALID [2022-02-21 03:10:09,352 INFO L290 TraceCheckUtils]: 10: Hoare triple {20556#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {20556#true} is VALID [2022-02-21 03:10:09,352 INFO L290 TraceCheckUtils]: 11: Hoare triple {20556#true} assume !(0 == ~m % 4294967296); {20556#true} is VALID [2022-02-21 03:10:09,352 INFO L290 TraceCheckUtils]: 12: Hoare triple {20556#true} assume !(~m % 4294967296 < 16777216); {20556#true} is VALID [2022-02-21 03:10:09,352 INFO L290 TraceCheckUtils]: 13: Hoare triple {20556#true} assume !false; {20556#true} is VALID [2022-02-21 03:10:09,353 INFO L290 TraceCheckUtils]: 14: Hoare triple {20556#true} assume !(~m % 4294967296 >= 33554432); {20556#true} is VALID [2022-02-21 03:10:09,353 INFO L290 TraceCheckUtils]: 15: Hoare triple {20556#true} assume 0 == ~m || 0 == ~bitwiseComplement(16777216);~m := 0; {20556#true} is VALID [2022-02-21 03:10:09,353 INFO L290 TraceCheckUtils]: 16: Hoare triple {20556#true} assume 128 + ~e <= 2147483647; {20556#true} is VALID [2022-02-21 03:10:09,353 INFO L290 TraceCheckUtils]: 17: Hoare triple {20556#true} assume 128 + ~e >= -2147483648; {20556#true} is VALID [2022-02-21 03:10:09,353 INFO L290 TraceCheckUtils]: 18: Hoare triple {20556#true} assume 128 + ~e <= 2147483647; {20556#true} is VALID [2022-02-21 03:10:09,353 INFO L290 TraceCheckUtils]: 19: Hoare triple {20556#true} assume 128 + ~e >= -2147483648; {20556#true} is VALID [2022-02-21 03:10:09,353 INFO L290 TraceCheckUtils]: 20: Hoare triple {20556#true} assume !((1 == ~m && (0 == 16777216 * (128 + ~e) || 1 == 16777216 * (128 + ~e))) || ((0 == ~m || 1 == ~m) && 1 == 16777216 * (128 + ~e))); {20556#true} is VALID [2022-02-21 03:10:09,375 INFO L290 TraceCheckUtils]: 21: Hoare triple {20556#true} assume 0 == ~m && (0 == 16777216 * (128 + ~e) || 1 == 16777216 * (128 + ~e));~res~0 := 16777216 * (128 + ~e); {20593#(<= base2flt_~res~0 0)} is VALID [2022-02-21 03:10:09,376 INFO L290 TraceCheckUtils]: 22: Hoare triple {20593#(<= base2flt_~res~0 0)} ~__retres4~0 := ~res~0; {20594#(<= base2flt_~__retres4~0 0)} is VALID [2022-02-21 03:10:09,376 INFO L290 TraceCheckUtils]: 23: Hoare triple {20594#(<= base2flt_~__retres4~0 0)} #res := ~__retres4~0; {20595#(<= |base2flt_#res| 0)} is VALID [2022-02-21 03:10:09,376 INFO L290 TraceCheckUtils]: 24: Hoare triple {20595#(<= |base2flt_#res| 0)} assume true; {20595#(<= |base2flt_#res| 0)} is VALID [2022-02-21 03:10:09,377 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {20595#(<= |base2flt_#res| 0)} {20556#true} #455#return; {20579#(<= |ULTIMATE.start_main_#t~ret23#1| 0)} is VALID [2022-02-21 03:10:09,377 INFO L290 TraceCheckUtils]: 26: Hoare triple {20579#(<= |ULTIMATE.start_main_#t~ret23#1| 0)} main_~a~0#1 := main_#t~ret23#1;havoc main_#t~ret23#1; {20580#(<= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-21 03:10:09,377 INFO L272 TraceCheckUtils]: 27: Hoare triple {20580#(<= |ULTIMATE.start_main_~a~0#1| 0)} call main_#t~ret24#1 := base2flt(main_~mb~2#1, main_~eb~2#1); {20556#true} is VALID [2022-02-21 03:10:09,377 INFO L290 TraceCheckUtils]: 28: Hoare triple {20556#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {20556#true} is VALID [2022-02-21 03:10:09,378 INFO L290 TraceCheckUtils]: 29: Hoare triple {20556#true} assume !(0 == ~m % 4294967296); {20556#true} is VALID [2022-02-21 03:10:09,378 INFO L290 TraceCheckUtils]: 30: Hoare triple {20556#true} assume !(~m % 4294967296 < 16777216); {20556#true} is VALID [2022-02-21 03:10:09,378 INFO L290 TraceCheckUtils]: 31: Hoare triple {20556#true} assume !false; {20556#true} is VALID [2022-02-21 03:10:09,378 INFO L290 TraceCheckUtils]: 32: Hoare triple {20556#true} assume ~m % 4294967296 >= 33554432; {20556#true} is VALID [2022-02-21 03:10:09,378 INFO L290 TraceCheckUtils]: 33: Hoare triple {20556#true} assume ~e >= 127;~__retres4~0 := 4294967295; {20556#true} is VALID [2022-02-21 03:10:09,378 INFO L290 TraceCheckUtils]: 34: Hoare triple {20556#true} #res := ~__retres4~0; {20556#true} is VALID [2022-02-21 03:10:09,378 INFO L290 TraceCheckUtils]: 35: Hoare triple {20556#true} assume true; {20556#true} is VALID [2022-02-21 03:10:09,378 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {20556#true} {20580#(<= |ULTIMATE.start_main_~a~0#1| 0)} #457#return; {20580#(<= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-21 03:10:09,379 INFO L290 TraceCheckUtils]: 37: Hoare triple {20580#(<= |ULTIMATE.start_main_~a~0#1| 0)} main_~b~0#1 := main_#t~ret24#1;havoc main_#t~ret24#1; {20580#(<= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-21 03:10:09,379 INFO L290 TraceCheckUtils]: 38: Hoare triple {20580#(<= |ULTIMATE.start_main_~a~0#1| 0)} assume !(main_~a~0#1 % 4294967296 < main_~zero~0#1 % 4294967296); {20580#(<= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-21 03:10:09,379 INFO L290 TraceCheckUtils]: 39: Hoare triple {20580#(<= |ULTIMATE.start_main_~a~0#1| 0)} assume main_~a~0#1 % 4294967296 > main_~zero~0#1 % 4294967296;main_~tmp~2#1 := 1; {20580#(<= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-21 03:10:09,379 INFO L290 TraceCheckUtils]: 40: Hoare triple {20580#(<= |ULTIMATE.start_main_~a~0#1| 0)} main_~sa~0#1 := main_~tmp~2#1; {20580#(<= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-21 03:10:09,380 INFO L290 TraceCheckUtils]: 41: Hoare triple {20580#(<= |ULTIMATE.start_main_~a~0#1| 0)} assume !(main_~b~0#1 % 4294967296 < main_~zero~0#1 % 4294967296); {20580#(<= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-21 03:10:09,380 INFO L290 TraceCheckUtils]: 42: Hoare triple {20580#(<= |ULTIMATE.start_main_~a~0#1| 0)} assume main_~b~0#1 % 4294967296 > main_~zero~0#1 % 4294967296;main_~tmp___0~0#1 := 1; {20580#(<= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-21 03:10:09,380 INFO L290 TraceCheckUtils]: 43: Hoare triple {20580#(<= |ULTIMATE.start_main_~a~0#1| 0)} main_~sb~0#1 := main_~tmp___0~0#1; {20580#(<= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-21 03:10:09,381 INFO L290 TraceCheckUtils]: 44: Hoare triple {20580#(<= |ULTIMATE.start_main_~a~0#1| 0)} assume { :begin_inline_addflt } true;addflt_#in~a#1, addflt_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc addflt_#res#1;havoc addflt_#t~nondet6#1, addflt_#t~nondet7#1, addflt_#t~nondet8#1, addflt_#t~nondet9#1, addflt_#t~nondet10#1, addflt_#t~nondet11#1, addflt_~a#1, addflt_~b#1, addflt_~res~1#1, addflt_~ma~0#1, addflt_~mb~0#1, addflt_~delta~0#1, addflt_~ea~0#1, addflt_~eb~0#1, addflt_~tmp~0#1, addflt_~__retres10~0#1;addflt_~a#1 := addflt_#in~a#1;addflt_~b#1 := addflt_#in~b#1;havoc addflt_~res~1#1;havoc addflt_~ma~0#1;havoc addflt_~mb~0#1;havoc addflt_~delta~0#1;havoc addflt_~ea~0#1;havoc addflt_~eb~0#1;havoc addflt_~tmp~0#1;havoc addflt_~__retres10~0#1; {20590#(<= |ULTIMATE.start_addflt_~a#1| 0)} is VALID [2022-02-21 03:10:09,381 INFO L290 TraceCheckUtils]: 45: Hoare triple {20590#(<= |ULTIMATE.start_addflt_~a#1| 0)} assume !(addflt_~a#1 % 4294967296 < addflt_~b#1 % 4294967296); {20590#(<= |ULTIMATE.start_addflt_~a#1| 0)} is VALID [2022-02-21 03:10:09,381 INFO L290 TraceCheckUtils]: 46: Hoare triple {20590#(<= |ULTIMATE.start_addflt_~a#1| 0)} assume !(0 == addflt_~b#1 % 4294967296); {20590#(<= |ULTIMATE.start_addflt_~a#1| 0)} is VALID [2022-02-21 03:10:09,382 INFO L290 TraceCheckUtils]: 47: Hoare triple {20590#(<= |ULTIMATE.start_addflt_~a#1| 0)} assume !(0 == addflt_~a#1); {20591#(and (not (= |ULTIMATE.start_addflt_~a#1| 0)) (<= |ULTIMATE.start_addflt_~a#1| 0))} is VALID [2022-02-21 03:10:09,382 INFO L290 TraceCheckUtils]: 48: Hoare triple {20591#(and (not (= |ULTIMATE.start_addflt_~a#1| 0)) (<= |ULTIMATE.start_addflt_~a#1| 0))} assume !false; {20591#(and (not (= |ULTIMATE.start_addflt_~a#1| 0)) (<= |ULTIMATE.start_addflt_~a#1| 0))} is VALID [2022-02-21 03:10:09,382 INFO L290 TraceCheckUtils]: 49: Hoare triple {20591#(and (not (= |ULTIMATE.start_addflt_~a#1| 0)) (<= |ULTIMATE.start_addflt_~a#1| 0))} assume !false; {20591#(and (not (= |ULTIMATE.start_addflt_~a#1| 0)) (<= |ULTIMATE.start_addflt_~a#1| 0))} is VALID [2022-02-21 03:10:09,383 INFO L290 TraceCheckUtils]: 50: Hoare triple {20591#(and (not (= |ULTIMATE.start_addflt_~a#1| 0)) (<= |ULTIMATE.start_addflt_~a#1| 0))} assume addflt_~a#1 >= 0;abs_109 := (if addflt_~a#1 < 16777215 then addflt_~a#1 else 16777215);assume addflt_~a#1 >= 0;assume addflt_~ma~0#1 < abs_109; {20557#false} is VALID [2022-02-21 03:10:09,383 INFO L290 TraceCheckUtils]: 51: Hoare triple {20557#false} assume (if addflt_~a#1 / 16777216 % 4294967296 % 4294967296 <= 2147483647 then addflt_~a#1 / 16777216 % 4294967296 % 4294967296 else addflt_~a#1 / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 <= 2147483647; {20557#false} is VALID [2022-02-21 03:10:09,383 INFO L290 TraceCheckUtils]: 52: Hoare triple {20557#false} assume !((if addflt_~a#1 / 16777216 % 4294967296 % 4294967296 <= 2147483647 then addflt_~a#1 / 16777216 % 4294967296 % 4294967296 else addflt_~a#1 / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 >= -2147483648); {20557#false} is VALID [2022-02-21 03:10:09,383 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-02-21 03:10:09,383 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:10:09,753 INFO L290 TraceCheckUtils]: 52: Hoare triple {20557#false} assume !((if addflt_~a#1 / 16777216 % 4294967296 % 4294967296 <= 2147483647 then addflt_~a#1 / 16777216 % 4294967296 % 4294967296 else addflt_~a#1 / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 >= -2147483648); {20557#false} is VALID [2022-02-21 03:10:09,753 INFO L290 TraceCheckUtils]: 51: Hoare triple {20557#false} assume (if addflt_~a#1 / 16777216 % 4294967296 % 4294967296 <= 2147483647 then addflt_~a#1 / 16777216 % 4294967296 % 4294967296 else addflt_~a#1 / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 <= 2147483647; {20557#false} is VALID [2022-02-21 03:10:09,754 INFO L290 TraceCheckUtils]: 50: Hoare triple {20591#(and (not (= |ULTIMATE.start_addflt_~a#1| 0)) (<= |ULTIMATE.start_addflt_~a#1| 0))} assume addflt_~a#1 >= 0;abs_109 := (if addflt_~a#1 < 16777215 then addflt_~a#1 else 16777215);assume addflt_~a#1 >= 0;assume addflt_~ma~0#1 < abs_109; {20557#false} is VALID [2022-02-21 03:10:09,754 INFO L290 TraceCheckUtils]: 49: Hoare triple {20591#(and (not (= |ULTIMATE.start_addflt_~a#1| 0)) (<= |ULTIMATE.start_addflt_~a#1| 0))} assume !false; {20591#(and (not (= |ULTIMATE.start_addflt_~a#1| 0)) (<= |ULTIMATE.start_addflt_~a#1| 0))} is VALID [2022-02-21 03:10:09,754 INFO L290 TraceCheckUtils]: 48: Hoare triple {20591#(and (not (= |ULTIMATE.start_addflt_~a#1| 0)) (<= |ULTIMATE.start_addflt_~a#1| 0))} assume !false; {20591#(and (not (= |ULTIMATE.start_addflt_~a#1| 0)) (<= |ULTIMATE.start_addflt_~a#1| 0))} is VALID [2022-02-21 03:10:09,755 INFO L290 TraceCheckUtils]: 47: Hoare triple {20590#(<= |ULTIMATE.start_addflt_~a#1| 0)} assume !(0 == addflt_~a#1); {20591#(and (not (= |ULTIMATE.start_addflt_~a#1| 0)) (<= |ULTIMATE.start_addflt_~a#1| 0))} is VALID [2022-02-21 03:10:09,755 INFO L290 TraceCheckUtils]: 46: Hoare triple {20590#(<= |ULTIMATE.start_addflt_~a#1| 0)} assume !(0 == addflt_~b#1 % 4294967296); {20590#(<= |ULTIMATE.start_addflt_~a#1| 0)} is VALID [2022-02-21 03:10:09,755 INFO L290 TraceCheckUtils]: 45: Hoare triple {20590#(<= |ULTIMATE.start_addflt_~a#1| 0)} assume !(addflt_~a#1 % 4294967296 < addflt_~b#1 % 4294967296); {20590#(<= |ULTIMATE.start_addflt_~a#1| 0)} is VALID [2022-02-21 03:10:09,755 INFO L290 TraceCheckUtils]: 44: Hoare triple {20580#(<= |ULTIMATE.start_main_~a~0#1| 0)} assume { :begin_inline_addflt } true;addflt_#in~a#1, addflt_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc addflt_#res#1;havoc addflt_#t~nondet6#1, addflt_#t~nondet7#1, addflt_#t~nondet8#1, addflt_#t~nondet9#1, addflt_#t~nondet10#1, addflt_#t~nondet11#1, addflt_~a#1, addflt_~b#1, addflt_~res~1#1, addflt_~ma~0#1, addflt_~mb~0#1, addflt_~delta~0#1, addflt_~ea~0#1, addflt_~eb~0#1, addflt_~tmp~0#1, addflt_~__retres10~0#1;addflt_~a#1 := addflt_#in~a#1;addflt_~b#1 := addflt_#in~b#1;havoc addflt_~res~1#1;havoc addflt_~ma~0#1;havoc addflt_~mb~0#1;havoc addflt_~delta~0#1;havoc addflt_~ea~0#1;havoc addflt_~eb~0#1;havoc addflt_~tmp~0#1;havoc addflt_~__retres10~0#1; {20590#(<= |ULTIMATE.start_addflt_~a#1| 0)} is VALID [2022-02-21 03:10:09,756 INFO L290 TraceCheckUtils]: 43: Hoare triple {20580#(<= |ULTIMATE.start_main_~a~0#1| 0)} main_~sb~0#1 := main_~tmp___0~0#1; {20580#(<= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-21 03:10:09,756 INFO L290 TraceCheckUtils]: 42: Hoare triple {20580#(<= |ULTIMATE.start_main_~a~0#1| 0)} assume main_~b~0#1 % 4294967296 > main_~zero~0#1 % 4294967296;main_~tmp___0~0#1 := 1; {20580#(<= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-21 03:10:09,756 INFO L290 TraceCheckUtils]: 41: Hoare triple {20580#(<= |ULTIMATE.start_main_~a~0#1| 0)} assume !(main_~b~0#1 % 4294967296 < main_~zero~0#1 % 4294967296); {20580#(<= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-21 03:10:09,756 INFO L290 TraceCheckUtils]: 40: Hoare triple {20580#(<= |ULTIMATE.start_main_~a~0#1| 0)} main_~sa~0#1 := main_~tmp~2#1; {20580#(<= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-21 03:10:09,757 INFO L290 TraceCheckUtils]: 39: Hoare triple {20580#(<= |ULTIMATE.start_main_~a~0#1| 0)} assume main_~a~0#1 % 4294967296 > main_~zero~0#1 % 4294967296;main_~tmp~2#1 := 1; {20580#(<= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-21 03:10:09,757 INFO L290 TraceCheckUtils]: 38: Hoare triple {20580#(<= |ULTIMATE.start_main_~a~0#1| 0)} assume !(main_~a~0#1 % 4294967296 < main_~zero~0#1 % 4294967296); {20580#(<= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-21 03:10:09,757 INFO L290 TraceCheckUtils]: 37: Hoare triple {20580#(<= |ULTIMATE.start_main_~a~0#1| 0)} main_~b~0#1 := main_#t~ret24#1;havoc main_#t~ret24#1; {20580#(<= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-21 03:10:09,758 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {20556#true} {20580#(<= |ULTIMATE.start_main_~a~0#1| 0)} #457#return; {20580#(<= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-21 03:10:09,758 INFO L290 TraceCheckUtils]: 35: Hoare triple {20556#true} assume true; {20556#true} is VALID [2022-02-21 03:10:09,758 INFO L290 TraceCheckUtils]: 34: Hoare triple {20556#true} #res := ~__retres4~0; {20556#true} is VALID [2022-02-21 03:10:09,758 INFO L290 TraceCheckUtils]: 33: Hoare triple {20556#true} assume ~e >= 127;~__retres4~0 := 4294967295; {20556#true} is VALID [2022-02-21 03:10:09,758 INFO L290 TraceCheckUtils]: 32: Hoare triple {20556#true} assume ~m % 4294967296 >= 33554432; {20556#true} is VALID [2022-02-21 03:10:09,758 INFO L290 TraceCheckUtils]: 31: Hoare triple {20556#true} assume !false; {20556#true} is VALID [2022-02-21 03:10:09,758 INFO L290 TraceCheckUtils]: 30: Hoare triple {20556#true} assume !(~m % 4294967296 < 16777216); {20556#true} is VALID [2022-02-21 03:10:09,758 INFO L290 TraceCheckUtils]: 29: Hoare triple {20556#true} assume !(0 == ~m % 4294967296); {20556#true} is VALID [2022-02-21 03:10:09,758 INFO L290 TraceCheckUtils]: 28: Hoare triple {20556#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {20556#true} is VALID [2022-02-21 03:10:09,758 INFO L272 TraceCheckUtils]: 27: Hoare triple {20580#(<= |ULTIMATE.start_main_~a~0#1| 0)} call main_#t~ret24#1 := base2flt(main_~mb~2#1, main_~eb~2#1); {20556#true} is VALID [2022-02-21 03:10:09,758 INFO L290 TraceCheckUtils]: 26: Hoare triple {20579#(<= |ULTIMATE.start_main_#t~ret23#1| 0)} main_~a~0#1 := main_#t~ret23#1;havoc main_#t~ret23#1; {20580#(<= |ULTIMATE.start_main_~a~0#1| 0)} is VALID [2022-02-21 03:10:09,759 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {20595#(<= |base2flt_#res| 0)} {20556#true} #455#return; {20579#(<= |ULTIMATE.start_main_#t~ret23#1| 0)} is VALID [2022-02-21 03:10:09,759 INFO L290 TraceCheckUtils]: 24: Hoare triple {20595#(<= |base2flt_#res| 0)} assume true; {20595#(<= |base2flt_#res| 0)} is VALID [2022-02-21 03:10:09,759 INFO L290 TraceCheckUtils]: 23: Hoare triple {20594#(<= base2flt_~__retres4~0 0)} #res := ~__retres4~0; {20595#(<= |base2flt_#res| 0)} is VALID [2022-02-21 03:10:09,764 INFO L290 TraceCheckUtils]: 22: Hoare triple {20593#(<= base2flt_~res~0 0)} ~__retres4~0 := ~res~0; {20594#(<= base2flt_~__retres4~0 0)} is VALID [2022-02-21 03:10:09,765 INFO L290 TraceCheckUtils]: 21: Hoare triple {20556#true} assume 0 == ~m && (0 == 16777216 * (128 + ~e) || 1 == 16777216 * (128 + ~e));~res~0 := 16777216 * (128 + ~e); {20593#(<= base2flt_~res~0 0)} is VALID [2022-02-21 03:10:09,765 INFO L290 TraceCheckUtils]: 20: Hoare triple {20556#true} assume !((1 == ~m && (0 == 16777216 * (128 + ~e) || 1 == 16777216 * (128 + ~e))) || ((0 == ~m || 1 == ~m) && 1 == 16777216 * (128 + ~e))); {20556#true} is VALID [2022-02-21 03:10:09,765 INFO L290 TraceCheckUtils]: 19: Hoare triple {20556#true} assume 128 + ~e >= -2147483648; {20556#true} is VALID [2022-02-21 03:10:09,765 INFO L290 TraceCheckUtils]: 18: Hoare triple {20556#true} assume 128 + ~e <= 2147483647; {20556#true} is VALID [2022-02-21 03:10:09,765 INFO L290 TraceCheckUtils]: 17: Hoare triple {20556#true} assume 128 + ~e >= -2147483648; {20556#true} is VALID [2022-02-21 03:10:09,765 INFO L290 TraceCheckUtils]: 16: Hoare triple {20556#true} assume 128 + ~e <= 2147483647; {20556#true} is VALID [2022-02-21 03:10:09,765 INFO L290 TraceCheckUtils]: 15: Hoare triple {20556#true} assume 0 == ~m || 0 == ~bitwiseComplement(16777216);~m := 0; {20556#true} is VALID [2022-02-21 03:10:09,765 INFO L290 TraceCheckUtils]: 14: Hoare triple {20556#true} assume !(~m % 4294967296 >= 33554432); {20556#true} is VALID [2022-02-21 03:10:09,765 INFO L290 TraceCheckUtils]: 13: Hoare triple {20556#true} assume !false; {20556#true} is VALID [2022-02-21 03:10:09,765 INFO L290 TraceCheckUtils]: 12: Hoare triple {20556#true} assume !(~m % 4294967296 < 16777216); {20556#true} is VALID [2022-02-21 03:10:09,765 INFO L290 TraceCheckUtils]: 11: Hoare triple {20556#true} assume !(0 == ~m % 4294967296); {20556#true} is VALID [2022-02-21 03:10:09,765 INFO L290 TraceCheckUtils]: 10: Hoare triple {20556#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {20556#true} is VALID [2022-02-21 03:10:09,766 INFO L272 TraceCheckUtils]: 9: Hoare triple {20556#true} call main_#t~ret23#1 := base2flt(main_~ma~2#1, main_~ea~2#1); {20556#true} is VALID [2022-02-21 03:10:09,766 INFO L290 TraceCheckUtils]: 8: Hoare triple {20556#true} main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1; {20556#true} is VALID [2022-02-21 03:10:09,766 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {20556#true} {20556#true} #453#return; {20556#true} is VALID [2022-02-21 03:10:09,766 INFO L290 TraceCheckUtils]: 6: Hoare triple {20556#true} assume true; {20556#true} is VALID [2022-02-21 03:10:09,766 INFO L290 TraceCheckUtils]: 5: Hoare triple {20556#true} #res := ~__retres4~0; {20556#true} is VALID [2022-02-21 03:10:09,766 INFO L290 TraceCheckUtils]: 4: Hoare triple {20556#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {20556#true} is VALID [2022-02-21 03:10:09,766 INFO L290 TraceCheckUtils]: 3: Hoare triple {20556#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {20556#true} is VALID [2022-02-21 03:10:09,766 INFO L272 TraceCheckUtils]: 2: Hoare triple {20556#true} call main_#t~ret22#1 := base2flt(0, 0); {20556#true} is VALID [2022-02-21 03:10:09,766 INFO L290 TraceCheckUtils]: 1: Hoare triple {20556#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_~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_add~0#1, main_~zero~0#1, main_~sa~0#1, main_~sb~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~tmp___1~0#1, main_~tmp___2~0#1, main_~tmp___3~0#1, main_~tmp___4~0#1, main_~tmp___5~0#1, main_~tmp___6~0#1, main_~tmp___7~0#1, main_~tmp___8~0#1, main_~tmp___9~0#1, main_~__retres23~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_add~0#1;havoc main_~zero~0#1;havoc main_~sa~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_~tmp___2~0#1;havoc main_~tmp___3~0#1;havoc main_~tmp___4~0#1;havoc main_~tmp___5~0#1;havoc main_~tmp___6~0#1;havoc main_~tmp___7~0#1;havoc main_~tmp___8~0#1;havoc main_~tmp___9~0#1;havoc main_~__retres23~0#1; {20556#true} is VALID [2022-02-21 03:10:09,766 INFO L290 TraceCheckUtils]: 0: Hoare triple {20556#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(24, 2);call #Ultimate.allocInit(12, 3); {20556#true} is VALID [2022-02-21 03:10:09,766 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-02-21 03:10:09,767 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1615939790] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:10:09,767 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:10:09,767 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 10 [2022-02-21 03:10:09,767 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374038709] [2022-02-21 03:10:09,767 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:10:09,767 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.1) internal successors, (41), 8 states have internal predecessors, (41), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 53 [2022-02-21 03:10:09,768 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:10:09,768 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 4.1) internal successors, (41), 8 states have internal predecessors, (41), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-21 03:10:09,796 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:10:09,796 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-21 03:10:09,796 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:10:09,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-21 03:10:09,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-02-21 03:10:09,797 INFO L87 Difference]: Start difference. First operand 166 states and 203 transitions. Second operand has 10 states, 10 states have (on average 4.1) internal successors, (41), 8 states have internal predecessors, (41), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-21 03:10:10,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:10,875 INFO L93 Difference]: Finished difference Result 419 states and 503 transitions. [2022-02-21 03:10:10,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-02-21 03:10:10,876 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.1) internal successors, (41), 8 states have internal predecessors, (41), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 53 [2022-02-21 03:10:10,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:10:10,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 4.1) internal successors, (41), 8 states have internal predecessors, (41), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-21 03:10:10,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 394 transitions. [2022-02-21 03:10:10,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 4.1) internal successors, (41), 8 states have internal predecessors, (41), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-21 03:10:10,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 394 transitions. [2022-02-21 03:10:10,880 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 394 transitions. [2022-02-21 03:10:11,119 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 394 edges. 394 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:10:11,125 INFO L225 Difference]: With dead ends: 419 [2022-02-21 03:10:11,125 INFO L226 Difference]: Without dead ends: 368 [2022-02-21 03:10:11,125 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 110 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=270, Unknown=0, NotChecked=0, Total=342 [2022-02-21 03:10:11,125 INFO L933 BasicCegarLoop]: 188 mSDtfsCounter, 266 mSDsluCounter, 1332 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 1520 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-21 03:10:11,126 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [270 Valid, 1520 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 229 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-21 03:10:11,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2022-02-21 03:10:11,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 186. [2022-02-21 03:10:11,200 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:10:11,201 INFO L82 GeneralOperation]: Start isEquivalent. First operand 368 states. Second operand has 186 states, 163 states have (on average 1.294478527607362) internal successors, (211), 172 states have internal predecessors, (211), 7 states have call successors, (7), 4 states have call predecessors, (7), 6 states have return successors, (9), 9 states have call predecessors, (9), 7 states have call successors, (9) [2022-02-21 03:10:11,201 INFO L74 IsIncluded]: Start isIncluded. First operand 368 states. Second operand has 186 states, 163 states have (on average 1.294478527607362) internal successors, (211), 172 states have internal predecessors, (211), 7 states have call successors, (7), 4 states have call predecessors, (7), 6 states have return successors, (9), 9 states have call predecessors, (9), 7 states have call successors, (9) [2022-02-21 03:10:11,201 INFO L87 Difference]: Start difference. First operand 368 states. Second operand has 186 states, 163 states have (on average 1.294478527607362) internal successors, (211), 172 states have internal predecessors, (211), 7 states have call successors, (7), 4 states have call predecessors, (7), 6 states have return successors, (9), 9 states have call predecessors, (9), 7 states have call successors, (9) [2022-02-21 03:10:11,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:11,207 INFO L93 Difference]: Finished difference Result 368 states and 445 transitions. [2022-02-21 03:10:11,207 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 445 transitions. [2022-02-21 03:10:11,208 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:10:11,208 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:10:11,208 INFO L74 IsIncluded]: Start isIncluded. First operand has 186 states, 163 states have (on average 1.294478527607362) internal successors, (211), 172 states have internal predecessors, (211), 7 states have call successors, (7), 4 states have call predecessors, (7), 6 states have return successors, (9), 9 states have call predecessors, (9), 7 states have call successors, (9) Second operand 368 states. [2022-02-21 03:10:11,208 INFO L87 Difference]: Start difference. First operand has 186 states, 163 states have (on average 1.294478527607362) internal successors, (211), 172 states have internal predecessors, (211), 7 states have call successors, (7), 4 states have call predecessors, (7), 6 states have return successors, (9), 9 states have call predecessors, (9), 7 states have call successors, (9) Second operand 368 states. [2022-02-21 03:10:11,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:11,213 INFO L93 Difference]: Finished difference Result 368 states and 445 transitions. [2022-02-21 03:10:11,214 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 445 transitions. [2022-02-21 03:10:11,214 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:10:11,214 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:10:11,214 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:10:11,214 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:10:11,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 163 states have (on average 1.294478527607362) internal successors, (211), 172 states have internal predecessors, (211), 7 states have call successors, (7), 4 states have call predecessors, (7), 6 states have return successors, (9), 9 states have call predecessors, (9), 7 states have call successors, (9) [2022-02-21 03:10:11,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 227 transitions. [2022-02-21 03:10:11,217 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 227 transitions. Word has length 53 [2022-02-21 03:10:11,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:10:11,217 INFO L470 AbstractCegarLoop]: Abstraction has 186 states and 227 transitions. [2022-02-21 03:10:11,217 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.1) internal successors, (41), 8 states have internal predecessors, (41), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-21 03:10:11,217 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 227 transitions. [2022-02-21 03:10:11,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-02-21 03:10:11,217 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:10:11,217 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:10:11,237 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-02-21 03:10:11,431 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:10:11,431 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-02-21 03:10:11,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:10:11,432 INFO L85 PathProgramCache]: Analyzing trace with hash -782217301, now seen corresponding path program 1 times [2022-02-21 03:10:11,432 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:10:11,432 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422252027] [2022-02-21 03:10:11,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:10:11,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:10:11,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:11,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-21 03:10:11,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:11,490 INFO L290 TraceCheckUtils]: 0: Hoare triple {22362#(and (= abs_77 |old(abs_77)|) (= abs_78 |old(abs_78)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {22327#true} is VALID [2022-02-21 03:10:11,490 INFO L290 TraceCheckUtils]: 1: Hoare triple {22327#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {22327#true} is VALID [2022-02-21 03:10:11,490 INFO L290 TraceCheckUtils]: 2: Hoare triple {22327#true} #res := ~__retres4~0; {22327#true} is VALID [2022-02-21 03:10:11,490 INFO L290 TraceCheckUtils]: 3: Hoare triple {22327#true} assume true; {22327#true} is VALID [2022-02-21 03:10:11,490 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {22327#true} {22327#true} #453#return; {22327#true} is VALID [2022-02-21 03:10:11,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-02-21 03:10:11,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:11,514 INFO L290 TraceCheckUtils]: 0: Hoare triple {22362#(and (= abs_77 |old(abs_77)|) (= abs_78 |old(abs_78)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {22327#true} is VALID [2022-02-21 03:10:11,514 INFO L290 TraceCheckUtils]: 1: Hoare triple {22327#true} assume !(0 == ~m % 4294967296); {22327#true} is VALID [2022-02-21 03:10:11,514 INFO L290 TraceCheckUtils]: 2: Hoare triple {22327#true} assume !(~m % 4294967296 < 16777216); {22327#true} is VALID [2022-02-21 03:10:11,514 INFO L290 TraceCheckUtils]: 3: Hoare triple {22327#true} assume !false; {22327#true} is VALID [2022-02-21 03:10:11,514 INFO L290 TraceCheckUtils]: 4: Hoare triple {22327#true} assume !(~m % 4294967296 >= 33554432); {22327#true} is VALID [2022-02-21 03:10:11,514 INFO L290 TraceCheckUtils]: 5: Hoare triple {22327#true} assume 0 == ~m || 0 == ~bitwiseComplement(16777216);~m := 0; {22327#true} is VALID [2022-02-21 03:10:11,515 INFO L290 TraceCheckUtils]: 6: Hoare triple {22327#true} assume 128 + ~e <= 2147483647; {22327#true} is VALID [2022-02-21 03:10:11,515 INFO L290 TraceCheckUtils]: 7: Hoare triple {22327#true} assume 128 + ~e >= -2147483648; {22327#true} is VALID [2022-02-21 03:10:11,515 INFO L290 TraceCheckUtils]: 8: Hoare triple {22327#true} assume 128 + ~e <= 2147483647; {22327#true} is VALID [2022-02-21 03:10:11,515 INFO L290 TraceCheckUtils]: 9: Hoare triple {22327#true} assume 128 + ~e >= -2147483648; {22327#true} is VALID [2022-02-21 03:10:11,515 INFO L290 TraceCheckUtils]: 10: Hoare triple {22327#true} assume !((1 == ~m && (0 == 16777216 * (128 + ~e) || 1 == 16777216 * (128 + ~e))) || ((0 == ~m || 1 == ~m) && 1 == 16777216 * (128 + ~e))); {22327#true} is VALID [2022-02-21 03:10:11,515 INFO L290 TraceCheckUtils]: 11: Hoare triple {22327#true} assume 0 == ~m && (0 == 16777216 * (128 + ~e) || 1 == 16777216 * (128 + ~e));~res~0 := 16777216 * (128 + ~e); {22363#(<= 0 base2flt_~res~0)} is VALID [2022-02-21 03:10:11,515 INFO L290 TraceCheckUtils]: 12: Hoare triple {22363#(<= 0 base2flt_~res~0)} ~__retres4~0 := ~res~0; {22364#(<= 0 base2flt_~__retres4~0)} is VALID [2022-02-21 03:10:11,516 INFO L290 TraceCheckUtils]: 13: Hoare triple {22364#(<= 0 base2flt_~__retres4~0)} #res := ~__retres4~0; {22365#(<= 0 |base2flt_#res|)} is VALID [2022-02-21 03:10:11,516 INFO L290 TraceCheckUtils]: 14: Hoare triple {22365#(<= 0 |base2flt_#res|)} assume true; {22365#(<= 0 |base2flt_#res|)} is VALID [2022-02-21 03:10:11,517 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {22365#(<= 0 |base2flt_#res|)} {22327#true} #455#return; {22350#(<= 0 |ULTIMATE.start_main_#t~ret23#1|)} is VALID [2022-02-21 03:10:11,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-02-21 03:10:11,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:11,521 INFO L290 TraceCheckUtils]: 0: Hoare triple {22362#(and (= abs_77 |old(abs_77)|) (= abs_78 |old(abs_78)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {22327#true} is VALID [2022-02-21 03:10:11,522 INFO L290 TraceCheckUtils]: 1: Hoare triple {22327#true} assume !(0 == ~m % 4294967296); {22327#true} is VALID [2022-02-21 03:10:11,522 INFO L290 TraceCheckUtils]: 2: Hoare triple {22327#true} assume !(~m % 4294967296 < 16777216); {22327#true} is VALID [2022-02-21 03:10:11,522 INFO L290 TraceCheckUtils]: 3: Hoare triple {22327#true} assume !false; {22327#true} is VALID [2022-02-21 03:10:11,522 INFO L290 TraceCheckUtils]: 4: Hoare triple {22327#true} assume ~m % 4294967296 >= 33554432; {22327#true} is VALID [2022-02-21 03:10:11,522 INFO L290 TraceCheckUtils]: 5: Hoare triple {22327#true} assume ~e >= 127;~__retres4~0 := 4294967295; {22327#true} is VALID [2022-02-21 03:10:11,522 INFO L290 TraceCheckUtils]: 6: Hoare triple {22327#true} #res := ~__retres4~0; {22327#true} is VALID [2022-02-21 03:10:11,522 INFO L290 TraceCheckUtils]: 7: Hoare triple {22327#true} assume true; {22327#true} is VALID [2022-02-21 03:10:11,523 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {22327#true} {22351#(<= 0 |ULTIMATE.start_main_~a~0#1|)} #457#return; {22351#(<= 0 |ULTIMATE.start_main_~a~0#1|)} is VALID [2022-02-21 03:10:11,523 INFO L290 TraceCheckUtils]: 0: Hoare triple {22327#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(24, 2);call #Ultimate.allocInit(12, 3); {22327#true} is VALID [2022-02-21 03:10:11,523 INFO L290 TraceCheckUtils]: 1: Hoare triple {22327#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_~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_add~0#1, main_~zero~0#1, main_~sa~0#1, main_~sb~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~tmp___1~0#1, main_~tmp___2~0#1, main_~tmp___3~0#1, main_~tmp___4~0#1, main_~tmp___5~0#1, main_~tmp___6~0#1, main_~tmp___7~0#1, main_~tmp___8~0#1, main_~tmp___9~0#1, main_~__retres23~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_add~0#1;havoc main_~zero~0#1;havoc main_~sa~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_~tmp___2~0#1;havoc main_~tmp___3~0#1;havoc main_~tmp___4~0#1;havoc main_~tmp___5~0#1;havoc main_~tmp___6~0#1;havoc main_~tmp___7~0#1;havoc main_~tmp___8~0#1;havoc main_~tmp___9~0#1;havoc main_~__retres23~0#1; {22327#true} is VALID [2022-02-21 03:10:11,524 INFO L272 TraceCheckUtils]: 2: Hoare triple {22327#true} call main_#t~ret22#1 := base2flt(0, 0); {22362#(and (= abs_77 |old(abs_77)|) (= abs_78 |old(abs_78)|))} is VALID [2022-02-21 03:10:11,524 INFO L290 TraceCheckUtils]: 3: Hoare triple {22362#(and (= abs_77 |old(abs_77)|) (= abs_78 |old(abs_78)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {22327#true} is VALID [2022-02-21 03:10:11,524 INFO L290 TraceCheckUtils]: 4: Hoare triple {22327#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {22327#true} is VALID [2022-02-21 03:10:11,524 INFO L290 TraceCheckUtils]: 5: Hoare triple {22327#true} #res := ~__retres4~0; {22327#true} is VALID [2022-02-21 03:10:11,524 INFO L290 TraceCheckUtils]: 6: Hoare triple {22327#true} assume true; {22327#true} is VALID [2022-02-21 03:10:11,524 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {22327#true} {22327#true} #453#return; {22327#true} is VALID [2022-02-21 03:10:11,524 INFO L290 TraceCheckUtils]: 8: Hoare triple {22327#true} main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1; {22327#true} is VALID [2022-02-21 03:10:11,525 INFO L272 TraceCheckUtils]: 9: Hoare triple {22327#true} call main_#t~ret23#1 := base2flt(main_~ma~2#1, main_~ea~2#1); {22362#(and (= abs_77 |old(abs_77)|) (= abs_78 |old(abs_78)|))} is VALID [2022-02-21 03:10:11,525 INFO L290 TraceCheckUtils]: 10: Hoare triple {22362#(and (= abs_77 |old(abs_77)|) (= abs_78 |old(abs_78)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {22327#true} is VALID [2022-02-21 03:10:11,525 INFO L290 TraceCheckUtils]: 11: Hoare triple {22327#true} assume !(0 == ~m % 4294967296); {22327#true} is VALID [2022-02-21 03:10:11,525 INFO L290 TraceCheckUtils]: 12: Hoare triple {22327#true} assume !(~m % 4294967296 < 16777216); {22327#true} is VALID [2022-02-21 03:10:11,525 INFO L290 TraceCheckUtils]: 13: Hoare triple {22327#true} assume !false; {22327#true} is VALID [2022-02-21 03:10:11,526 INFO L290 TraceCheckUtils]: 14: Hoare triple {22327#true} assume !(~m % 4294967296 >= 33554432); {22327#true} is VALID [2022-02-21 03:10:11,526 INFO L290 TraceCheckUtils]: 15: Hoare triple {22327#true} assume 0 == ~m || 0 == ~bitwiseComplement(16777216);~m := 0; {22327#true} is VALID [2022-02-21 03:10:11,526 INFO L290 TraceCheckUtils]: 16: Hoare triple {22327#true} assume 128 + ~e <= 2147483647; {22327#true} is VALID [2022-02-21 03:10:11,526 INFO L290 TraceCheckUtils]: 17: Hoare triple {22327#true} assume 128 + ~e >= -2147483648; {22327#true} is VALID [2022-02-21 03:10:11,526 INFO L290 TraceCheckUtils]: 18: Hoare triple {22327#true} assume 128 + ~e <= 2147483647; {22327#true} is VALID [2022-02-21 03:10:11,526 INFO L290 TraceCheckUtils]: 19: Hoare triple {22327#true} assume 128 + ~e >= -2147483648; {22327#true} is VALID [2022-02-21 03:10:11,526 INFO L290 TraceCheckUtils]: 20: Hoare triple {22327#true} assume !((1 == ~m && (0 == 16777216 * (128 + ~e) || 1 == 16777216 * (128 + ~e))) || ((0 == ~m || 1 == ~m) && 1 == 16777216 * (128 + ~e))); {22327#true} is VALID [2022-02-21 03:10:11,527 INFO L290 TraceCheckUtils]: 21: Hoare triple {22327#true} assume 0 == ~m && (0 == 16777216 * (128 + ~e) || 1 == 16777216 * (128 + ~e));~res~0 := 16777216 * (128 + ~e); {22363#(<= 0 base2flt_~res~0)} is VALID [2022-02-21 03:10:11,527 INFO L290 TraceCheckUtils]: 22: Hoare triple {22363#(<= 0 base2flt_~res~0)} ~__retres4~0 := ~res~0; {22364#(<= 0 base2flt_~__retres4~0)} is VALID [2022-02-21 03:10:11,527 INFO L290 TraceCheckUtils]: 23: Hoare triple {22364#(<= 0 base2flt_~__retres4~0)} #res := ~__retres4~0; {22365#(<= 0 |base2flt_#res|)} is VALID [2022-02-21 03:10:11,528 INFO L290 TraceCheckUtils]: 24: Hoare triple {22365#(<= 0 |base2flt_#res|)} assume true; {22365#(<= 0 |base2flt_#res|)} is VALID [2022-02-21 03:10:11,528 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {22365#(<= 0 |base2flt_#res|)} {22327#true} #455#return; {22350#(<= 0 |ULTIMATE.start_main_#t~ret23#1|)} is VALID [2022-02-21 03:10:11,528 INFO L290 TraceCheckUtils]: 26: Hoare triple {22350#(<= 0 |ULTIMATE.start_main_#t~ret23#1|)} main_~a~0#1 := main_#t~ret23#1;havoc main_#t~ret23#1; {22351#(<= 0 |ULTIMATE.start_main_~a~0#1|)} is VALID [2022-02-21 03:10:11,529 INFO L272 TraceCheckUtils]: 27: Hoare triple {22351#(<= 0 |ULTIMATE.start_main_~a~0#1|)} call main_#t~ret24#1 := base2flt(main_~mb~2#1, main_~eb~2#1); {22362#(and (= abs_77 |old(abs_77)|) (= abs_78 |old(abs_78)|))} is VALID [2022-02-21 03:10:11,529 INFO L290 TraceCheckUtils]: 28: Hoare triple {22362#(and (= abs_77 |old(abs_77)|) (= abs_78 |old(abs_78)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {22327#true} is VALID [2022-02-21 03:10:11,529 INFO L290 TraceCheckUtils]: 29: Hoare triple {22327#true} assume !(0 == ~m % 4294967296); {22327#true} is VALID [2022-02-21 03:10:11,529 INFO L290 TraceCheckUtils]: 30: Hoare triple {22327#true} assume !(~m % 4294967296 < 16777216); {22327#true} is VALID [2022-02-21 03:10:11,529 INFO L290 TraceCheckUtils]: 31: Hoare triple {22327#true} assume !false; {22327#true} is VALID [2022-02-21 03:10:11,530 INFO L290 TraceCheckUtils]: 32: Hoare triple {22327#true} assume ~m % 4294967296 >= 33554432; {22327#true} is VALID [2022-02-21 03:10:11,530 INFO L290 TraceCheckUtils]: 33: Hoare triple {22327#true} assume ~e >= 127;~__retres4~0 := 4294967295; {22327#true} is VALID [2022-02-21 03:10:11,530 INFO L290 TraceCheckUtils]: 34: Hoare triple {22327#true} #res := ~__retres4~0; {22327#true} is VALID [2022-02-21 03:10:11,530 INFO L290 TraceCheckUtils]: 35: Hoare triple {22327#true} assume true; {22327#true} is VALID [2022-02-21 03:10:11,530 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {22327#true} {22351#(<= 0 |ULTIMATE.start_main_~a~0#1|)} #457#return; {22351#(<= 0 |ULTIMATE.start_main_~a~0#1|)} is VALID [2022-02-21 03:10:11,531 INFO L290 TraceCheckUtils]: 37: Hoare triple {22351#(<= 0 |ULTIMATE.start_main_~a~0#1|)} main_~b~0#1 := main_#t~ret24#1;havoc main_#t~ret24#1; {22351#(<= 0 |ULTIMATE.start_main_~a~0#1|)} is VALID [2022-02-21 03:10:11,531 INFO L290 TraceCheckUtils]: 38: Hoare triple {22351#(<= 0 |ULTIMATE.start_main_~a~0#1|)} assume !(main_~a~0#1 % 4294967296 < main_~zero~0#1 % 4294967296); {22351#(<= 0 |ULTIMATE.start_main_~a~0#1|)} is VALID [2022-02-21 03:10:11,531 INFO L290 TraceCheckUtils]: 39: Hoare triple {22351#(<= 0 |ULTIMATE.start_main_~a~0#1|)} assume main_~a~0#1 % 4294967296 > main_~zero~0#1 % 4294967296;main_~tmp~2#1 := 1; {22351#(<= 0 |ULTIMATE.start_main_~a~0#1|)} is VALID [2022-02-21 03:10:11,532 INFO L290 TraceCheckUtils]: 40: Hoare triple {22351#(<= 0 |ULTIMATE.start_main_~a~0#1|)} main_~sa~0#1 := main_~tmp~2#1; {22351#(<= 0 |ULTIMATE.start_main_~a~0#1|)} is VALID [2022-02-21 03:10:11,532 INFO L290 TraceCheckUtils]: 41: Hoare triple {22351#(<= 0 |ULTIMATE.start_main_~a~0#1|)} assume !(main_~b~0#1 % 4294967296 < main_~zero~0#1 % 4294967296); {22351#(<= 0 |ULTIMATE.start_main_~a~0#1|)} is VALID [2022-02-21 03:10:11,532 INFO L290 TraceCheckUtils]: 42: Hoare triple {22351#(<= 0 |ULTIMATE.start_main_~a~0#1|)} assume main_~b~0#1 % 4294967296 > main_~zero~0#1 % 4294967296;main_~tmp___0~0#1 := 1; {22351#(<= 0 |ULTIMATE.start_main_~a~0#1|)} is VALID [2022-02-21 03:10:11,532 INFO L290 TraceCheckUtils]: 43: Hoare triple {22351#(<= 0 |ULTIMATE.start_main_~a~0#1|)} main_~sb~0#1 := main_~tmp___0~0#1; {22351#(<= 0 |ULTIMATE.start_main_~a~0#1|)} is VALID [2022-02-21 03:10:11,533 INFO L290 TraceCheckUtils]: 44: Hoare triple {22351#(<= 0 |ULTIMATE.start_main_~a~0#1|)} assume { :begin_inline_addflt } true;addflt_#in~a#1, addflt_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc addflt_#res#1;havoc addflt_#t~nondet6#1, addflt_#t~nondet7#1, addflt_#t~nondet8#1, addflt_#t~nondet9#1, addflt_#t~nondet10#1, addflt_#t~nondet11#1, addflt_~a#1, addflt_~b#1, addflt_~res~1#1, addflt_~ma~0#1, addflt_~mb~0#1, addflt_~delta~0#1, addflt_~ea~0#1, addflt_~eb~0#1, addflt_~tmp~0#1, addflt_~__retres10~0#1;addflt_~a#1 := addflt_#in~a#1;addflt_~b#1 := addflt_#in~b#1;havoc addflt_~res~1#1;havoc addflt_~ma~0#1;havoc addflt_~mb~0#1;havoc addflt_~delta~0#1;havoc addflt_~ea~0#1;havoc addflt_~eb~0#1;havoc addflt_~tmp~0#1;havoc addflt_~__retres10~0#1; {22361#(<= 0 |ULTIMATE.start_addflt_~a#1|)} is VALID [2022-02-21 03:10:11,533 INFO L290 TraceCheckUtils]: 45: Hoare triple {22361#(<= 0 |ULTIMATE.start_addflt_~a#1|)} assume !(addflt_~a#1 % 4294967296 < addflt_~b#1 % 4294967296); {22361#(<= 0 |ULTIMATE.start_addflt_~a#1|)} is VALID [2022-02-21 03:10:11,533 INFO L290 TraceCheckUtils]: 46: Hoare triple {22361#(<= 0 |ULTIMATE.start_addflt_~a#1|)} assume !(0 == addflt_~b#1 % 4294967296); {22361#(<= 0 |ULTIMATE.start_addflt_~a#1|)} is VALID [2022-02-21 03:10:11,534 INFO L290 TraceCheckUtils]: 47: Hoare triple {22361#(<= 0 |ULTIMATE.start_addflt_~a#1|)} assume !(0 == addflt_~a#1); {22361#(<= 0 |ULTIMATE.start_addflt_~a#1|)} is VALID [2022-02-21 03:10:11,534 INFO L290 TraceCheckUtils]: 48: Hoare triple {22361#(<= 0 |ULTIMATE.start_addflt_~a#1|)} assume !false; {22361#(<= 0 |ULTIMATE.start_addflt_~a#1|)} is VALID [2022-02-21 03:10:11,534 INFO L290 TraceCheckUtils]: 49: Hoare triple {22361#(<= 0 |ULTIMATE.start_addflt_~a#1|)} assume !false; {22361#(<= 0 |ULTIMATE.start_addflt_~a#1|)} is VALID [2022-02-21 03:10:11,534 INFO L290 TraceCheckUtils]: 50: Hoare triple {22361#(<= 0 |ULTIMATE.start_addflt_~a#1|)} assume !(addflt_~a#1 >= 0);addflt_~ma~0#1 := addflt_#t~nondet6#1;havoc addflt_#t~nondet6#1; {22328#false} is VALID [2022-02-21 03:10:11,535 INFO L290 TraceCheckUtils]: 51: Hoare triple {22328#false} assume (if addflt_~a#1 / 16777216 % 4294967296 % 4294967296 <= 2147483647 then addflt_~a#1 / 16777216 % 4294967296 % 4294967296 else addflt_~a#1 / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 <= 2147483647; {22328#false} is VALID [2022-02-21 03:10:11,535 INFO L290 TraceCheckUtils]: 52: Hoare triple {22328#false} assume !((if addflt_~a#1 / 16777216 % 4294967296 % 4294967296 <= 2147483647 then addflt_~a#1 / 16777216 % 4294967296 % 4294967296 else addflt_~a#1 / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 >= -2147483648); {22328#false} is VALID [2022-02-21 03:10:11,535 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-02-21 03:10:11,535 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:10:11,535 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422252027] [2022-02-21 03:10:11,535 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1422252027] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:10:11,535 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [994670779] [2022-02-21 03:10:11,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:10:11,536 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:10:11,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:10:11,537 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:10:11,538 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-02-21 03:10:11,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:11,585 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 11 conjunts are in the unsatisfiable core [2022-02-21 03:10:11,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:11,597 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:10:12,202 INFO L290 TraceCheckUtils]: 0: Hoare triple {22327#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(24, 2);call #Ultimate.allocInit(12, 3); {22327#true} is VALID [2022-02-21 03:10:12,203 INFO L290 TraceCheckUtils]: 1: Hoare triple {22327#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_~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_add~0#1, main_~zero~0#1, main_~sa~0#1, main_~sb~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~tmp___1~0#1, main_~tmp___2~0#1, main_~tmp___3~0#1, main_~tmp___4~0#1, main_~tmp___5~0#1, main_~tmp___6~0#1, main_~tmp___7~0#1, main_~tmp___8~0#1, main_~tmp___9~0#1, main_~__retres23~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_add~0#1;havoc main_~zero~0#1;havoc main_~sa~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_~tmp___2~0#1;havoc main_~tmp___3~0#1;havoc main_~tmp___4~0#1;havoc main_~tmp___5~0#1;havoc main_~tmp___6~0#1;havoc main_~tmp___7~0#1;havoc main_~tmp___8~0#1;havoc main_~tmp___9~0#1;havoc main_~__retres23~0#1; {22372#(<= 0 (+ |ULTIMATE.start_main_~ea~2#1| 128))} is VALID [2022-02-21 03:10:12,203 INFO L272 TraceCheckUtils]: 2: Hoare triple {22372#(<= 0 (+ |ULTIMATE.start_main_~ea~2#1| 128))} call main_#t~ret22#1 := base2flt(0, 0); {22327#true} is VALID [2022-02-21 03:10:12,203 INFO L290 TraceCheckUtils]: 3: Hoare triple {22327#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {22327#true} is VALID [2022-02-21 03:10:12,203 INFO L290 TraceCheckUtils]: 4: Hoare triple {22327#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {22327#true} is VALID [2022-02-21 03:10:12,203 INFO L290 TraceCheckUtils]: 5: Hoare triple {22327#true} #res := ~__retres4~0; {22327#true} is VALID [2022-02-21 03:10:12,203 INFO L290 TraceCheckUtils]: 6: Hoare triple {22327#true} assume true; {22327#true} is VALID [2022-02-21 03:10:12,204 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {22327#true} {22372#(<= 0 (+ |ULTIMATE.start_main_~ea~2#1| 128))} #453#return; {22372#(<= 0 (+ |ULTIMATE.start_main_~ea~2#1| 128))} is VALID [2022-02-21 03:10:12,204 INFO L290 TraceCheckUtils]: 8: Hoare triple {22372#(<= 0 (+ |ULTIMATE.start_main_~ea~2#1| 128))} main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1; {22372#(<= 0 (+ |ULTIMATE.start_main_~ea~2#1| 128))} is VALID [2022-02-21 03:10:12,204 INFO L272 TraceCheckUtils]: 9: Hoare triple {22372#(<= 0 (+ |ULTIMATE.start_main_~ea~2#1| 128))} call main_#t~ret23#1 := base2flt(main_~ma~2#1, main_~ea~2#1); {22327#true} is VALID [2022-02-21 03:10:12,204 INFO L290 TraceCheckUtils]: 10: Hoare triple {22327#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {22400#(<= |base2flt_#in~e| base2flt_~e)} is VALID [2022-02-21 03:10:12,205 INFO L290 TraceCheckUtils]: 11: Hoare triple {22400#(<= |base2flt_#in~e| base2flt_~e)} assume !(0 == ~m % 4294967296); {22400#(<= |base2flt_#in~e| base2flt_~e)} is VALID [2022-02-21 03:10:12,205 INFO L290 TraceCheckUtils]: 12: Hoare triple {22400#(<= |base2flt_#in~e| base2flt_~e)} assume !(~m % 4294967296 < 16777216); {22400#(<= |base2flt_#in~e| base2flt_~e)} is VALID [2022-02-21 03:10:12,205 INFO L290 TraceCheckUtils]: 13: Hoare triple {22400#(<= |base2flt_#in~e| base2flt_~e)} assume !false; {22400#(<= |base2flt_#in~e| base2flt_~e)} is VALID [2022-02-21 03:10:12,205 INFO L290 TraceCheckUtils]: 14: Hoare triple {22400#(<= |base2flt_#in~e| base2flt_~e)} assume !(~m % 4294967296 >= 33554432); {22400#(<= |base2flt_#in~e| base2flt_~e)} is VALID [2022-02-21 03:10:12,206 INFO L290 TraceCheckUtils]: 15: Hoare triple {22400#(<= |base2flt_#in~e| base2flt_~e)} assume 0 == ~m || 0 == ~bitwiseComplement(16777216);~m := 0; {22400#(<= |base2flt_#in~e| base2flt_~e)} is VALID [2022-02-21 03:10:12,206 INFO L290 TraceCheckUtils]: 16: Hoare triple {22400#(<= |base2flt_#in~e| base2flt_~e)} assume 128 + ~e <= 2147483647; {22400#(<= |base2flt_#in~e| base2flt_~e)} is VALID [2022-02-21 03:10:12,206 INFO L290 TraceCheckUtils]: 17: Hoare triple {22400#(<= |base2flt_#in~e| base2flt_~e)} assume 128 + ~e >= -2147483648; {22400#(<= |base2flt_#in~e| base2flt_~e)} is VALID [2022-02-21 03:10:12,206 INFO L290 TraceCheckUtils]: 18: Hoare triple {22400#(<= |base2flt_#in~e| base2flt_~e)} assume 128 + ~e <= 2147483647; {22400#(<= |base2flt_#in~e| base2flt_~e)} is VALID [2022-02-21 03:10:12,207 INFO L290 TraceCheckUtils]: 19: Hoare triple {22400#(<= |base2flt_#in~e| base2flt_~e)} assume 128 + ~e >= -2147483648; {22400#(<= |base2flt_#in~e| base2flt_~e)} is VALID [2022-02-21 03:10:12,207 INFO L290 TraceCheckUtils]: 20: Hoare triple {22400#(<= |base2flt_#in~e| base2flt_~e)} assume !((1 == ~m && (0 == 16777216 * (128 + ~e) || 1 == 16777216 * (128 + ~e))) || ((0 == ~m || 1 == ~m) && 1 == 16777216 * (128 + ~e))); {22400#(<= |base2flt_#in~e| base2flt_~e)} is VALID [2022-02-21 03:10:12,207 INFO L290 TraceCheckUtils]: 21: Hoare triple {22400#(<= |base2flt_#in~e| base2flt_~e)} assume 0 == ~m && (0 == 16777216 * (128 + ~e) || 1 == 16777216 * (128 + ~e));~res~0 := 16777216 * (128 + ~e); {22434#(<= |base2flt_#in~e| (div (+ (- 2147483648) base2flt_~res~0) 16777216))} is VALID [2022-02-21 03:10:12,208 INFO L290 TraceCheckUtils]: 22: Hoare triple {22434#(<= |base2flt_#in~e| (div (+ (- 2147483648) base2flt_~res~0) 16777216))} ~__retres4~0 := ~res~0; {22438#(<= |base2flt_#in~e| (div (+ (- 2147483648) base2flt_~__retres4~0) 16777216))} is VALID [2022-02-21 03:10:12,208 INFO L290 TraceCheckUtils]: 23: Hoare triple {22438#(<= |base2flt_#in~e| (div (+ (- 2147483648) base2flt_~__retres4~0) 16777216))} #res := ~__retres4~0; {22442#(<= |base2flt_#in~e| (div (+ (- 2147483648) |base2flt_#res|) 16777216))} is VALID [2022-02-21 03:10:12,208 INFO L290 TraceCheckUtils]: 24: Hoare triple {22442#(<= |base2flt_#in~e| (div (+ (- 2147483648) |base2flt_#res|) 16777216))} assume true; {22442#(<= |base2flt_#in~e| (div (+ (- 2147483648) |base2flt_#res|) 16777216))} is VALID [2022-02-21 03:10:12,209 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {22442#(<= |base2flt_#in~e| (div (+ (- 2147483648) |base2flt_#res|) 16777216))} {22372#(<= 0 (+ |ULTIMATE.start_main_~ea~2#1| 128))} #455#return; {22350#(<= 0 |ULTIMATE.start_main_#t~ret23#1|)} is VALID [2022-02-21 03:10:12,209 INFO L290 TraceCheckUtils]: 26: Hoare triple {22350#(<= 0 |ULTIMATE.start_main_#t~ret23#1|)} main_~a~0#1 := main_#t~ret23#1;havoc main_#t~ret23#1; {22351#(<= 0 |ULTIMATE.start_main_~a~0#1|)} is VALID [2022-02-21 03:10:12,209 INFO L272 TraceCheckUtils]: 27: Hoare triple {22351#(<= 0 |ULTIMATE.start_main_~a~0#1|)} call main_#t~ret24#1 := base2flt(main_~mb~2#1, main_~eb~2#1); {22327#true} is VALID [2022-02-21 03:10:12,210 INFO L290 TraceCheckUtils]: 28: Hoare triple {22327#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {22327#true} is VALID [2022-02-21 03:10:12,210 INFO L290 TraceCheckUtils]: 29: Hoare triple {22327#true} assume !(0 == ~m % 4294967296); {22327#true} is VALID [2022-02-21 03:10:12,210 INFO L290 TraceCheckUtils]: 30: Hoare triple {22327#true} assume !(~m % 4294967296 < 16777216); {22327#true} is VALID [2022-02-21 03:10:12,210 INFO L290 TraceCheckUtils]: 31: Hoare triple {22327#true} assume !false; {22327#true} is VALID [2022-02-21 03:10:12,210 INFO L290 TraceCheckUtils]: 32: Hoare triple {22327#true} assume ~m % 4294967296 >= 33554432; {22327#true} is VALID [2022-02-21 03:10:12,210 INFO L290 TraceCheckUtils]: 33: Hoare triple {22327#true} assume ~e >= 127;~__retres4~0 := 4294967295; {22327#true} is VALID [2022-02-21 03:10:12,210 INFO L290 TraceCheckUtils]: 34: Hoare triple {22327#true} #res := ~__retres4~0; {22327#true} is VALID [2022-02-21 03:10:12,210 INFO L290 TraceCheckUtils]: 35: Hoare triple {22327#true} assume true; {22327#true} is VALID [2022-02-21 03:10:12,210 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {22327#true} {22351#(<= 0 |ULTIMATE.start_main_~a~0#1|)} #457#return; {22351#(<= 0 |ULTIMATE.start_main_~a~0#1|)} is VALID [2022-02-21 03:10:12,211 INFO L290 TraceCheckUtils]: 37: Hoare triple {22351#(<= 0 |ULTIMATE.start_main_~a~0#1|)} main_~b~0#1 := main_#t~ret24#1;havoc main_#t~ret24#1; {22351#(<= 0 |ULTIMATE.start_main_~a~0#1|)} is VALID [2022-02-21 03:10:12,211 INFO L290 TraceCheckUtils]: 38: Hoare triple {22351#(<= 0 |ULTIMATE.start_main_~a~0#1|)} assume !(main_~a~0#1 % 4294967296 < main_~zero~0#1 % 4294967296); {22351#(<= 0 |ULTIMATE.start_main_~a~0#1|)} is VALID [2022-02-21 03:10:12,221 INFO L290 TraceCheckUtils]: 39: Hoare triple {22351#(<= 0 |ULTIMATE.start_main_~a~0#1|)} assume main_~a~0#1 % 4294967296 > main_~zero~0#1 % 4294967296;main_~tmp~2#1 := 1; {22351#(<= 0 |ULTIMATE.start_main_~a~0#1|)} is VALID [2022-02-21 03:10:12,221 INFO L290 TraceCheckUtils]: 40: Hoare triple {22351#(<= 0 |ULTIMATE.start_main_~a~0#1|)} main_~sa~0#1 := main_~tmp~2#1; {22351#(<= 0 |ULTIMATE.start_main_~a~0#1|)} is VALID [2022-02-21 03:10:12,221 INFO L290 TraceCheckUtils]: 41: Hoare triple {22351#(<= 0 |ULTIMATE.start_main_~a~0#1|)} assume !(main_~b~0#1 % 4294967296 < main_~zero~0#1 % 4294967296); {22351#(<= 0 |ULTIMATE.start_main_~a~0#1|)} is VALID [2022-02-21 03:10:12,222 INFO L290 TraceCheckUtils]: 42: Hoare triple {22351#(<= 0 |ULTIMATE.start_main_~a~0#1|)} assume main_~b~0#1 % 4294967296 > main_~zero~0#1 % 4294967296;main_~tmp___0~0#1 := 1; {22351#(<= 0 |ULTIMATE.start_main_~a~0#1|)} is VALID [2022-02-21 03:10:12,222 INFO L290 TraceCheckUtils]: 43: Hoare triple {22351#(<= 0 |ULTIMATE.start_main_~a~0#1|)} main_~sb~0#1 := main_~tmp___0~0#1; {22351#(<= 0 |ULTIMATE.start_main_~a~0#1|)} is VALID [2022-02-21 03:10:12,222 INFO L290 TraceCheckUtils]: 44: Hoare triple {22351#(<= 0 |ULTIMATE.start_main_~a~0#1|)} assume { :begin_inline_addflt } true;addflt_#in~a#1, addflt_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc addflt_#res#1;havoc addflt_#t~nondet6#1, addflt_#t~nondet7#1, addflt_#t~nondet8#1, addflt_#t~nondet9#1, addflt_#t~nondet10#1, addflt_#t~nondet11#1, addflt_~a#1, addflt_~b#1, addflt_~res~1#1, addflt_~ma~0#1, addflt_~mb~0#1, addflt_~delta~0#1, addflt_~ea~0#1, addflt_~eb~0#1, addflt_~tmp~0#1, addflt_~__retres10~0#1;addflt_~a#1 := addflt_#in~a#1;addflt_~b#1 := addflt_#in~b#1;havoc addflt_~res~1#1;havoc addflt_~ma~0#1;havoc addflt_~mb~0#1;havoc addflt_~delta~0#1;havoc addflt_~ea~0#1;havoc addflt_~eb~0#1;havoc addflt_~tmp~0#1;havoc addflt_~__retres10~0#1; {22361#(<= 0 |ULTIMATE.start_addflt_~a#1|)} is VALID [2022-02-21 03:10:12,223 INFO L290 TraceCheckUtils]: 45: Hoare triple {22361#(<= 0 |ULTIMATE.start_addflt_~a#1|)} assume !(addflt_~a#1 % 4294967296 < addflt_~b#1 % 4294967296); {22361#(<= 0 |ULTIMATE.start_addflt_~a#1|)} is VALID [2022-02-21 03:10:12,223 INFO L290 TraceCheckUtils]: 46: Hoare triple {22361#(<= 0 |ULTIMATE.start_addflt_~a#1|)} assume !(0 == addflt_~b#1 % 4294967296); {22361#(<= 0 |ULTIMATE.start_addflt_~a#1|)} is VALID [2022-02-21 03:10:12,223 INFO L290 TraceCheckUtils]: 47: Hoare triple {22361#(<= 0 |ULTIMATE.start_addflt_~a#1|)} assume !(0 == addflt_~a#1); {22361#(<= 0 |ULTIMATE.start_addflt_~a#1|)} is VALID [2022-02-21 03:10:12,223 INFO L290 TraceCheckUtils]: 48: Hoare triple {22361#(<= 0 |ULTIMATE.start_addflt_~a#1|)} assume !false; {22361#(<= 0 |ULTIMATE.start_addflt_~a#1|)} is VALID [2022-02-21 03:10:12,224 INFO L290 TraceCheckUtils]: 49: Hoare triple {22361#(<= 0 |ULTIMATE.start_addflt_~a#1|)} assume !false; {22361#(<= 0 |ULTIMATE.start_addflt_~a#1|)} is VALID [2022-02-21 03:10:12,224 INFO L290 TraceCheckUtils]: 50: Hoare triple {22361#(<= 0 |ULTIMATE.start_addflt_~a#1|)} assume !(addflt_~a#1 >= 0);addflt_~ma~0#1 := addflt_#t~nondet6#1;havoc addflt_#t~nondet6#1; {22328#false} is VALID [2022-02-21 03:10:12,224 INFO L290 TraceCheckUtils]: 51: Hoare triple {22328#false} assume (if addflt_~a#1 / 16777216 % 4294967296 % 4294967296 <= 2147483647 then addflt_~a#1 / 16777216 % 4294967296 % 4294967296 else addflt_~a#1 / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 <= 2147483647; {22328#false} is VALID [2022-02-21 03:10:12,224 INFO L290 TraceCheckUtils]: 52: Hoare triple {22328#false} assume !((if addflt_~a#1 / 16777216 % 4294967296 % 4294967296 <= 2147483647 then addflt_~a#1 / 16777216 % 4294967296 % 4294967296 else addflt_~a#1 / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 >= -2147483648); {22328#false} is VALID [2022-02-21 03:10:12,224 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-02-21 03:10:12,224 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:10:12,730 INFO L290 TraceCheckUtils]: 52: Hoare triple {22328#false} assume !((if addflt_~a#1 / 16777216 % 4294967296 % 4294967296 <= 2147483647 then addflt_~a#1 / 16777216 % 4294967296 % 4294967296 else addflt_~a#1 / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 >= -2147483648); {22328#false} is VALID [2022-02-21 03:10:12,730 INFO L290 TraceCheckUtils]: 51: Hoare triple {22328#false} assume (if addflt_~a#1 / 16777216 % 4294967296 % 4294967296 <= 2147483647 then addflt_~a#1 / 16777216 % 4294967296 % 4294967296 else addflt_~a#1 / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 <= 2147483647; {22328#false} is VALID [2022-02-21 03:10:12,730 INFO L290 TraceCheckUtils]: 50: Hoare triple {22361#(<= 0 |ULTIMATE.start_addflt_~a#1|)} assume !(addflt_~a#1 >= 0);addflt_~ma~0#1 := addflt_#t~nondet6#1;havoc addflt_#t~nondet6#1; {22328#false} is VALID [2022-02-21 03:10:12,730 INFO L290 TraceCheckUtils]: 49: Hoare triple {22361#(<= 0 |ULTIMATE.start_addflt_~a#1|)} assume !false; {22361#(<= 0 |ULTIMATE.start_addflt_~a#1|)} is VALID [2022-02-21 03:10:12,731 INFO L290 TraceCheckUtils]: 48: Hoare triple {22361#(<= 0 |ULTIMATE.start_addflt_~a#1|)} assume !false; {22361#(<= 0 |ULTIMATE.start_addflt_~a#1|)} is VALID [2022-02-21 03:10:12,731 INFO L290 TraceCheckUtils]: 47: Hoare triple {22361#(<= 0 |ULTIMATE.start_addflt_~a#1|)} assume !(0 == addflt_~a#1); {22361#(<= 0 |ULTIMATE.start_addflt_~a#1|)} is VALID [2022-02-21 03:10:12,731 INFO L290 TraceCheckUtils]: 46: Hoare triple {22361#(<= 0 |ULTIMATE.start_addflt_~a#1|)} assume !(0 == addflt_~b#1 % 4294967296); {22361#(<= 0 |ULTIMATE.start_addflt_~a#1|)} is VALID [2022-02-21 03:10:12,732 INFO L290 TraceCheckUtils]: 45: Hoare triple {22361#(<= 0 |ULTIMATE.start_addflt_~a#1|)} assume !(addflt_~a#1 % 4294967296 < addflt_~b#1 % 4294967296); {22361#(<= 0 |ULTIMATE.start_addflt_~a#1|)} is VALID [2022-02-21 03:10:12,732 INFO L290 TraceCheckUtils]: 44: Hoare triple {22351#(<= 0 |ULTIMATE.start_main_~a~0#1|)} assume { :begin_inline_addflt } true;addflt_#in~a#1, addflt_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc addflt_#res#1;havoc addflt_#t~nondet6#1, addflt_#t~nondet7#1, addflt_#t~nondet8#1, addflt_#t~nondet9#1, addflt_#t~nondet10#1, addflt_#t~nondet11#1, addflt_~a#1, addflt_~b#1, addflt_~res~1#1, addflt_~ma~0#1, addflt_~mb~0#1, addflt_~delta~0#1, addflt_~ea~0#1, addflt_~eb~0#1, addflt_~tmp~0#1, addflt_~__retres10~0#1;addflt_~a#1 := addflt_#in~a#1;addflt_~b#1 := addflt_#in~b#1;havoc addflt_~res~1#1;havoc addflt_~ma~0#1;havoc addflt_~mb~0#1;havoc addflt_~delta~0#1;havoc addflt_~ea~0#1;havoc addflt_~eb~0#1;havoc addflt_~tmp~0#1;havoc addflt_~__retres10~0#1; {22361#(<= 0 |ULTIMATE.start_addflt_~a#1|)} is VALID [2022-02-21 03:10:12,732 INFO L290 TraceCheckUtils]: 43: Hoare triple {22351#(<= 0 |ULTIMATE.start_main_~a~0#1|)} main_~sb~0#1 := main_~tmp___0~0#1; {22351#(<= 0 |ULTIMATE.start_main_~a~0#1|)} is VALID [2022-02-21 03:10:12,732 INFO L290 TraceCheckUtils]: 42: Hoare triple {22351#(<= 0 |ULTIMATE.start_main_~a~0#1|)} assume main_~b~0#1 % 4294967296 > main_~zero~0#1 % 4294967296;main_~tmp___0~0#1 := 1; {22351#(<= 0 |ULTIMATE.start_main_~a~0#1|)} is VALID [2022-02-21 03:10:12,733 INFO L290 TraceCheckUtils]: 41: Hoare triple {22351#(<= 0 |ULTIMATE.start_main_~a~0#1|)} assume !(main_~b~0#1 % 4294967296 < main_~zero~0#1 % 4294967296); {22351#(<= 0 |ULTIMATE.start_main_~a~0#1|)} is VALID [2022-02-21 03:10:12,733 INFO L290 TraceCheckUtils]: 40: Hoare triple {22351#(<= 0 |ULTIMATE.start_main_~a~0#1|)} main_~sa~0#1 := main_~tmp~2#1; {22351#(<= 0 |ULTIMATE.start_main_~a~0#1|)} is VALID [2022-02-21 03:10:12,733 INFO L290 TraceCheckUtils]: 39: Hoare triple {22351#(<= 0 |ULTIMATE.start_main_~a~0#1|)} assume main_~a~0#1 % 4294967296 > main_~zero~0#1 % 4294967296;main_~tmp~2#1 := 1; {22351#(<= 0 |ULTIMATE.start_main_~a~0#1|)} is VALID [2022-02-21 03:10:12,733 INFO L290 TraceCheckUtils]: 38: Hoare triple {22351#(<= 0 |ULTIMATE.start_main_~a~0#1|)} assume !(main_~a~0#1 % 4294967296 < main_~zero~0#1 % 4294967296); {22351#(<= 0 |ULTIMATE.start_main_~a~0#1|)} is VALID [2022-02-21 03:10:12,734 INFO L290 TraceCheckUtils]: 37: Hoare triple {22351#(<= 0 |ULTIMATE.start_main_~a~0#1|)} main_~b~0#1 := main_#t~ret24#1;havoc main_#t~ret24#1; {22351#(<= 0 |ULTIMATE.start_main_~a~0#1|)} is VALID [2022-02-21 03:10:12,734 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {22327#true} {22351#(<= 0 |ULTIMATE.start_main_~a~0#1|)} #457#return; {22351#(<= 0 |ULTIMATE.start_main_~a~0#1|)} is VALID [2022-02-21 03:10:12,734 INFO L290 TraceCheckUtils]: 35: Hoare triple {22327#true} assume true; {22327#true} is VALID [2022-02-21 03:10:12,734 INFO L290 TraceCheckUtils]: 34: Hoare triple {22327#true} #res := ~__retres4~0; {22327#true} is VALID [2022-02-21 03:10:12,734 INFO L290 TraceCheckUtils]: 33: Hoare triple {22327#true} assume ~e >= 127;~__retres4~0 := 4294967295; {22327#true} is VALID [2022-02-21 03:10:12,734 INFO L290 TraceCheckUtils]: 32: Hoare triple {22327#true} assume ~m % 4294967296 >= 33554432; {22327#true} is VALID [2022-02-21 03:10:12,735 INFO L290 TraceCheckUtils]: 31: Hoare triple {22327#true} assume !false; {22327#true} is VALID [2022-02-21 03:10:12,735 INFO L290 TraceCheckUtils]: 30: Hoare triple {22327#true} assume !(~m % 4294967296 < 16777216); {22327#true} is VALID [2022-02-21 03:10:12,735 INFO L290 TraceCheckUtils]: 29: Hoare triple {22327#true} assume !(0 == ~m % 4294967296); {22327#true} is VALID [2022-02-21 03:10:12,735 INFO L290 TraceCheckUtils]: 28: Hoare triple {22327#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {22327#true} is VALID [2022-02-21 03:10:12,735 INFO L272 TraceCheckUtils]: 27: Hoare triple {22351#(<= 0 |ULTIMATE.start_main_~a~0#1|)} call main_#t~ret24#1 := base2flt(main_~mb~2#1, main_~eb~2#1); {22327#true} is VALID [2022-02-21 03:10:12,735 INFO L290 TraceCheckUtils]: 26: Hoare triple {22350#(<= 0 |ULTIMATE.start_main_#t~ret23#1|)} main_~a~0#1 := main_#t~ret23#1;havoc main_#t~ret23#1; {22351#(<= 0 |ULTIMATE.start_main_~a~0#1|)} is VALID [2022-02-21 03:10:12,736 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {22614#(or (< (+ 128 |base2flt_#in~e|) 0) (<= 0 |base2flt_#res|))} {22372#(<= 0 (+ |ULTIMATE.start_main_~ea~2#1| 128))} #455#return; {22350#(<= 0 |ULTIMATE.start_main_#t~ret23#1|)} is VALID [2022-02-21 03:10:12,736 INFO L290 TraceCheckUtils]: 24: Hoare triple {22614#(or (< (+ 128 |base2flt_#in~e|) 0) (<= 0 |base2flt_#res|))} assume true; {22614#(or (< (+ 128 |base2flt_#in~e|) 0) (<= 0 |base2flt_#res|))} is VALID [2022-02-21 03:10:12,736 INFO L290 TraceCheckUtils]: 23: Hoare triple {22621#(or (< (+ 128 |base2flt_#in~e|) 0) (<= 0 base2flt_~__retres4~0))} #res := ~__retres4~0; {22614#(or (< (+ 128 |base2flt_#in~e|) 0) (<= 0 |base2flt_#res|))} is VALID [2022-02-21 03:10:12,737 INFO L290 TraceCheckUtils]: 22: Hoare triple {22625#(or (<= 0 base2flt_~res~0) (< (+ 128 |base2flt_#in~e|) 0))} ~__retres4~0 := ~res~0; {22621#(or (< (+ 128 |base2flt_#in~e|) 0) (<= 0 base2flt_~__retres4~0))} is VALID [2022-02-21 03:10:12,737 INFO L290 TraceCheckUtils]: 21: Hoare triple {22629#(or (< (+ 128 |base2flt_#in~e|) 0) (<= 0 (+ (* 16777216 base2flt_~e) 2147483648)))} assume 0 == ~m && (0 == 16777216 * (128 + ~e) || 1 == 16777216 * (128 + ~e));~res~0 := 16777216 * (128 + ~e); {22625#(or (<= 0 base2flt_~res~0) (< (+ 128 |base2flt_#in~e|) 0))} is VALID [2022-02-21 03:10:12,738 INFO L290 TraceCheckUtils]: 20: Hoare triple {22629#(or (< (+ 128 |base2flt_#in~e|) 0) (<= 0 (+ (* 16777216 base2flt_~e) 2147483648)))} assume !((1 == ~m && (0 == 16777216 * (128 + ~e) || 1 == 16777216 * (128 + ~e))) || ((0 == ~m || 1 == ~m) && 1 == 16777216 * (128 + ~e))); {22629#(or (< (+ 128 |base2flt_#in~e|) 0) (<= 0 (+ (* 16777216 base2flt_~e) 2147483648)))} is VALID [2022-02-21 03:10:12,738 INFO L290 TraceCheckUtils]: 19: Hoare triple {22629#(or (< (+ 128 |base2flt_#in~e|) 0) (<= 0 (+ (* 16777216 base2flt_~e) 2147483648)))} assume 128 + ~e >= -2147483648; {22629#(or (< (+ 128 |base2flt_#in~e|) 0) (<= 0 (+ (* 16777216 base2flt_~e) 2147483648)))} is VALID [2022-02-21 03:10:12,738 INFO L290 TraceCheckUtils]: 18: Hoare triple {22629#(or (< (+ 128 |base2flt_#in~e|) 0) (<= 0 (+ (* 16777216 base2flt_~e) 2147483648)))} assume 128 + ~e <= 2147483647; {22629#(or (< (+ 128 |base2flt_#in~e|) 0) (<= 0 (+ (* 16777216 base2flt_~e) 2147483648)))} is VALID [2022-02-21 03:10:12,739 INFO L290 TraceCheckUtils]: 17: Hoare triple {22629#(or (< (+ 128 |base2flt_#in~e|) 0) (<= 0 (+ (* 16777216 base2flt_~e) 2147483648)))} assume 128 + ~e >= -2147483648; {22629#(or (< (+ 128 |base2flt_#in~e|) 0) (<= 0 (+ (* 16777216 base2flt_~e) 2147483648)))} is VALID [2022-02-21 03:10:12,739 INFO L290 TraceCheckUtils]: 16: Hoare triple {22629#(or (< (+ 128 |base2flt_#in~e|) 0) (<= 0 (+ (* 16777216 base2flt_~e) 2147483648)))} assume 128 + ~e <= 2147483647; {22629#(or (< (+ 128 |base2flt_#in~e|) 0) (<= 0 (+ (* 16777216 base2flt_~e) 2147483648)))} is VALID [2022-02-21 03:10:12,739 INFO L290 TraceCheckUtils]: 15: Hoare triple {22629#(or (< (+ 128 |base2flt_#in~e|) 0) (<= 0 (+ (* 16777216 base2flt_~e) 2147483648)))} assume 0 == ~m || 0 == ~bitwiseComplement(16777216);~m := 0; {22629#(or (< (+ 128 |base2flt_#in~e|) 0) (<= 0 (+ (* 16777216 base2flt_~e) 2147483648)))} is VALID [2022-02-21 03:10:12,740 INFO L290 TraceCheckUtils]: 14: Hoare triple {22629#(or (< (+ 128 |base2flt_#in~e|) 0) (<= 0 (+ (* 16777216 base2flt_~e) 2147483648)))} assume !(~m % 4294967296 >= 33554432); {22629#(or (< (+ 128 |base2flt_#in~e|) 0) (<= 0 (+ (* 16777216 base2flt_~e) 2147483648)))} is VALID [2022-02-21 03:10:12,740 INFO L290 TraceCheckUtils]: 13: Hoare triple {22629#(or (< (+ 128 |base2flt_#in~e|) 0) (<= 0 (+ (* 16777216 base2flt_~e) 2147483648)))} assume !false; {22629#(or (< (+ 128 |base2flt_#in~e|) 0) (<= 0 (+ (* 16777216 base2flt_~e) 2147483648)))} is VALID [2022-02-21 03:10:12,740 INFO L290 TraceCheckUtils]: 12: Hoare triple {22629#(or (< (+ 128 |base2flt_#in~e|) 0) (<= 0 (+ (* 16777216 base2flt_~e) 2147483648)))} assume !(~m % 4294967296 < 16777216); {22629#(or (< (+ 128 |base2flt_#in~e|) 0) (<= 0 (+ (* 16777216 base2flt_~e) 2147483648)))} is VALID [2022-02-21 03:10:12,741 INFO L290 TraceCheckUtils]: 11: Hoare triple {22629#(or (< (+ 128 |base2flt_#in~e|) 0) (<= 0 (+ (* 16777216 base2flt_~e) 2147483648)))} assume !(0 == ~m % 4294967296); {22629#(or (< (+ 128 |base2flt_#in~e|) 0) (<= 0 (+ (* 16777216 base2flt_~e) 2147483648)))} is VALID [2022-02-21 03:10:12,741 INFO L290 TraceCheckUtils]: 10: Hoare triple {22327#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {22629#(or (< (+ 128 |base2flt_#in~e|) 0) (<= 0 (+ (* 16777216 base2flt_~e) 2147483648)))} is VALID [2022-02-21 03:10:12,741 INFO L272 TraceCheckUtils]: 9: Hoare triple {22372#(<= 0 (+ |ULTIMATE.start_main_~ea~2#1| 128))} call main_#t~ret23#1 := base2flt(main_~ma~2#1, main_~ea~2#1); {22327#true} is VALID [2022-02-21 03:10:12,741 INFO L290 TraceCheckUtils]: 8: Hoare triple {22372#(<= 0 (+ |ULTIMATE.start_main_~ea~2#1| 128))} main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1; {22372#(<= 0 (+ |ULTIMATE.start_main_~ea~2#1| 128))} is VALID [2022-02-21 03:10:12,742 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {22327#true} {22372#(<= 0 (+ |ULTIMATE.start_main_~ea~2#1| 128))} #453#return; {22372#(<= 0 (+ |ULTIMATE.start_main_~ea~2#1| 128))} is VALID [2022-02-21 03:10:12,742 INFO L290 TraceCheckUtils]: 6: Hoare triple {22327#true} assume true; {22327#true} is VALID [2022-02-21 03:10:12,742 INFO L290 TraceCheckUtils]: 5: Hoare triple {22327#true} #res := ~__retres4~0; {22327#true} is VALID [2022-02-21 03:10:12,742 INFO L290 TraceCheckUtils]: 4: Hoare triple {22327#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {22327#true} is VALID [2022-02-21 03:10:12,742 INFO L290 TraceCheckUtils]: 3: Hoare triple {22327#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {22327#true} is VALID [2022-02-21 03:10:12,742 INFO L272 TraceCheckUtils]: 2: Hoare triple {22372#(<= 0 (+ |ULTIMATE.start_main_~ea~2#1| 128))} call main_#t~ret22#1 := base2flt(0, 0); {22327#true} is VALID [2022-02-21 03:10:12,743 INFO L290 TraceCheckUtils]: 1: Hoare triple {22327#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_~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_add~0#1, main_~zero~0#1, main_~sa~0#1, main_~sb~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~tmp___1~0#1, main_~tmp___2~0#1, main_~tmp___3~0#1, main_~tmp___4~0#1, main_~tmp___5~0#1, main_~tmp___6~0#1, main_~tmp___7~0#1, main_~tmp___8~0#1, main_~tmp___9~0#1, main_~__retres23~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_add~0#1;havoc main_~zero~0#1;havoc main_~sa~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_~tmp___2~0#1;havoc main_~tmp___3~0#1;havoc main_~tmp___4~0#1;havoc main_~tmp___5~0#1;havoc main_~tmp___6~0#1;havoc main_~tmp___7~0#1;havoc main_~tmp___8~0#1;havoc main_~tmp___9~0#1;havoc main_~__retres23~0#1; {22372#(<= 0 (+ |ULTIMATE.start_main_~ea~2#1| 128))} is VALID [2022-02-21 03:10:12,743 INFO L290 TraceCheckUtils]: 0: Hoare triple {22327#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(24, 2);call #Ultimate.allocInit(12, 3); {22327#true} is VALID [2022-02-21 03:10:12,743 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-02-21 03:10:12,743 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [994670779] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:10:12,743 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:10:12,743 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 18 [2022-02-21 03:10:12,743 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481412616] [2022-02-21 03:10:12,743 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:10:12,744 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 4.055555555555555) internal successors, (73), 16 states have internal predecessors, (73), 3 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) Word has length 53 [2022-02-21 03:10:12,744 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:10:12,744 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 18 states, 18 states have (on average 4.055555555555555) internal successors, (73), 16 states have internal predecessors, (73), 3 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2022-02-21 03:10:12,846 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 85 edges. 85 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:10:12,847 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-02-21 03:10:12,847 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:10:12,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-02-21 03:10:12,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=266, Unknown=0, NotChecked=0, Total=306 [2022-02-21 03:10:12,847 INFO L87 Difference]: Start difference. First operand 186 states and 227 transitions. Second operand has 18 states, 18 states have (on average 4.055555555555555) internal successors, (73), 16 states have internal predecessors, (73), 3 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2022-02-21 03:10:14,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:14,823 INFO L93 Difference]: Finished difference Result 544 states and 674 transitions. [2022-02-21 03:10:14,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-02-21 03:10:14,823 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 4.055555555555555) internal successors, (73), 16 states have internal predecessors, (73), 3 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) Word has length 53 [2022-02-21 03:10:14,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:10:14,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 4.055555555555555) internal successors, (73), 16 states have internal predecessors, (73), 3 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2022-02-21 03:10:14,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 457 transitions. [2022-02-21 03:10:14,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 4.055555555555555) internal successors, (73), 16 states have internal predecessors, (73), 3 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2022-02-21 03:10:14,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 457 transitions. [2022-02-21 03:10:14,837 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states and 457 transitions. [2022-02-21 03:10:15,128 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 457 edges. 457 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:10:15,138 INFO L225 Difference]: With dead ends: 544 [2022-02-21 03:10:15,138 INFO L226 Difference]: Without dead ends: 488 [2022-02-21 03:10:15,138 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 102 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=252, Invalid=1154, Unknown=0, NotChecked=0, Total=1406 [2022-02-21 03:10:15,139 INFO L933 BasicCegarLoop]: 95 mSDtfsCounter, 636 mSDsluCounter, 827 mSDsCounter, 0 mSdLazyCounter, 578 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 654 SdHoareTripleChecker+Valid, 922 SdHoareTripleChecker+Invalid, 666 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 578 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-21 03:10:15,139 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [654 Valid, 922 Invalid, 666 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 578 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-02-21 03:10:15,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2022-02-21 03:10:15,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 201. [2022-02-21 03:10:15,230 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:10:15,231 INFO L82 GeneralOperation]: Start isEquivalent. First operand 488 states. Second operand has 201 states, 176 states have (on average 1.2840909090909092) internal successors, (226), 185 states have internal predecessors, (226), 8 states have call successors, (8), 4 states have call predecessors, (8), 7 states have return successors, (11), 11 states have call predecessors, (11), 8 states have call successors, (11) [2022-02-21 03:10:15,231 INFO L74 IsIncluded]: Start isIncluded. First operand 488 states. Second operand has 201 states, 176 states have (on average 1.2840909090909092) internal successors, (226), 185 states have internal predecessors, (226), 8 states have call successors, (8), 4 states have call predecessors, (8), 7 states have return successors, (11), 11 states have call predecessors, (11), 8 states have call successors, (11) [2022-02-21 03:10:15,231 INFO L87 Difference]: Start difference. First operand 488 states. Second operand has 201 states, 176 states have (on average 1.2840909090909092) internal successors, (226), 185 states have internal predecessors, (226), 8 states have call successors, (8), 4 states have call predecessors, (8), 7 states have return successors, (11), 11 states have call predecessors, (11), 8 states have call successors, (11) [2022-02-21 03:10:15,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:15,241 INFO L93 Difference]: Finished difference Result 488 states and 610 transitions. [2022-02-21 03:10:15,241 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 610 transitions. [2022-02-21 03:10:15,242 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:10:15,242 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:10:15,242 INFO L74 IsIncluded]: Start isIncluded. First operand has 201 states, 176 states have (on average 1.2840909090909092) internal successors, (226), 185 states have internal predecessors, (226), 8 states have call successors, (8), 4 states have call predecessors, (8), 7 states have return successors, (11), 11 states have call predecessors, (11), 8 states have call successors, (11) Second operand 488 states. [2022-02-21 03:10:15,242 INFO L87 Difference]: Start difference. First operand has 201 states, 176 states have (on average 1.2840909090909092) internal successors, (226), 185 states have internal predecessors, (226), 8 states have call successors, (8), 4 states have call predecessors, (8), 7 states have return successors, (11), 11 states have call predecessors, (11), 8 states have call successors, (11) Second operand 488 states. [2022-02-21 03:10:15,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:15,251 INFO L93 Difference]: Finished difference Result 488 states and 610 transitions. [2022-02-21 03:10:15,251 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 610 transitions. [2022-02-21 03:10:15,252 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:10:15,252 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:10:15,252 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:10:15,252 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:10:15,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 176 states have (on average 1.2840909090909092) internal successors, (226), 185 states have internal predecessors, (226), 8 states have call successors, (8), 4 states have call predecessors, (8), 7 states have return successors, (11), 11 states have call predecessors, (11), 8 states have call successors, (11) [2022-02-21 03:10:15,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 245 transitions. [2022-02-21 03:10:15,255 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 245 transitions. Word has length 53 [2022-02-21 03:10:15,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:10:15,255 INFO L470 AbstractCegarLoop]: Abstraction has 201 states and 245 transitions. [2022-02-21 03:10:15,255 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.055555555555555) internal successors, (73), 16 states have internal predecessors, (73), 3 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2022-02-21 03:10:15,255 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 245 transitions. [2022-02-21 03:10:15,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-02-21 03:10:15,256 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:10:15,256 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:10:15,274 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-02-21 03:10:15,471 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:10:15,471 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-02-21 03:10:15,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:10:15,471 INFO L85 PathProgramCache]: Analyzing trace with hash 27127403, now seen corresponding path program 1 times [2022-02-21 03:10:15,471 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:10:15,472 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627554073] [2022-02-21 03:10:15,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:10:15,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:10:15,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:15,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-21 03:10:15,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:15,553 INFO L290 TraceCheckUtils]: 0: Hoare triple {24564#(and (= abs_77 |old(abs_77)|) (= abs_78 |old(abs_78)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {24529#true} is VALID [2022-02-21 03:10:15,553 INFO L290 TraceCheckUtils]: 1: Hoare triple {24529#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {24529#true} is VALID [2022-02-21 03:10:15,553 INFO L290 TraceCheckUtils]: 2: Hoare triple {24529#true} #res := ~__retres4~0; {24529#true} is VALID [2022-02-21 03:10:15,553 INFO L290 TraceCheckUtils]: 3: Hoare triple {24529#true} assume true; {24529#true} is VALID [2022-02-21 03:10:15,553 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {24529#true} {24529#true} #453#return; {24529#true} is VALID [2022-02-21 03:10:15,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-02-21 03:10:15,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:15,587 INFO L290 TraceCheckUtils]: 0: Hoare triple {24564#(and (= abs_77 |old(abs_77)|) (= abs_78 |old(abs_78)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {24529#true} is VALID [2022-02-21 03:10:15,587 INFO L290 TraceCheckUtils]: 1: Hoare triple {24529#true} assume !(0 == ~m % 4294967296); {24529#true} is VALID [2022-02-21 03:10:15,587 INFO L290 TraceCheckUtils]: 2: Hoare triple {24529#true} assume !(~m % 4294967296 < 16777216); {24529#true} is VALID [2022-02-21 03:10:15,587 INFO L290 TraceCheckUtils]: 3: Hoare triple {24529#true} assume !false; {24529#true} is VALID [2022-02-21 03:10:15,587 INFO L290 TraceCheckUtils]: 4: Hoare triple {24529#true} assume !(~m % 4294967296 >= 33554432); {24529#true} is VALID [2022-02-21 03:10:15,587 INFO L290 TraceCheckUtils]: 5: Hoare triple {24529#true} assume 0 == ~m || 0 == ~bitwiseComplement(16777216);~m := 0; {24529#true} is VALID [2022-02-21 03:10:15,587 INFO L290 TraceCheckUtils]: 6: Hoare triple {24529#true} assume 128 + ~e <= 2147483647; {24529#true} is VALID [2022-02-21 03:10:15,587 INFO L290 TraceCheckUtils]: 7: Hoare triple {24529#true} assume 128 + ~e >= -2147483648; {24529#true} is VALID [2022-02-21 03:10:15,587 INFO L290 TraceCheckUtils]: 8: Hoare triple {24529#true} assume 128 + ~e <= 2147483647; {24529#true} is VALID [2022-02-21 03:10:15,587 INFO L290 TraceCheckUtils]: 9: Hoare triple {24529#true} assume 128 + ~e >= -2147483648; {24529#true} is VALID [2022-02-21 03:10:15,587 INFO L290 TraceCheckUtils]: 10: Hoare triple {24529#true} assume !((1 == ~m && (0 == 16777216 * (128 + ~e) || 1 == 16777216 * (128 + ~e))) || ((0 == ~m || 1 == ~m) && 1 == 16777216 * (128 + ~e))); {24529#true} is VALID [2022-02-21 03:10:15,588 INFO L290 TraceCheckUtils]: 11: Hoare triple {24529#true} assume 0 == ~m && (0 == 16777216 * (128 + ~e) || 1 == 16777216 * (128 + ~e));~res~0 := 16777216 * (128 + ~e); {24565#(and (<= 0 base2flt_~res~0) (<= base2flt_~res~0 0))} is VALID [2022-02-21 03:10:15,588 INFO L290 TraceCheckUtils]: 12: Hoare triple {24565#(and (<= 0 base2flt_~res~0) (<= base2flt_~res~0 0))} ~__retres4~0 := ~res~0; {24566#(and (<= base2flt_~__retres4~0 0) (<= 0 base2flt_~__retres4~0))} is VALID [2022-02-21 03:10:15,588 INFO L290 TraceCheckUtils]: 13: Hoare triple {24566#(and (<= base2flt_~__retres4~0 0) (<= 0 base2flt_~__retres4~0))} #res := ~__retres4~0; {24567#(and (<= |base2flt_#res| 0) (<= 0 |base2flt_#res|))} is VALID [2022-02-21 03:10:15,589 INFO L290 TraceCheckUtils]: 14: Hoare triple {24567#(and (<= |base2flt_#res| 0) (<= 0 |base2flt_#res|))} assume true; {24567#(and (<= |base2flt_#res| 0) (<= 0 |base2flt_#res|))} is VALID [2022-02-21 03:10:15,589 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {24567#(and (<= |base2flt_#res| 0) (<= 0 |base2flt_#res|))} {24529#true} #455#return; {24552#(and (<= 0 |ULTIMATE.start_main_#t~ret23#1|) (<= |ULTIMATE.start_main_#t~ret23#1| 0))} is VALID [2022-02-21 03:10:15,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-02-21 03:10:15,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:15,593 INFO L290 TraceCheckUtils]: 0: Hoare triple {24564#(and (= abs_77 |old(abs_77)|) (= abs_78 |old(abs_78)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {24529#true} is VALID [2022-02-21 03:10:15,593 INFO L290 TraceCheckUtils]: 1: Hoare triple {24529#true} assume !(0 == ~m % 4294967296); {24529#true} is VALID [2022-02-21 03:10:15,594 INFO L290 TraceCheckUtils]: 2: Hoare triple {24529#true} assume !(~m % 4294967296 < 16777216); {24529#true} is VALID [2022-02-21 03:10:15,594 INFO L290 TraceCheckUtils]: 3: Hoare triple {24529#true} assume !false; {24529#true} is VALID [2022-02-21 03:10:15,594 INFO L290 TraceCheckUtils]: 4: Hoare triple {24529#true} assume ~m % 4294967296 >= 33554432; {24529#true} is VALID [2022-02-21 03:10:15,594 INFO L290 TraceCheckUtils]: 5: Hoare triple {24529#true} assume ~e >= 127;~__retres4~0 := 4294967295; {24529#true} is VALID [2022-02-21 03:10:15,594 INFO L290 TraceCheckUtils]: 6: Hoare triple {24529#true} #res := ~__retres4~0; {24529#true} is VALID [2022-02-21 03:10:15,594 INFO L290 TraceCheckUtils]: 7: Hoare triple {24529#true} assume true; {24529#true} is VALID [2022-02-21 03:10:15,594 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {24529#true} {24553#(and (<= |ULTIMATE.start_main_~a~0#1| 0) (<= 0 |ULTIMATE.start_main_~a~0#1|))} #457#return; {24553#(and (<= |ULTIMATE.start_main_~a~0#1| 0) (<= 0 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:10:15,594 INFO L290 TraceCheckUtils]: 0: Hoare triple {24529#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(24, 2);call #Ultimate.allocInit(12, 3); {24529#true} is VALID [2022-02-21 03:10:15,595 INFO L290 TraceCheckUtils]: 1: Hoare triple {24529#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_~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_add~0#1, main_~zero~0#1, main_~sa~0#1, main_~sb~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~tmp___1~0#1, main_~tmp___2~0#1, main_~tmp___3~0#1, main_~tmp___4~0#1, main_~tmp___5~0#1, main_~tmp___6~0#1, main_~tmp___7~0#1, main_~tmp___8~0#1, main_~tmp___9~0#1, main_~__retres23~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_add~0#1;havoc main_~zero~0#1;havoc main_~sa~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_~tmp___2~0#1;havoc main_~tmp___3~0#1;havoc main_~tmp___4~0#1;havoc main_~tmp___5~0#1;havoc main_~tmp___6~0#1;havoc main_~tmp___7~0#1;havoc main_~tmp___8~0#1;havoc main_~tmp___9~0#1;havoc main_~__retres23~0#1; {24529#true} is VALID [2022-02-21 03:10:15,595 INFO L272 TraceCheckUtils]: 2: Hoare triple {24529#true} call main_#t~ret22#1 := base2flt(0, 0); {24564#(and (= abs_77 |old(abs_77)|) (= abs_78 |old(abs_78)|))} is VALID [2022-02-21 03:10:15,595 INFO L290 TraceCheckUtils]: 3: Hoare triple {24564#(and (= abs_77 |old(abs_77)|) (= abs_78 |old(abs_78)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {24529#true} is VALID [2022-02-21 03:10:15,595 INFO L290 TraceCheckUtils]: 4: Hoare triple {24529#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {24529#true} is VALID [2022-02-21 03:10:15,595 INFO L290 TraceCheckUtils]: 5: Hoare triple {24529#true} #res := ~__retres4~0; {24529#true} is VALID [2022-02-21 03:10:15,595 INFO L290 TraceCheckUtils]: 6: Hoare triple {24529#true} assume true; {24529#true} is VALID [2022-02-21 03:10:15,595 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {24529#true} {24529#true} #453#return; {24529#true} is VALID [2022-02-21 03:10:15,595 INFO L290 TraceCheckUtils]: 8: Hoare triple {24529#true} main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1; {24529#true} is VALID [2022-02-21 03:10:15,596 INFO L272 TraceCheckUtils]: 9: Hoare triple {24529#true} call main_#t~ret23#1 := base2flt(main_~ma~2#1, main_~ea~2#1); {24564#(and (= abs_77 |old(abs_77)|) (= abs_78 |old(abs_78)|))} is VALID [2022-02-21 03:10:15,596 INFO L290 TraceCheckUtils]: 10: Hoare triple {24564#(and (= abs_77 |old(abs_77)|) (= abs_78 |old(abs_78)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {24529#true} is VALID [2022-02-21 03:10:15,596 INFO L290 TraceCheckUtils]: 11: Hoare triple {24529#true} assume !(0 == ~m % 4294967296); {24529#true} is VALID [2022-02-21 03:10:15,596 INFO L290 TraceCheckUtils]: 12: Hoare triple {24529#true} assume !(~m % 4294967296 < 16777216); {24529#true} is VALID [2022-02-21 03:10:15,596 INFO L290 TraceCheckUtils]: 13: Hoare triple {24529#true} assume !false; {24529#true} is VALID [2022-02-21 03:10:15,596 INFO L290 TraceCheckUtils]: 14: Hoare triple {24529#true} assume !(~m % 4294967296 >= 33554432); {24529#true} is VALID [2022-02-21 03:10:15,596 INFO L290 TraceCheckUtils]: 15: Hoare triple {24529#true} assume 0 == ~m || 0 == ~bitwiseComplement(16777216);~m := 0; {24529#true} is VALID [2022-02-21 03:10:15,596 INFO L290 TraceCheckUtils]: 16: Hoare triple {24529#true} assume 128 + ~e <= 2147483647; {24529#true} is VALID [2022-02-21 03:10:15,596 INFO L290 TraceCheckUtils]: 17: Hoare triple {24529#true} assume 128 + ~e >= -2147483648; {24529#true} is VALID [2022-02-21 03:10:15,596 INFO L290 TraceCheckUtils]: 18: Hoare triple {24529#true} assume 128 + ~e <= 2147483647; {24529#true} is VALID [2022-02-21 03:10:15,596 INFO L290 TraceCheckUtils]: 19: Hoare triple {24529#true} assume 128 + ~e >= -2147483648; {24529#true} is VALID [2022-02-21 03:10:15,597 INFO L290 TraceCheckUtils]: 20: Hoare triple {24529#true} assume !((1 == ~m && (0 == 16777216 * (128 + ~e) || 1 == 16777216 * (128 + ~e))) || ((0 == ~m || 1 == ~m) && 1 == 16777216 * (128 + ~e))); {24529#true} is VALID [2022-02-21 03:10:15,597 INFO L290 TraceCheckUtils]: 21: Hoare triple {24529#true} assume 0 == ~m && (0 == 16777216 * (128 + ~e) || 1 == 16777216 * (128 + ~e));~res~0 := 16777216 * (128 + ~e); {24565#(and (<= 0 base2flt_~res~0) (<= base2flt_~res~0 0))} is VALID [2022-02-21 03:10:15,597 INFO L290 TraceCheckUtils]: 22: Hoare triple {24565#(and (<= 0 base2flt_~res~0) (<= base2flt_~res~0 0))} ~__retres4~0 := ~res~0; {24566#(and (<= base2flt_~__retres4~0 0) (<= 0 base2flt_~__retres4~0))} is VALID [2022-02-21 03:10:15,597 INFO L290 TraceCheckUtils]: 23: Hoare triple {24566#(and (<= base2flt_~__retres4~0 0) (<= 0 base2flt_~__retres4~0))} #res := ~__retres4~0; {24567#(and (<= |base2flt_#res| 0) (<= 0 |base2flt_#res|))} is VALID [2022-02-21 03:10:15,598 INFO L290 TraceCheckUtils]: 24: Hoare triple {24567#(and (<= |base2flt_#res| 0) (<= 0 |base2flt_#res|))} assume true; {24567#(and (<= |base2flt_#res| 0) (<= 0 |base2flt_#res|))} is VALID [2022-02-21 03:10:15,598 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {24567#(and (<= |base2flt_#res| 0) (<= 0 |base2flt_#res|))} {24529#true} #455#return; {24552#(and (<= 0 |ULTIMATE.start_main_#t~ret23#1|) (<= |ULTIMATE.start_main_#t~ret23#1| 0))} is VALID [2022-02-21 03:10:15,599 INFO L290 TraceCheckUtils]: 26: Hoare triple {24552#(and (<= 0 |ULTIMATE.start_main_#t~ret23#1|) (<= |ULTIMATE.start_main_#t~ret23#1| 0))} main_~a~0#1 := main_#t~ret23#1;havoc main_#t~ret23#1; {24553#(and (<= |ULTIMATE.start_main_~a~0#1| 0) (<= 0 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:10:15,599 INFO L272 TraceCheckUtils]: 27: Hoare triple {24553#(and (<= |ULTIMATE.start_main_~a~0#1| 0) (<= 0 |ULTIMATE.start_main_~a~0#1|))} call main_#t~ret24#1 := base2flt(main_~mb~2#1, main_~eb~2#1); {24564#(and (= abs_77 |old(abs_77)|) (= abs_78 |old(abs_78)|))} is VALID [2022-02-21 03:10:15,599 INFO L290 TraceCheckUtils]: 28: Hoare triple {24564#(and (= abs_77 |old(abs_77)|) (= abs_78 |old(abs_78)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {24529#true} is VALID [2022-02-21 03:10:15,599 INFO L290 TraceCheckUtils]: 29: Hoare triple {24529#true} assume !(0 == ~m % 4294967296); {24529#true} is VALID [2022-02-21 03:10:15,599 INFO L290 TraceCheckUtils]: 30: Hoare triple {24529#true} assume !(~m % 4294967296 < 16777216); {24529#true} is VALID [2022-02-21 03:10:15,599 INFO L290 TraceCheckUtils]: 31: Hoare triple {24529#true} assume !false; {24529#true} is VALID [2022-02-21 03:10:15,599 INFO L290 TraceCheckUtils]: 32: Hoare triple {24529#true} assume ~m % 4294967296 >= 33554432; {24529#true} is VALID [2022-02-21 03:10:15,599 INFO L290 TraceCheckUtils]: 33: Hoare triple {24529#true} assume ~e >= 127;~__retres4~0 := 4294967295; {24529#true} is VALID [2022-02-21 03:10:15,600 INFO L290 TraceCheckUtils]: 34: Hoare triple {24529#true} #res := ~__retres4~0; {24529#true} is VALID [2022-02-21 03:10:15,600 INFO L290 TraceCheckUtils]: 35: Hoare triple {24529#true} assume true; {24529#true} is VALID [2022-02-21 03:10:15,600 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {24529#true} {24553#(and (<= |ULTIMATE.start_main_~a~0#1| 0) (<= 0 |ULTIMATE.start_main_~a~0#1|))} #457#return; {24553#(and (<= |ULTIMATE.start_main_~a~0#1| 0) (<= 0 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:10:15,600 INFO L290 TraceCheckUtils]: 37: Hoare triple {24553#(and (<= |ULTIMATE.start_main_~a~0#1| 0) (<= 0 |ULTIMATE.start_main_~a~0#1|))} main_~b~0#1 := main_#t~ret24#1;havoc main_#t~ret24#1; {24553#(and (<= |ULTIMATE.start_main_~a~0#1| 0) (<= 0 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:10:15,601 INFO L290 TraceCheckUtils]: 38: Hoare triple {24553#(and (<= |ULTIMATE.start_main_~a~0#1| 0) (<= 0 |ULTIMATE.start_main_~a~0#1|))} assume !(main_~a~0#1 % 4294967296 < main_~zero~0#1 % 4294967296); {24563#(and (<= (+ (* (div |ULTIMATE.start_main_~zero~0#1| 4294967296) 4294967296) |ULTIMATE.start_main_~a~0#1|) |ULTIMATE.start_main_~zero~0#1|) (< 0 (+ (div |ULTIMATE.start_main_~a~0#1| 4294967296) 1)))} is VALID [2022-02-21 03:10:15,601 INFO L290 TraceCheckUtils]: 39: Hoare triple {24563#(and (<= (+ (* (div |ULTIMATE.start_main_~zero~0#1| 4294967296) 4294967296) |ULTIMATE.start_main_~a~0#1|) |ULTIMATE.start_main_~zero~0#1|) (< 0 (+ (div |ULTIMATE.start_main_~a~0#1| 4294967296) 1)))} assume main_~a~0#1 % 4294967296 > main_~zero~0#1 % 4294967296;main_~tmp~2#1 := 1; {24530#false} is VALID [2022-02-21 03:10:15,601 INFO L290 TraceCheckUtils]: 40: Hoare triple {24530#false} main_~sa~0#1 := main_~tmp~2#1; {24530#false} is VALID [2022-02-21 03:10:15,602 INFO L290 TraceCheckUtils]: 41: Hoare triple {24530#false} assume !(main_~b~0#1 % 4294967296 < main_~zero~0#1 % 4294967296); {24530#false} is VALID [2022-02-21 03:10:15,602 INFO L290 TraceCheckUtils]: 42: Hoare triple {24530#false} assume main_~b~0#1 % 4294967296 > main_~zero~0#1 % 4294967296;main_~tmp___0~0#1 := 1; {24530#false} is VALID [2022-02-21 03:10:15,602 INFO L290 TraceCheckUtils]: 43: Hoare triple {24530#false} main_~sb~0#1 := main_~tmp___0~0#1; {24530#false} is VALID [2022-02-21 03:10:15,602 INFO L290 TraceCheckUtils]: 44: Hoare triple {24530#false} assume { :begin_inline_addflt } true;addflt_#in~a#1, addflt_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc addflt_#res#1;havoc addflt_#t~nondet6#1, addflt_#t~nondet7#1, addflt_#t~nondet8#1, addflt_#t~nondet9#1, addflt_#t~nondet10#1, addflt_#t~nondet11#1, addflt_~a#1, addflt_~b#1, addflt_~res~1#1, addflt_~ma~0#1, addflt_~mb~0#1, addflt_~delta~0#1, addflt_~ea~0#1, addflt_~eb~0#1, addflt_~tmp~0#1, addflt_~__retres10~0#1;addflt_~a#1 := addflt_#in~a#1;addflt_~b#1 := addflt_#in~b#1;havoc addflt_~res~1#1;havoc addflt_~ma~0#1;havoc addflt_~mb~0#1;havoc addflt_~delta~0#1;havoc addflt_~ea~0#1;havoc addflt_~eb~0#1;havoc addflt_~tmp~0#1;havoc addflt_~__retres10~0#1; {24530#false} is VALID [2022-02-21 03:10:15,602 INFO L290 TraceCheckUtils]: 45: Hoare triple {24530#false} assume addflt_~a#1 % 4294967296 < addflt_~b#1 % 4294967296;addflt_~tmp~0#1 := addflt_~a#1;addflt_~a#1 := addflt_~b#1;addflt_~b#1 := addflt_~tmp~0#1; {24530#false} is VALID [2022-02-21 03:10:15,602 INFO L290 TraceCheckUtils]: 46: Hoare triple {24530#false} assume !(0 == addflt_~b#1 % 4294967296); {24530#false} is VALID [2022-02-21 03:10:15,602 INFO L290 TraceCheckUtils]: 47: Hoare triple {24530#false} assume !(0 == addflt_~a#1); {24530#false} is VALID [2022-02-21 03:10:15,602 INFO L290 TraceCheckUtils]: 48: Hoare triple {24530#false} assume !false; {24530#false} is VALID [2022-02-21 03:10:15,602 INFO L290 TraceCheckUtils]: 49: Hoare triple {24530#false} assume !false; {24530#false} is VALID [2022-02-21 03:10:15,602 INFO L290 TraceCheckUtils]: 50: Hoare triple {24530#false} assume addflt_~a#1 >= 0;abs_109 := (if addflt_~a#1 < 16777215 then addflt_~a#1 else 16777215);assume addflt_~a#1 >= 0;assume addflt_~ma~0#1 < abs_109; {24530#false} is VALID [2022-02-21 03:10:15,602 INFO L290 TraceCheckUtils]: 51: Hoare triple {24530#false} assume (if addflt_~a#1 / 16777216 % 4294967296 % 4294967296 <= 2147483647 then addflt_~a#1 / 16777216 % 4294967296 % 4294967296 else addflt_~a#1 / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 <= 2147483647; {24530#false} is VALID [2022-02-21 03:10:15,602 INFO L290 TraceCheckUtils]: 52: Hoare triple {24530#false} assume !((if addflt_~a#1 / 16777216 % 4294967296 % 4294967296 <= 2147483647 then addflt_~a#1 / 16777216 % 4294967296 % 4294967296 else addflt_~a#1 / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 >= -2147483648); {24530#false} is VALID [2022-02-21 03:10:15,602 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-02-21 03:10:15,602 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:10:15,602 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627554073] [2022-02-21 03:10:15,603 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627554073] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:10:15,603 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1117746777] [2022-02-21 03:10:15,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:10:15,603 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:10:15,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:10:15,604 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:10:15,605 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-02-21 03:10:15,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:15,661 INFO L263 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 25 conjunts are in the unsatisfiable core [2022-02-21 03:10:15,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:15,671 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:10:16,018 INFO L290 TraceCheckUtils]: 0: Hoare triple {24529#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(24, 2);call #Ultimate.allocInit(12, 3); {24529#true} is VALID [2022-02-21 03:10:16,018 INFO L290 TraceCheckUtils]: 1: Hoare triple {24529#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_~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_add~0#1, main_~zero~0#1, main_~sa~0#1, main_~sb~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~tmp___1~0#1, main_~tmp___2~0#1, main_~tmp___3~0#1, main_~tmp___4~0#1, main_~tmp___5~0#1, main_~tmp___6~0#1, main_~tmp___7~0#1, main_~tmp___8~0#1, main_~tmp___9~0#1, main_~__retres23~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_add~0#1;havoc main_~zero~0#1;havoc main_~sa~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_~tmp___2~0#1;havoc main_~tmp___3~0#1;havoc main_~tmp___4~0#1;havoc main_~tmp___5~0#1;havoc main_~tmp___6~0#1;havoc main_~tmp___7~0#1;havoc main_~tmp___8~0#1;havoc main_~tmp___9~0#1;havoc main_~__retres23~0#1; {24529#true} is VALID [2022-02-21 03:10:16,018 INFO L272 TraceCheckUtils]: 2: Hoare triple {24529#true} call main_#t~ret22#1 := base2flt(0, 0); {24529#true} is VALID [2022-02-21 03:10:16,018 INFO L290 TraceCheckUtils]: 3: Hoare triple {24529#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {24580#(= base2flt_~m |base2flt_#in~m|)} is VALID [2022-02-21 03:10:16,031 INFO L290 TraceCheckUtils]: 4: Hoare triple {24580#(= base2flt_~m |base2flt_#in~m|)} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {24584#(<= (mod |base2flt_#in~m| 4294967296) 0)} is VALID [2022-02-21 03:10:16,031 INFO L290 TraceCheckUtils]: 5: Hoare triple {24584#(<= (mod |base2flt_#in~m| 4294967296) 0)} #res := ~__retres4~0; {24584#(<= (mod |base2flt_#in~m| 4294967296) 0)} is VALID [2022-02-21 03:10:16,032 INFO L290 TraceCheckUtils]: 6: Hoare triple {24584#(<= (mod |base2flt_#in~m| 4294967296) 0)} assume true; {24584#(<= (mod |base2flt_#in~m| 4294967296) 0)} is VALID [2022-02-21 03:10:16,032 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {24584#(<= (mod |base2flt_#in~m| 4294967296) 0)} {24529#true} #453#return; {24529#true} is VALID [2022-02-21 03:10:16,032 INFO L290 TraceCheckUtils]: 8: Hoare triple {24529#true} main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1; {24529#true} is VALID [2022-02-21 03:10:16,032 INFO L272 TraceCheckUtils]: 9: Hoare triple {24529#true} call main_#t~ret23#1 := base2flt(main_~ma~2#1, main_~ea~2#1); {24529#true} is VALID [2022-02-21 03:10:16,032 INFO L290 TraceCheckUtils]: 10: Hoare triple {24529#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {24529#true} is VALID [2022-02-21 03:10:16,032 INFO L290 TraceCheckUtils]: 11: Hoare triple {24529#true} assume !(0 == ~m % 4294967296); {24529#true} is VALID [2022-02-21 03:10:16,032 INFO L290 TraceCheckUtils]: 12: Hoare triple {24529#true} assume !(~m % 4294967296 < 16777216); {24529#true} is VALID [2022-02-21 03:10:16,032 INFO L290 TraceCheckUtils]: 13: Hoare triple {24529#true} assume !false; {24529#true} is VALID [2022-02-21 03:10:16,032 INFO L290 TraceCheckUtils]: 14: Hoare triple {24529#true} assume !(~m % 4294967296 >= 33554432); {24529#true} is VALID [2022-02-21 03:10:16,032 INFO L290 TraceCheckUtils]: 15: Hoare triple {24529#true} assume 0 == ~m || 0 == ~bitwiseComplement(16777216);~m := 0; {24529#true} is VALID [2022-02-21 03:10:16,032 INFO L290 TraceCheckUtils]: 16: Hoare triple {24529#true} assume 128 + ~e <= 2147483647; {24529#true} is VALID [2022-02-21 03:10:16,032 INFO L290 TraceCheckUtils]: 17: Hoare triple {24529#true} assume 128 + ~e >= -2147483648; {24529#true} is VALID [2022-02-21 03:10:16,033 INFO L290 TraceCheckUtils]: 18: Hoare triple {24529#true} assume 128 + ~e <= 2147483647; {24529#true} is VALID [2022-02-21 03:10:16,033 INFO L290 TraceCheckUtils]: 19: Hoare triple {24529#true} assume 128 + ~e >= -2147483648; {24529#true} is VALID [2022-02-21 03:10:16,033 INFO L290 TraceCheckUtils]: 20: Hoare triple {24529#true} assume !((1 == ~m && (0 == 16777216 * (128 + ~e) || 1 == 16777216 * (128 + ~e))) || ((0 == ~m || 1 == ~m) && 1 == 16777216 * (128 + ~e))); {24529#true} is VALID [2022-02-21 03:10:16,033 INFO L290 TraceCheckUtils]: 21: Hoare triple {24529#true} assume 0 == ~m && (0 == 16777216 * (128 + ~e) || 1 == 16777216 * (128 + ~e));~res~0 := 16777216 * (128 + ~e); {24565#(and (<= 0 base2flt_~res~0) (<= base2flt_~res~0 0))} is VALID [2022-02-21 03:10:16,033 INFO L290 TraceCheckUtils]: 22: Hoare triple {24565#(and (<= 0 base2flt_~res~0) (<= base2flt_~res~0 0))} ~__retres4~0 := ~res~0; {24566#(and (<= base2flt_~__retres4~0 0) (<= 0 base2flt_~__retres4~0))} is VALID [2022-02-21 03:10:16,034 INFO L290 TraceCheckUtils]: 23: Hoare triple {24566#(and (<= base2flt_~__retres4~0 0) (<= 0 base2flt_~__retres4~0))} #res := ~__retres4~0; {24567#(and (<= |base2flt_#res| 0) (<= 0 |base2flt_#res|))} is VALID [2022-02-21 03:10:16,034 INFO L290 TraceCheckUtils]: 24: Hoare triple {24567#(and (<= |base2flt_#res| 0) (<= 0 |base2flt_#res|))} assume true; {24567#(and (<= |base2flt_#res| 0) (<= 0 |base2flt_#res|))} is VALID [2022-02-21 03:10:16,035 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {24567#(and (<= |base2flt_#res| 0) (<= 0 |base2flt_#res|))} {24529#true} #455#return; {24552#(and (<= 0 |ULTIMATE.start_main_#t~ret23#1|) (<= |ULTIMATE.start_main_#t~ret23#1| 0))} is VALID [2022-02-21 03:10:16,035 INFO L290 TraceCheckUtils]: 26: Hoare triple {24552#(and (<= 0 |ULTIMATE.start_main_#t~ret23#1|) (<= |ULTIMATE.start_main_#t~ret23#1| 0))} main_~a~0#1 := main_#t~ret23#1;havoc main_#t~ret23#1; {24553#(and (<= |ULTIMATE.start_main_~a~0#1| 0) (<= 0 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:10:16,035 INFO L272 TraceCheckUtils]: 27: Hoare triple {24553#(and (<= |ULTIMATE.start_main_~a~0#1| 0) (<= 0 |ULTIMATE.start_main_~a~0#1|))} call main_#t~ret24#1 := base2flt(main_~mb~2#1, main_~eb~2#1); {24529#true} is VALID [2022-02-21 03:10:16,035 INFO L290 TraceCheckUtils]: 28: Hoare triple {24529#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {24529#true} is VALID [2022-02-21 03:10:16,035 INFO L290 TraceCheckUtils]: 29: Hoare triple {24529#true} assume !(0 == ~m % 4294967296); {24529#true} is VALID [2022-02-21 03:10:16,035 INFO L290 TraceCheckUtils]: 30: Hoare triple {24529#true} assume !(~m % 4294967296 < 16777216); {24529#true} is VALID [2022-02-21 03:10:16,035 INFO L290 TraceCheckUtils]: 31: Hoare triple {24529#true} assume !false; {24529#true} is VALID [2022-02-21 03:10:16,035 INFO L290 TraceCheckUtils]: 32: Hoare triple {24529#true} assume ~m % 4294967296 >= 33554432; {24529#true} is VALID [2022-02-21 03:10:16,035 INFO L290 TraceCheckUtils]: 33: Hoare triple {24529#true} assume ~e >= 127;~__retres4~0 := 4294967295; {24529#true} is VALID [2022-02-21 03:10:16,036 INFO L290 TraceCheckUtils]: 34: Hoare triple {24529#true} #res := ~__retres4~0; {24529#true} is VALID [2022-02-21 03:10:16,036 INFO L290 TraceCheckUtils]: 35: Hoare triple {24529#true} assume true; {24529#true} is VALID [2022-02-21 03:10:16,036 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {24529#true} {24553#(and (<= |ULTIMATE.start_main_~a~0#1| 0) (<= 0 |ULTIMATE.start_main_~a~0#1|))} #457#return; {24553#(and (<= |ULTIMATE.start_main_~a~0#1| 0) (<= 0 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:10:16,037 INFO L290 TraceCheckUtils]: 37: Hoare triple {24553#(and (<= |ULTIMATE.start_main_~a~0#1| 0) (<= 0 |ULTIMATE.start_main_~a~0#1|))} main_~b~0#1 := main_#t~ret24#1;havoc main_#t~ret24#1; {24553#(and (<= |ULTIMATE.start_main_~a~0#1| 0) (<= 0 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:10:16,037 INFO L290 TraceCheckUtils]: 38: Hoare triple {24553#(and (<= |ULTIMATE.start_main_~a~0#1| 0) (<= 0 |ULTIMATE.start_main_~a~0#1|))} assume !(main_~a~0#1 % 4294967296 < main_~zero~0#1 % 4294967296); {24553#(and (<= |ULTIMATE.start_main_~a~0#1| 0) (<= 0 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:10:16,037 INFO L290 TraceCheckUtils]: 39: Hoare triple {24553#(and (<= |ULTIMATE.start_main_~a~0#1| 0) (<= 0 |ULTIMATE.start_main_~a~0#1|))} assume main_~a~0#1 % 4294967296 > main_~zero~0#1 % 4294967296;main_~tmp~2#1 := 1; {24553#(and (<= |ULTIMATE.start_main_~a~0#1| 0) (<= 0 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:10:16,038 INFO L290 TraceCheckUtils]: 40: Hoare triple {24553#(and (<= |ULTIMATE.start_main_~a~0#1| 0) (<= 0 |ULTIMATE.start_main_~a~0#1|))} main_~sa~0#1 := main_~tmp~2#1; {24553#(and (<= |ULTIMATE.start_main_~a~0#1| 0) (<= 0 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:10:16,038 INFO L290 TraceCheckUtils]: 41: Hoare triple {24553#(and (<= |ULTIMATE.start_main_~a~0#1| 0) (<= 0 |ULTIMATE.start_main_~a~0#1|))} assume !(main_~b~0#1 % 4294967296 < main_~zero~0#1 % 4294967296); {24553#(and (<= |ULTIMATE.start_main_~a~0#1| 0) (<= 0 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:10:16,038 INFO L290 TraceCheckUtils]: 42: Hoare triple {24553#(and (<= |ULTIMATE.start_main_~a~0#1| 0) (<= 0 |ULTIMATE.start_main_~a~0#1|))} assume main_~b~0#1 % 4294967296 > main_~zero~0#1 % 4294967296;main_~tmp___0~0#1 := 1; {24553#(and (<= |ULTIMATE.start_main_~a~0#1| 0) (<= 0 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:10:16,039 INFO L290 TraceCheckUtils]: 43: Hoare triple {24553#(and (<= |ULTIMATE.start_main_~a~0#1| 0) (<= 0 |ULTIMATE.start_main_~a~0#1|))} main_~sb~0#1 := main_~tmp___0~0#1; {24553#(and (<= |ULTIMATE.start_main_~a~0#1| 0) (<= 0 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-21 03:10:16,039 INFO L290 TraceCheckUtils]: 44: Hoare triple {24553#(and (<= |ULTIMATE.start_main_~a~0#1| 0) (<= 0 |ULTIMATE.start_main_~a~0#1|))} assume { :begin_inline_addflt } true;addflt_#in~a#1, addflt_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc addflt_#res#1;havoc addflt_#t~nondet6#1, addflt_#t~nondet7#1, addflt_#t~nondet8#1, addflt_#t~nondet9#1, addflt_#t~nondet10#1, addflt_#t~nondet11#1, addflt_~a#1, addflt_~b#1, addflt_~res~1#1, addflt_~ma~0#1, addflt_~mb~0#1, addflt_~delta~0#1, addflt_~ea~0#1, addflt_~eb~0#1, addflt_~tmp~0#1, addflt_~__retres10~0#1;addflt_~a#1 := addflt_#in~a#1;addflt_~b#1 := addflt_#in~b#1;havoc addflt_~res~1#1;havoc addflt_~ma~0#1;havoc addflt_~mb~0#1;havoc addflt_~delta~0#1;havoc addflt_~ea~0#1;havoc addflt_~eb~0#1;havoc addflt_~tmp~0#1;havoc addflt_~__retres10~0#1; {24705#(and (<= |ULTIMATE.start_addflt_~a#1| 0) (<= 0 |ULTIMATE.start_addflt_~a#1|))} is VALID [2022-02-21 03:10:16,039 INFO L290 TraceCheckUtils]: 45: Hoare triple {24705#(and (<= |ULTIMATE.start_addflt_~a#1| 0) (<= 0 |ULTIMATE.start_addflt_~a#1|))} assume addflt_~a#1 % 4294967296 < addflt_~b#1 % 4294967296;addflt_~tmp~0#1 := addflt_~a#1;addflt_~a#1 := addflt_~b#1;addflt_~b#1 := addflt_~tmp~0#1; {24709#(and (<= |ULTIMATE.start_addflt_~b#1| 0) (<= 0 |ULTIMATE.start_addflt_~b#1|))} is VALID [2022-02-21 03:10:16,040 INFO L290 TraceCheckUtils]: 46: Hoare triple {24709#(and (<= |ULTIMATE.start_addflt_~b#1| 0) (<= 0 |ULTIMATE.start_addflt_~b#1|))} assume !(0 == addflt_~b#1 % 4294967296); {24530#false} is VALID [2022-02-21 03:10:16,040 INFO L290 TraceCheckUtils]: 47: Hoare triple {24530#false} assume !(0 == addflt_~a#1); {24530#false} is VALID [2022-02-21 03:10:16,040 INFO L290 TraceCheckUtils]: 48: Hoare triple {24530#false} assume !false; {24530#false} is VALID [2022-02-21 03:10:16,040 INFO L290 TraceCheckUtils]: 49: Hoare triple {24530#false} assume !false; {24530#false} is VALID [2022-02-21 03:10:16,040 INFO L290 TraceCheckUtils]: 50: Hoare triple {24530#false} assume addflt_~a#1 >= 0;abs_109 := (if addflt_~a#1 < 16777215 then addflt_~a#1 else 16777215);assume addflt_~a#1 >= 0;assume addflt_~ma~0#1 < abs_109; {24530#false} is VALID [2022-02-21 03:10:16,040 INFO L290 TraceCheckUtils]: 51: Hoare triple {24530#false} assume (if addflt_~a#1 / 16777216 % 4294967296 % 4294967296 <= 2147483647 then addflt_~a#1 / 16777216 % 4294967296 % 4294967296 else addflt_~a#1 / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 <= 2147483647; {24530#false} is VALID [2022-02-21 03:10:16,040 INFO L290 TraceCheckUtils]: 52: Hoare triple {24530#false} assume !((if addflt_~a#1 / 16777216 % 4294967296 % 4294967296 <= 2147483647 then addflt_~a#1 / 16777216 % 4294967296 % 4294967296 else addflt_~a#1 / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 >= -2147483648); {24530#false} is VALID [2022-02-21 03:10:16,040 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-02-21 03:10:16,041 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:10:16,293 INFO L290 TraceCheckUtils]: 52: Hoare triple {24530#false} assume !((if addflt_~a#1 / 16777216 % 4294967296 % 4294967296 <= 2147483647 then addflt_~a#1 / 16777216 % 4294967296 % 4294967296 else addflt_~a#1 / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 >= -2147483648); {24530#false} is VALID [2022-02-21 03:10:16,293 INFO L290 TraceCheckUtils]: 51: Hoare triple {24530#false} assume (if addflt_~a#1 / 16777216 % 4294967296 % 4294967296 <= 2147483647 then addflt_~a#1 / 16777216 % 4294967296 % 4294967296 else addflt_~a#1 / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 <= 2147483647; {24530#false} is VALID [2022-02-21 03:10:16,293 INFO L290 TraceCheckUtils]: 50: Hoare triple {24530#false} assume addflt_~a#1 >= 0;abs_109 := (if addflt_~a#1 < 16777215 then addflt_~a#1 else 16777215);assume addflt_~a#1 >= 0;assume addflt_~ma~0#1 < abs_109; {24530#false} is VALID [2022-02-21 03:10:16,293 INFO L290 TraceCheckUtils]: 49: Hoare triple {24530#false} assume !false; {24530#false} is VALID [2022-02-21 03:10:16,293 INFO L290 TraceCheckUtils]: 48: Hoare triple {24530#false} assume !false; {24530#false} is VALID [2022-02-21 03:10:16,294 INFO L290 TraceCheckUtils]: 47: Hoare triple {24530#false} assume !(0 == addflt_~a#1); {24530#false} is VALID [2022-02-21 03:10:16,294 INFO L290 TraceCheckUtils]: 46: Hoare triple {24749#(= (mod |ULTIMATE.start_addflt_~b#1| 4294967296) 0)} assume !(0 == addflt_~b#1 % 4294967296); {24530#false} is VALID [2022-02-21 03:10:16,294 INFO L290 TraceCheckUtils]: 45: Hoare triple {24753#(= (mod |ULTIMATE.start_addflt_~a#1| 4294967296) 0)} assume addflt_~a#1 % 4294967296 < addflt_~b#1 % 4294967296;addflt_~tmp~0#1 := addflt_~a#1;addflt_~a#1 := addflt_~b#1;addflt_~b#1 := addflt_~tmp~0#1; {24749#(= (mod |ULTIMATE.start_addflt_~b#1| 4294967296) 0)} is VALID [2022-02-21 03:10:16,295 INFO L290 TraceCheckUtils]: 44: Hoare triple {24757#(= (mod |ULTIMATE.start_main_~a~0#1| 4294967296) 0)} assume { :begin_inline_addflt } true;addflt_#in~a#1, addflt_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc addflt_#res#1;havoc addflt_#t~nondet6#1, addflt_#t~nondet7#1, addflt_#t~nondet8#1, addflt_#t~nondet9#1, addflt_#t~nondet10#1, addflt_#t~nondet11#1, addflt_~a#1, addflt_~b#1, addflt_~res~1#1, addflt_~ma~0#1, addflt_~mb~0#1, addflt_~delta~0#1, addflt_~ea~0#1, addflt_~eb~0#1, addflt_~tmp~0#1, addflt_~__retres10~0#1;addflt_~a#1 := addflt_#in~a#1;addflt_~b#1 := addflt_#in~b#1;havoc addflt_~res~1#1;havoc addflt_~ma~0#1;havoc addflt_~mb~0#1;havoc addflt_~delta~0#1;havoc addflt_~ea~0#1;havoc addflt_~eb~0#1;havoc addflt_~tmp~0#1;havoc addflt_~__retres10~0#1; {24753#(= (mod |ULTIMATE.start_addflt_~a#1| 4294967296) 0)} is VALID [2022-02-21 03:10:16,295 INFO L290 TraceCheckUtils]: 43: Hoare triple {24757#(= (mod |ULTIMATE.start_main_~a~0#1| 4294967296) 0)} main_~sb~0#1 := main_~tmp___0~0#1; {24757#(= (mod |ULTIMATE.start_main_~a~0#1| 4294967296) 0)} is VALID [2022-02-21 03:10:16,295 INFO L290 TraceCheckUtils]: 42: Hoare triple {24757#(= (mod |ULTIMATE.start_main_~a~0#1| 4294967296) 0)} assume main_~b~0#1 % 4294967296 > main_~zero~0#1 % 4294967296;main_~tmp___0~0#1 := 1; {24757#(= (mod |ULTIMATE.start_main_~a~0#1| 4294967296) 0)} is VALID [2022-02-21 03:10:16,295 INFO L290 TraceCheckUtils]: 41: Hoare triple {24757#(= (mod |ULTIMATE.start_main_~a~0#1| 4294967296) 0)} assume !(main_~b~0#1 % 4294967296 < main_~zero~0#1 % 4294967296); {24757#(= (mod |ULTIMATE.start_main_~a~0#1| 4294967296) 0)} is VALID [2022-02-21 03:10:16,296 INFO L290 TraceCheckUtils]: 40: Hoare triple {24757#(= (mod |ULTIMATE.start_main_~a~0#1| 4294967296) 0)} main_~sa~0#1 := main_~tmp~2#1; {24757#(= (mod |ULTIMATE.start_main_~a~0#1| 4294967296) 0)} is VALID [2022-02-21 03:10:16,296 INFO L290 TraceCheckUtils]: 39: Hoare triple {24757#(= (mod |ULTIMATE.start_main_~a~0#1| 4294967296) 0)} assume main_~a~0#1 % 4294967296 > main_~zero~0#1 % 4294967296;main_~tmp~2#1 := 1; {24757#(= (mod |ULTIMATE.start_main_~a~0#1| 4294967296) 0)} is VALID [2022-02-21 03:10:16,296 INFO L290 TraceCheckUtils]: 38: Hoare triple {24757#(= (mod |ULTIMATE.start_main_~a~0#1| 4294967296) 0)} assume !(main_~a~0#1 % 4294967296 < main_~zero~0#1 % 4294967296); {24757#(= (mod |ULTIMATE.start_main_~a~0#1| 4294967296) 0)} is VALID [2022-02-21 03:10:16,296 INFO L290 TraceCheckUtils]: 37: Hoare triple {24757#(= (mod |ULTIMATE.start_main_~a~0#1| 4294967296) 0)} main_~b~0#1 := main_#t~ret24#1;havoc main_#t~ret24#1; {24757#(= (mod |ULTIMATE.start_main_~a~0#1| 4294967296) 0)} is VALID [2022-02-21 03:10:16,297 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {24529#true} {24757#(= (mod |ULTIMATE.start_main_~a~0#1| 4294967296) 0)} #457#return; {24757#(= (mod |ULTIMATE.start_main_~a~0#1| 4294967296) 0)} is VALID [2022-02-21 03:10:16,297 INFO L290 TraceCheckUtils]: 35: Hoare triple {24529#true} assume true; {24529#true} is VALID [2022-02-21 03:10:16,297 INFO L290 TraceCheckUtils]: 34: Hoare triple {24529#true} #res := ~__retres4~0; {24529#true} is VALID [2022-02-21 03:10:16,297 INFO L290 TraceCheckUtils]: 33: Hoare triple {24529#true} assume ~e >= 127;~__retres4~0 := 4294967295; {24529#true} is VALID [2022-02-21 03:10:16,297 INFO L290 TraceCheckUtils]: 32: Hoare triple {24529#true} assume ~m % 4294967296 >= 33554432; {24529#true} is VALID [2022-02-21 03:10:16,297 INFO L290 TraceCheckUtils]: 31: Hoare triple {24529#true} assume !false; {24529#true} is VALID [2022-02-21 03:10:16,297 INFO L290 TraceCheckUtils]: 30: Hoare triple {24529#true} assume !(~m % 4294967296 < 16777216); {24529#true} is VALID [2022-02-21 03:10:16,297 INFO L290 TraceCheckUtils]: 29: Hoare triple {24529#true} assume !(0 == ~m % 4294967296); {24529#true} is VALID [2022-02-21 03:10:16,297 INFO L290 TraceCheckUtils]: 28: Hoare triple {24529#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {24529#true} is VALID [2022-02-21 03:10:16,297 INFO L272 TraceCheckUtils]: 27: Hoare triple {24757#(= (mod |ULTIMATE.start_main_~a~0#1| 4294967296) 0)} call main_#t~ret24#1 := base2flt(main_~mb~2#1, main_~eb~2#1); {24529#true} is VALID [2022-02-21 03:10:16,298 INFO L290 TraceCheckUtils]: 26: Hoare triple {24812#(= (mod |ULTIMATE.start_main_#t~ret23#1| 4294967296) 0)} main_~a~0#1 := main_#t~ret23#1;havoc main_#t~ret23#1; {24757#(= (mod |ULTIMATE.start_main_~a~0#1| 4294967296) 0)} is VALID [2022-02-21 03:10:16,298 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {24819#(= (mod |base2flt_#res| 4294967296) 0)} {24529#true} #455#return; {24812#(= (mod |ULTIMATE.start_main_#t~ret23#1| 4294967296) 0)} is VALID [2022-02-21 03:10:16,299 INFO L290 TraceCheckUtils]: 24: Hoare triple {24819#(= (mod |base2flt_#res| 4294967296) 0)} assume true; {24819#(= (mod |base2flt_#res| 4294967296) 0)} is VALID [2022-02-21 03:10:16,299 INFO L290 TraceCheckUtils]: 23: Hoare triple {24826#(= (mod base2flt_~__retres4~0 4294967296) 0)} #res := ~__retres4~0; {24819#(= (mod |base2flt_#res| 4294967296) 0)} is VALID [2022-02-21 03:10:16,299 INFO L290 TraceCheckUtils]: 22: Hoare triple {24830#(= (mod base2flt_~res~0 4294967296) 0)} ~__retres4~0 := ~res~0; {24826#(= (mod base2flt_~__retres4~0 4294967296) 0)} is VALID [2022-02-21 03:10:16,300 INFO L290 TraceCheckUtils]: 21: Hoare triple {24529#true} assume 0 == ~m && (0 == 16777216 * (128 + ~e) || 1 == 16777216 * (128 + ~e));~res~0 := 16777216 * (128 + ~e); {24830#(= (mod base2flt_~res~0 4294967296) 0)} is VALID [2022-02-21 03:10:16,300 INFO L290 TraceCheckUtils]: 20: Hoare triple {24529#true} assume !((1 == ~m && (0 == 16777216 * (128 + ~e) || 1 == 16777216 * (128 + ~e))) || ((0 == ~m || 1 == ~m) && 1 == 16777216 * (128 + ~e))); {24529#true} is VALID [2022-02-21 03:10:16,300 INFO L290 TraceCheckUtils]: 19: Hoare triple {24529#true} assume 128 + ~e >= -2147483648; {24529#true} is VALID [2022-02-21 03:10:16,300 INFO L290 TraceCheckUtils]: 18: Hoare triple {24529#true} assume 128 + ~e <= 2147483647; {24529#true} is VALID [2022-02-21 03:10:16,300 INFO L290 TraceCheckUtils]: 17: Hoare triple {24529#true} assume 128 + ~e >= -2147483648; {24529#true} is VALID [2022-02-21 03:10:16,300 INFO L290 TraceCheckUtils]: 16: Hoare triple {24529#true} assume 128 + ~e <= 2147483647; {24529#true} is VALID [2022-02-21 03:10:16,300 INFO L290 TraceCheckUtils]: 15: Hoare triple {24529#true} assume 0 == ~m || 0 == ~bitwiseComplement(16777216);~m := 0; {24529#true} is VALID [2022-02-21 03:10:16,300 INFO L290 TraceCheckUtils]: 14: Hoare triple {24529#true} assume !(~m % 4294967296 >= 33554432); {24529#true} is VALID [2022-02-21 03:10:16,300 INFO L290 TraceCheckUtils]: 13: Hoare triple {24529#true} assume !false; {24529#true} is VALID [2022-02-21 03:10:16,300 INFO L290 TraceCheckUtils]: 12: Hoare triple {24529#true} assume !(~m % 4294967296 < 16777216); {24529#true} is VALID [2022-02-21 03:10:16,300 INFO L290 TraceCheckUtils]: 11: Hoare triple {24529#true} assume !(0 == ~m % 4294967296); {24529#true} is VALID [2022-02-21 03:10:16,300 INFO L290 TraceCheckUtils]: 10: Hoare triple {24529#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {24529#true} is VALID [2022-02-21 03:10:16,300 INFO L272 TraceCheckUtils]: 9: Hoare triple {24529#true} call main_#t~ret23#1 := base2flt(main_~ma~2#1, main_~ea~2#1); {24529#true} is VALID [2022-02-21 03:10:16,300 INFO L290 TraceCheckUtils]: 8: Hoare triple {24529#true} main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1; {24529#true} is VALID [2022-02-21 03:10:16,300 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {24529#true} {24529#true} #453#return; {24529#true} is VALID [2022-02-21 03:10:16,300 INFO L290 TraceCheckUtils]: 6: Hoare triple {24529#true} assume true; {24529#true} is VALID [2022-02-21 03:10:16,301 INFO L290 TraceCheckUtils]: 5: Hoare triple {24529#true} #res := ~__retres4~0; {24529#true} is VALID [2022-02-21 03:10:16,301 INFO L290 TraceCheckUtils]: 4: Hoare triple {24529#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {24529#true} is VALID [2022-02-21 03:10:16,301 INFO L290 TraceCheckUtils]: 3: Hoare triple {24529#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {24529#true} is VALID [2022-02-21 03:10:16,301 INFO L272 TraceCheckUtils]: 2: Hoare triple {24529#true} call main_#t~ret22#1 := base2flt(0, 0); {24529#true} is VALID [2022-02-21 03:10:16,301 INFO L290 TraceCheckUtils]: 1: Hoare triple {24529#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_~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_add~0#1, main_~zero~0#1, main_~sa~0#1, main_~sb~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~tmp___1~0#1, main_~tmp___2~0#1, main_~tmp___3~0#1, main_~tmp___4~0#1, main_~tmp___5~0#1, main_~tmp___6~0#1, main_~tmp___7~0#1, main_~tmp___8~0#1, main_~tmp___9~0#1, main_~__retres23~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_add~0#1;havoc main_~zero~0#1;havoc main_~sa~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_~tmp___2~0#1;havoc main_~tmp___3~0#1;havoc main_~tmp___4~0#1;havoc main_~tmp___5~0#1;havoc main_~tmp___6~0#1;havoc main_~tmp___7~0#1;havoc main_~tmp___8~0#1;havoc main_~tmp___9~0#1;havoc main_~__retres23~0#1; {24529#true} is VALID [2022-02-21 03:10:16,301 INFO L290 TraceCheckUtils]: 0: Hoare triple {24529#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(24, 2);call #Ultimate.allocInit(12, 3); {24529#true} is VALID [2022-02-21 03:10:16,301 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-02-21 03:10:16,301 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1117746777] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:10:16,301 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:10:16,301 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 9] total 20 [2022-02-21 03:10:16,301 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512151843] [2022-02-21 03:10:16,301 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:10:16,302 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 3.45) internal successors, (69), 17 states have internal predecessors, (69), 3 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) Word has length 53 [2022-02-21 03:10:16,302 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:10:16,302 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 20 states, 20 states have (on average 3.45) internal successors, (69), 17 states have internal predecessors, (69), 3 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2022-02-21 03:10:16,361 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:10:16,361 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-02-21 03:10:16,361 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:10:16,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-02-21 03:10:16,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=335, Unknown=0, NotChecked=0, Total=380 [2022-02-21 03:10:16,362 INFO L87 Difference]: Start difference. First operand 201 states and 245 transitions. Second operand has 20 states, 20 states have (on average 3.45) internal successors, (69), 17 states have internal predecessors, (69), 3 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2022-02-21 03:10:18,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:18,708 INFO L93 Difference]: Finished difference Result 436 states and 549 transitions. [2022-02-21 03:10:18,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-02-21 03:10:18,709 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 3.45) internal successors, (69), 17 states have internal predecessors, (69), 3 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) Word has length 53 [2022-02-21 03:10:18,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:10:18,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 3.45) internal successors, (69), 17 states have internal predecessors, (69), 3 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2022-02-21 03:10:18,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 344 transitions. [2022-02-21 03:10:18,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 3.45) internal successors, (69), 17 states have internal predecessors, (69), 3 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2022-02-21 03:10:18,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 344 transitions. [2022-02-21 03:10:18,713 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 26 states and 344 transitions. [2022-02-21 03:10:18,965 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 344 edges. 344 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:10:18,974 INFO L225 Difference]: With dead ends: 436 [2022-02-21 03:10:18,974 INFO L226 Difference]: Without dead ends: 346 [2022-02-21 03:10:18,975 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 101 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=226, Invalid=1180, Unknown=0, NotChecked=0, Total=1406 [2022-02-21 03:10:18,976 INFO L933 BasicCegarLoop]: 118 mSDtfsCounter, 177 mSDsluCounter, 1522 mSDsCounter, 0 mSdLazyCounter, 808 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 1640 SdHoareTripleChecker+Invalid, 832 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 808 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-02-21 03:10:18,976 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [179 Valid, 1640 Invalid, 832 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 808 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-02-21 03:10:18,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2022-02-21 03:10:19,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 186. [2022-02-21 03:10:19,054 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:10:19,054 INFO L82 GeneralOperation]: Start isEquivalent. First operand 346 states. Second operand has 186 states, 163 states have (on average 1.2883435582822085) internal successors, (210), 172 states have internal predecessors, (210), 7 states have call successors, (7), 4 states have call predecessors, (7), 6 states have return successors, (9), 9 states have call predecessors, (9), 7 states have call successors, (9) [2022-02-21 03:10:19,055 INFO L74 IsIncluded]: Start isIncluded. First operand 346 states. Second operand has 186 states, 163 states have (on average 1.2883435582822085) internal successors, (210), 172 states have internal predecessors, (210), 7 states have call successors, (7), 4 states have call predecessors, (7), 6 states have return successors, (9), 9 states have call predecessors, (9), 7 states have call successors, (9) [2022-02-21 03:10:19,055 INFO L87 Difference]: Start difference. First operand 346 states. Second operand has 186 states, 163 states have (on average 1.2883435582822085) internal successors, (210), 172 states have internal predecessors, (210), 7 states have call successors, (7), 4 states have call predecessors, (7), 6 states have return successors, (9), 9 states have call predecessors, (9), 7 states have call successors, (9) [2022-02-21 03:10:19,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:19,060 INFO L93 Difference]: Finished difference Result 346 states and 437 transitions. [2022-02-21 03:10:19,060 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 437 transitions. [2022-02-21 03:10:19,061 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:10:19,061 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:10:19,061 INFO L74 IsIncluded]: Start isIncluded. First operand has 186 states, 163 states have (on average 1.2883435582822085) internal successors, (210), 172 states have internal predecessors, (210), 7 states have call successors, (7), 4 states have call predecessors, (7), 6 states have return successors, (9), 9 states have call predecessors, (9), 7 states have call successors, (9) Second operand 346 states. [2022-02-21 03:10:19,061 INFO L87 Difference]: Start difference. First operand has 186 states, 163 states have (on average 1.2883435582822085) internal successors, (210), 172 states have internal predecessors, (210), 7 states have call successors, (7), 4 states have call predecessors, (7), 6 states have return successors, (9), 9 states have call predecessors, (9), 7 states have call successors, (9) Second operand 346 states. [2022-02-21 03:10:19,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:19,066 INFO L93 Difference]: Finished difference Result 346 states and 437 transitions. [2022-02-21 03:10:19,066 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 437 transitions. [2022-02-21 03:10:19,067 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:10:19,067 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:10:19,067 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:10:19,067 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:10:19,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 163 states have (on average 1.2883435582822085) internal successors, (210), 172 states have internal predecessors, (210), 7 states have call successors, (7), 4 states have call predecessors, (7), 6 states have return successors, (9), 9 states have call predecessors, (9), 7 states have call successors, (9) [2022-02-21 03:10:19,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 226 transitions. [2022-02-21 03:10:19,069 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 226 transitions. Word has length 53 [2022-02-21 03:10:19,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:10:19,069 INFO L470 AbstractCegarLoop]: Abstraction has 186 states and 226 transitions. [2022-02-21 03:10:19,069 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 3.45) internal successors, (69), 17 states have internal predecessors, (69), 3 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2022-02-21 03:10:19,069 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 226 transitions. [2022-02-21 03:10:19,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-02-21 03:10:19,070 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:10:19,070 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:10:19,095 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-02-21 03:10:19,287 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-02-21 03:10:19,287 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-02-21 03:10:19,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:10:19,288 INFO L85 PathProgramCache]: Analyzing trace with hash 513325306, now seen corresponding path program 1 times [2022-02-21 03:10:19,288 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:10:19,288 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064264289] [2022-02-21 03:10:19,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:10:19,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:10:19,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:19,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-21 03:10:19,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:19,319 INFO L290 TraceCheckUtils]: 0: Hoare triple {26350#(and (= abs_77 |old(abs_77)|) (= abs_78 |old(abs_78)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {26318#true} is VALID [2022-02-21 03:10:19,319 INFO L290 TraceCheckUtils]: 1: Hoare triple {26318#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {26318#true} is VALID [2022-02-21 03:10:19,319 INFO L290 TraceCheckUtils]: 2: Hoare triple {26318#true} #res := ~__retres4~0; {26318#true} is VALID [2022-02-21 03:10:19,319 INFO L290 TraceCheckUtils]: 3: Hoare triple {26318#true} assume true; {26318#true} is VALID [2022-02-21 03:10:19,319 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {26318#true} {26318#true} #453#return; {26318#true} is VALID [2022-02-21 03:10:19,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-02-21 03:10:19,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:19,358 INFO L290 TraceCheckUtils]: 0: Hoare triple {26350#(and (= abs_77 |old(abs_77)|) (= abs_78 |old(abs_78)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {26318#true} is VALID [2022-02-21 03:10:19,359 INFO L290 TraceCheckUtils]: 1: Hoare triple {26318#true} assume !(0 == ~m % 4294967296); {26318#true} is VALID [2022-02-21 03:10:19,359 INFO L290 TraceCheckUtils]: 2: Hoare triple {26318#true} assume !(~m % 4294967296 < 16777216); {26351#(or (<= (+ (div base2flt_~m 4294967296) 1) 0) (<= (+ 16777216 (* (div base2flt_~m 4294967296) 4294967296)) base2flt_~m))} is VALID [2022-02-21 03:10:19,360 INFO L290 TraceCheckUtils]: 3: Hoare triple {26351#(or (<= (+ (div base2flt_~m 4294967296) 1) 0) (<= (+ 16777216 (* (div base2flt_~m 4294967296) 4294967296)) base2flt_~m))} assume !false; {26351#(or (<= (+ (div base2flt_~m 4294967296) 1) 0) (<= (+ 16777216 (* (div base2flt_~m 4294967296) 4294967296)) base2flt_~m))} is VALID [2022-02-21 03:10:19,360 INFO L290 TraceCheckUtils]: 4: Hoare triple {26351#(or (<= (+ (div base2flt_~m 4294967296) 1) 0) (<= (+ 16777216 (* (div base2flt_~m 4294967296) 4294967296)) base2flt_~m))} assume !(~m % 4294967296 >= 33554432); {26352#(and (or (not (<= (+ (div base2flt_~m 4294967296) 1) 0)) (<= base2flt_~m (+ 33554431 (* (div base2flt_~m 4294967296) 4294967296)))) (or (<= (+ (div base2flt_~m 4294967296) 1) 0) (<= (+ 16777216 (* (div base2flt_~m 4294967296) 4294967296)) base2flt_~m)))} is VALID [2022-02-21 03:10:19,361 INFO L290 TraceCheckUtils]: 5: Hoare triple {26352#(and (or (not (<= (+ (div base2flt_~m 4294967296) 1) 0)) (<= base2flt_~m (+ 33554431 (* (div base2flt_~m 4294967296) 4294967296)))) (or (<= (+ (div base2flt_~m 4294967296) 1) 0) (<= (+ 16777216 (* (div base2flt_~m 4294967296) 4294967296)) base2flt_~m)))} assume !(0 == ~m || 0 == ~bitwiseComplement(16777216)); {26352#(and (or (not (<= (+ (div base2flt_~m 4294967296) 1) 0)) (<= base2flt_~m (+ 33554431 (* (div base2flt_~m 4294967296) 4294967296)))) (or (<= (+ (div base2flt_~m 4294967296) 1) 0) (<= (+ 16777216 (* (div base2flt_~m 4294967296) 4294967296)) base2flt_~m)))} is VALID [2022-02-21 03:10:19,361 INFO L290 TraceCheckUtils]: 6: Hoare triple {26352#(and (or (not (<= (+ (div base2flt_~m 4294967296) 1) 0)) (<= base2flt_~m (+ 33554431 (* (div base2flt_~m 4294967296) 4294967296)))) (or (<= (+ (div base2flt_~m 4294967296) 1) 0) (<= (+ 16777216 (* (div base2flt_~m 4294967296) 4294967296)) base2flt_~m)))} assume 1 == ~m && (0 == ~bitwiseComplement(16777216) || 1 == ~bitwiseComplement(16777216));~m := ~bitwiseComplement(16777216); {26319#false} is VALID [2022-02-21 03:10:19,361 INFO L290 TraceCheckUtils]: 7: Hoare triple {26319#false} assume 128 + ~e <= 2147483647; {26319#false} is VALID [2022-02-21 03:10:19,361 INFO L290 TraceCheckUtils]: 8: Hoare triple {26319#false} assume 128 + ~e >= -2147483648; {26319#false} is VALID [2022-02-21 03:10:19,361 INFO L290 TraceCheckUtils]: 9: Hoare triple {26319#false} assume 128 + ~e <= 2147483647; {26319#false} is VALID [2022-02-21 03:10:19,361 INFO L290 TraceCheckUtils]: 10: Hoare triple {26319#false} assume 128 + ~e >= -2147483648; {26319#false} is VALID [2022-02-21 03:10:19,361 INFO L290 TraceCheckUtils]: 11: Hoare triple {26319#false} assume (1 == ~m && (0 == 16777216 * (128 + ~e) || 1 == 16777216 * (128 + ~e))) || ((0 == ~m || 1 == ~m) && 1 == 16777216 * (128 + ~e));~res~0 := 1; {26319#false} is VALID [2022-02-21 03:10:19,361 INFO L290 TraceCheckUtils]: 12: Hoare triple {26319#false} ~__retres4~0 := ~res~0; {26319#false} is VALID [2022-02-21 03:10:19,361 INFO L290 TraceCheckUtils]: 13: Hoare triple {26319#false} #res := ~__retres4~0; {26319#false} is VALID [2022-02-21 03:10:19,361 INFO L290 TraceCheckUtils]: 14: Hoare triple {26319#false} assume true; {26319#false} is VALID [2022-02-21 03:10:19,362 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {26319#false} {26318#true} #455#return; {26319#false} is VALID [2022-02-21 03:10:19,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-02-21 03:10:19,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:19,368 INFO L290 TraceCheckUtils]: 0: Hoare triple {26350#(and (= abs_77 |old(abs_77)|) (= abs_78 |old(abs_78)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {26318#true} is VALID [2022-02-21 03:10:19,368 INFO L290 TraceCheckUtils]: 1: Hoare triple {26318#true} assume !(0 == ~m % 4294967296); {26318#true} is VALID [2022-02-21 03:10:19,369 INFO L290 TraceCheckUtils]: 2: Hoare triple {26318#true} assume !(~m % 4294967296 < 16777216); {26318#true} is VALID [2022-02-21 03:10:19,369 INFO L290 TraceCheckUtils]: 3: Hoare triple {26318#true} assume !false; {26318#true} is VALID [2022-02-21 03:10:19,369 INFO L290 TraceCheckUtils]: 4: Hoare triple {26318#true} assume ~m % 4294967296 >= 33554432; {26318#true} is VALID [2022-02-21 03:10:19,369 INFO L290 TraceCheckUtils]: 5: Hoare triple {26318#true} assume ~e >= 127;~__retres4~0 := 4294967295; {26318#true} is VALID [2022-02-21 03:10:19,369 INFO L290 TraceCheckUtils]: 6: Hoare triple {26318#true} #res := ~__retres4~0; {26318#true} is VALID [2022-02-21 03:10:19,369 INFO L290 TraceCheckUtils]: 7: Hoare triple {26318#true} assume true; {26318#true} is VALID [2022-02-21 03:10:19,369 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {26318#true} {26319#false} #457#return; {26319#false} is VALID [2022-02-21 03:10:19,369 INFO L290 TraceCheckUtils]: 0: Hoare triple {26318#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(24, 2);call #Ultimate.allocInit(12, 3); {26318#true} is VALID [2022-02-21 03:10:19,369 INFO L290 TraceCheckUtils]: 1: Hoare triple {26318#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_~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_add~0#1, main_~zero~0#1, main_~sa~0#1, main_~sb~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~tmp___1~0#1, main_~tmp___2~0#1, main_~tmp___3~0#1, main_~tmp___4~0#1, main_~tmp___5~0#1, main_~tmp___6~0#1, main_~tmp___7~0#1, main_~tmp___8~0#1, main_~tmp___9~0#1, main_~__retres23~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_add~0#1;havoc main_~zero~0#1;havoc main_~sa~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_~tmp___2~0#1;havoc main_~tmp___3~0#1;havoc main_~tmp___4~0#1;havoc main_~tmp___5~0#1;havoc main_~tmp___6~0#1;havoc main_~tmp___7~0#1;havoc main_~tmp___8~0#1;havoc main_~tmp___9~0#1;havoc main_~__retres23~0#1; {26318#true} is VALID [2022-02-21 03:10:19,370 INFO L272 TraceCheckUtils]: 2: Hoare triple {26318#true} call main_#t~ret22#1 := base2flt(0, 0); {26350#(and (= abs_77 |old(abs_77)|) (= abs_78 |old(abs_78)|))} is VALID [2022-02-21 03:10:19,370 INFO L290 TraceCheckUtils]: 3: Hoare triple {26350#(and (= abs_77 |old(abs_77)|) (= abs_78 |old(abs_78)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {26318#true} is VALID [2022-02-21 03:10:19,370 INFO L290 TraceCheckUtils]: 4: Hoare triple {26318#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {26318#true} is VALID [2022-02-21 03:10:19,370 INFO L290 TraceCheckUtils]: 5: Hoare triple {26318#true} #res := ~__retres4~0; {26318#true} is VALID [2022-02-21 03:10:19,370 INFO L290 TraceCheckUtils]: 6: Hoare triple {26318#true} assume true; {26318#true} is VALID [2022-02-21 03:10:19,370 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {26318#true} {26318#true} #453#return; {26318#true} is VALID [2022-02-21 03:10:19,370 INFO L290 TraceCheckUtils]: 8: Hoare triple {26318#true} main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1; {26318#true} is VALID [2022-02-21 03:10:19,371 INFO L272 TraceCheckUtils]: 9: Hoare triple {26318#true} call main_#t~ret23#1 := base2flt(main_~ma~2#1, main_~ea~2#1); {26350#(and (= abs_77 |old(abs_77)|) (= abs_78 |old(abs_78)|))} is VALID [2022-02-21 03:10:19,371 INFO L290 TraceCheckUtils]: 10: Hoare triple {26350#(and (= abs_77 |old(abs_77)|) (= abs_78 |old(abs_78)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {26318#true} is VALID [2022-02-21 03:10:19,371 INFO L290 TraceCheckUtils]: 11: Hoare triple {26318#true} assume !(0 == ~m % 4294967296); {26318#true} is VALID [2022-02-21 03:10:19,371 INFO L290 TraceCheckUtils]: 12: Hoare triple {26318#true} assume !(~m % 4294967296 < 16777216); {26351#(or (<= (+ (div base2flt_~m 4294967296) 1) 0) (<= (+ 16777216 (* (div base2flt_~m 4294967296) 4294967296)) base2flt_~m))} is VALID [2022-02-21 03:10:19,372 INFO L290 TraceCheckUtils]: 13: Hoare triple {26351#(or (<= (+ (div base2flt_~m 4294967296) 1) 0) (<= (+ 16777216 (* (div base2flt_~m 4294967296) 4294967296)) base2flt_~m))} assume !false; {26351#(or (<= (+ (div base2flt_~m 4294967296) 1) 0) (<= (+ 16777216 (* (div base2flt_~m 4294967296) 4294967296)) base2flt_~m))} is VALID [2022-02-21 03:10:19,372 INFO L290 TraceCheckUtils]: 14: Hoare triple {26351#(or (<= (+ (div base2flt_~m 4294967296) 1) 0) (<= (+ 16777216 (* (div base2flt_~m 4294967296) 4294967296)) base2flt_~m))} assume !(~m % 4294967296 >= 33554432); {26352#(and (or (not (<= (+ (div base2flt_~m 4294967296) 1) 0)) (<= base2flt_~m (+ 33554431 (* (div base2flt_~m 4294967296) 4294967296)))) (or (<= (+ (div base2flt_~m 4294967296) 1) 0) (<= (+ 16777216 (* (div base2flt_~m 4294967296) 4294967296)) base2flt_~m)))} is VALID [2022-02-21 03:10:19,373 INFO L290 TraceCheckUtils]: 15: Hoare triple {26352#(and (or (not (<= (+ (div base2flt_~m 4294967296) 1) 0)) (<= base2flt_~m (+ 33554431 (* (div base2flt_~m 4294967296) 4294967296)))) (or (<= (+ (div base2flt_~m 4294967296) 1) 0) (<= (+ 16777216 (* (div base2flt_~m 4294967296) 4294967296)) base2flt_~m)))} assume !(0 == ~m || 0 == ~bitwiseComplement(16777216)); {26352#(and (or (not (<= (+ (div base2flt_~m 4294967296) 1) 0)) (<= base2flt_~m (+ 33554431 (* (div base2flt_~m 4294967296) 4294967296)))) (or (<= (+ (div base2flt_~m 4294967296) 1) 0) (<= (+ 16777216 (* (div base2flt_~m 4294967296) 4294967296)) base2flt_~m)))} is VALID [2022-02-21 03:10:19,373 INFO L290 TraceCheckUtils]: 16: Hoare triple {26352#(and (or (not (<= (+ (div base2flt_~m 4294967296) 1) 0)) (<= base2flt_~m (+ 33554431 (* (div base2flt_~m 4294967296) 4294967296)))) (or (<= (+ (div base2flt_~m 4294967296) 1) 0) (<= (+ 16777216 (* (div base2flt_~m 4294967296) 4294967296)) base2flt_~m)))} assume 1 == ~m && (0 == ~bitwiseComplement(16777216) || 1 == ~bitwiseComplement(16777216));~m := ~bitwiseComplement(16777216); {26319#false} is VALID [2022-02-21 03:10:19,373 INFO L290 TraceCheckUtils]: 17: Hoare triple {26319#false} assume 128 + ~e <= 2147483647; {26319#false} is VALID [2022-02-21 03:10:19,373 INFO L290 TraceCheckUtils]: 18: Hoare triple {26319#false} assume 128 + ~e >= -2147483648; {26319#false} is VALID [2022-02-21 03:10:19,373 INFO L290 TraceCheckUtils]: 19: Hoare triple {26319#false} assume 128 + ~e <= 2147483647; {26319#false} is VALID [2022-02-21 03:10:19,373 INFO L290 TraceCheckUtils]: 20: Hoare triple {26319#false} assume 128 + ~e >= -2147483648; {26319#false} is VALID [2022-02-21 03:10:19,373 INFO L290 TraceCheckUtils]: 21: Hoare triple {26319#false} assume (1 == ~m && (0 == 16777216 * (128 + ~e) || 1 == 16777216 * (128 + ~e))) || ((0 == ~m || 1 == ~m) && 1 == 16777216 * (128 + ~e));~res~0 := 1; {26319#false} is VALID [2022-02-21 03:10:19,373 INFO L290 TraceCheckUtils]: 22: Hoare triple {26319#false} ~__retres4~0 := ~res~0; {26319#false} is VALID [2022-02-21 03:10:19,373 INFO L290 TraceCheckUtils]: 23: Hoare triple {26319#false} #res := ~__retres4~0; {26319#false} is VALID [2022-02-21 03:10:19,373 INFO L290 TraceCheckUtils]: 24: Hoare triple {26319#false} assume true; {26319#false} is VALID [2022-02-21 03:10:19,373 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {26319#false} {26318#true} #455#return; {26319#false} is VALID [2022-02-21 03:10:19,373 INFO L290 TraceCheckUtils]: 26: Hoare triple {26319#false} main_~a~0#1 := main_#t~ret23#1;havoc main_#t~ret23#1; {26319#false} is VALID [2022-02-21 03:10:19,374 INFO L272 TraceCheckUtils]: 27: Hoare triple {26319#false} call main_#t~ret24#1 := base2flt(main_~mb~2#1, main_~eb~2#1); {26350#(and (= abs_77 |old(abs_77)|) (= abs_78 |old(abs_78)|))} is VALID [2022-02-21 03:10:19,374 INFO L290 TraceCheckUtils]: 28: Hoare triple {26350#(and (= abs_77 |old(abs_77)|) (= abs_78 |old(abs_78)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {26318#true} is VALID [2022-02-21 03:10:19,374 INFO L290 TraceCheckUtils]: 29: Hoare triple {26318#true} assume !(0 == ~m % 4294967296); {26318#true} is VALID [2022-02-21 03:10:19,374 INFO L290 TraceCheckUtils]: 30: Hoare triple {26318#true} assume !(~m % 4294967296 < 16777216); {26318#true} is VALID [2022-02-21 03:10:19,374 INFO L290 TraceCheckUtils]: 31: Hoare triple {26318#true} assume !false; {26318#true} is VALID [2022-02-21 03:10:19,374 INFO L290 TraceCheckUtils]: 32: Hoare triple {26318#true} assume ~m % 4294967296 >= 33554432; {26318#true} is VALID [2022-02-21 03:10:19,374 INFO L290 TraceCheckUtils]: 33: Hoare triple {26318#true} assume ~e >= 127;~__retres4~0 := 4294967295; {26318#true} is VALID [2022-02-21 03:10:19,374 INFO L290 TraceCheckUtils]: 34: Hoare triple {26318#true} #res := ~__retres4~0; {26318#true} is VALID [2022-02-21 03:10:19,374 INFO L290 TraceCheckUtils]: 35: Hoare triple {26318#true} assume true; {26318#true} is VALID [2022-02-21 03:10:19,374 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {26318#true} {26319#false} #457#return; {26319#false} is VALID [2022-02-21 03:10:19,374 INFO L290 TraceCheckUtils]: 37: Hoare triple {26319#false} main_~b~0#1 := main_#t~ret24#1;havoc main_#t~ret24#1; {26319#false} is VALID [2022-02-21 03:10:19,374 INFO L290 TraceCheckUtils]: 38: Hoare triple {26319#false} assume !(main_~a~0#1 % 4294967296 < main_~zero~0#1 % 4294967296); {26319#false} is VALID [2022-02-21 03:10:19,374 INFO L290 TraceCheckUtils]: 39: Hoare triple {26319#false} assume main_~a~0#1 % 4294967296 > main_~zero~0#1 % 4294967296;main_~tmp~2#1 := 1; {26319#false} is VALID [2022-02-21 03:10:19,374 INFO L290 TraceCheckUtils]: 40: Hoare triple {26319#false} main_~sa~0#1 := main_~tmp~2#1; {26319#false} is VALID [2022-02-21 03:10:19,374 INFO L290 TraceCheckUtils]: 41: Hoare triple {26319#false} assume !(main_~b~0#1 % 4294967296 < main_~zero~0#1 % 4294967296); {26319#false} is VALID [2022-02-21 03:10:19,374 INFO L290 TraceCheckUtils]: 42: Hoare triple {26319#false} assume main_~b~0#1 % 4294967296 > main_~zero~0#1 % 4294967296;main_~tmp___0~0#1 := 1; {26319#false} is VALID [2022-02-21 03:10:19,374 INFO L290 TraceCheckUtils]: 43: Hoare triple {26319#false} main_~sb~0#1 := main_~tmp___0~0#1; {26319#false} is VALID [2022-02-21 03:10:19,375 INFO L290 TraceCheckUtils]: 44: Hoare triple {26319#false} assume { :begin_inline_addflt } true;addflt_#in~a#1, addflt_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc addflt_#res#1;havoc addflt_#t~nondet6#1, addflt_#t~nondet7#1, addflt_#t~nondet8#1, addflt_#t~nondet9#1, addflt_#t~nondet10#1, addflt_#t~nondet11#1, addflt_~a#1, addflt_~b#1, addflt_~res~1#1, addflt_~ma~0#1, addflt_~mb~0#1, addflt_~delta~0#1, addflt_~ea~0#1, addflt_~eb~0#1, addflt_~tmp~0#1, addflt_~__retres10~0#1;addflt_~a#1 := addflt_#in~a#1;addflt_~b#1 := addflt_#in~b#1;havoc addflt_~res~1#1;havoc addflt_~ma~0#1;havoc addflt_~mb~0#1;havoc addflt_~delta~0#1;havoc addflt_~ea~0#1;havoc addflt_~eb~0#1;havoc addflt_~tmp~0#1;havoc addflt_~__retres10~0#1; {26319#false} is VALID [2022-02-21 03:10:19,375 INFO L290 TraceCheckUtils]: 45: Hoare triple {26319#false} assume !(addflt_~a#1 % 4294967296 < addflt_~b#1 % 4294967296); {26319#false} is VALID [2022-02-21 03:10:19,375 INFO L290 TraceCheckUtils]: 46: Hoare triple {26319#false} assume !(0 == addflt_~b#1 % 4294967296); {26319#false} is VALID [2022-02-21 03:10:19,375 INFO L290 TraceCheckUtils]: 47: Hoare triple {26319#false} assume !(0 == addflt_~a#1); {26319#false} is VALID [2022-02-21 03:10:19,375 INFO L290 TraceCheckUtils]: 48: Hoare triple {26319#false} assume !false; {26319#false} is VALID [2022-02-21 03:10:19,375 INFO L290 TraceCheckUtils]: 49: Hoare triple {26319#false} assume !false; {26319#false} is VALID [2022-02-21 03:10:19,375 INFO L290 TraceCheckUtils]: 50: Hoare triple {26319#false} assume addflt_~a#1 >= 0;abs_109 := (if addflt_~a#1 < 16777215 then addflt_~a#1 else 16777215);assume addflt_~a#1 >= 0;assume addflt_~ma~0#1 < abs_109; {26319#false} is VALID [2022-02-21 03:10:19,375 INFO L290 TraceCheckUtils]: 51: Hoare triple {26319#false} assume (if addflt_~a#1 / 16777216 % 4294967296 % 4294967296 <= 2147483647 then addflt_~a#1 / 16777216 % 4294967296 % 4294967296 else addflt_~a#1 / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 <= 2147483647; {26319#false} is VALID [2022-02-21 03:10:19,375 INFO L290 TraceCheckUtils]: 52: Hoare triple {26319#false} assume !((if addflt_~a#1 / 16777216 % 4294967296 % 4294967296 <= 2147483647 then addflt_~a#1 / 16777216 % 4294967296 % 4294967296 else addflt_~a#1 / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 >= -2147483648); {26319#false} is VALID [2022-02-21 03:10:19,375 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-02-21 03:10:19,375 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:10:19,375 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064264289] [2022-02-21 03:10:19,375 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2064264289] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:10:19,375 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1480761070] [2022-02-21 03:10:19,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:10:19,376 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:10:19,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:10:19,377 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:10:19,377 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-02-21 03:10:19,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:19,425 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 03:10:19,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:19,434 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:10:19,532 INFO L290 TraceCheckUtils]: 0: Hoare triple {26318#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(24, 2);call #Ultimate.allocInit(12, 3); {26318#true} is VALID [2022-02-21 03:10:19,532 INFO L290 TraceCheckUtils]: 1: Hoare triple {26318#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_~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_add~0#1, main_~zero~0#1, main_~sa~0#1, main_~sb~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~tmp___1~0#1, main_~tmp___2~0#1, main_~tmp___3~0#1, main_~tmp___4~0#1, main_~tmp___5~0#1, main_~tmp___6~0#1, main_~tmp___7~0#1, main_~tmp___8~0#1, main_~tmp___9~0#1, main_~__retres23~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_add~0#1;havoc main_~zero~0#1;havoc main_~sa~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_~tmp___2~0#1;havoc main_~tmp___3~0#1;havoc main_~tmp___4~0#1;havoc main_~tmp___5~0#1;havoc main_~tmp___6~0#1;havoc main_~tmp___7~0#1;havoc main_~tmp___8~0#1;havoc main_~tmp___9~0#1;havoc main_~__retres23~0#1; {26318#true} is VALID [2022-02-21 03:10:19,532 INFO L272 TraceCheckUtils]: 2: Hoare triple {26318#true} call main_#t~ret22#1 := base2flt(0, 0); {26318#true} is VALID [2022-02-21 03:10:19,532 INFO L290 TraceCheckUtils]: 3: Hoare triple {26318#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {26318#true} is VALID [2022-02-21 03:10:19,532 INFO L290 TraceCheckUtils]: 4: Hoare triple {26318#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {26318#true} is VALID [2022-02-21 03:10:19,532 INFO L290 TraceCheckUtils]: 5: Hoare triple {26318#true} #res := ~__retres4~0; {26318#true} is VALID [2022-02-21 03:10:19,532 INFO L290 TraceCheckUtils]: 6: Hoare triple {26318#true} assume true; {26318#true} is VALID [2022-02-21 03:10:19,532 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {26318#true} {26318#true} #453#return; {26318#true} is VALID [2022-02-21 03:10:19,532 INFO L290 TraceCheckUtils]: 8: Hoare triple {26318#true} main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1; {26318#true} is VALID [2022-02-21 03:10:19,533 INFO L272 TraceCheckUtils]: 9: Hoare triple {26318#true} call main_#t~ret23#1 := base2flt(main_~ma~2#1, main_~ea~2#1); {26318#true} is VALID [2022-02-21 03:10:19,533 INFO L290 TraceCheckUtils]: 10: Hoare triple {26318#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {26318#true} is VALID [2022-02-21 03:10:19,533 INFO L290 TraceCheckUtils]: 11: Hoare triple {26318#true} assume !(0 == ~m % 4294967296); {26318#true} is VALID [2022-02-21 03:10:19,533 INFO L290 TraceCheckUtils]: 12: Hoare triple {26318#true} assume !(~m % 4294967296 < 16777216); {26392#(not (< (mod base2flt_~m 4294967296) 16777216))} is VALID [2022-02-21 03:10:19,533 INFO L290 TraceCheckUtils]: 13: Hoare triple {26392#(not (< (mod base2flt_~m 4294967296) 16777216))} assume !false; {26392#(not (< (mod base2flt_~m 4294967296) 16777216))} is VALID [2022-02-21 03:10:19,534 INFO L290 TraceCheckUtils]: 14: Hoare triple {26392#(not (< (mod base2flt_~m 4294967296) 16777216))} assume !(~m % 4294967296 >= 33554432); {26399#(and (not (< (mod base2flt_~m 4294967296) 16777216)) (not (<= 33554432 (mod base2flt_~m 4294967296))))} is VALID [2022-02-21 03:10:19,534 INFO L290 TraceCheckUtils]: 15: Hoare triple {26399#(and (not (< (mod base2flt_~m 4294967296) 16777216)) (not (<= 33554432 (mod base2flt_~m 4294967296))))} assume !(0 == ~m || 0 == ~bitwiseComplement(16777216)); {26399#(and (not (< (mod base2flt_~m 4294967296) 16777216)) (not (<= 33554432 (mod base2flt_~m 4294967296))))} is VALID [2022-02-21 03:10:19,534 INFO L290 TraceCheckUtils]: 16: Hoare triple {26399#(and (not (< (mod base2flt_~m 4294967296) 16777216)) (not (<= 33554432 (mod base2flt_~m 4294967296))))} assume 1 == ~m && (0 == ~bitwiseComplement(16777216) || 1 == ~bitwiseComplement(16777216));~m := ~bitwiseComplement(16777216); {26319#false} is VALID [2022-02-21 03:10:19,534 INFO L290 TraceCheckUtils]: 17: Hoare triple {26319#false} assume 128 + ~e <= 2147483647; {26319#false} is VALID [2022-02-21 03:10:19,535 INFO L290 TraceCheckUtils]: 18: Hoare triple {26319#false} assume 128 + ~e >= -2147483648; {26319#false} is VALID [2022-02-21 03:10:19,535 INFO L290 TraceCheckUtils]: 19: Hoare triple {26319#false} assume 128 + ~e <= 2147483647; {26319#false} is VALID [2022-02-21 03:10:19,535 INFO L290 TraceCheckUtils]: 20: Hoare triple {26319#false} assume 128 + ~e >= -2147483648; {26319#false} is VALID [2022-02-21 03:10:19,535 INFO L290 TraceCheckUtils]: 21: Hoare triple {26319#false} assume (1 == ~m && (0 == 16777216 * (128 + ~e) || 1 == 16777216 * (128 + ~e))) || ((0 == ~m || 1 == ~m) && 1 == 16777216 * (128 + ~e));~res~0 := 1; {26319#false} is VALID [2022-02-21 03:10:19,535 INFO L290 TraceCheckUtils]: 22: Hoare triple {26319#false} ~__retres4~0 := ~res~0; {26319#false} is VALID [2022-02-21 03:10:19,535 INFO L290 TraceCheckUtils]: 23: Hoare triple {26319#false} #res := ~__retres4~0; {26319#false} is VALID [2022-02-21 03:10:19,535 INFO L290 TraceCheckUtils]: 24: Hoare triple {26319#false} assume true; {26319#false} is VALID [2022-02-21 03:10:19,535 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {26319#false} {26318#true} #455#return; {26319#false} is VALID [2022-02-21 03:10:19,535 INFO L290 TraceCheckUtils]: 26: Hoare triple {26319#false} main_~a~0#1 := main_#t~ret23#1;havoc main_#t~ret23#1; {26319#false} is VALID [2022-02-21 03:10:19,536 INFO L272 TraceCheckUtils]: 27: Hoare triple {26319#false} call main_#t~ret24#1 := base2flt(main_~mb~2#1, main_~eb~2#1); {26319#false} is VALID [2022-02-21 03:10:19,536 INFO L290 TraceCheckUtils]: 28: Hoare triple {26319#false} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {26319#false} is VALID [2022-02-21 03:10:19,536 INFO L290 TraceCheckUtils]: 29: Hoare triple {26319#false} assume !(0 == ~m % 4294967296); {26319#false} is VALID [2022-02-21 03:10:19,536 INFO L290 TraceCheckUtils]: 30: Hoare triple {26319#false} assume !(~m % 4294967296 < 16777216); {26319#false} is VALID [2022-02-21 03:10:19,536 INFO L290 TraceCheckUtils]: 31: Hoare triple {26319#false} assume !false; {26319#false} is VALID [2022-02-21 03:10:19,536 INFO L290 TraceCheckUtils]: 32: Hoare triple {26319#false} assume ~m % 4294967296 >= 33554432; {26319#false} is VALID [2022-02-21 03:10:19,536 INFO L290 TraceCheckUtils]: 33: Hoare triple {26319#false} assume ~e >= 127;~__retres4~0 := 4294967295; {26319#false} is VALID [2022-02-21 03:10:19,536 INFO L290 TraceCheckUtils]: 34: Hoare triple {26319#false} #res := ~__retres4~0; {26319#false} is VALID [2022-02-21 03:10:19,536 INFO L290 TraceCheckUtils]: 35: Hoare triple {26319#false} assume true; {26319#false} is VALID [2022-02-21 03:10:19,537 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {26319#false} {26319#false} #457#return; {26319#false} is VALID [2022-02-21 03:10:19,537 INFO L290 TraceCheckUtils]: 37: Hoare triple {26319#false} main_~b~0#1 := main_#t~ret24#1;havoc main_#t~ret24#1; {26319#false} is VALID [2022-02-21 03:10:19,537 INFO L290 TraceCheckUtils]: 38: Hoare triple {26319#false} assume !(main_~a~0#1 % 4294967296 < main_~zero~0#1 % 4294967296); {26319#false} is VALID [2022-02-21 03:10:19,537 INFO L290 TraceCheckUtils]: 39: Hoare triple {26319#false} assume main_~a~0#1 % 4294967296 > main_~zero~0#1 % 4294967296;main_~tmp~2#1 := 1; {26319#false} is VALID [2022-02-21 03:10:19,537 INFO L290 TraceCheckUtils]: 40: Hoare triple {26319#false} main_~sa~0#1 := main_~tmp~2#1; {26319#false} is VALID [2022-02-21 03:10:19,537 INFO L290 TraceCheckUtils]: 41: Hoare triple {26319#false} assume !(main_~b~0#1 % 4294967296 < main_~zero~0#1 % 4294967296); {26319#false} is VALID [2022-02-21 03:10:19,537 INFO L290 TraceCheckUtils]: 42: Hoare triple {26319#false} assume main_~b~0#1 % 4294967296 > main_~zero~0#1 % 4294967296;main_~tmp___0~0#1 := 1; {26319#false} is VALID [2022-02-21 03:10:19,537 INFO L290 TraceCheckUtils]: 43: Hoare triple {26319#false} main_~sb~0#1 := main_~tmp___0~0#1; {26319#false} is VALID [2022-02-21 03:10:19,538 INFO L290 TraceCheckUtils]: 44: Hoare triple {26319#false} assume { :begin_inline_addflt } true;addflt_#in~a#1, addflt_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc addflt_#res#1;havoc addflt_#t~nondet6#1, addflt_#t~nondet7#1, addflt_#t~nondet8#1, addflt_#t~nondet9#1, addflt_#t~nondet10#1, addflt_#t~nondet11#1, addflt_~a#1, addflt_~b#1, addflt_~res~1#1, addflt_~ma~0#1, addflt_~mb~0#1, addflt_~delta~0#1, addflt_~ea~0#1, addflt_~eb~0#1, addflt_~tmp~0#1, addflt_~__retres10~0#1;addflt_~a#1 := addflt_#in~a#1;addflt_~b#1 := addflt_#in~b#1;havoc addflt_~res~1#1;havoc addflt_~ma~0#1;havoc addflt_~mb~0#1;havoc addflt_~delta~0#1;havoc addflt_~ea~0#1;havoc addflt_~eb~0#1;havoc addflt_~tmp~0#1;havoc addflt_~__retres10~0#1; {26319#false} is VALID [2022-02-21 03:10:19,538 INFO L290 TraceCheckUtils]: 45: Hoare triple {26319#false} assume !(addflt_~a#1 % 4294967296 < addflt_~b#1 % 4294967296); {26319#false} is VALID [2022-02-21 03:10:19,538 INFO L290 TraceCheckUtils]: 46: Hoare triple {26319#false} assume !(0 == addflt_~b#1 % 4294967296); {26319#false} is VALID [2022-02-21 03:10:19,538 INFO L290 TraceCheckUtils]: 47: Hoare triple {26319#false} assume !(0 == addflt_~a#1); {26319#false} is VALID [2022-02-21 03:10:19,538 INFO L290 TraceCheckUtils]: 48: Hoare triple {26319#false} assume !false; {26319#false} is VALID [2022-02-21 03:10:19,538 INFO L290 TraceCheckUtils]: 49: Hoare triple {26319#false} assume !false; {26319#false} is VALID [2022-02-21 03:10:19,538 INFO L290 TraceCheckUtils]: 50: Hoare triple {26319#false} assume addflt_~a#1 >= 0;abs_109 := (if addflt_~a#1 < 16777215 then addflt_~a#1 else 16777215);assume addflt_~a#1 >= 0;assume addflt_~ma~0#1 < abs_109; {26319#false} is VALID [2022-02-21 03:10:19,538 INFO L290 TraceCheckUtils]: 51: Hoare triple {26319#false} assume (if addflt_~a#1 / 16777216 % 4294967296 % 4294967296 <= 2147483647 then addflt_~a#1 / 16777216 % 4294967296 % 4294967296 else addflt_~a#1 / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 <= 2147483647; {26319#false} is VALID [2022-02-21 03:10:19,538 INFO L290 TraceCheckUtils]: 52: Hoare triple {26319#false} assume !((if addflt_~a#1 / 16777216 % 4294967296 % 4294967296 <= 2147483647 then addflt_~a#1 / 16777216 % 4294967296 % 4294967296 else addflt_~a#1 / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 >= -2147483648); {26319#false} is VALID [2022-02-21 03:10:19,538 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-02-21 03:10:19,538 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-21 03:10:19,538 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1480761070] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:10:19,539 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-21 03:10:19,539 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2022-02-21 03:10:19,539 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019324357] [2022-02-21 03:10:19,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:10:19,539 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 53 [2022-02-21 03:10:19,539 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:10:19,539 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-21 03:10:19,591 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:10:19,592 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-21 03:10:19,592 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:10:19,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-21 03:10:19,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-02-21 03:10:19,592 INFO L87 Difference]: Start difference. First operand 186 states and 226 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-21 03:10:19,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:19,973 INFO L93 Difference]: Finished difference Result 411 states and 521 transitions. [2022-02-21 03:10:19,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-21 03:10:19,973 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 53 [2022-02-21 03:10:19,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:10:19,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-21 03:10:19,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 295 transitions. [2022-02-21 03:10:19,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-21 03:10:19,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 295 transitions. [2022-02-21 03:10:19,976 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 295 transitions. [2022-02-21 03:10:20,139 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 295 edges. 295 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:10:20,142 INFO L225 Difference]: With dead ends: 411 [2022-02-21 03:10:20,142 INFO L226 Difference]: Without dead ends: 262 [2022-02-21 03:10:20,143 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-02-21 03:10:20,143 INFO L933 BasicCegarLoop]: 126 mSDtfsCounter, 37 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-21 03:10:20,143 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [37 Valid, 328 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-21 03:10:20,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2022-02-21 03:10:20,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 212. [2022-02-21 03:10:20,272 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:10:20,272 INFO L82 GeneralOperation]: Start isEquivalent. First operand 262 states. Second operand has 212 states, 189 states have (on average 1.2804232804232805) internal successors, (242), 198 states have internal predecessors, (242), 7 states have call successors, (7), 4 states have call predecessors, (7), 6 states have return successors, (9), 9 states have call predecessors, (9), 7 states have call successors, (9) [2022-02-21 03:10:20,273 INFO L74 IsIncluded]: Start isIncluded. First operand 262 states. Second operand has 212 states, 189 states have (on average 1.2804232804232805) internal successors, (242), 198 states have internal predecessors, (242), 7 states have call successors, (7), 4 states have call predecessors, (7), 6 states have return successors, (9), 9 states have call predecessors, (9), 7 states have call successors, (9) [2022-02-21 03:10:20,273 INFO L87 Difference]: Start difference. First operand 262 states. Second operand has 212 states, 189 states have (on average 1.2804232804232805) internal successors, (242), 198 states have internal predecessors, (242), 7 states have call successors, (7), 4 states have call predecessors, (7), 6 states have return successors, (9), 9 states have call predecessors, (9), 7 states have call successors, (9) [2022-02-21 03:10:20,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:20,276 INFO L93 Difference]: Finished difference Result 262 states and 320 transitions. [2022-02-21 03:10:20,276 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 320 transitions. [2022-02-21 03:10:20,278 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:10:20,278 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:10:20,278 INFO L74 IsIncluded]: Start isIncluded. First operand has 212 states, 189 states have (on average 1.2804232804232805) internal successors, (242), 198 states have internal predecessors, (242), 7 states have call successors, (7), 4 states have call predecessors, (7), 6 states have return successors, (9), 9 states have call predecessors, (9), 7 states have call successors, (9) Second operand 262 states. [2022-02-21 03:10:20,278 INFO L87 Difference]: Start difference. First operand has 212 states, 189 states have (on average 1.2804232804232805) internal successors, (242), 198 states have internal predecessors, (242), 7 states have call successors, (7), 4 states have call predecessors, (7), 6 states have return successors, (9), 9 states have call predecessors, (9), 7 states have call successors, (9) Second operand 262 states. [2022-02-21 03:10:20,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:20,283 INFO L93 Difference]: Finished difference Result 262 states and 320 transitions. [2022-02-21 03:10:20,283 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 320 transitions. [2022-02-21 03:10:20,284 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:10:20,284 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:10:20,284 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:10:20,284 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:10:20,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 189 states have (on average 1.2804232804232805) internal successors, (242), 198 states have internal predecessors, (242), 7 states have call successors, (7), 4 states have call predecessors, (7), 6 states have return successors, (9), 9 states have call predecessors, (9), 7 states have call successors, (9) [2022-02-21 03:10:20,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 258 transitions. [2022-02-21 03:10:20,288 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 258 transitions. Word has length 53 [2022-02-21 03:10:20,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:10:20,289 INFO L470 AbstractCegarLoop]: Abstraction has 212 states and 258 transitions. [2022-02-21 03:10:20,289 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-21 03:10:20,289 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 258 transitions. [2022-02-21 03:10:20,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-02-21 03:10:20,289 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:10:20,289 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:10:20,305 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2022-02-21 03:10:20,490 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:10:20,490 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-02-21 03:10:20,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:10:20,490 INFO L85 PathProgramCache]: Analyzing trace with hash -814993957, now seen corresponding path program 1 times [2022-02-21 03:10:20,490 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:10:20,491 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982640199] [2022-02-21 03:10:20,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:10:20,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:10:20,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:20,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-21 03:10:20,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:20,524 INFO L290 TraceCheckUtils]: 0: Hoare triple {27765#(and (= abs_77 |old(abs_77)|) (= abs_78 |old(abs_78)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {27732#true} is VALID [2022-02-21 03:10:20,524 INFO L290 TraceCheckUtils]: 1: Hoare triple {27732#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {27732#true} is VALID [2022-02-21 03:10:20,524 INFO L290 TraceCheckUtils]: 2: Hoare triple {27732#true} #res := ~__retres4~0; {27732#true} is VALID [2022-02-21 03:10:20,524 INFO L290 TraceCheckUtils]: 3: Hoare triple {27732#true} assume true; {27732#true} is VALID [2022-02-21 03:10:20,524 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {27732#true} {27732#true} #453#return; {27732#true} is VALID [2022-02-21 03:10:20,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-02-21 03:10:20,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:20,551 INFO L290 TraceCheckUtils]: 0: Hoare triple {27765#(and (= abs_77 |old(abs_77)|) (= abs_78 |old(abs_78)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {27732#true} is VALID [2022-02-21 03:10:20,551 INFO L290 TraceCheckUtils]: 1: Hoare triple {27732#true} assume !(0 == ~m % 4294967296); {27732#true} is VALID [2022-02-21 03:10:20,551 INFO L290 TraceCheckUtils]: 2: Hoare triple {27732#true} assume !(~m % 4294967296 < 16777216); {27732#true} is VALID [2022-02-21 03:10:20,551 INFO L290 TraceCheckUtils]: 3: Hoare triple {27732#true} assume !false; {27732#true} is VALID [2022-02-21 03:10:20,551 INFO L290 TraceCheckUtils]: 4: Hoare triple {27732#true} assume !(~m % 4294967296 >= 33554432); {27732#true} is VALID [2022-02-21 03:10:20,551 INFO L290 TraceCheckUtils]: 5: Hoare triple {27732#true} assume 0 == ~m || 0 == ~bitwiseComplement(16777216);~m := 0; {27766#(= base2flt_~m 0)} is VALID [2022-02-21 03:10:20,552 INFO L290 TraceCheckUtils]: 6: Hoare triple {27766#(= base2flt_~m 0)} assume 128 + ~e <= 2147483647; {27766#(= base2flt_~m 0)} is VALID [2022-02-21 03:10:20,552 INFO L290 TraceCheckUtils]: 7: Hoare triple {27766#(= base2flt_~m 0)} assume 128 + ~e >= -2147483648; {27766#(= base2flt_~m 0)} is VALID [2022-02-21 03:10:20,556 INFO L290 TraceCheckUtils]: 8: Hoare triple {27766#(= base2flt_~m 0)} assume 128 + ~e <= 2147483647; {27766#(= base2flt_~m 0)} is VALID [2022-02-21 03:10:20,557 INFO L290 TraceCheckUtils]: 9: Hoare triple {27766#(= base2flt_~m 0)} assume 128 + ~e >= -2147483648; {27766#(= base2flt_~m 0)} is VALID [2022-02-21 03:10:20,557 INFO L290 TraceCheckUtils]: 10: Hoare triple {27766#(= base2flt_~m 0)} assume !((1 == ~m && (0 == 16777216 * (128 + ~e) || 1 == 16777216 * (128 + ~e))) || ((0 == ~m || 1 == ~m) && 1 == 16777216 * (128 + ~e))); {27767#(or (= base2flt_~m 0) (not (= (+ (* 16777216 base2flt_~e) 2147483648) 0)))} is VALID [2022-02-21 03:10:20,558 INFO L290 TraceCheckUtils]: 11: Hoare triple {27767#(or (= base2flt_~m 0) (not (= (+ (* 16777216 base2flt_~e) 2147483648) 0)))} assume !(0 == ~m && (0 == 16777216 * (128 + ~e) || 1 == 16777216 * (128 + ~e))); {27768#(not (= (+ 128 base2flt_~e) 0))} is VALID [2022-02-21 03:10:20,558 INFO L290 TraceCheckUtils]: 12: Hoare triple {27768#(not (= (+ 128 base2flt_~e) 0))} assume (0 == ~m || 1 == ~m) && 0 == 16777216 * (128 + ~e);~res~0 := ~m; {27733#false} is VALID [2022-02-21 03:10:20,558 INFO L290 TraceCheckUtils]: 13: Hoare triple {27733#false} ~__retres4~0 := ~res~0; {27733#false} is VALID [2022-02-21 03:10:20,558 INFO L290 TraceCheckUtils]: 14: Hoare triple {27733#false} #res := ~__retres4~0; {27733#false} is VALID [2022-02-21 03:10:20,558 INFO L290 TraceCheckUtils]: 15: Hoare triple {27733#false} assume true; {27733#false} is VALID [2022-02-21 03:10:20,558 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {27733#false} {27732#true} #455#return; {27733#false} is VALID [2022-02-21 03:10:20,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-02-21 03:10:20,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:20,563 INFO L290 TraceCheckUtils]: 0: Hoare triple {27765#(and (= abs_77 |old(abs_77)|) (= abs_78 |old(abs_78)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {27732#true} is VALID [2022-02-21 03:10:20,563 INFO L290 TraceCheckUtils]: 1: Hoare triple {27732#true} assume !(0 == ~m % 4294967296); {27732#true} is VALID [2022-02-21 03:10:20,563 INFO L290 TraceCheckUtils]: 2: Hoare triple {27732#true} assume !(~m % 4294967296 < 16777216); {27732#true} is VALID [2022-02-21 03:10:20,563 INFO L290 TraceCheckUtils]: 3: Hoare triple {27732#true} assume !false; {27732#true} is VALID [2022-02-21 03:10:20,563 INFO L290 TraceCheckUtils]: 4: Hoare triple {27732#true} assume ~m % 4294967296 >= 33554432; {27732#true} is VALID [2022-02-21 03:10:20,563 INFO L290 TraceCheckUtils]: 5: Hoare triple {27732#true} assume ~e >= 127;~__retres4~0 := 4294967295; {27732#true} is VALID [2022-02-21 03:10:20,563 INFO L290 TraceCheckUtils]: 6: Hoare triple {27732#true} #res := ~__retres4~0; {27732#true} is VALID [2022-02-21 03:10:20,563 INFO L290 TraceCheckUtils]: 7: Hoare triple {27732#true} assume true; {27732#true} is VALID [2022-02-21 03:10:20,563 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {27732#true} {27733#false} #457#return; {27733#false} is VALID [2022-02-21 03:10:20,563 INFO L290 TraceCheckUtils]: 0: Hoare triple {27732#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(24, 2);call #Ultimate.allocInit(12, 3); {27732#true} is VALID [2022-02-21 03:10:20,566 INFO L290 TraceCheckUtils]: 1: Hoare triple {27732#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_~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_add~0#1, main_~zero~0#1, main_~sa~0#1, main_~sb~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~tmp___1~0#1, main_~tmp___2~0#1, main_~tmp___3~0#1, main_~tmp___4~0#1, main_~tmp___5~0#1, main_~tmp___6~0#1, main_~tmp___7~0#1, main_~tmp___8~0#1, main_~tmp___9~0#1, main_~__retres23~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_add~0#1;havoc main_~zero~0#1;havoc main_~sa~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_~tmp___2~0#1;havoc main_~tmp___3~0#1;havoc main_~tmp___4~0#1;havoc main_~tmp___5~0#1;havoc main_~tmp___6~0#1;havoc main_~tmp___7~0#1;havoc main_~tmp___8~0#1;havoc main_~tmp___9~0#1;havoc main_~__retres23~0#1; {27732#true} is VALID [2022-02-21 03:10:20,567 INFO L272 TraceCheckUtils]: 2: Hoare triple {27732#true} call main_#t~ret22#1 := base2flt(0, 0); {27765#(and (= abs_77 |old(abs_77)|) (= abs_78 |old(abs_78)|))} is VALID [2022-02-21 03:10:20,567 INFO L290 TraceCheckUtils]: 3: Hoare triple {27765#(and (= abs_77 |old(abs_77)|) (= abs_78 |old(abs_78)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {27732#true} is VALID [2022-02-21 03:10:20,567 INFO L290 TraceCheckUtils]: 4: Hoare triple {27732#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {27732#true} is VALID [2022-02-21 03:10:20,568 INFO L290 TraceCheckUtils]: 5: Hoare triple {27732#true} #res := ~__retres4~0; {27732#true} is VALID [2022-02-21 03:10:20,568 INFO L290 TraceCheckUtils]: 6: Hoare triple {27732#true} assume true; {27732#true} is VALID [2022-02-21 03:10:20,568 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {27732#true} {27732#true} #453#return; {27732#true} is VALID [2022-02-21 03:10:20,568 INFO L290 TraceCheckUtils]: 8: Hoare triple {27732#true} main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1; {27732#true} is VALID [2022-02-21 03:10:20,568 INFO L272 TraceCheckUtils]: 9: Hoare triple {27732#true} call main_#t~ret23#1 := base2flt(main_~ma~2#1, main_~ea~2#1); {27765#(and (= abs_77 |old(abs_77)|) (= abs_78 |old(abs_78)|))} is VALID [2022-02-21 03:10:20,568 INFO L290 TraceCheckUtils]: 10: Hoare triple {27765#(and (= abs_77 |old(abs_77)|) (= abs_78 |old(abs_78)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {27732#true} is VALID [2022-02-21 03:10:20,568 INFO L290 TraceCheckUtils]: 11: Hoare triple {27732#true} assume !(0 == ~m % 4294967296); {27732#true} is VALID [2022-02-21 03:10:20,568 INFO L290 TraceCheckUtils]: 12: Hoare triple {27732#true} assume !(~m % 4294967296 < 16777216); {27732#true} is VALID [2022-02-21 03:10:20,568 INFO L290 TraceCheckUtils]: 13: Hoare triple {27732#true} assume !false; {27732#true} is VALID [2022-02-21 03:10:20,569 INFO L290 TraceCheckUtils]: 14: Hoare triple {27732#true} assume !(~m % 4294967296 >= 33554432); {27732#true} is VALID [2022-02-21 03:10:20,569 INFO L290 TraceCheckUtils]: 15: Hoare triple {27732#true} assume 0 == ~m || 0 == ~bitwiseComplement(16777216);~m := 0; {27766#(= base2flt_~m 0)} is VALID [2022-02-21 03:10:20,569 INFO L290 TraceCheckUtils]: 16: Hoare triple {27766#(= base2flt_~m 0)} assume 128 + ~e <= 2147483647; {27766#(= base2flt_~m 0)} is VALID [2022-02-21 03:10:20,569 INFO L290 TraceCheckUtils]: 17: Hoare triple {27766#(= base2flt_~m 0)} assume 128 + ~e >= -2147483648; {27766#(= base2flt_~m 0)} is VALID [2022-02-21 03:10:20,569 INFO L290 TraceCheckUtils]: 18: Hoare triple {27766#(= base2flt_~m 0)} assume 128 + ~e <= 2147483647; {27766#(= base2flt_~m 0)} is VALID [2022-02-21 03:10:20,570 INFO L290 TraceCheckUtils]: 19: Hoare triple {27766#(= base2flt_~m 0)} assume 128 + ~e >= -2147483648; {27766#(= base2flt_~m 0)} is VALID [2022-02-21 03:10:20,570 INFO L290 TraceCheckUtils]: 20: Hoare triple {27766#(= base2flt_~m 0)} assume !((1 == ~m && (0 == 16777216 * (128 + ~e) || 1 == 16777216 * (128 + ~e))) || ((0 == ~m || 1 == ~m) && 1 == 16777216 * (128 + ~e))); {27767#(or (= base2flt_~m 0) (not (= (+ (* 16777216 base2flt_~e) 2147483648) 0)))} is VALID [2022-02-21 03:10:20,570 INFO L290 TraceCheckUtils]: 21: Hoare triple {27767#(or (= base2flt_~m 0) (not (= (+ (* 16777216 base2flt_~e) 2147483648) 0)))} assume !(0 == ~m && (0 == 16777216 * (128 + ~e) || 1 == 16777216 * (128 + ~e))); {27768#(not (= (+ 128 base2flt_~e) 0))} is VALID [2022-02-21 03:10:20,571 INFO L290 TraceCheckUtils]: 22: Hoare triple {27768#(not (= (+ 128 base2flt_~e) 0))} assume (0 == ~m || 1 == ~m) && 0 == 16777216 * (128 + ~e);~res~0 := ~m; {27733#false} is VALID [2022-02-21 03:10:20,571 INFO L290 TraceCheckUtils]: 23: Hoare triple {27733#false} ~__retres4~0 := ~res~0; {27733#false} is VALID [2022-02-21 03:10:20,571 INFO L290 TraceCheckUtils]: 24: Hoare triple {27733#false} #res := ~__retres4~0; {27733#false} is VALID [2022-02-21 03:10:20,571 INFO L290 TraceCheckUtils]: 25: Hoare triple {27733#false} assume true; {27733#false} is VALID [2022-02-21 03:10:20,571 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {27733#false} {27732#true} #455#return; {27733#false} is VALID [2022-02-21 03:10:20,571 INFO L290 TraceCheckUtils]: 27: Hoare triple {27733#false} main_~a~0#1 := main_#t~ret23#1;havoc main_#t~ret23#1; {27733#false} is VALID [2022-02-21 03:10:20,571 INFO L272 TraceCheckUtils]: 28: Hoare triple {27733#false} call main_#t~ret24#1 := base2flt(main_~mb~2#1, main_~eb~2#1); {27765#(and (= abs_77 |old(abs_77)|) (= abs_78 |old(abs_78)|))} is VALID [2022-02-21 03:10:20,571 INFO L290 TraceCheckUtils]: 29: Hoare triple {27765#(and (= abs_77 |old(abs_77)|) (= abs_78 |old(abs_78)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {27732#true} is VALID [2022-02-21 03:10:20,571 INFO L290 TraceCheckUtils]: 30: Hoare triple {27732#true} assume !(0 == ~m % 4294967296); {27732#true} is VALID [2022-02-21 03:10:20,571 INFO L290 TraceCheckUtils]: 31: Hoare triple {27732#true} assume !(~m % 4294967296 < 16777216); {27732#true} is VALID [2022-02-21 03:10:20,571 INFO L290 TraceCheckUtils]: 32: Hoare triple {27732#true} assume !false; {27732#true} is VALID [2022-02-21 03:10:20,571 INFO L290 TraceCheckUtils]: 33: Hoare triple {27732#true} assume ~m % 4294967296 >= 33554432; {27732#true} is VALID [2022-02-21 03:10:20,572 INFO L290 TraceCheckUtils]: 34: Hoare triple {27732#true} assume ~e >= 127;~__retres4~0 := 4294967295; {27732#true} is VALID [2022-02-21 03:10:20,572 INFO L290 TraceCheckUtils]: 35: Hoare triple {27732#true} #res := ~__retres4~0; {27732#true} is VALID [2022-02-21 03:10:20,572 INFO L290 TraceCheckUtils]: 36: Hoare triple {27732#true} assume true; {27732#true} is VALID [2022-02-21 03:10:20,572 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {27732#true} {27733#false} #457#return; {27733#false} is VALID [2022-02-21 03:10:20,572 INFO L290 TraceCheckUtils]: 38: Hoare triple {27733#false} main_~b~0#1 := main_#t~ret24#1;havoc main_#t~ret24#1; {27733#false} is VALID [2022-02-21 03:10:20,572 INFO L290 TraceCheckUtils]: 39: Hoare triple {27733#false} assume !(main_~a~0#1 % 4294967296 < main_~zero~0#1 % 4294967296); {27733#false} is VALID [2022-02-21 03:10:20,572 INFO L290 TraceCheckUtils]: 40: Hoare triple {27733#false} assume main_~a~0#1 % 4294967296 > main_~zero~0#1 % 4294967296;main_~tmp~2#1 := 1; {27733#false} is VALID [2022-02-21 03:10:20,572 INFO L290 TraceCheckUtils]: 41: Hoare triple {27733#false} main_~sa~0#1 := main_~tmp~2#1; {27733#false} is VALID [2022-02-21 03:10:20,572 INFO L290 TraceCheckUtils]: 42: Hoare triple {27733#false} assume !(main_~b~0#1 % 4294967296 < main_~zero~0#1 % 4294967296); {27733#false} is VALID [2022-02-21 03:10:20,572 INFO L290 TraceCheckUtils]: 43: Hoare triple {27733#false} assume main_~b~0#1 % 4294967296 > main_~zero~0#1 % 4294967296;main_~tmp___0~0#1 := 1; {27733#false} is VALID [2022-02-21 03:10:20,572 INFO L290 TraceCheckUtils]: 44: Hoare triple {27733#false} main_~sb~0#1 := main_~tmp___0~0#1; {27733#false} is VALID [2022-02-21 03:10:20,572 INFO L290 TraceCheckUtils]: 45: Hoare triple {27733#false} assume { :begin_inline_addflt } true;addflt_#in~a#1, addflt_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc addflt_#res#1;havoc addflt_#t~nondet6#1, addflt_#t~nondet7#1, addflt_#t~nondet8#1, addflt_#t~nondet9#1, addflt_#t~nondet10#1, addflt_#t~nondet11#1, addflt_~a#1, addflt_~b#1, addflt_~res~1#1, addflt_~ma~0#1, addflt_~mb~0#1, addflt_~delta~0#1, addflt_~ea~0#1, addflt_~eb~0#1, addflt_~tmp~0#1, addflt_~__retres10~0#1;addflt_~a#1 := addflt_#in~a#1;addflt_~b#1 := addflt_#in~b#1;havoc addflt_~res~1#1;havoc addflt_~ma~0#1;havoc addflt_~mb~0#1;havoc addflt_~delta~0#1;havoc addflt_~ea~0#1;havoc addflt_~eb~0#1;havoc addflt_~tmp~0#1;havoc addflt_~__retres10~0#1; {27733#false} is VALID [2022-02-21 03:10:20,572 INFO L290 TraceCheckUtils]: 46: Hoare triple {27733#false} assume !(addflt_~a#1 % 4294967296 < addflt_~b#1 % 4294967296); {27733#false} is VALID [2022-02-21 03:10:20,572 INFO L290 TraceCheckUtils]: 47: Hoare triple {27733#false} assume !(0 == addflt_~b#1 % 4294967296); {27733#false} is VALID [2022-02-21 03:10:20,572 INFO L290 TraceCheckUtils]: 48: Hoare triple {27733#false} assume !(0 == addflt_~a#1); {27733#false} is VALID [2022-02-21 03:10:20,572 INFO L290 TraceCheckUtils]: 49: Hoare triple {27733#false} assume !false; {27733#false} is VALID [2022-02-21 03:10:20,572 INFO L290 TraceCheckUtils]: 50: Hoare triple {27733#false} assume !false; {27733#false} is VALID [2022-02-21 03:10:20,573 INFO L290 TraceCheckUtils]: 51: Hoare triple {27733#false} assume addflt_~a#1 >= 0;abs_109 := (if addflt_~a#1 < 16777215 then addflt_~a#1 else 16777215);assume addflt_~a#1 >= 0;assume addflt_~ma~0#1 < abs_109; {27733#false} is VALID [2022-02-21 03:10:20,573 INFO L290 TraceCheckUtils]: 52: Hoare triple {27733#false} assume (if addflt_~a#1 / 16777216 % 4294967296 % 4294967296 <= 2147483647 then addflt_~a#1 / 16777216 % 4294967296 % 4294967296 else addflt_~a#1 / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 <= 2147483647; {27733#false} is VALID [2022-02-21 03:10:20,573 INFO L290 TraceCheckUtils]: 53: Hoare triple {27733#false} assume !((if addflt_~a#1 / 16777216 % 4294967296 % 4294967296 <= 2147483647 then addflt_~a#1 / 16777216 % 4294967296 % 4294967296 else addflt_~a#1 / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 >= -2147483648); {27733#false} is VALID [2022-02-21 03:10:20,573 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-02-21 03:10:20,573 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:10:20,573 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982640199] [2022-02-21 03:10:20,573 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1982640199] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:10:20,573 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1639463238] [2022-02-21 03:10:20,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:10:20,573 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:10:20,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:10:20,574 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:10:20,575 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-02-21 03:10:20,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:20,635 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-21 03:10:20,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:20,644 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:10:20,723 INFO L290 TraceCheckUtils]: 0: Hoare triple {27732#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(24, 2);call #Ultimate.allocInit(12, 3); {27732#true} is VALID [2022-02-21 03:10:20,723 INFO L290 TraceCheckUtils]: 1: Hoare triple {27732#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_~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_add~0#1, main_~zero~0#1, main_~sa~0#1, main_~sb~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~tmp___1~0#1, main_~tmp___2~0#1, main_~tmp___3~0#1, main_~tmp___4~0#1, main_~tmp___5~0#1, main_~tmp___6~0#1, main_~tmp___7~0#1, main_~tmp___8~0#1, main_~tmp___9~0#1, main_~__retres23~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_add~0#1;havoc main_~zero~0#1;havoc main_~sa~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_~tmp___2~0#1;havoc main_~tmp___3~0#1;havoc main_~tmp___4~0#1;havoc main_~tmp___5~0#1;havoc main_~tmp___6~0#1;havoc main_~tmp___7~0#1;havoc main_~tmp___8~0#1;havoc main_~tmp___9~0#1;havoc main_~__retres23~0#1; {27732#true} is VALID [2022-02-21 03:10:20,724 INFO L272 TraceCheckUtils]: 2: Hoare triple {27732#true} call main_#t~ret22#1 := base2flt(0, 0); {27732#true} is VALID [2022-02-21 03:10:20,724 INFO L290 TraceCheckUtils]: 3: Hoare triple {27732#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {27732#true} is VALID [2022-02-21 03:10:20,724 INFO L290 TraceCheckUtils]: 4: Hoare triple {27732#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {27732#true} is VALID [2022-02-21 03:10:20,724 INFO L290 TraceCheckUtils]: 5: Hoare triple {27732#true} #res := ~__retres4~0; {27732#true} is VALID [2022-02-21 03:10:20,724 INFO L290 TraceCheckUtils]: 6: Hoare triple {27732#true} assume true; {27732#true} is VALID [2022-02-21 03:10:20,724 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {27732#true} {27732#true} #453#return; {27732#true} is VALID [2022-02-21 03:10:20,724 INFO L290 TraceCheckUtils]: 8: Hoare triple {27732#true} main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1; {27732#true} is VALID [2022-02-21 03:10:20,724 INFO L272 TraceCheckUtils]: 9: Hoare triple {27732#true} call main_#t~ret23#1 := base2flt(main_~ma~2#1, main_~ea~2#1); {27732#true} is VALID [2022-02-21 03:10:20,724 INFO L290 TraceCheckUtils]: 10: Hoare triple {27732#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {27732#true} is VALID [2022-02-21 03:10:20,724 INFO L290 TraceCheckUtils]: 11: Hoare triple {27732#true} assume !(0 == ~m % 4294967296); {27732#true} is VALID [2022-02-21 03:10:20,724 INFO L290 TraceCheckUtils]: 12: Hoare triple {27732#true} assume !(~m % 4294967296 < 16777216); {27732#true} is VALID [2022-02-21 03:10:20,724 INFO L290 TraceCheckUtils]: 13: Hoare triple {27732#true} assume !false; {27732#true} is VALID [2022-02-21 03:10:20,724 INFO L290 TraceCheckUtils]: 14: Hoare triple {27732#true} assume !(~m % 4294967296 >= 33554432); {27732#true} is VALID [2022-02-21 03:10:20,725 INFO L290 TraceCheckUtils]: 15: Hoare triple {27732#true} assume 0 == ~m || 0 == ~bitwiseComplement(16777216);~m := 0; {27766#(= base2flt_~m 0)} is VALID [2022-02-21 03:10:20,725 INFO L290 TraceCheckUtils]: 16: Hoare triple {27766#(= base2flt_~m 0)} assume 128 + ~e <= 2147483647; {27766#(= base2flt_~m 0)} is VALID [2022-02-21 03:10:20,725 INFO L290 TraceCheckUtils]: 17: Hoare triple {27766#(= base2flt_~m 0)} assume 128 + ~e >= -2147483648; {27766#(= base2flt_~m 0)} is VALID [2022-02-21 03:10:20,725 INFO L290 TraceCheckUtils]: 18: Hoare triple {27766#(= base2flt_~m 0)} assume 128 + ~e <= 2147483647; {27766#(= base2flt_~m 0)} is VALID [2022-02-21 03:10:20,726 INFO L290 TraceCheckUtils]: 19: Hoare triple {27766#(= base2flt_~m 0)} assume 128 + ~e >= -2147483648; {27766#(= base2flt_~m 0)} is VALID [2022-02-21 03:10:20,726 INFO L290 TraceCheckUtils]: 20: Hoare triple {27766#(= base2flt_~m 0)} assume !((1 == ~m && (0 == 16777216 * (128 + ~e) || 1 == 16777216 * (128 + ~e))) || ((0 == ~m || 1 == ~m) && 1 == 16777216 * (128 + ~e))); {27766#(= base2flt_~m 0)} is VALID [2022-02-21 03:10:20,726 INFO L290 TraceCheckUtils]: 21: Hoare triple {27766#(= base2flt_~m 0)} assume !(0 == ~m && (0 == 16777216 * (128 + ~e) || 1 == 16777216 * (128 + ~e))); {27768#(not (= (+ 128 base2flt_~e) 0))} is VALID [2022-02-21 03:10:20,727 INFO L290 TraceCheckUtils]: 22: Hoare triple {27768#(not (= (+ 128 base2flt_~e) 0))} assume (0 == ~m || 1 == ~m) && 0 == 16777216 * (128 + ~e);~res~0 := ~m; {27733#false} is VALID [2022-02-21 03:10:20,727 INFO L290 TraceCheckUtils]: 23: Hoare triple {27733#false} ~__retres4~0 := ~res~0; {27733#false} is VALID [2022-02-21 03:10:20,727 INFO L290 TraceCheckUtils]: 24: Hoare triple {27733#false} #res := ~__retres4~0; {27733#false} is VALID [2022-02-21 03:10:20,727 INFO L290 TraceCheckUtils]: 25: Hoare triple {27733#false} assume true; {27733#false} is VALID [2022-02-21 03:10:20,727 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {27733#false} {27732#true} #455#return; {27733#false} is VALID [2022-02-21 03:10:20,727 INFO L290 TraceCheckUtils]: 27: Hoare triple {27733#false} main_~a~0#1 := main_#t~ret23#1;havoc main_#t~ret23#1; {27733#false} is VALID [2022-02-21 03:10:20,727 INFO L272 TraceCheckUtils]: 28: Hoare triple {27733#false} call main_#t~ret24#1 := base2flt(main_~mb~2#1, main_~eb~2#1); {27733#false} is VALID [2022-02-21 03:10:20,727 INFO L290 TraceCheckUtils]: 29: Hoare triple {27733#false} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {27733#false} is VALID [2022-02-21 03:10:20,727 INFO L290 TraceCheckUtils]: 30: Hoare triple {27733#false} assume !(0 == ~m % 4294967296); {27733#false} is VALID [2022-02-21 03:10:20,727 INFO L290 TraceCheckUtils]: 31: Hoare triple {27733#false} assume !(~m % 4294967296 < 16777216); {27733#false} is VALID [2022-02-21 03:10:20,727 INFO L290 TraceCheckUtils]: 32: Hoare triple {27733#false} assume !false; {27733#false} is VALID [2022-02-21 03:10:20,727 INFO L290 TraceCheckUtils]: 33: Hoare triple {27733#false} assume ~m % 4294967296 >= 33554432; {27733#false} is VALID [2022-02-21 03:10:20,727 INFO L290 TraceCheckUtils]: 34: Hoare triple {27733#false} assume ~e >= 127;~__retres4~0 := 4294967295; {27733#false} is VALID [2022-02-21 03:10:20,727 INFO L290 TraceCheckUtils]: 35: Hoare triple {27733#false} #res := ~__retres4~0; {27733#false} is VALID [2022-02-21 03:10:20,727 INFO L290 TraceCheckUtils]: 36: Hoare triple {27733#false} assume true; {27733#false} is VALID [2022-02-21 03:10:20,727 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {27733#false} {27733#false} #457#return; {27733#false} is VALID [2022-02-21 03:10:20,728 INFO L290 TraceCheckUtils]: 38: Hoare triple {27733#false} main_~b~0#1 := main_#t~ret24#1;havoc main_#t~ret24#1; {27733#false} is VALID [2022-02-21 03:10:20,728 INFO L290 TraceCheckUtils]: 39: Hoare triple {27733#false} assume !(main_~a~0#1 % 4294967296 < main_~zero~0#1 % 4294967296); {27733#false} is VALID [2022-02-21 03:10:20,728 INFO L290 TraceCheckUtils]: 40: Hoare triple {27733#false} assume main_~a~0#1 % 4294967296 > main_~zero~0#1 % 4294967296;main_~tmp~2#1 := 1; {27733#false} is VALID [2022-02-21 03:10:20,728 INFO L290 TraceCheckUtils]: 41: Hoare triple {27733#false} main_~sa~0#1 := main_~tmp~2#1; {27733#false} is VALID [2022-02-21 03:10:20,728 INFO L290 TraceCheckUtils]: 42: Hoare triple {27733#false} assume !(main_~b~0#1 % 4294967296 < main_~zero~0#1 % 4294967296); {27733#false} is VALID [2022-02-21 03:10:20,728 INFO L290 TraceCheckUtils]: 43: Hoare triple {27733#false} assume main_~b~0#1 % 4294967296 > main_~zero~0#1 % 4294967296;main_~tmp___0~0#1 := 1; {27733#false} is VALID [2022-02-21 03:10:20,728 INFO L290 TraceCheckUtils]: 44: Hoare triple {27733#false} main_~sb~0#1 := main_~tmp___0~0#1; {27733#false} is VALID [2022-02-21 03:10:20,728 INFO L290 TraceCheckUtils]: 45: Hoare triple {27733#false} assume { :begin_inline_addflt } true;addflt_#in~a#1, addflt_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc addflt_#res#1;havoc addflt_#t~nondet6#1, addflt_#t~nondet7#1, addflt_#t~nondet8#1, addflt_#t~nondet9#1, addflt_#t~nondet10#1, addflt_#t~nondet11#1, addflt_~a#1, addflt_~b#1, addflt_~res~1#1, addflt_~ma~0#1, addflt_~mb~0#1, addflt_~delta~0#1, addflt_~ea~0#1, addflt_~eb~0#1, addflt_~tmp~0#1, addflt_~__retres10~0#1;addflt_~a#1 := addflt_#in~a#1;addflt_~b#1 := addflt_#in~b#1;havoc addflt_~res~1#1;havoc addflt_~ma~0#1;havoc addflt_~mb~0#1;havoc addflt_~delta~0#1;havoc addflt_~ea~0#1;havoc addflt_~eb~0#1;havoc addflt_~tmp~0#1;havoc addflt_~__retres10~0#1; {27733#false} is VALID [2022-02-21 03:10:20,728 INFO L290 TraceCheckUtils]: 46: Hoare triple {27733#false} assume !(addflt_~a#1 % 4294967296 < addflt_~b#1 % 4294967296); {27733#false} is VALID [2022-02-21 03:10:20,728 INFO L290 TraceCheckUtils]: 47: Hoare triple {27733#false} assume !(0 == addflt_~b#1 % 4294967296); {27733#false} is VALID [2022-02-21 03:10:20,728 INFO L290 TraceCheckUtils]: 48: Hoare triple {27733#false} assume !(0 == addflt_~a#1); {27733#false} is VALID [2022-02-21 03:10:20,739 INFO L290 TraceCheckUtils]: 49: Hoare triple {27733#false} assume !false; {27733#false} is VALID [2022-02-21 03:10:20,739 INFO L290 TraceCheckUtils]: 50: Hoare triple {27733#false} assume !false; {27733#false} is VALID [2022-02-21 03:10:20,739 INFO L290 TraceCheckUtils]: 51: Hoare triple {27733#false} assume addflt_~a#1 >= 0;abs_109 := (if addflt_~a#1 < 16777215 then addflt_~a#1 else 16777215);assume addflt_~a#1 >= 0;assume addflt_~ma~0#1 < abs_109; {27733#false} is VALID [2022-02-21 03:10:20,739 INFO L290 TraceCheckUtils]: 52: Hoare triple {27733#false} assume (if addflt_~a#1 / 16777216 % 4294967296 % 4294967296 <= 2147483647 then addflt_~a#1 / 16777216 % 4294967296 % 4294967296 else addflt_~a#1 / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 <= 2147483647; {27733#false} is VALID [2022-02-21 03:10:20,739 INFO L290 TraceCheckUtils]: 53: Hoare triple {27733#false} assume !((if addflt_~a#1 / 16777216 % 4294967296 % 4294967296 <= 2147483647 then addflt_~a#1 / 16777216 % 4294967296 % 4294967296 else addflt_~a#1 / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 >= -2147483648); {27733#false} is VALID [2022-02-21 03:10:20,741 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-02-21 03:10:20,742 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-21 03:10:20,742 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1639463238] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:10:20,742 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-21 03:10:20,742 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 6 [2022-02-21 03:10:20,742 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99777715] [2022-02-21 03:10:20,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:10:20,743 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 54 [2022-02-21 03:10:20,744 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:10:20,744 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-21 03:10:20,773 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:10:20,773 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-21 03:10:20,773 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:10:20,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-21 03:10:20,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-02-21 03:10:20,774 INFO L87 Difference]: Start difference. First operand 212 states and 258 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-21 03:10:21,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:21,095 INFO L93 Difference]: Finished difference Result 385 states and 475 transitions. [2022-02-21 03:10:21,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-21 03:10:21,095 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 54 [2022-02-21 03:10:21,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:10:21,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-21 03:10:21,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 266 transitions. [2022-02-21 03:10:21,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-21 03:10:21,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 266 transitions. [2022-02-21 03:10:21,099 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 266 transitions. [2022-02-21 03:10:21,249 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 266 edges. 266 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:10:21,252 INFO L225 Difference]: With dead ends: 385 [2022-02-21 03:10:21,252 INFO L226 Difference]: Without dead ends: 237 [2022-02-21 03:10:21,252 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 61 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-02-21 03:10:21,253 INFO L933 BasicCegarLoop]: 123 mSDtfsCounter, 18 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 03:10:21,253 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 334 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 03:10:21,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2022-02-21 03:10:21,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 208. [2022-02-21 03:10:21,353 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:10:21,353 INFO L82 GeneralOperation]: Start isEquivalent. First operand 237 states. Second operand has 208 states, 185 states have (on average 1.2918918918918918) internal successors, (239), 194 states have internal predecessors, (239), 7 states have call successors, (7), 4 states have call predecessors, (7), 6 states have return successors, (9), 9 states have call predecessors, (9), 7 states have call successors, (9) [2022-02-21 03:10:21,354 INFO L74 IsIncluded]: Start isIncluded. First operand 237 states. Second operand has 208 states, 185 states have (on average 1.2918918918918918) internal successors, (239), 194 states have internal predecessors, (239), 7 states have call successors, (7), 4 states have call predecessors, (7), 6 states have return successors, (9), 9 states have call predecessors, (9), 7 states have call successors, (9) [2022-02-21 03:10:21,354 INFO L87 Difference]: Start difference. First operand 237 states. Second operand has 208 states, 185 states have (on average 1.2918918918918918) internal successors, (239), 194 states have internal predecessors, (239), 7 states have call successors, (7), 4 states have call predecessors, (7), 6 states have return successors, (9), 9 states have call predecessors, (9), 7 states have call successors, (9) [2022-02-21 03:10:21,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:21,357 INFO L93 Difference]: Finished difference Result 237 states and 292 transitions. [2022-02-21 03:10:21,357 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 292 transitions. [2022-02-21 03:10:21,358 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:10:21,358 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:10:21,358 INFO L74 IsIncluded]: Start isIncluded. First operand has 208 states, 185 states have (on average 1.2918918918918918) internal successors, (239), 194 states have internal predecessors, (239), 7 states have call successors, (7), 4 states have call predecessors, (7), 6 states have return successors, (9), 9 states have call predecessors, (9), 7 states have call successors, (9) Second operand 237 states. [2022-02-21 03:10:21,358 INFO L87 Difference]: Start difference. First operand has 208 states, 185 states have (on average 1.2918918918918918) internal successors, (239), 194 states have internal predecessors, (239), 7 states have call successors, (7), 4 states have call predecessors, (7), 6 states have return successors, (9), 9 states have call predecessors, (9), 7 states have call successors, (9) Second operand 237 states. [2022-02-21 03:10:21,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:21,362 INFO L93 Difference]: Finished difference Result 237 states and 292 transitions. [2022-02-21 03:10:21,362 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 292 transitions. [2022-02-21 03:10:21,362 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:10:21,362 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:10:21,362 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:10:21,362 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:10:21,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 185 states have (on average 1.2918918918918918) internal successors, (239), 194 states have internal predecessors, (239), 7 states have call successors, (7), 4 states have call predecessors, (7), 6 states have return successors, (9), 9 states have call predecessors, (9), 7 states have call successors, (9) [2022-02-21 03:10:21,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 255 transitions. [2022-02-21 03:10:21,365 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 255 transitions. Word has length 54 [2022-02-21 03:10:21,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:10:21,365 INFO L470 AbstractCegarLoop]: Abstraction has 208 states and 255 transitions. [2022-02-21 03:10:21,366 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-21 03:10:21,366 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 255 transitions. [2022-02-21 03:10:21,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-02-21 03:10:21,366 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:10:21,366 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:10:21,385 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-02-21 03:10:21,579 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:10:21,579 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-02-21 03:10:21,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:10:21,580 INFO L85 PathProgramCache]: Analyzing trace with hash 1003371972, now seen corresponding path program 1 times [2022-02-21 03:10:21,580 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:10:21,580 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927563409] [2022-02-21 03:10:21,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:10:21,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:10:21,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:21,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-21 03:10:21,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:21,743 INFO L290 TraceCheckUtils]: 0: Hoare triple {29109#(and (= abs_77 |old(abs_77)|) (= abs_78 |old(abs_78)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {29069#true} is VALID [2022-02-21 03:10:21,744 INFO L290 TraceCheckUtils]: 1: Hoare triple {29069#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {29069#true} is VALID [2022-02-21 03:10:21,744 INFO L290 TraceCheckUtils]: 2: Hoare triple {29069#true} #res := ~__retres4~0; {29069#true} is VALID [2022-02-21 03:10:21,744 INFO L290 TraceCheckUtils]: 3: Hoare triple {29069#true} assume true; {29069#true} is VALID [2022-02-21 03:10:21,744 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {29069#true} {29069#true} #453#return; {29069#true} is VALID [2022-02-21 03:10:21,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-02-21 03:10:21,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:21,751 INFO L290 TraceCheckUtils]: 0: Hoare triple {29109#(and (= abs_77 |old(abs_77)|) (= abs_78 |old(abs_78)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {29069#true} is VALID [2022-02-21 03:10:21,751 INFO L290 TraceCheckUtils]: 1: Hoare triple {29069#true} assume !(0 == ~m % 4294967296); {29069#true} is VALID [2022-02-21 03:10:21,751 INFO L290 TraceCheckUtils]: 2: Hoare triple {29069#true} assume !(~m % 4294967296 < 16777216); {29069#true} is VALID [2022-02-21 03:10:21,751 INFO L290 TraceCheckUtils]: 3: Hoare triple {29069#true} assume !false; {29069#true} is VALID [2022-02-21 03:10:21,751 INFO L290 TraceCheckUtils]: 4: Hoare triple {29069#true} assume !(~m % 4294967296 >= 33554432); {29069#true} is VALID [2022-02-21 03:10:21,751 INFO L290 TraceCheckUtils]: 5: Hoare triple {29069#true} assume 0 == ~m || 0 == ~bitwiseComplement(16777216);~m := 0; {29069#true} is VALID [2022-02-21 03:10:21,752 INFO L290 TraceCheckUtils]: 6: Hoare triple {29069#true} assume 128 + ~e <= 2147483647; {29069#true} is VALID [2022-02-21 03:10:21,752 INFO L290 TraceCheckUtils]: 7: Hoare triple {29069#true} assume 128 + ~e >= -2147483648; {29069#true} is VALID [2022-02-21 03:10:21,752 INFO L290 TraceCheckUtils]: 8: Hoare triple {29069#true} assume 128 + ~e <= 2147483647; {29069#true} is VALID [2022-02-21 03:10:21,752 INFO L290 TraceCheckUtils]: 9: Hoare triple {29069#true} assume 128 + ~e >= -2147483648; {29069#true} is VALID [2022-02-21 03:10:21,752 INFO L290 TraceCheckUtils]: 10: Hoare triple {29069#true} assume !((1 == ~m && (0 == 16777216 * (128 + ~e) || 1 == 16777216 * (128 + ~e))) || ((0 == ~m || 1 == ~m) && 1 == 16777216 * (128 + ~e))); {29069#true} is VALID [2022-02-21 03:10:21,752 INFO L290 TraceCheckUtils]: 11: Hoare triple {29069#true} assume !(0 == ~m && (0 == 16777216 * (128 + ~e) || 1 == 16777216 * (128 + ~e))); {29069#true} is VALID [2022-02-21 03:10:21,752 INFO L290 TraceCheckUtils]: 12: Hoare triple {29069#true} assume !((0 == ~m || 1 == ~m) && 0 == 16777216 * (128 + ~e)); {29069#true} is VALID [2022-02-21 03:10:21,753 INFO L290 TraceCheckUtils]: 13: Hoare triple {29069#true} assume ~m >= 0 && 16777216 * (128 + ~e) >= 0;abs_78 := (if ~m < 16777216 * (128 + ~e) then 16777216 * (128 + ~e) else ~m);assume ~m >= 0 && 16777216 * (128 + ~e) >= 0;assume ~res~0 >= abs_78; {29069#true} is VALID [2022-02-21 03:10:21,753 INFO L290 TraceCheckUtils]: 14: Hoare triple {29069#true} ~__retres4~0 := ~res~0; {29069#true} is VALID [2022-02-21 03:10:21,754 INFO L290 TraceCheckUtils]: 15: Hoare triple {29069#true} #res := ~__retres4~0; {29069#true} is VALID [2022-02-21 03:10:21,754 INFO L290 TraceCheckUtils]: 16: Hoare triple {29069#true} assume true; {29069#true} is VALID [2022-02-21 03:10:21,754 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {29069#true} {29069#true} #455#return; {29069#true} is VALID [2022-02-21 03:10:21,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-02-21 03:10:21,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:21,786 INFO L290 TraceCheckUtils]: 0: Hoare triple {29109#(and (= abs_77 |old(abs_77)|) (= abs_78 |old(abs_78)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {29069#true} is VALID [2022-02-21 03:10:21,786 INFO L290 TraceCheckUtils]: 1: Hoare triple {29069#true} assume !(0 == ~m % 4294967296); {29069#true} is VALID [2022-02-21 03:10:21,786 INFO L290 TraceCheckUtils]: 2: Hoare triple {29069#true} assume !(~m % 4294967296 < 16777216); {29069#true} is VALID [2022-02-21 03:10:21,786 INFO L290 TraceCheckUtils]: 3: Hoare triple {29069#true} assume !false; {29069#true} is VALID [2022-02-21 03:10:21,787 INFO L290 TraceCheckUtils]: 4: Hoare triple {29069#true} assume ~m % 4294967296 >= 33554432; {29069#true} is VALID [2022-02-21 03:10:21,787 INFO L290 TraceCheckUtils]: 5: Hoare triple {29069#true} assume ~e >= 127;~__retres4~0 := 4294967295; {29110#(and (<= base2flt_~__retres4~0 4294967295) (<= 4294967295 base2flt_~__retres4~0))} is VALID [2022-02-21 03:10:21,787 INFO L290 TraceCheckUtils]: 6: Hoare triple {29110#(and (<= base2flt_~__retres4~0 4294967295) (<= 4294967295 base2flt_~__retres4~0))} #res := ~__retres4~0; {29111#(and (<= |base2flt_#res| 4294967295) (<= 4294967295 |base2flt_#res|))} is VALID [2022-02-21 03:10:21,788 INFO L290 TraceCheckUtils]: 7: Hoare triple {29111#(and (<= |base2flt_#res| 4294967295) (<= 4294967295 |base2flt_#res|))} assume true; {29111#(and (<= |base2flt_#res| 4294967295) (<= 4294967295 |base2flt_#res|))} is VALID [2022-02-21 03:10:21,788 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {29111#(and (<= |base2flt_#res| 4294967295) (<= 4294967295 |base2flt_#res|))} {29069#true} #457#return; {29103#(and (<= 4294967295 |ULTIMATE.start_main_#t~ret24#1|) (<= |ULTIMATE.start_main_#t~ret24#1| 4294967295))} is VALID [2022-02-21 03:10:21,789 INFO L290 TraceCheckUtils]: 0: Hoare triple {29069#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(24, 2);call #Ultimate.allocInit(12, 3); {29069#true} is VALID [2022-02-21 03:10:21,789 INFO L290 TraceCheckUtils]: 1: Hoare triple {29069#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_~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_add~0#1, main_~zero~0#1, main_~sa~0#1, main_~sb~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~tmp___1~0#1, main_~tmp___2~0#1, main_~tmp___3~0#1, main_~tmp___4~0#1, main_~tmp___5~0#1, main_~tmp___6~0#1, main_~tmp___7~0#1, main_~tmp___8~0#1, main_~tmp___9~0#1, main_~__retres23~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_add~0#1;havoc main_~zero~0#1;havoc main_~sa~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_~tmp___2~0#1;havoc main_~tmp___3~0#1;havoc main_~tmp___4~0#1;havoc main_~tmp___5~0#1;havoc main_~tmp___6~0#1;havoc main_~tmp___7~0#1;havoc main_~tmp___8~0#1;havoc main_~tmp___9~0#1;havoc main_~__retres23~0#1; {29069#true} is VALID [2022-02-21 03:10:21,789 INFO L272 TraceCheckUtils]: 2: Hoare triple {29069#true} call main_#t~ret22#1 := base2flt(0, 0); {29109#(and (= abs_77 |old(abs_77)|) (= abs_78 |old(abs_78)|))} is VALID [2022-02-21 03:10:21,789 INFO L290 TraceCheckUtils]: 3: Hoare triple {29109#(and (= abs_77 |old(abs_77)|) (= abs_78 |old(abs_78)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {29069#true} is VALID [2022-02-21 03:10:21,790 INFO L290 TraceCheckUtils]: 4: Hoare triple {29069#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {29069#true} is VALID [2022-02-21 03:10:21,790 INFO L290 TraceCheckUtils]: 5: Hoare triple {29069#true} #res := ~__retres4~0; {29069#true} is VALID [2022-02-21 03:10:21,790 INFO L290 TraceCheckUtils]: 6: Hoare triple {29069#true} assume true; {29069#true} is VALID [2022-02-21 03:10:21,790 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {29069#true} {29069#true} #453#return; {29069#true} is VALID [2022-02-21 03:10:21,790 INFO L290 TraceCheckUtils]: 8: Hoare triple {29069#true} main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1; {29069#true} is VALID [2022-02-21 03:10:21,791 INFO L272 TraceCheckUtils]: 9: Hoare triple {29069#true} call main_#t~ret23#1 := base2flt(main_~ma~2#1, main_~ea~2#1); {29109#(and (= abs_77 |old(abs_77)|) (= abs_78 |old(abs_78)|))} is VALID [2022-02-21 03:10:21,791 INFO L290 TraceCheckUtils]: 10: Hoare triple {29109#(and (= abs_77 |old(abs_77)|) (= abs_78 |old(abs_78)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {29069#true} is VALID [2022-02-21 03:10:21,791 INFO L290 TraceCheckUtils]: 11: Hoare triple {29069#true} assume !(0 == ~m % 4294967296); {29069#true} is VALID [2022-02-21 03:10:21,791 INFO L290 TraceCheckUtils]: 12: Hoare triple {29069#true} assume !(~m % 4294967296 < 16777216); {29069#true} is VALID [2022-02-21 03:10:21,791 INFO L290 TraceCheckUtils]: 13: Hoare triple {29069#true} assume !false; {29069#true} is VALID [2022-02-21 03:10:21,791 INFO L290 TraceCheckUtils]: 14: Hoare triple {29069#true} assume !(~m % 4294967296 >= 33554432); {29069#true} is VALID [2022-02-21 03:10:21,791 INFO L290 TraceCheckUtils]: 15: Hoare triple {29069#true} assume 0 == ~m || 0 == ~bitwiseComplement(16777216);~m := 0; {29069#true} is VALID [2022-02-21 03:10:21,791 INFO L290 TraceCheckUtils]: 16: Hoare triple {29069#true} assume 128 + ~e <= 2147483647; {29069#true} is VALID [2022-02-21 03:10:21,791 INFO L290 TraceCheckUtils]: 17: Hoare triple {29069#true} assume 128 + ~e >= -2147483648; {29069#true} is VALID [2022-02-21 03:10:21,792 INFO L290 TraceCheckUtils]: 18: Hoare triple {29069#true} assume 128 + ~e <= 2147483647; {29069#true} is VALID [2022-02-21 03:10:21,792 INFO L290 TraceCheckUtils]: 19: Hoare triple {29069#true} assume 128 + ~e >= -2147483648; {29069#true} is VALID [2022-02-21 03:10:21,792 INFO L290 TraceCheckUtils]: 20: Hoare triple {29069#true} assume !((1 == ~m && (0 == 16777216 * (128 + ~e) || 1 == 16777216 * (128 + ~e))) || ((0 == ~m || 1 == ~m) && 1 == 16777216 * (128 + ~e))); {29069#true} is VALID [2022-02-21 03:10:21,792 INFO L290 TraceCheckUtils]: 21: Hoare triple {29069#true} assume !(0 == ~m && (0 == 16777216 * (128 + ~e) || 1 == 16777216 * (128 + ~e))); {29069#true} is VALID [2022-02-21 03:10:21,792 INFO L290 TraceCheckUtils]: 22: Hoare triple {29069#true} assume !((0 == ~m || 1 == ~m) && 0 == 16777216 * (128 + ~e)); {29069#true} is VALID [2022-02-21 03:10:21,792 INFO L290 TraceCheckUtils]: 23: Hoare triple {29069#true} assume ~m >= 0 && 16777216 * (128 + ~e) >= 0;abs_78 := (if ~m < 16777216 * (128 + ~e) then 16777216 * (128 + ~e) else ~m);assume ~m >= 0 && 16777216 * (128 + ~e) >= 0;assume ~res~0 >= abs_78; {29069#true} is VALID [2022-02-21 03:10:21,792 INFO L290 TraceCheckUtils]: 24: Hoare triple {29069#true} ~__retres4~0 := ~res~0; {29069#true} is VALID [2022-02-21 03:10:21,792 INFO L290 TraceCheckUtils]: 25: Hoare triple {29069#true} #res := ~__retres4~0; {29069#true} is VALID [2022-02-21 03:10:21,792 INFO L290 TraceCheckUtils]: 26: Hoare triple {29069#true} assume true; {29069#true} is VALID [2022-02-21 03:10:21,793 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {29069#true} {29069#true} #455#return; {29069#true} is VALID [2022-02-21 03:10:21,793 INFO L290 TraceCheckUtils]: 28: Hoare triple {29069#true} main_~a~0#1 := main_#t~ret23#1;havoc main_#t~ret23#1; {29069#true} is VALID [2022-02-21 03:10:21,793 INFO L272 TraceCheckUtils]: 29: Hoare triple {29069#true} call main_#t~ret24#1 := base2flt(main_~mb~2#1, main_~eb~2#1); {29109#(and (= abs_77 |old(abs_77)|) (= abs_78 |old(abs_78)|))} is VALID [2022-02-21 03:10:21,793 INFO L290 TraceCheckUtils]: 30: Hoare triple {29109#(and (= abs_77 |old(abs_77)|) (= abs_78 |old(abs_78)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {29069#true} is VALID [2022-02-21 03:10:21,794 INFO L290 TraceCheckUtils]: 31: Hoare triple {29069#true} assume !(0 == ~m % 4294967296); {29069#true} is VALID [2022-02-21 03:10:21,794 INFO L290 TraceCheckUtils]: 32: Hoare triple {29069#true} assume !(~m % 4294967296 < 16777216); {29069#true} is VALID [2022-02-21 03:10:21,794 INFO L290 TraceCheckUtils]: 33: Hoare triple {29069#true} assume !false; {29069#true} is VALID [2022-02-21 03:10:21,794 INFO L290 TraceCheckUtils]: 34: Hoare triple {29069#true} assume ~m % 4294967296 >= 33554432; {29069#true} is VALID [2022-02-21 03:10:21,794 INFO L290 TraceCheckUtils]: 35: Hoare triple {29069#true} assume ~e >= 127;~__retres4~0 := 4294967295; {29110#(and (<= base2flt_~__retres4~0 4294967295) (<= 4294967295 base2flt_~__retres4~0))} is VALID [2022-02-21 03:10:21,795 INFO L290 TraceCheckUtils]: 36: Hoare triple {29110#(and (<= base2flt_~__retres4~0 4294967295) (<= 4294967295 base2flt_~__retres4~0))} #res := ~__retres4~0; {29111#(and (<= |base2flt_#res| 4294967295) (<= 4294967295 |base2flt_#res|))} is VALID [2022-02-21 03:10:21,795 INFO L290 TraceCheckUtils]: 37: Hoare triple {29111#(and (<= |base2flt_#res| 4294967295) (<= 4294967295 |base2flt_#res|))} assume true; {29111#(and (<= |base2flt_#res| 4294967295) (<= 4294967295 |base2flt_#res|))} is VALID [2022-02-21 03:10:21,796 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {29111#(and (<= |base2flt_#res| 4294967295) (<= 4294967295 |base2flt_#res|))} {29069#true} #457#return; {29103#(and (<= 4294967295 |ULTIMATE.start_main_#t~ret24#1|) (<= |ULTIMATE.start_main_#t~ret24#1| 4294967295))} is VALID [2022-02-21 03:10:21,796 INFO L290 TraceCheckUtils]: 39: Hoare triple {29103#(and (<= 4294967295 |ULTIMATE.start_main_#t~ret24#1|) (<= |ULTIMATE.start_main_#t~ret24#1| 4294967295))} main_~b~0#1 := main_#t~ret24#1;havoc main_#t~ret24#1; {29104#(and (<= 4294967295 |ULTIMATE.start_main_~b~0#1|) (<= |ULTIMATE.start_main_~b~0#1| 4294967295))} is VALID [2022-02-21 03:10:21,796 INFO L290 TraceCheckUtils]: 40: Hoare triple {29104#(and (<= 4294967295 |ULTIMATE.start_main_~b~0#1|) (<= |ULTIMATE.start_main_~b~0#1| 4294967295))} assume !(main_~a~0#1 % 4294967296 < main_~zero~0#1 % 4294967296); {29104#(and (<= 4294967295 |ULTIMATE.start_main_~b~0#1|) (<= |ULTIMATE.start_main_~b~0#1| 4294967295))} is VALID [2022-02-21 03:10:21,797 INFO L290 TraceCheckUtils]: 41: Hoare triple {29104#(and (<= 4294967295 |ULTIMATE.start_main_~b~0#1|) (<= |ULTIMATE.start_main_~b~0#1| 4294967295))} assume main_~a~0#1 % 4294967296 > main_~zero~0#1 % 4294967296;main_~tmp~2#1 := 1; {29104#(and (<= 4294967295 |ULTIMATE.start_main_~b~0#1|) (<= |ULTIMATE.start_main_~b~0#1| 4294967295))} is VALID [2022-02-21 03:10:21,797 INFO L290 TraceCheckUtils]: 42: Hoare triple {29104#(and (<= 4294967295 |ULTIMATE.start_main_~b~0#1|) (<= |ULTIMATE.start_main_~b~0#1| 4294967295))} main_~sa~0#1 := main_~tmp~2#1; {29104#(and (<= 4294967295 |ULTIMATE.start_main_~b~0#1|) (<= |ULTIMATE.start_main_~b~0#1| 4294967295))} is VALID [2022-02-21 03:10:21,798 INFO L290 TraceCheckUtils]: 43: Hoare triple {29104#(and (<= 4294967295 |ULTIMATE.start_main_~b~0#1|) (<= |ULTIMATE.start_main_~b~0#1| 4294967295))} assume !(main_~b~0#1 % 4294967296 < main_~zero~0#1 % 4294967296); {29104#(and (<= 4294967295 |ULTIMATE.start_main_~b~0#1|) (<= |ULTIMATE.start_main_~b~0#1| 4294967295))} is VALID [2022-02-21 03:10:21,798 INFO L290 TraceCheckUtils]: 44: Hoare triple {29104#(and (<= 4294967295 |ULTIMATE.start_main_~b~0#1|) (<= |ULTIMATE.start_main_~b~0#1| 4294967295))} assume main_~b~0#1 % 4294967296 > main_~zero~0#1 % 4294967296;main_~tmp___0~0#1 := 1; {29104#(and (<= 4294967295 |ULTIMATE.start_main_~b~0#1|) (<= |ULTIMATE.start_main_~b~0#1| 4294967295))} is VALID [2022-02-21 03:10:21,798 INFO L290 TraceCheckUtils]: 45: Hoare triple {29104#(and (<= 4294967295 |ULTIMATE.start_main_~b~0#1|) (<= |ULTIMATE.start_main_~b~0#1| 4294967295))} main_~sb~0#1 := main_~tmp___0~0#1; {29104#(and (<= 4294967295 |ULTIMATE.start_main_~b~0#1|) (<= |ULTIMATE.start_main_~b~0#1| 4294967295))} is VALID [2022-02-21 03:10:21,799 INFO L290 TraceCheckUtils]: 46: Hoare triple {29104#(and (<= 4294967295 |ULTIMATE.start_main_~b~0#1|) (<= |ULTIMATE.start_main_~b~0#1| 4294967295))} assume { :begin_inline_addflt } true;addflt_#in~a#1, addflt_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc addflt_#res#1;havoc addflt_#t~nondet6#1, addflt_#t~nondet7#1, addflt_#t~nondet8#1, addflt_#t~nondet9#1, addflt_#t~nondet10#1, addflt_#t~nondet11#1, addflt_~a#1, addflt_~b#1, addflt_~res~1#1, addflt_~ma~0#1, addflt_~mb~0#1, addflt_~delta~0#1, addflt_~ea~0#1, addflt_~eb~0#1, addflt_~tmp~0#1, addflt_~__retres10~0#1;addflt_~a#1 := addflt_#in~a#1;addflt_~b#1 := addflt_#in~b#1;havoc addflt_~res~1#1;havoc addflt_~ma~0#1;havoc addflt_~mb~0#1;havoc addflt_~delta~0#1;havoc addflt_~ea~0#1;havoc addflt_~eb~0#1;havoc addflt_~tmp~0#1;havoc addflt_~__retres10~0#1; {29105#(and (or (<= 4294967295 |ULTIMATE.start_addflt_~b#1|) (<= (div |ULTIMATE.start_addflt_~a#1| 4294967296) (+ (* 16777216 (div (div |ULTIMATE.start_addflt_~a#1| 16777216) 4294967296)) 8388607))) (<= |ULTIMATE.start_addflt_~b#1| 4294967295))} is VALID [2022-02-21 03:10:21,800 INFO L290 TraceCheckUtils]: 47: Hoare triple {29105#(and (or (<= 4294967295 |ULTIMATE.start_addflt_~b#1|) (<= (div |ULTIMATE.start_addflt_~a#1| 4294967296) (+ (* 16777216 (div (div |ULTIMATE.start_addflt_~a#1| 16777216) 4294967296)) 8388607))) (<= |ULTIMATE.start_addflt_~b#1| 4294967295))} assume !(addflt_~a#1 % 4294967296 < addflt_~b#1 % 4294967296); {29106#(and (<= (div |ULTIMATE.start_addflt_~b#1| 4294967296) 0) (or (<= (div |ULTIMATE.start_addflt_~a#1| 4294967296) (+ (* 16777216 (div (div |ULTIMATE.start_addflt_~a#1| 16777216) 4294967296)) 8388607)) (<= (+ 4294967295 (* (div |ULTIMATE.start_addflt_~a#1| 4294967296) 4294967296)) (+ (* 4294967296 (div |ULTIMATE.start_addflt_~b#1| 4294967296)) |ULTIMATE.start_addflt_~a#1|))))} is VALID [2022-02-21 03:10:21,800 INFO L290 TraceCheckUtils]: 48: Hoare triple {29106#(and (<= (div |ULTIMATE.start_addflt_~b#1| 4294967296) 0) (or (<= (div |ULTIMATE.start_addflt_~a#1| 4294967296) (+ (* 16777216 (div (div |ULTIMATE.start_addflt_~a#1| 16777216) 4294967296)) 8388607)) (<= (+ 4294967295 (* (div |ULTIMATE.start_addflt_~a#1| 4294967296) 4294967296)) (+ (* 4294967296 (div |ULTIMATE.start_addflt_~b#1| 4294967296)) |ULTIMATE.start_addflt_~a#1|))))} assume !(0 == addflt_~b#1 % 4294967296); {29107#(or (<= (+ 4294967295 (* (div |ULTIMATE.start_addflt_~a#1| 4294967296) 4294967296)) |ULTIMATE.start_addflt_~a#1|) (<= (div |ULTIMATE.start_addflt_~a#1| 4294967296) (+ (* 16777216 (div (div |ULTIMATE.start_addflt_~a#1| 16777216) 4294967296)) 8388607)))} is VALID [2022-02-21 03:10:21,801 INFO L290 TraceCheckUtils]: 49: Hoare triple {29107#(or (<= (+ 4294967295 (* (div |ULTIMATE.start_addflt_~a#1| 4294967296) 4294967296)) |ULTIMATE.start_addflt_~a#1|) (<= (div |ULTIMATE.start_addflt_~a#1| 4294967296) (+ (* 16777216 (div (div |ULTIMATE.start_addflt_~a#1| 16777216) 4294967296)) 8388607)))} assume !(0 == addflt_~a#1); {29107#(or (<= (+ 4294967295 (* (div |ULTIMATE.start_addflt_~a#1| 4294967296) 4294967296)) |ULTIMATE.start_addflt_~a#1|) (<= (div |ULTIMATE.start_addflt_~a#1| 4294967296) (+ (* 16777216 (div (div |ULTIMATE.start_addflt_~a#1| 16777216) 4294967296)) 8388607)))} is VALID [2022-02-21 03:10:21,801 INFO L290 TraceCheckUtils]: 50: Hoare triple {29107#(or (<= (+ 4294967295 (* (div |ULTIMATE.start_addflt_~a#1| 4294967296) 4294967296)) |ULTIMATE.start_addflt_~a#1|) (<= (div |ULTIMATE.start_addflt_~a#1| 4294967296) (+ (* 16777216 (div (div |ULTIMATE.start_addflt_~a#1| 16777216) 4294967296)) 8388607)))} assume !false; {29107#(or (<= (+ 4294967295 (* (div |ULTIMATE.start_addflt_~a#1| 4294967296) 4294967296)) |ULTIMATE.start_addflt_~a#1|) (<= (div |ULTIMATE.start_addflt_~a#1| 4294967296) (+ (* 16777216 (div (div |ULTIMATE.start_addflt_~a#1| 16777216) 4294967296)) 8388607)))} is VALID [2022-02-21 03:10:21,802 INFO L290 TraceCheckUtils]: 51: Hoare triple {29107#(or (<= (+ 4294967295 (* (div |ULTIMATE.start_addflt_~a#1| 4294967296) 4294967296)) |ULTIMATE.start_addflt_~a#1|) (<= (div |ULTIMATE.start_addflt_~a#1| 4294967296) (+ (* 16777216 (div (div |ULTIMATE.start_addflt_~a#1| 16777216) 4294967296)) 8388607)))} assume !false; {29107#(or (<= (+ 4294967295 (* (div |ULTIMATE.start_addflt_~a#1| 4294967296) 4294967296)) |ULTIMATE.start_addflt_~a#1|) (<= (div |ULTIMATE.start_addflt_~a#1| 4294967296) (+ (* 16777216 (div (div |ULTIMATE.start_addflt_~a#1| 16777216) 4294967296)) 8388607)))} is VALID [2022-02-21 03:10:21,802 INFO L290 TraceCheckUtils]: 52: Hoare triple {29107#(or (<= (+ 4294967295 (* (div |ULTIMATE.start_addflt_~a#1| 4294967296) 4294967296)) |ULTIMATE.start_addflt_~a#1|) (<= (div |ULTIMATE.start_addflt_~a#1| 4294967296) (+ (* 16777216 (div (div |ULTIMATE.start_addflt_~a#1| 16777216) 4294967296)) 8388607)))} assume addflt_~a#1 >= 0;abs_109 := (if addflt_~a#1 < 16777215 then addflt_~a#1 else 16777215);assume addflt_~a#1 >= 0;assume addflt_~ma~0#1 < abs_109; {29107#(or (<= (+ 4294967295 (* (div |ULTIMATE.start_addflt_~a#1| 4294967296) 4294967296)) |ULTIMATE.start_addflt_~a#1|) (<= (div |ULTIMATE.start_addflt_~a#1| 4294967296) (+ (* 16777216 (div (div |ULTIMATE.start_addflt_~a#1| 16777216) 4294967296)) 8388607)))} is VALID [2022-02-21 03:10:21,803 INFO L290 TraceCheckUtils]: 53: Hoare triple {29107#(or (<= (+ 4294967295 (* (div |ULTIMATE.start_addflt_~a#1| 4294967296) 4294967296)) |ULTIMATE.start_addflt_~a#1|) (<= (div |ULTIMATE.start_addflt_~a#1| 4294967296) (+ (* 16777216 (div (div |ULTIMATE.start_addflt_~a#1| 16777216) 4294967296)) 8388607)))} assume (if addflt_~a#1 / 16777216 % 4294967296 % 4294967296 <= 2147483647 then addflt_~a#1 / 16777216 % 4294967296 % 4294967296 else addflt_~a#1 / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 <= 2147483647; {29108#(or (<= (+ 255 (* (div |ULTIMATE.start_addflt_~a#1| 4294967296) 256)) (div |ULTIMATE.start_addflt_~a#1| 16777216)) (<= (div |ULTIMATE.start_addflt_~a#1| 4294967296) (+ (* 16777216 (div (div |ULTIMATE.start_addflt_~a#1| 16777216) 4294967296)) 8388607)))} is VALID [2022-02-21 03:10:21,804 INFO L290 TraceCheckUtils]: 54: Hoare triple {29108#(or (<= (+ 255 (* (div |ULTIMATE.start_addflt_~a#1| 4294967296) 256)) (div |ULTIMATE.start_addflt_~a#1| 16777216)) (<= (div |ULTIMATE.start_addflt_~a#1| 4294967296) (+ (* 16777216 (div (div |ULTIMATE.start_addflt_~a#1| 16777216) 4294967296)) 8388607)))} assume !((if addflt_~a#1 / 16777216 % 4294967296 % 4294967296 <= 2147483647 then addflt_~a#1 / 16777216 % 4294967296 % 4294967296 else addflt_~a#1 / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 >= -2147483648); {29070#false} is VALID [2022-02-21 03:10:21,804 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-02-21 03:10:21,804 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:10:21,804 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927563409] [2022-02-21 03:10:21,805 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1927563409] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:10:21,805 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:10:21,805 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-02-21 03:10:21,805 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731973289] [2022-02-21 03:10:21,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:10:21,806 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.2) internal successors, (42), 9 states have internal predecessors, (42), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 55 [2022-02-21 03:10:21,806 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:10:21,806 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 11 states, 10 states have (on average 4.2) internal successors, (42), 9 states have internal predecessors, (42), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-21 03:10:21,838 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:10:21,838 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-02-21 03:10:21,839 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:10:21,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-02-21 03:10:21,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-02-21 03:10:21,839 INFO L87 Difference]: Start difference. First operand 208 states and 255 transitions. Second operand has 11 states, 10 states have (on average 4.2) internal successors, (42), 9 states have internal predecessors, (42), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-21 03:10:23,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:23,078 INFO L93 Difference]: Finished difference Result 390 states and 472 transitions. [2022-02-21 03:10:23,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-21 03:10:23,078 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.2) internal successors, (42), 9 states have internal predecessors, (42), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 55 [2022-02-21 03:10:23,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:10:23,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 4.2) internal successors, (42), 9 states have internal predecessors, (42), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-21 03:10:23,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 273 transitions. [2022-02-21 03:10:23,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 4.2) internal successors, (42), 9 states have internal predecessors, (42), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-21 03:10:23,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 273 transitions. [2022-02-21 03:10:23,081 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 273 transitions. [2022-02-21 03:10:23,274 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 273 edges. 273 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:10:23,280 INFO L225 Difference]: With dead ends: 390 [2022-02-21 03:10:23,281 INFO L226 Difference]: Without dead ends: 389 [2022-02-21 03:10:23,281 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2022-02-21 03:10:23,281 INFO L933 BasicCegarLoop]: 111 mSDtfsCounter, 313 mSDsluCounter, 772 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 315 SdHoareTripleChecker+Valid, 883 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-21 03:10:23,281 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [315 Valid, 883 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-21 03:10:23,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2022-02-21 03:10:23,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 234. [2022-02-21 03:10:23,398 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:10:23,398 INFO L82 GeneralOperation]: Start isEquivalent. First operand 389 states. Second operand has 234 states, 210 states have (on average 1.2904761904761906) internal successors, (271), 218 states have internal predecessors, (271), 7 states have call successors, (7), 4 states have call predecessors, (7), 7 states have return successors, (12), 11 states have call predecessors, (12), 7 states have call successors, (12) [2022-02-21 03:10:23,399 INFO L74 IsIncluded]: Start isIncluded. First operand 389 states. Second operand has 234 states, 210 states have (on average 1.2904761904761906) internal successors, (271), 218 states have internal predecessors, (271), 7 states have call successors, (7), 4 states have call predecessors, (7), 7 states have return successors, (12), 11 states have call predecessors, (12), 7 states have call successors, (12) [2022-02-21 03:10:23,399 INFO L87 Difference]: Start difference. First operand 389 states. Second operand has 234 states, 210 states have (on average 1.2904761904761906) internal successors, (271), 218 states have internal predecessors, (271), 7 states have call successors, (7), 4 states have call predecessors, (7), 7 states have return successors, (12), 11 states have call predecessors, (12), 7 states have call successors, (12) [2022-02-21 03:10:23,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:23,405 INFO L93 Difference]: Finished difference Result 389 states and 471 transitions. [2022-02-21 03:10:23,405 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 471 transitions. [2022-02-21 03:10:23,406 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:10:23,406 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:10:23,406 INFO L74 IsIncluded]: Start isIncluded. First operand has 234 states, 210 states have (on average 1.2904761904761906) internal successors, (271), 218 states have internal predecessors, (271), 7 states have call successors, (7), 4 states have call predecessors, (7), 7 states have return successors, (12), 11 states have call predecessors, (12), 7 states have call successors, (12) Second operand 389 states. [2022-02-21 03:10:23,406 INFO L87 Difference]: Start difference. First operand has 234 states, 210 states have (on average 1.2904761904761906) internal successors, (271), 218 states have internal predecessors, (271), 7 states have call successors, (7), 4 states have call predecessors, (7), 7 states have return successors, (12), 11 states have call predecessors, (12), 7 states have call successors, (12) Second operand 389 states. [2022-02-21 03:10:23,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:23,412 INFO L93 Difference]: Finished difference Result 389 states and 471 transitions. [2022-02-21 03:10:23,412 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 471 transitions. [2022-02-21 03:10:23,413 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:10:23,413 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:10:23,413 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:10:23,413 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:10:23,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 210 states have (on average 1.2904761904761906) internal successors, (271), 218 states have internal predecessors, (271), 7 states have call successors, (7), 4 states have call predecessors, (7), 7 states have return successors, (12), 11 states have call predecessors, (12), 7 states have call successors, (12) [2022-02-21 03:10:23,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 290 transitions. [2022-02-21 03:10:23,416 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 290 transitions. Word has length 55 [2022-02-21 03:10:23,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:10:23,416 INFO L470 AbstractCegarLoop]: Abstraction has 234 states and 290 transitions. [2022-02-21 03:10:23,416 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.2) internal successors, (42), 9 states have internal predecessors, (42), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-21 03:10:23,416 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 290 transitions. [2022-02-21 03:10:23,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-02-21 03:10:23,417 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:10:23,417 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:10:23,417 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-02-21 03:10:23,417 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-02-21 03:10:23,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:10:23,418 INFO L85 PathProgramCache]: Analyzing trace with hash 1812718598, now seen corresponding path program 1 times [2022-02-21 03:10:23,418 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:10:23,418 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18092754] [2022-02-21 03:10:23,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:10:23,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:10:23,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:23,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-21 03:10:23,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:23,517 INFO L290 TraceCheckUtils]: 0: Hoare triple {30624#(and (= abs_77 |old(abs_77)|) (= abs_78 |old(abs_78)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {30585#true} is VALID [2022-02-21 03:10:23,517 INFO L290 TraceCheckUtils]: 1: Hoare triple {30585#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {30585#true} is VALID [2022-02-21 03:10:23,517 INFO L290 TraceCheckUtils]: 2: Hoare triple {30585#true} #res := ~__retres4~0; {30585#true} is VALID [2022-02-21 03:10:23,517 INFO L290 TraceCheckUtils]: 3: Hoare triple {30585#true} assume true; {30585#true} is VALID [2022-02-21 03:10:23,517 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {30585#true} {30585#true} #453#return; {30585#true} is VALID [2022-02-21 03:10:23,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-02-21 03:10:23,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:23,524 INFO L290 TraceCheckUtils]: 0: Hoare triple {30624#(and (= abs_77 |old(abs_77)|) (= abs_78 |old(abs_78)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {30585#true} is VALID [2022-02-21 03:10:23,525 INFO L290 TraceCheckUtils]: 1: Hoare triple {30585#true} assume !(0 == ~m % 4294967296); {30585#true} is VALID [2022-02-21 03:10:23,525 INFO L290 TraceCheckUtils]: 2: Hoare triple {30585#true} assume !(~m % 4294967296 < 16777216); {30585#true} is VALID [2022-02-21 03:10:23,525 INFO L290 TraceCheckUtils]: 3: Hoare triple {30585#true} assume !false; {30585#true} is VALID [2022-02-21 03:10:23,525 INFO L290 TraceCheckUtils]: 4: Hoare triple {30585#true} assume !(~m % 4294967296 >= 33554432); {30585#true} is VALID [2022-02-21 03:10:23,525 INFO L290 TraceCheckUtils]: 5: Hoare triple {30585#true} assume 0 == ~m || 0 == ~bitwiseComplement(16777216);~m := 0; {30585#true} is VALID [2022-02-21 03:10:23,525 INFO L290 TraceCheckUtils]: 6: Hoare triple {30585#true} assume 128 + ~e <= 2147483647; {30585#true} is VALID [2022-02-21 03:10:23,525 INFO L290 TraceCheckUtils]: 7: Hoare triple {30585#true} assume 128 + ~e >= -2147483648; {30585#true} is VALID [2022-02-21 03:10:23,526 INFO L290 TraceCheckUtils]: 8: Hoare triple {30585#true} assume 128 + ~e <= 2147483647; {30585#true} is VALID [2022-02-21 03:10:23,526 INFO L290 TraceCheckUtils]: 9: Hoare triple {30585#true} assume 128 + ~e >= -2147483648; {30585#true} is VALID [2022-02-21 03:10:23,526 INFO L290 TraceCheckUtils]: 10: Hoare triple {30585#true} assume !((1 == ~m && (0 == 16777216 * (128 + ~e) || 1 == 16777216 * (128 + ~e))) || ((0 == ~m || 1 == ~m) && 1 == 16777216 * (128 + ~e))); {30585#true} is VALID [2022-02-21 03:10:23,526 INFO L290 TraceCheckUtils]: 11: Hoare triple {30585#true} assume !(0 == ~m && (0 == 16777216 * (128 + ~e) || 1 == 16777216 * (128 + ~e))); {30585#true} is VALID [2022-02-21 03:10:23,526 INFO L290 TraceCheckUtils]: 12: Hoare triple {30585#true} assume !((0 == ~m || 1 == ~m) && 0 == 16777216 * (128 + ~e)); {30585#true} is VALID [2022-02-21 03:10:23,526 INFO L290 TraceCheckUtils]: 13: Hoare triple {30585#true} assume ~m >= 0 && 16777216 * (128 + ~e) >= 0;abs_78 := (if ~m < 16777216 * (128 + ~e) then 16777216 * (128 + ~e) else ~m);assume ~m >= 0 && 16777216 * (128 + ~e) >= 0;assume ~res~0 >= abs_78; {30585#true} is VALID [2022-02-21 03:10:23,526 INFO L290 TraceCheckUtils]: 14: Hoare triple {30585#true} ~__retres4~0 := ~res~0; {30585#true} is VALID [2022-02-21 03:10:23,526 INFO L290 TraceCheckUtils]: 15: Hoare triple {30585#true} #res := ~__retres4~0; {30585#true} is VALID [2022-02-21 03:10:23,526 INFO L290 TraceCheckUtils]: 16: Hoare triple {30585#true} assume true; {30585#true} is VALID [2022-02-21 03:10:23,527 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {30585#true} {30585#true} #455#return; {30585#true} is VALID [2022-02-21 03:10:23,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-02-21 03:10:23,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:23,561 INFO L290 TraceCheckUtils]: 0: Hoare triple {30624#(and (= abs_77 |old(abs_77)|) (= abs_78 |old(abs_78)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {30585#true} is VALID [2022-02-21 03:10:23,562 INFO L290 TraceCheckUtils]: 1: Hoare triple {30585#true} assume !(0 == ~m % 4294967296); {30585#true} is VALID [2022-02-21 03:10:23,562 INFO L290 TraceCheckUtils]: 2: Hoare triple {30585#true} assume !(~m % 4294967296 < 16777216); {30585#true} is VALID [2022-02-21 03:10:23,562 INFO L290 TraceCheckUtils]: 3: Hoare triple {30585#true} assume !false; {30585#true} is VALID [2022-02-21 03:10:23,562 INFO L290 TraceCheckUtils]: 4: Hoare triple {30585#true} assume ~m % 4294967296 >= 33554432; {30585#true} is VALID [2022-02-21 03:10:23,562 INFO L290 TraceCheckUtils]: 5: Hoare triple {30585#true} assume ~e >= 127;~__retres4~0 := 4294967295; {30625#(and (<= base2flt_~__retres4~0 4294967295) (<= 4294967295 base2flt_~__retres4~0))} is VALID [2022-02-21 03:10:23,563 INFO L290 TraceCheckUtils]: 6: Hoare triple {30625#(and (<= base2flt_~__retres4~0 4294967295) (<= 4294967295 base2flt_~__retres4~0))} #res := ~__retres4~0; {30626#(and (<= |base2flt_#res| 4294967295) (<= 4294967295 |base2flt_#res|))} is VALID [2022-02-21 03:10:23,563 INFO L290 TraceCheckUtils]: 7: Hoare triple {30626#(and (<= |base2flt_#res| 4294967295) (<= 4294967295 |base2flt_#res|))} assume true; {30626#(and (<= |base2flt_#res| 4294967295) (<= 4294967295 |base2flt_#res|))} is VALID [2022-02-21 03:10:23,564 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {30626#(and (<= |base2flt_#res| 4294967295) (<= 4294967295 |base2flt_#res|))} {30585#true} #457#return; {30619#(and (<= 4294967295 |ULTIMATE.start_main_#t~ret24#1|) (<= |ULTIMATE.start_main_#t~ret24#1| 4294967295))} is VALID [2022-02-21 03:10:23,564 INFO L290 TraceCheckUtils]: 0: Hoare triple {30585#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(24, 2);call #Ultimate.allocInit(12, 3); {30585#true} is VALID [2022-02-21 03:10:23,564 INFO L290 TraceCheckUtils]: 1: Hoare triple {30585#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_~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_add~0#1, main_~zero~0#1, main_~sa~0#1, main_~sb~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~tmp___1~0#1, main_~tmp___2~0#1, main_~tmp___3~0#1, main_~tmp___4~0#1, main_~tmp___5~0#1, main_~tmp___6~0#1, main_~tmp___7~0#1, main_~tmp___8~0#1, main_~tmp___9~0#1, main_~__retres23~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_add~0#1;havoc main_~zero~0#1;havoc main_~sa~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_~tmp___2~0#1;havoc main_~tmp___3~0#1;havoc main_~tmp___4~0#1;havoc main_~tmp___5~0#1;havoc main_~tmp___6~0#1;havoc main_~tmp___7~0#1;havoc main_~tmp___8~0#1;havoc main_~tmp___9~0#1;havoc main_~__retres23~0#1; {30585#true} is VALID [2022-02-21 03:10:23,565 INFO L272 TraceCheckUtils]: 2: Hoare triple {30585#true} call main_#t~ret22#1 := base2flt(0, 0); {30624#(and (= abs_77 |old(abs_77)|) (= abs_78 |old(abs_78)|))} is VALID [2022-02-21 03:10:23,565 INFO L290 TraceCheckUtils]: 3: Hoare triple {30624#(and (= abs_77 |old(abs_77)|) (= abs_78 |old(abs_78)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {30585#true} is VALID [2022-02-21 03:10:23,565 INFO L290 TraceCheckUtils]: 4: Hoare triple {30585#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {30585#true} is VALID [2022-02-21 03:10:23,565 INFO L290 TraceCheckUtils]: 5: Hoare triple {30585#true} #res := ~__retres4~0; {30585#true} is VALID [2022-02-21 03:10:23,565 INFO L290 TraceCheckUtils]: 6: Hoare triple {30585#true} assume true; {30585#true} is VALID [2022-02-21 03:10:23,566 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {30585#true} {30585#true} #453#return; {30585#true} is VALID [2022-02-21 03:10:23,566 INFO L290 TraceCheckUtils]: 8: Hoare triple {30585#true} main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1; {30585#true} is VALID [2022-02-21 03:10:23,566 INFO L272 TraceCheckUtils]: 9: Hoare triple {30585#true} call main_#t~ret23#1 := base2flt(main_~ma~2#1, main_~ea~2#1); {30624#(and (= abs_77 |old(abs_77)|) (= abs_78 |old(abs_78)|))} is VALID [2022-02-21 03:10:23,567 INFO L290 TraceCheckUtils]: 10: Hoare triple {30624#(and (= abs_77 |old(abs_77)|) (= abs_78 |old(abs_78)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {30585#true} is VALID [2022-02-21 03:10:23,567 INFO L290 TraceCheckUtils]: 11: Hoare triple {30585#true} assume !(0 == ~m % 4294967296); {30585#true} is VALID [2022-02-21 03:10:23,567 INFO L290 TraceCheckUtils]: 12: Hoare triple {30585#true} assume !(~m % 4294967296 < 16777216); {30585#true} is VALID [2022-02-21 03:10:23,567 INFO L290 TraceCheckUtils]: 13: Hoare triple {30585#true} assume !false; {30585#true} is VALID [2022-02-21 03:10:23,567 INFO L290 TraceCheckUtils]: 14: Hoare triple {30585#true} assume !(~m % 4294967296 >= 33554432); {30585#true} is VALID [2022-02-21 03:10:23,567 INFO L290 TraceCheckUtils]: 15: Hoare triple {30585#true} assume 0 == ~m || 0 == ~bitwiseComplement(16777216);~m := 0; {30585#true} is VALID [2022-02-21 03:10:23,567 INFO L290 TraceCheckUtils]: 16: Hoare triple {30585#true} assume 128 + ~e <= 2147483647; {30585#true} is VALID [2022-02-21 03:10:23,567 INFO L290 TraceCheckUtils]: 17: Hoare triple {30585#true} assume 128 + ~e >= -2147483648; {30585#true} is VALID [2022-02-21 03:10:23,567 INFO L290 TraceCheckUtils]: 18: Hoare triple {30585#true} assume 128 + ~e <= 2147483647; {30585#true} is VALID [2022-02-21 03:10:23,568 INFO L290 TraceCheckUtils]: 19: Hoare triple {30585#true} assume 128 + ~e >= -2147483648; {30585#true} is VALID [2022-02-21 03:10:23,568 INFO L290 TraceCheckUtils]: 20: Hoare triple {30585#true} assume !((1 == ~m && (0 == 16777216 * (128 + ~e) || 1 == 16777216 * (128 + ~e))) || ((0 == ~m || 1 == ~m) && 1 == 16777216 * (128 + ~e))); {30585#true} is VALID [2022-02-21 03:10:23,568 INFO L290 TraceCheckUtils]: 21: Hoare triple {30585#true} assume !(0 == ~m && (0 == 16777216 * (128 + ~e) || 1 == 16777216 * (128 + ~e))); {30585#true} is VALID [2022-02-21 03:10:23,568 INFO L290 TraceCheckUtils]: 22: Hoare triple {30585#true} assume !((0 == ~m || 1 == ~m) && 0 == 16777216 * (128 + ~e)); {30585#true} is VALID [2022-02-21 03:10:23,568 INFO L290 TraceCheckUtils]: 23: Hoare triple {30585#true} assume ~m >= 0 && 16777216 * (128 + ~e) >= 0;abs_78 := (if ~m < 16777216 * (128 + ~e) then 16777216 * (128 + ~e) else ~m);assume ~m >= 0 && 16777216 * (128 + ~e) >= 0;assume ~res~0 >= abs_78; {30585#true} is VALID [2022-02-21 03:10:23,568 INFO L290 TraceCheckUtils]: 24: Hoare triple {30585#true} ~__retres4~0 := ~res~0; {30585#true} is VALID [2022-02-21 03:10:23,568 INFO L290 TraceCheckUtils]: 25: Hoare triple {30585#true} #res := ~__retres4~0; {30585#true} is VALID [2022-02-21 03:10:23,568 INFO L290 TraceCheckUtils]: 26: Hoare triple {30585#true} assume true; {30585#true} is VALID [2022-02-21 03:10:23,568 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {30585#true} {30585#true} #455#return; {30585#true} is VALID [2022-02-21 03:10:23,569 INFO L290 TraceCheckUtils]: 28: Hoare triple {30585#true} main_~a~0#1 := main_#t~ret23#1;havoc main_#t~ret23#1; {30585#true} is VALID [2022-02-21 03:10:23,569 INFO L272 TraceCheckUtils]: 29: Hoare triple {30585#true} call main_#t~ret24#1 := base2flt(main_~mb~2#1, main_~eb~2#1); {30624#(and (= abs_77 |old(abs_77)|) (= abs_78 |old(abs_78)|))} is VALID [2022-02-21 03:10:23,569 INFO L290 TraceCheckUtils]: 30: Hoare triple {30624#(and (= abs_77 |old(abs_77)|) (= abs_78 |old(abs_78)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {30585#true} is VALID [2022-02-21 03:10:23,570 INFO L290 TraceCheckUtils]: 31: Hoare triple {30585#true} assume !(0 == ~m % 4294967296); {30585#true} is VALID [2022-02-21 03:10:23,570 INFO L290 TraceCheckUtils]: 32: Hoare triple {30585#true} assume !(~m % 4294967296 < 16777216); {30585#true} is VALID [2022-02-21 03:10:23,570 INFO L290 TraceCheckUtils]: 33: Hoare triple {30585#true} assume !false; {30585#true} is VALID [2022-02-21 03:10:23,570 INFO L290 TraceCheckUtils]: 34: Hoare triple {30585#true} assume ~m % 4294967296 >= 33554432; {30585#true} is VALID [2022-02-21 03:10:23,570 INFO L290 TraceCheckUtils]: 35: Hoare triple {30585#true} assume ~e >= 127;~__retres4~0 := 4294967295; {30625#(and (<= base2flt_~__retres4~0 4294967295) (<= 4294967295 base2flt_~__retres4~0))} is VALID [2022-02-21 03:10:23,571 INFO L290 TraceCheckUtils]: 36: Hoare triple {30625#(and (<= base2flt_~__retres4~0 4294967295) (<= 4294967295 base2flt_~__retres4~0))} #res := ~__retres4~0; {30626#(and (<= |base2flt_#res| 4294967295) (<= 4294967295 |base2flt_#res|))} is VALID [2022-02-21 03:10:23,571 INFO L290 TraceCheckUtils]: 37: Hoare triple {30626#(and (<= |base2flt_#res| 4294967295) (<= 4294967295 |base2flt_#res|))} assume true; {30626#(and (<= |base2flt_#res| 4294967295) (<= 4294967295 |base2flt_#res|))} is VALID [2022-02-21 03:10:23,572 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {30626#(and (<= |base2flt_#res| 4294967295) (<= 4294967295 |base2flt_#res|))} {30585#true} #457#return; {30619#(and (<= 4294967295 |ULTIMATE.start_main_#t~ret24#1|) (<= |ULTIMATE.start_main_#t~ret24#1| 4294967295))} is VALID [2022-02-21 03:10:23,572 INFO L290 TraceCheckUtils]: 39: Hoare triple {30619#(and (<= 4294967295 |ULTIMATE.start_main_#t~ret24#1|) (<= |ULTIMATE.start_main_#t~ret24#1| 4294967295))} main_~b~0#1 := main_#t~ret24#1;havoc main_#t~ret24#1; {30620#(and (<= 4294967295 |ULTIMATE.start_main_~b~0#1|) (<= |ULTIMATE.start_main_~b~0#1| 4294967295))} is VALID [2022-02-21 03:10:23,573 INFO L290 TraceCheckUtils]: 40: Hoare triple {30620#(and (<= 4294967295 |ULTIMATE.start_main_~b~0#1|) (<= |ULTIMATE.start_main_~b~0#1| 4294967295))} assume !(main_~a~0#1 % 4294967296 < main_~zero~0#1 % 4294967296); {30620#(and (<= 4294967295 |ULTIMATE.start_main_~b~0#1|) (<= |ULTIMATE.start_main_~b~0#1| 4294967295))} is VALID [2022-02-21 03:10:23,573 INFO L290 TraceCheckUtils]: 41: Hoare triple {30620#(and (<= 4294967295 |ULTIMATE.start_main_~b~0#1|) (<= |ULTIMATE.start_main_~b~0#1| 4294967295))} assume main_~a~0#1 % 4294967296 > main_~zero~0#1 % 4294967296;main_~tmp~2#1 := 1; {30620#(and (<= 4294967295 |ULTIMATE.start_main_~b~0#1|) (<= |ULTIMATE.start_main_~b~0#1| 4294967295))} is VALID [2022-02-21 03:10:23,573 INFO L290 TraceCheckUtils]: 42: Hoare triple {30620#(and (<= 4294967295 |ULTIMATE.start_main_~b~0#1|) (<= |ULTIMATE.start_main_~b~0#1| 4294967295))} main_~sa~0#1 := main_~tmp~2#1; {30620#(and (<= 4294967295 |ULTIMATE.start_main_~b~0#1|) (<= |ULTIMATE.start_main_~b~0#1| 4294967295))} is VALID [2022-02-21 03:10:23,574 INFO L290 TraceCheckUtils]: 43: Hoare triple {30620#(and (<= 4294967295 |ULTIMATE.start_main_~b~0#1|) (<= |ULTIMATE.start_main_~b~0#1| 4294967295))} assume !(main_~b~0#1 % 4294967296 < main_~zero~0#1 % 4294967296); {30620#(and (<= 4294967295 |ULTIMATE.start_main_~b~0#1|) (<= |ULTIMATE.start_main_~b~0#1| 4294967295))} is VALID [2022-02-21 03:10:23,574 INFO L290 TraceCheckUtils]: 44: Hoare triple {30620#(and (<= 4294967295 |ULTIMATE.start_main_~b~0#1|) (<= |ULTIMATE.start_main_~b~0#1| 4294967295))} assume main_~b~0#1 % 4294967296 > main_~zero~0#1 % 4294967296;main_~tmp___0~0#1 := 1; {30620#(and (<= 4294967295 |ULTIMATE.start_main_~b~0#1|) (<= |ULTIMATE.start_main_~b~0#1| 4294967295))} is VALID [2022-02-21 03:10:23,575 INFO L290 TraceCheckUtils]: 45: Hoare triple {30620#(and (<= 4294967295 |ULTIMATE.start_main_~b~0#1|) (<= |ULTIMATE.start_main_~b~0#1| 4294967295))} main_~sb~0#1 := main_~tmp___0~0#1; {30620#(and (<= 4294967295 |ULTIMATE.start_main_~b~0#1|) (<= |ULTIMATE.start_main_~b~0#1| 4294967295))} is VALID [2022-02-21 03:10:23,575 INFO L290 TraceCheckUtils]: 46: Hoare triple {30620#(and (<= 4294967295 |ULTIMATE.start_main_~b~0#1|) (<= |ULTIMATE.start_main_~b~0#1| 4294967295))} assume { :begin_inline_addflt } true;addflt_#in~a#1, addflt_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc addflt_#res#1;havoc addflt_#t~nondet6#1, addflt_#t~nondet7#1, addflt_#t~nondet8#1, addflt_#t~nondet9#1, addflt_#t~nondet10#1, addflt_#t~nondet11#1, addflt_~a#1, addflt_~b#1, addflt_~res~1#1, addflt_~ma~0#1, addflt_~mb~0#1, addflt_~delta~0#1, addflt_~ea~0#1, addflt_~eb~0#1, addflt_~tmp~0#1, addflt_~__retres10~0#1;addflt_~a#1 := addflt_#in~a#1;addflt_~b#1 := addflt_#in~b#1;havoc addflt_~res~1#1;havoc addflt_~ma~0#1;havoc addflt_~mb~0#1;havoc addflt_~delta~0#1;havoc addflt_~ea~0#1;havoc addflt_~eb~0#1;havoc addflt_~tmp~0#1;havoc addflt_~__retres10~0#1; {30621#(and (<= 4294967295 |ULTIMATE.start_addflt_~b#1|) (<= |ULTIMATE.start_addflt_~b#1| 4294967295))} is VALID [2022-02-21 03:10:23,576 INFO L290 TraceCheckUtils]: 47: Hoare triple {30621#(and (<= 4294967295 |ULTIMATE.start_addflt_~b#1|) (<= |ULTIMATE.start_addflt_~b#1| 4294967295))} assume addflt_~a#1 % 4294967296 < addflt_~b#1 % 4294967296;addflt_~tmp~0#1 := addflt_~a#1;addflt_~a#1 := addflt_~b#1;addflt_~b#1 := addflt_~tmp~0#1; {30622#(and (not (<= (+ (div (div |ULTIMATE.start_addflt_~a#1| 16777216) 4294967296) 1) 0)) (<= |ULTIMATE.start_addflt_~a#1| 4294967295))} is VALID [2022-02-21 03:10:23,576 INFO L290 TraceCheckUtils]: 48: Hoare triple {30622#(and (not (<= (+ (div (div |ULTIMATE.start_addflt_~a#1| 16777216) 4294967296) 1) 0)) (<= |ULTIMATE.start_addflt_~a#1| 4294967295))} assume !(0 == addflt_~b#1 % 4294967296); {30622#(and (not (<= (+ (div (div |ULTIMATE.start_addflt_~a#1| 16777216) 4294967296) 1) 0)) (<= |ULTIMATE.start_addflt_~a#1| 4294967295))} is VALID [2022-02-21 03:10:23,576 INFO L290 TraceCheckUtils]: 49: Hoare triple {30622#(and (not (<= (+ (div (div |ULTIMATE.start_addflt_~a#1| 16777216) 4294967296) 1) 0)) (<= |ULTIMATE.start_addflt_~a#1| 4294967295))} assume !(0 == addflt_~a#1); {30622#(and (not (<= (+ (div (div |ULTIMATE.start_addflt_~a#1| 16777216) 4294967296) 1) 0)) (<= |ULTIMATE.start_addflt_~a#1| 4294967295))} is VALID [2022-02-21 03:10:23,577 INFO L290 TraceCheckUtils]: 50: Hoare triple {30622#(and (not (<= (+ (div (div |ULTIMATE.start_addflt_~a#1| 16777216) 4294967296) 1) 0)) (<= |ULTIMATE.start_addflt_~a#1| 4294967295))} assume !false; {30622#(and (not (<= (+ (div (div |ULTIMATE.start_addflt_~a#1| 16777216) 4294967296) 1) 0)) (<= |ULTIMATE.start_addflt_~a#1| 4294967295))} is VALID [2022-02-21 03:10:23,581 INFO L290 TraceCheckUtils]: 51: Hoare triple {30622#(and (not (<= (+ (div (div |ULTIMATE.start_addflt_~a#1| 16777216) 4294967296) 1) 0)) (<= |ULTIMATE.start_addflt_~a#1| 4294967295))} assume !false; {30622#(and (not (<= (+ (div (div |ULTIMATE.start_addflt_~a#1| 16777216) 4294967296) 1) 0)) (<= |ULTIMATE.start_addflt_~a#1| 4294967295))} is VALID [2022-02-21 03:10:23,582 INFO L290 TraceCheckUtils]: 52: Hoare triple {30622#(and (not (<= (+ (div (div |ULTIMATE.start_addflt_~a#1| 16777216) 4294967296) 1) 0)) (<= |ULTIMATE.start_addflt_~a#1| 4294967295))} assume addflt_~a#1 >= 0;abs_109 := (if addflt_~a#1 < 16777215 then addflt_~a#1 else 16777215);assume addflt_~a#1 >= 0;assume addflt_~ma~0#1 < abs_109; {30622#(and (not (<= (+ (div (div |ULTIMATE.start_addflt_~a#1| 16777216) 4294967296) 1) 0)) (<= |ULTIMATE.start_addflt_~a#1| 4294967295))} is VALID [2022-02-21 03:10:23,582 INFO L290 TraceCheckUtils]: 53: Hoare triple {30622#(and (not (<= (+ (div (div |ULTIMATE.start_addflt_~a#1| 16777216) 4294967296) 1) 0)) (<= |ULTIMATE.start_addflt_~a#1| 4294967295))} assume (if addflt_~a#1 / 16777216 % 4294967296 % 4294967296 <= 2147483647 then addflt_~a#1 / 16777216 % 4294967296 % 4294967296 else addflt_~a#1 / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 <= 2147483647; {30623#(and (<= (div |ULTIMATE.start_addflt_~a#1| 16777216) (+ 2147483647 (* 4294967296 (div (div |ULTIMATE.start_addflt_~a#1| 16777216) 4294967296)))) (< 0 (+ (div (div |ULTIMATE.start_addflt_~a#1| 16777216) 4294967296) 1)))} is VALID [2022-02-21 03:10:23,583 INFO L290 TraceCheckUtils]: 54: Hoare triple {30623#(and (<= (div |ULTIMATE.start_addflt_~a#1| 16777216) (+ 2147483647 (* 4294967296 (div (div |ULTIMATE.start_addflt_~a#1| 16777216) 4294967296)))) (< 0 (+ (div (div |ULTIMATE.start_addflt_~a#1| 16777216) 4294967296) 1)))} assume !((if addflt_~a#1 / 16777216 % 4294967296 % 4294967296 <= 2147483647 then addflt_~a#1 / 16777216 % 4294967296 % 4294967296 else addflt_~a#1 / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 >= -2147483648); {30586#false} is VALID [2022-02-21 03:10:23,583 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-02-21 03:10:23,583 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:10:23,584 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18092754] [2022-02-21 03:10:23,584 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18092754] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:10:23,584 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:10:23,584 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-21 03:10:23,584 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145765643] [2022-02-21 03:10:23,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:10:23,584 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.666666666666667) internal successors, (42), 8 states have internal predecessors, (42), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 55 [2022-02-21 03:10:23,585 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:10:23,585 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 10 states, 9 states have (on average 4.666666666666667) internal successors, (42), 8 states have internal predecessors, (42), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-21 03:10:23,620 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:10:23,620 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-21 03:10:23,620 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:10:23,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-21 03:10:23,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-02-21 03:10:23,621 INFO L87 Difference]: Start difference. First operand 234 states and 290 transitions. Second operand has 10 states, 9 states have (on average 4.666666666666667) internal successors, (42), 8 states have internal predecessors, (42), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-21 03:10:24,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:24,749 INFO L93 Difference]: Finished difference Result 429 states and 519 transitions. [2022-02-21 03:10:24,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-21 03:10:24,750 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.666666666666667) internal successors, (42), 8 states have internal predecessors, (42), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 55 [2022-02-21 03:10:24,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:10:24,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 4.666666666666667) internal successors, (42), 8 states have internal predecessors, (42), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-21 03:10:24,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 327 transitions. [2022-02-21 03:10:24,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 4.666666666666667) internal successors, (42), 8 states have internal predecessors, (42), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-21 03:10:24,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 327 transitions. [2022-02-21 03:10:24,753 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 327 transitions. [2022-02-21 03:10:24,955 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 327 edges. 327 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:10:24,960 INFO L225 Difference]: With dead ends: 429 [2022-02-21 03:10:24,960 INFO L226 Difference]: Without dead ends: 378 [2022-02-21 03:10:24,961 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2022-02-21 03:10:24,961 INFO L933 BasicCegarLoop]: 168 mSDtfsCounter, 253 mSDsluCounter, 1062 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 253 SdHoareTripleChecker+Valid, 1230 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-21 03:10:24,961 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [253 Valid, 1230 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-21 03:10:24,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2022-02-21 03:10:25,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 258. [2022-02-21 03:10:25,076 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:10:25,077 INFO L82 GeneralOperation]: Start isEquivalent. First operand 378 states. Second operand has 258 states, 234 states have (on average 1.2735042735042734) internal successors, (298), 241 states have internal predecessors, (298), 7 states have call successors, (7), 4 states have call predecessors, (7), 7 states have return successors, (12), 12 states have call predecessors, (12), 7 states have call successors, (12) [2022-02-21 03:10:25,077 INFO L74 IsIncluded]: Start isIncluded. First operand 378 states. Second operand has 258 states, 234 states have (on average 1.2735042735042734) internal successors, (298), 241 states have internal predecessors, (298), 7 states have call successors, (7), 4 states have call predecessors, (7), 7 states have return successors, (12), 12 states have call predecessors, (12), 7 states have call successors, (12) [2022-02-21 03:10:25,077 INFO L87 Difference]: Start difference. First operand 378 states. Second operand has 258 states, 234 states have (on average 1.2735042735042734) internal successors, (298), 241 states have internal predecessors, (298), 7 states have call successors, (7), 4 states have call predecessors, (7), 7 states have return successors, (12), 12 states have call predecessors, (12), 7 states have call successors, (12) [2022-02-21 03:10:25,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:25,082 INFO L93 Difference]: Finished difference Result 378 states and 457 transitions. [2022-02-21 03:10:25,082 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 457 transitions. [2022-02-21 03:10:25,082 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:10:25,083 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:10:25,083 INFO L74 IsIncluded]: Start isIncluded. First operand has 258 states, 234 states have (on average 1.2735042735042734) internal successors, (298), 241 states have internal predecessors, (298), 7 states have call successors, (7), 4 states have call predecessors, (7), 7 states have return successors, (12), 12 states have call predecessors, (12), 7 states have call successors, (12) Second operand 378 states. [2022-02-21 03:10:25,083 INFO L87 Difference]: Start difference. First operand has 258 states, 234 states have (on average 1.2735042735042734) internal successors, (298), 241 states have internal predecessors, (298), 7 states have call successors, (7), 4 states have call predecessors, (7), 7 states have return successors, (12), 12 states have call predecessors, (12), 7 states have call successors, (12) Second operand 378 states. [2022-02-21 03:10:25,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:25,088 INFO L93 Difference]: Finished difference Result 378 states and 457 transitions. [2022-02-21 03:10:25,088 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 457 transitions. [2022-02-21 03:10:25,088 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:10:25,089 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:10:25,089 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:10:25,089 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:10:25,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 234 states have (on average 1.2735042735042734) internal successors, (298), 241 states have internal predecessors, (298), 7 states have call successors, (7), 4 states have call predecessors, (7), 7 states have return successors, (12), 12 states have call predecessors, (12), 7 states have call successors, (12) [2022-02-21 03:10:25,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 317 transitions. [2022-02-21 03:10:25,092 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 317 transitions. Word has length 55 [2022-02-21 03:10:25,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:10:25,092 INFO L470 AbstractCegarLoop]: Abstraction has 258 states and 317 transitions. [2022-02-21 03:10:25,092 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.666666666666667) internal successors, (42), 8 states have internal predecessors, (42), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-21 03:10:25,092 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 317 transitions. [2022-02-21 03:10:25,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-02-21 03:10:25,093 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:10:25,093 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:10:25,093 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-02-21 03:10:25,093 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-02-21 03:10:25,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:10:25,094 INFO L85 PathProgramCache]: Analyzing trace with hash -1309999454, now seen corresponding path program 1 times [2022-02-21 03:10:25,094 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:10:25,094 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235458677] [2022-02-21 03:10:25,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:10:25,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:10:25,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:25,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-21 03:10:25,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:25,244 INFO L290 TraceCheckUtils]: 0: Hoare triple {32189#(and (= abs_77 |old(abs_77)|) (= abs_78 |old(abs_78)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {32144#true} is VALID [2022-02-21 03:10:25,245 INFO L290 TraceCheckUtils]: 1: Hoare triple {32144#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {32190#(and (<= base2flt_~__retres4~0 0) (<= 0 base2flt_~__retres4~0))} is VALID [2022-02-21 03:10:25,245 INFO L290 TraceCheckUtils]: 2: Hoare triple {32190#(and (<= base2flt_~__retres4~0 0) (<= 0 base2flt_~__retres4~0))} #res := ~__retres4~0; {32191#(and (<= |base2flt_#res| 0) (<= 0 |base2flt_#res|))} is VALID [2022-02-21 03:10:25,246 INFO L290 TraceCheckUtils]: 3: Hoare triple {32191#(and (<= |base2flt_#res| 0) (<= 0 |base2flt_#res|))} assume true; {32191#(and (<= |base2flt_#res| 0) (<= 0 |base2flt_#res|))} is VALID [2022-02-21 03:10:25,246 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {32191#(and (<= |base2flt_#res| 0) (<= 0 |base2flt_#res|))} {32144#true} #453#return; {32151#(= |ULTIMATE.start_main_#t~ret22#1| 0)} is VALID [2022-02-21 03:10:25,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-02-21 03:10:25,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:25,253 INFO L290 TraceCheckUtils]: 0: Hoare triple {32189#(and (= abs_77 |old(abs_77)|) (= abs_78 |old(abs_78)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {32144#true} is VALID [2022-02-21 03:10:25,254 INFO L290 TraceCheckUtils]: 1: Hoare triple {32144#true} assume !(0 == ~m % 4294967296); {32144#true} is VALID [2022-02-21 03:10:25,254 INFO L290 TraceCheckUtils]: 2: Hoare triple {32144#true} assume !(~m % 4294967296 < 16777216); {32144#true} is VALID [2022-02-21 03:10:25,254 INFO L290 TraceCheckUtils]: 3: Hoare triple {32144#true} assume !false; {32144#true} is VALID [2022-02-21 03:10:25,254 INFO L290 TraceCheckUtils]: 4: Hoare triple {32144#true} assume !(~m % 4294967296 >= 33554432); {32144#true} is VALID [2022-02-21 03:10:25,254 INFO L290 TraceCheckUtils]: 5: Hoare triple {32144#true} assume 0 == ~m || 0 == ~bitwiseComplement(16777216);~m := 0; {32144#true} is VALID [2022-02-21 03:10:25,254 INFO L290 TraceCheckUtils]: 6: Hoare triple {32144#true} assume 128 + ~e <= 2147483647; {32144#true} is VALID [2022-02-21 03:10:25,254 INFO L290 TraceCheckUtils]: 7: Hoare triple {32144#true} assume 128 + ~e >= -2147483648; {32144#true} is VALID [2022-02-21 03:10:25,254 INFO L290 TraceCheckUtils]: 8: Hoare triple {32144#true} assume 128 + ~e <= 2147483647; {32144#true} is VALID [2022-02-21 03:10:25,254 INFO L290 TraceCheckUtils]: 9: Hoare triple {32144#true} assume 128 + ~e >= -2147483648; {32144#true} is VALID [2022-02-21 03:10:25,255 INFO L290 TraceCheckUtils]: 10: Hoare triple {32144#true} assume !((1 == ~m && (0 == 16777216 * (128 + ~e) || 1 == 16777216 * (128 + ~e))) || ((0 == ~m || 1 == ~m) && 1 == 16777216 * (128 + ~e))); {32144#true} is VALID [2022-02-21 03:10:25,255 INFO L290 TraceCheckUtils]: 11: Hoare triple {32144#true} assume !(0 == ~m && (0 == 16777216 * (128 + ~e) || 1 == 16777216 * (128 + ~e))); {32144#true} is VALID [2022-02-21 03:10:25,255 INFO L290 TraceCheckUtils]: 12: Hoare triple {32144#true} assume !((0 == ~m || 1 == ~m) && 0 == 16777216 * (128 + ~e)); {32144#true} is VALID [2022-02-21 03:10:25,255 INFO L290 TraceCheckUtils]: 13: Hoare triple {32144#true} assume ~m >= 0 && 16777216 * (128 + ~e) >= 0;abs_78 := (if ~m < 16777216 * (128 + ~e) then 16777216 * (128 + ~e) else ~m);assume ~m >= 0 && 16777216 * (128 + ~e) >= 0;assume ~res~0 >= abs_78; {32144#true} is VALID [2022-02-21 03:10:25,255 INFO L290 TraceCheckUtils]: 14: Hoare triple {32144#true} ~__retres4~0 := ~res~0; {32144#true} is VALID [2022-02-21 03:10:25,255 INFO L290 TraceCheckUtils]: 15: Hoare triple {32144#true} #res := ~__retres4~0; {32144#true} is VALID [2022-02-21 03:10:25,255 INFO L290 TraceCheckUtils]: 16: Hoare triple {32144#true} assume true; {32144#true} is VALID [2022-02-21 03:10:25,256 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {32144#true} {32152#(= |ULTIMATE.start_main_~zero~0#1| 0)} #455#return; {32152#(= |ULTIMATE.start_main_~zero~0#1| 0)} is VALID [2022-02-21 03:10:25,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-02-21 03:10:25,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:25,279 INFO L290 TraceCheckUtils]: 0: Hoare triple {32189#(and (= abs_77 |old(abs_77)|) (= abs_78 |old(abs_78)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {32144#true} is VALID [2022-02-21 03:10:25,279 INFO L290 TraceCheckUtils]: 1: Hoare triple {32144#true} assume !(0 == ~m % 4294967296); {32144#true} is VALID [2022-02-21 03:10:25,280 INFO L290 TraceCheckUtils]: 2: Hoare triple {32144#true} assume !(~m % 4294967296 < 16777216); {32144#true} is VALID [2022-02-21 03:10:25,280 INFO L290 TraceCheckUtils]: 3: Hoare triple {32144#true} assume !false; {32144#true} is VALID [2022-02-21 03:10:25,280 INFO L290 TraceCheckUtils]: 4: Hoare triple {32144#true} assume !(~m % 4294967296 >= 33554432); {32144#true} is VALID [2022-02-21 03:10:25,280 INFO L290 TraceCheckUtils]: 5: Hoare triple {32144#true} assume 0 == ~m || 0 == ~bitwiseComplement(16777216);~m := 0; {32144#true} is VALID [2022-02-21 03:10:25,280 INFO L290 TraceCheckUtils]: 6: Hoare triple {32144#true} assume 128 + ~e <= 2147483647; {32144#true} is VALID [2022-02-21 03:10:25,280 INFO L290 TraceCheckUtils]: 7: Hoare triple {32144#true} assume 128 + ~e >= -2147483648; {32144#true} is VALID [2022-02-21 03:10:25,280 INFO L290 TraceCheckUtils]: 8: Hoare triple {32144#true} assume 128 + ~e <= 2147483647; {32144#true} is VALID [2022-02-21 03:10:25,280 INFO L290 TraceCheckUtils]: 9: Hoare triple {32144#true} assume 128 + ~e >= -2147483648; {32144#true} is VALID [2022-02-21 03:10:25,281 INFO L290 TraceCheckUtils]: 10: Hoare triple {32144#true} assume !((1 == ~m && (0 == 16777216 * (128 + ~e) || 1 == 16777216 * (128 + ~e))) || ((0 == ~m || 1 == ~m) && 1 == 16777216 * (128 + ~e))); {32144#true} is VALID [2022-02-21 03:10:25,281 INFO L290 TraceCheckUtils]: 11: Hoare triple {32144#true} assume 0 == ~m && (0 == 16777216 * (128 + ~e) || 1 == 16777216 * (128 + ~e));~res~0 := 16777216 * (128 + ~e); {32192#(and (<= 0 base2flt_~res~0) (<= base2flt_~res~0 0))} is VALID [2022-02-21 03:10:25,281 INFO L290 TraceCheckUtils]: 12: Hoare triple {32192#(and (<= 0 base2flt_~res~0) (<= base2flt_~res~0 0))} ~__retres4~0 := ~res~0; {32190#(and (<= base2flt_~__retres4~0 0) (<= 0 base2flt_~__retres4~0))} is VALID [2022-02-21 03:10:25,282 INFO L290 TraceCheckUtils]: 13: Hoare triple {32190#(and (<= base2flt_~__retres4~0 0) (<= 0 base2flt_~__retres4~0))} #res := ~__retres4~0; {32191#(and (<= |base2flt_#res| 0) (<= 0 |base2flt_#res|))} is VALID [2022-02-21 03:10:25,282 INFO L290 TraceCheckUtils]: 14: Hoare triple {32191#(and (<= |base2flt_#res| 0) (<= 0 |base2flt_#res|))} assume true; {32191#(and (<= |base2flt_#res| 0) (<= 0 |base2flt_#res|))} is VALID [2022-02-21 03:10:25,283 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {32191#(and (<= |base2flt_#res| 0) (<= 0 |base2flt_#res|))} {32152#(= |ULTIMATE.start_main_~zero~0#1| 0)} #457#return; {32187#(and (= |ULTIMATE.start_main_~zero~0#1| 0) (<= 0 |ULTIMATE.start_main_#t~ret24#1|) (<= |ULTIMATE.start_main_#t~ret24#1| 0))} is VALID [2022-02-21 03:10:25,283 INFO L290 TraceCheckUtils]: 0: Hoare triple {32144#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(24, 2);call #Ultimate.allocInit(12, 3); {32144#true} is VALID [2022-02-21 03:10:25,283 INFO L290 TraceCheckUtils]: 1: Hoare triple {32144#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_~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_add~0#1, main_~zero~0#1, main_~sa~0#1, main_~sb~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~tmp___1~0#1, main_~tmp___2~0#1, main_~tmp___3~0#1, main_~tmp___4~0#1, main_~tmp___5~0#1, main_~tmp___6~0#1, main_~tmp___7~0#1, main_~tmp___8~0#1, main_~tmp___9~0#1, main_~__retres23~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_add~0#1;havoc main_~zero~0#1;havoc main_~sa~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_~tmp___2~0#1;havoc main_~tmp___3~0#1;havoc main_~tmp___4~0#1;havoc main_~tmp___5~0#1;havoc main_~tmp___6~0#1;havoc main_~tmp___7~0#1;havoc main_~tmp___8~0#1;havoc main_~tmp___9~0#1;havoc main_~__retres23~0#1; {32144#true} is VALID [2022-02-21 03:10:25,283 INFO L272 TraceCheckUtils]: 2: Hoare triple {32144#true} call main_#t~ret22#1 := base2flt(0, 0); {32189#(and (= abs_77 |old(abs_77)|) (= abs_78 |old(abs_78)|))} is VALID [2022-02-21 03:10:25,283 INFO L290 TraceCheckUtils]: 3: Hoare triple {32189#(and (= abs_77 |old(abs_77)|) (= abs_78 |old(abs_78)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {32144#true} is VALID [2022-02-21 03:10:25,284 INFO L290 TraceCheckUtils]: 4: Hoare triple {32144#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {32190#(and (<= base2flt_~__retres4~0 0) (<= 0 base2flt_~__retres4~0))} is VALID [2022-02-21 03:10:25,284 INFO L290 TraceCheckUtils]: 5: Hoare triple {32190#(and (<= base2flt_~__retres4~0 0) (<= 0 base2flt_~__retres4~0))} #res := ~__retres4~0; {32191#(and (<= |base2flt_#res| 0) (<= 0 |base2flt_#res|))} is VALID [2022-02-21 03:10:25,284 INFO L290 TraceCheckUtils]: 6: Hoare triple {32191#(and (<= |base2flt_#res| 0) (<= 0 |base2flt_#res|))} assume true; {32191#(and (<= |base2flt_#res| 0) (<= 0 |base2flt_#res|))} is VALID [2022-02-21 03:10:25,285 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {32191#(and (<= |base2flt_#res| 0) (<= 0 |base2flt_#res|))} {32144#true} #453#return; {32151#(= |ULTIMATE.start_main_#t~ret22#1| 0)} is VALID [2022-02-21 03:10:25,285 INFO L290 TraceCheckUtils]: 8: Hoare triple {32151#(= |ULTIMATE.start_main_#t~ret22#1| 0)} main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1; {32152#(= |ULTIMATE.start_main_~zero~0#1| 0)} is VALID [2022-02-21 03:10:25,286 INFO L272 TraceCheckUtils]: 9: Hoare triple {32152#(= |ULTIMATE.start_main_~zero~0#1| 0)} call main_#t~ret23#1 := base2flt(main_~ma~2#1, main_~ea~2#1); {32189#(and (= abs_77 |old(abs_77)|) (= abs_78 |old(abs_78)|))} is VALID [2022-02-21 03:10:25,286 INFO L290 TraceCheckUtils]: 10: Hoare triple {32189#(and (= abs_77 |old(abs_77)|) (= abs_78 |old(abs_78)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {32144#true} is VALID [2022-02-21 03:10:25,286 INFO L290 TraceCheckUtils]: 11: Hoare triple {32144#true} assume !(0 == ~m % 4294967296); {32144#true} is VALID [2022-02-21 03:10:25,286 INFO L290 TraceCheckUtils]: 12: Hoare triple {32144#true} assume !(~m % 4294967296 < 16777216); {32144#true} is VALID [2022-02-21 03:10:25,286 INFO L290 TraceCheckUtils]: 13: Hoare triple {32144#true} assume !false; {32144#true} is VALID [2022-02-21 03:10:25,286 INFO L290 TraceCheckUtils]: 14: Hoare triple {32144#true} assume !(~m % 4294967296 >= 33554432); {32144#true} is VALID [2022-02-21 03:10:25,286 INFO L290 TraceCheckUtils]: 15: Hoare triple {32144#true} assume 0 == ~m || 0 == ~bitwiseComplement(16777216);~m := 0; {32144#true} is VALID [2022-02-21 03:10:25,286 INFO L290 TraceCheckUtils]: 16: Hoare triple {32144#true} assume 128 + ~e <= 2147483647; {32144#true} is VALID [2022-02-21 03:10:25,287 INFO L290 TraceCheckUtils]: 17: Hoare triple {32144#true} assume 128 + ~e >= -2147483648; {32144#true} is VALID [2022-02-21 03:10:25,287 INFO L290 TraceCheckUtils]: 18: Hoare triple {32144#true} assume 128 + ~e <= 2147483647; {32144#true} is VALID [2022-02-21 03:10:25,287 INFO L290 TraceCheckUtils]: 19: Hoare triple {32144#true} assume 128 + ~e >= -2147483648; {32144#true} is VALID [2022-02-21 03:10:25,287 INFO L290 TraceCheckUtils]: 20: Hoare triple {32144#true} assume !((1 == ~m && (0 == 16777216 * (128 + ~e) || 1 == 16777216 * (128 + ~e))) || ((0 == ~m || 1 == ~m) && 1 == 16777216 * (128 + ~e))); {32144#true} is VALID [2022-02-21 03:10:25,287 INFO L290 TraceCheckUtils]: 21: Hoare triple {32144#true} assume !(0 == ~m && (0 == 16777216 * (128 + ~e) || 1 == 16777216 * (128 + ~e))); {32144#true} is VALID [2022-02-21 03:10:25,287 INFO L290 TraceCheckUtils]: 22: Hoare triple {32144#true} assume !((0 == ~m || 1 == ~m) && 0 == 16777216 * (128 + ~e)); {32144#true} is VALID [2022-02-21 03:10:25,287 INFO L290 TraceCheckUtils]: 23: Hoare triple {32144#true} assume ~m >= 0 && 16777216 * (128 + ~e) >= 0;abs_78 := (if ~m < 16777216 * (128 + ~e) then 16777216 * (128 + ~e) else ~m);assume ~m >= 0 && 16777216 * (128 + ~e) >= 0;assume ~res~0 >= abs_78; {32144#true} is VALID [2022-02-21 03:10:25,287 INFO L290 TraceCheckUtils]: 24: Hoare triple {32144#true} ~__retres4~0 := ~res~0; {32144#true} is VALID [2022-02-21 03:10:25,288 INFO L290 TraceCheckUtils]: 25: Hoare triple {32144#true} #res := ~__retres4~0; {32144#true} is VALID [2022-02-21 03:10:25,288 INFO L290 TraceCheckUtils]: 26: Hoare triple {32144#true} assume true; {32144#true} is VALID [2022-02-21 03:10:25,288 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {32144#true} {32152#(= |ULTIMATE.start_main_~zero~0#1| 0)} #455#return; {32152#(= |ULTIMATE.start_main_~zero~0#1| 0)} is VALID [2022-02-21 03:10:25,288 INFO L290 TraceCheckUtils]: 28: Hoare triple {32152#(= |ULTIMATE.start_main_~zero~0#1| 0)} main_~a~0#1 := main_#t~ret23#1;havoc main_#t~ret23#1; {32152#(= |ULTIMATE.start_main_~zero~0#1| 0)} is VALID [2022-02-21 03:10:25,289 INFO L272 TraceCheckUtils]: 29: Hoare triple {32152#(= |ULTIMATE.start_main_~zero~0#1| 0)} call main_#t~ret24#1 := base2flt(main_~mb~2#1, main_~eb~2#1); {32189#(and (= abs_77 |old(abs_77)|) (= abs_78 |old(abs_78)|))} is VALID [2022-02-21 03:10:25,289 INFO L290 TraceCheckUtils]: 30: Hoare triple {32189#(and (= abs_77 |old(abs_77)|) (= abs_78 |old(abs_78)|))} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {32144#true} is VALID [2022-02-21 03:10:25,289 INFO L290 TraceCheckUtils]: 31: Hoare triple {32144#true} assume !(0 == ~m % 4294967296); {32144#true} is VALID [2022-02-21 03:10:25,289 INFO L290 TraceCheckUtils]: 32: Hoare triple {32144#true} assume !(~m % 4294967296 < 16777216); {32144#true} is VALID [2022-02-21 03:10:25,290 INFO L290 TraceCheckUtils]: 33: Hoare triple {32144#true} assume !false; {32144#true} is VALID [2022-02-21 03:10:25,290 INFO L290 TraceCheckUtils]: 34: Hoare triple {32144#true} assume !(~m % 4294967296 >= 33554432); {32144#true} is VALID [2022-02-21 03:10:25,291 INFO L290 TraceCheckUtils]: 35: Hoare triple {32144#true} assume 0 == ~m || 0 == ~bitwiseComplement(16777216);~m := 0; {32144#true} is VALID [2022-02-21 03:10:25,291 INFO L290 TraceCheckUtils]: 36: Hoare triple {32144#true} assume 128 + ~e <= 2147483647; {32144#true} is VALID [2022-02-21 03:10:25,291 INFO L290 TraceCheckUtils]: 37: Hoare triple {32144#true} assume 128 + ~e >= -2147483648; {32144#true} is VALID [2022-02-21 03:10:25,291 INFO L290 TraceCheckUtils]: 38: Hoare triple {32144#true} assume 128 + ~e <= 2147483647; {32144#true} is VALID [2022-02-21 03:10:25,291 INFO L290 TraceCheckUtils]: 39: Hoare triple {32144#true} assume 128 + ~e >= -2147483648; {32144#true} is VALID [2022-02-21 03:10:25,291 INFO L290 TraceCheckUtils]: 40: Hoare triple {32144#true} assume !((1 == ~m && (0 == 16777216 * (128 + ~e) || 1 == 16777216 * (128 + ~e))) || ((0 == ~m || 1 == ~m) && 1 == 16777216 * (128 + ~e))); {32144#true} is VALID [2022-02-21 03:10:25,292 INFO L290 TraceCheckUtils]: 41: Hoare triple {32144#true} assume 0 == ~m && (0 == 16777216 * (128 + ~e) || 1 == 16777216 * (128 + ~e));~res~0 := 16777216 * (128 + ~e); {32192#(and (<= 0 base2flt_~res~0) (<= base2flt_~res~0 0))} is VALID [2022-02-21 03:10:25,292 INFO L290 TraceCheckUtils]: 42: Hoare triple {32192#(and (<= 0 base2flt_~res~0) (<= base2flt_~res~0 0))} ~__retres4~0 := ~res~0; {32190#(and (<= base2flt_~__retres4~0 0) (<= 0 base2flt_~__retres4~0))} is VALID [2022-02-21 03:10:25,292 INFO L290 TraceCheckUtils]: 43: Hoare triple {32190#(and (<= base2flt_~__retres4~0 0) (<= 0 base2flt_~__retres4~0))} #res := ~__retres4~0; {32191#(and (<= |base2flt_#res| 0) (<= 0 |base2flt_#res|))} is VALID [2022-02-21 03:10:25,293 INFO L290 TraceCheckUtils]: 44: Hoare triple {32191#(and (<= |base2flt_#res| 0) (<= 0 |base2flt_#res|))} assume true; {32191#(and (<= |base2flt_#res| 0) (<= 0 |base2flt_#res|))} is VALID [2022-02-21 03:10:25,293 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {32191#(and (<= |base2flt_#res| 0) (<= 0 |base2flt_#res|))} {32152#(= |ULTIMATE.start_main_~zero~0#1| 0)} #457#return; {32187#(and (= |ULTIMATE.start_main_~zero~0#1| 0) (<= 0 |ULTIMATE.start_main_#t~ret24#1|) (<= |ULTIMATE.start_main_#t~ret24#1| 0))} is VALID [2022-02-21 03:10:25,294 INFO L290 TraceCheckUtils]: 46: Hoare triple {32187#(and (= |ULTIMATE.start_main_~zero~0#1| 0) (<= 0 |ULTIMATE.start_main_#t~ret24#1|) (<= |ULTIMATE.start_main_#t~ret24#1| 0))} main_~b~0#1 := main_#t~ret24#1;havoc main_#t~ret24#1; {32188#(and (<= |ULTIMATE.start_main_~b~0#1| 0) (= |ULTIMATE.start_main_~zero~0#1| 0) (<= (div |ULTIMATE.start_main_~zero~0#1| 4294967296) (div |ULTIMATE.start_main_~b~0#1| 4294967296)))} is VALID [2022-02-21 03:10:25,294 INFO L290 TraceCheckUtils]: 47: Hoare triple {32188#(and (<= |ULTIMATE.start_main_~b~0#1| 0) (= |ULTIMATE.start_main_~zero~0#1| 0) (<= (div |ULTIMATE.start_main_~zero~0#1| 4294967296) (div |ULTIMATE.start_main_~b~0#1| 4294967296)))} assume !(main_~a~0#1 % 4294967296 < main_~zero~0#1 % 4294967296); {32188#(and (<= |ULTIMATE.start_main_~b~0#1| 0) (= |ULTIMATE.start_main_~zero~0#1| 0) (<= (div |ULTIMATE.start_main_~zero~0#1| 4294967296) (div |ULTIMATE.start_main_~b~0#1| 4294967296)))} is VALID [2022-02-21 03:10:25,294 INFO L290 TraceCheckUtils]: 48: Hoare triple {32188#(and (<= |ULTIMATE.start_main_~b~0#1| 0) (= |ULTIMATE.start_main_~zero~0#1| 0) (<= (div |ULTIMATE.start_main_~zero~0#1| 4294967296) (div |ULTIMATE.start_main_~b~0#1| 4294967296)))} assume main_~a~0#1 % 4294967296 > main_~zero~0#1 % 4294967296;main_~tmp~2#1 := 1; {32188#(and (<= |ULTIMATE.start_main_~b~0#1| 0) (= |ULTIMATE.start_main_~zero~0#1| 0) (<= (div |ULTIMATE.start_main_~zero~0#1| 4294967296) (div |ULTIMATE.start_main_~b~0#1| 4294967296)))} is VALID [2022-02-21 03:10:25,295 INFO L290 TraceCheckUtils]: 49: Hoare triple {32188#(and (<= |ULTIMATE.start_main_~b~0#1| 0) (= |ULTIMATE.start_main_~zero~0#1| 0) (<= (div |ULTIMATE.start_main_~zero~0#1| 4294967296) (div |ULTIMATE.start_main_~b~0#1| 4294967296)))} main_~sa~0#1 := main_~tmp~2#1; {32188#(and (<= |ULTIMATE.start_main_~b~0#1| 0) (= |ULTIMATE.start_main_~zero~0#1| 0) (<= (div |ULTIMATE.start_main_~zero~0#1| 4294967296) (div |ULTIMATE.start_main_~b~0#1| 4294967296)))} is VALID [2022-02-21 03:10:25,295 INFO L290 TraceCheckUtils]: 50: Hoare triple {32188#(and (<= |ULTIMATE.start_main_~b~0#1| 0) (= |ULTIMATE.start_main_~zero~0#1| 0) (<= (div |ULTIMATE.start_main_~zero~0#1| 4294967296) (div |ULTIMATE.start_main_~b~0#1| 4294967296)))} assume !(main_~b~0#1 % 4294967296 < main_~zero~0#1 % 4294967296); {32188#(and (<= |ULTIMATE.start_main_~b~0#1| 0) (= |ULTIMATE.start_main_~zero~0#1| 0) (<= (div |ULTIMATE.start_main_~zero~0#1| 4294967296) (div |ULTIMATE.start_main_~b~0#1| 4294967296)))} is VALID [2022-02-21 03:10:25,296 INFO L290 TraceCheckUtils]: 51: Hoare triple {32188#(and (<= |ULTIMATE.start_main_~b~0#1| 0) (= |ULTIMATE.start_main_~zero~0#1| 0) (<= (div |ULTIMATE.start_main_~zero~0#1| 4294967296) (div |ULTIMATE.start_main_~b~0#1| 4294967296)))} assume main_~b~0#1 % 4294967296 > main_~zero~0#1 % 4294967296;main_~tmp___0~0#1 := 1; {32145#false} is VALID [2022-02-21 03:10:25,296 INFO L290 TraceCheckUtils]: 52: Hoare triple {32145#false} main_~sb~0#1 := main_~tmp___0~0#1; {32145#false} is VALID [2022-02-21 03:10:25,296 INFO L290 TraceCheckUtils]: 53: Hoare triple {32145#false} assume { :begin_inline_addflt } true;addflt_#in~a#1, addflt_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc addflt_#res#1;havoc addflt_#t~nondet6#1, addflt_#t~nondet7#1, addflt_#t~nondet8#1, addflt_#t~nondet9#1, addflt_#t~nondet10#1, addflt_#t~nondet11#1, addflt_~a#1, addflt_~b#1, addflt_~res~1#1, addflt_~ma~0#1, addflt_~mb~0#1, addflt_~delta~0#1, addflt_~ea~0#1, addflt_~eb~0#1, addflt_~tmp~0#1, addflt_~__retres10~0#1;addflt_~a#1 := addflt_#in~a#1;addflt_~b#1 := addflt_#in~b#1;havoc addflt_~res~1#1;havoc addflt_~ma~0#1;havoc addflt_~mb~0#1;havoc addflt_~delta~0#1;havoc addflt_~ea~0#1;havoc addflt_~eb~0#1;havoc addflt_~tmp~0#1;havoc addflt_~__retres10~0#1; {32145#false} is VALID [2022-02-21 03:10:25,296 INFO L290 TraceCheckUtils]: 54: Hoare triple {32145#false} assume !(addflt_~a#1 % 4294967296 < addflt_~b#1 % 4294967296); {32145#false} is VALID [2022-02-21 03:10:25,296 INFO L290 TraceCheckUtils]: 55: Hoare triple {32145#false} assume !(0 == addflt_~b#1 % 4294967296); {32145#false} is VALID [2022-02-21 03:10:25,296 INFO L290 TraceCheckUtils]: 56: Hoare triple {32145#false} assume !(0 == addflt_~a#1); {32145#false} is VALID [2022-02-21 03:10:25,296 INFO L290 TraceCheckUtils]: 57: Hoare triple {32145#false} assume !false; {32145#false} is VALID [2022-02-21 03:10:25,296 INFO L290 TraceCheckUtils]: 58: Hoare triple {32145#false} assume !false; {32145#false} is VALID [2022-02-21 03:10:25,297 INFO L290 TraceCheckUtils]: 59: Hoare triple {32145#false} assume addflt_~a#1 >= 0;abs_109 := (if addflt_~a#1 < 16777215 then addflt_~a#1 else 16777215);assume addflt_~a#1 >= 0;assume addflt_~ma~0#1 < abs_109; {32145#false} is VALID [2022-02-21 03:10:25,297 INFO L290 TraceCheckUtils]: 60: Hoare triple {32145#false} assume (if addflt_~a#1 / 16777216 % 4294967296 % 4294967296 <= 2147483647 then addflt_~a#1 / 16777216 % 4294967296 % 4294967296 else addflt_~a#1 / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 <= 2147483647; {32145#false} is VALID [2022-02-21 03:10:25,297 INFO L290 TraceCheckUtils]: 61: Hoare triple {32145#false} assume !((if addflt_~a#1 / 16777216 % 4294967296 % 4294967296 <= 2147483647 then addflt_~a#1 / 16777216 % 4294967296 % 4294967296 else addflt_~a#1 / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 >= -2147483648); {32145#false} is VALID [2022-02-21 03:10:25,297 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-02-21 03:10:25,297 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:10:25,297 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235458677] [2022-02-21 03:10:25,297 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1235458677] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:10:25,298 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1281032834] [2022-02-21 03:10:25,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:10:25,298 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:10:25,298 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:10:25,299 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:10:25,326 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-02-21 03:10:25,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:25,357 INFO L263 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 21 conjunts are in the unsatisfiable core [2022-02-21 03:10:25,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:10:25,367 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:10:25,713 INFO L290 TraceCheckUtils]: 0: Hoare triple {32144#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(24, 2);call #Ultimate.allocInit(12, 3); {32144#true} is VALID [2022-02-21 03:10:25,713 INFO L290 TraceCheckUtils]: 1: Hoare triple {32144#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_~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_add~0#1, main_~zero~0#1, main_~sa~0#1, main_~sb~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~tmp___1~0#1, main_~tmp___2~0#1, main_~tmp___3~0#1, main_~tmp___4~0#1, main_~tmp___5~0#1, main_~tmp___6~0#1, main_~tmp___7~0#1, main_~tmp___8~0#1, main_~tmp___9~0#1, main_~__retres23~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_add~0#1;havoc main_~zero~0#1;havoc main_~sa~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_~tmp___2~0#1;havoc main_~tmp___3~0#1;havoc main_~tmp___4~0#1;havoc main_~tmp___5~0#1;havoc main_~tmp___6~0#1;havoc main_~tmp___7~0#1;havoc main_~tmp___8~0#1;havoc main_~tmp___9~0#1;havoc main_~__retres23~0#1; {32144#true} is VALID [2022-02-21 03:10:25,713 INFO L272 TraceCheckUtils]: 2: Hoare triple {32144#true} call main_#t~ret22#1 := base2flt(0, 0); {32144#true} is VALID [2022-02-21 03:10:25,714 INFO L290 TraceCheckUtils]: 3: Hoare triple {32144#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {32205#(= base2flt_~m |base2flt_#in~m|)} is VALID [2022-02-21 03:10:25,714 INFO L290 TraceCheckUtils]: 4: Hoare triple {32205#(= base2flt_~m |base2flt_#in~m|)} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {32209#(<= (mod |base2flt_#in~m| 4294967296) 0)} is VALID [2022-02-21 03:10:25,714 INFO L290 TraceCheckUtils]: 5: Hoare triple {32209#(<= (mod |base2flt_#in~m| 4294967296) 0)} #res := ~__retres4~0; {32209#(<= (mod |base2flt_#in~m| 4294967296) 0)} is VALID [2022-02-21 03:10:25,715 INFO L290 TraceCheckUtils]: 6: Hoare triple {32209#(<= (mod |base2flt_#in~m| 4294967296) 0)} assume true; {32209#(<= (mod |base2flt_#in~m| 4294967296) 0)} is VALID [2022-02-21 03:10:25,715 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {32209#(<= (mod |base2flt_#in~m| 4294967296) 0)} {32144#true} #453#return; {32144#true} is VALID [2022-02-21 03:10:25,715 INFO L290 TraceCheckUtils]: 8: Hoare triple {32144#true} main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1; {32144#true} is VALID [2022-02-21 03:10:25,715 INFO L272 TraceCheckUtils]: 9: Hoare triple {32144#true} call main_#t~ret23#1 := base2flt(main_~ma~2#1, main_~ea~2#1); {32144#true} is VALID [2022-02-21 03:10:25,715 INFO L290 TraceCheckUtils]: 10: Hoare triple {32144#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {32144#true} is VALID [2022-02-21 03:10:25,715 INFO L290 TraceCheckUtils]: 11: Hoare triple {32144#true} assume !(0 == ~m % 4294967296); {32144#true} is VALID [2022-02-21 03:10:25,715 INFO L290 TraceCheckUtils]: 12: Hoare triple {32144#true} assume !(~m % 4294967296 < 16777216); {32144#true} is VALID [2022-02-21 03:10:25,715 INFO L290 TraceCheckUtils]: 13: Hoare triple {32144#true} assume !false; {32144#true} is VALID [2022-02-21 03:10:25,715 INFO L290 TraceCheckUtils]: 14: Hoare triple {32144#true} assume !(~m % 4294967296 >= 33554432); {32144#true} is VALID [2022-02-21 03:10:25,715 INFO L290 TraceCheckUtils]: 15: Hoare triple {32144#true} assume 0 == ~m || 0 == ~bitwiseComplement(16777216);~m := 0; {32144#true} is VALID [2022-02-21 03:10:25,715 INFO L290 TraceCheckUtils]: 16: Hoare triple {32144#true} assume 128 + ~e <= 2147483647; {32144#true} is VALID [2022-02-21 03:10:25,715 INFO L290 TraceCheckUtils]: 17: Hoare triple {32144#true} assume 128 + ~e >= -2147483648; {32144#true} is VALID [2022-02-21 03:10:25,715 INFO L290 TraceCheckUtils]: 18: Hoare triple {32144#true} assume 128 + ~e <= 2147483647; {32144#true} is VALID [2022-02-21 03:10:25,715 INFO L290 TraceCheckUtils]: 19: Hoare triple {32144#true} assume 128 + ~e >= -2147483648; {32144#true} is VALID [2022-02-21 03:10:25,715 INFO L290 TraceCheckUtils]: 20: Hoare triple {32144#true} assume !((1 == ~m && (0 == 16777216 * (128 + ~e) || 1 == 16777216 * (128 + ~e))) || ((0 == ~m || 1 == ~m) && 1 == 16777216 * (128 + ~e))); {32144#true} is VALID [2022-02-21 03:10:25,715 INFO L290 TraceCheckUtils]: 21: Hoare triple {32144#true} assume !(0 == ~m && (0 == 16777216 * (128 + ~e) || 1 == 16777216 * (128 + ~e))); {32144#true} is VALID [2022-02-21 03:10:25,715 INFO L290 TraceCheckUtils]: 22: Hoare triple {32144#true} assume !((0 == ~m || 1 == ~m) && 0 == 16777216 * (128 + ~e)); {32144#true} is VALID [2022-02-21 03:10:25,716 INFO L290 TraceCheckUtils]: 23: Hoare triple {32144#true} assume ~m >= 0 && 16777216 * (128 + ~e) >= 0;abs_78 := (if ~m < 16777216 * (128 + ~e) then 16777216 * (128 + ~e) else ~m);assume ~m >= 0 && 16777216 * (128 + ~e) >= 0;assume ~res~0 >= abs_78; {32144#true} is VALID [2022-02-21 03:10:25,716 INFO L290 TraceCheckUtils]: 24: Hoare triple {32144#true} ~__retres4~0 := ~res~0; {32144#true} is VALID [2022-02-21 03:10:25,716 INFO L290 TraceCheckUtils]: 25: Hoare triple {32144#true} #res := ~__retres4~0; {32144#true} is VALID [2022-02-21 03:10:25,716 INFO L290 TraceCheckUtils]: 26: Hoare triple {32144#true} assume true; {32144#true} is VALID [2022-02-21 03:10:25,716 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {32144#true} {32144#true} #455#return; {32144#true} is VALID [2022-02-21 03:10:25,716 INFO L290 TraceCheckUtils]: 28: Hoare triple {32144#true} main_~a~0#1 := main_#t~ret23#1;havoc main_#t~ret23#1; {32144#true} is VALID [2022-02-21 03:10:25,716 INFO L272 TraceCheckUtils]: 29: Hoare triple {32144#true} call main_#t~ret24#1 := base2flt(main_~mb~2#1, main_~eb~2#1); {32144#true} is VALID [2022-02-21 03:10:25,716 INFO L290 TraceCheckUtils]: 30: Hoare triple {32144#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {32144#true} is VALID [2022-02-21 03:10:25,716 INFO L290 TraceCheckUtils]: 31: Hoare triple {32144#true} assume !(0 == ~m % 4294967296); {32144#true} is VALID [2022-02-21 03:10:25,716 INFO L290 TraceCheckUtils]: 32: Hoare triple {32144#true} assume !(~m % 4294967296 < 16777216); {32144#true} is VALID [2022-02-21 03:10:25,716 INFO L290 TraceCheckUtils]: 33: Hoare triple {32144#true} assume !false; {32144#true} is VALID [2022-02-21 03:10:25,716 INFO L290 TraceCheckUtils]: 34: Hoare triple {32144#true} assume !(~m % 4294967296 >= 33554432); {32144#true} is VALID [2022-02-21 03:10:25,716 INFO L290 TraceCheckUtils]: 35: Hoare triple {32144#true} assume 0 == ~m || 0 == ~bitwiseComplement(16777216);~m := 0; {32144#true} is VALID [2022-02-21 03:10:25,716 INFO L290 TraceCheckUtils]: 36: Hoare triple {32144#true} assume 128 + ~e <= 2147483647; {32144#true} is VALID [2022-02-21 03:10:25,716 INFO L290 TraceCheckUtils]: 37: Hoare triple {32144#true} assume 128 + ~e >= -2147483648; {32144#true} is VALID [2022-02-21 03:10:25,716 INFO L290 TraceCheckUtils]: 38: Hoare triple {32144#true} assume 128 + ~e <= 2147483647; {32144#true} is VALID [2022-02-21 03:10:25,716 INFO L290 TraceCheckUtils]: 39: Hoare triple {32144#true} assume 128 + ~e >= -2147483648; {32144#true} is VALID [2022-02-21 03:10:25,716 INFO L290 TraceCheckUtils]: 40: Hoare triple {32144#true} assume !((1 == ~m && (0 == 16777216 * (128 + ~e) || 1 == 16777216 * (128 + ~e))) || ((0 == ~m || 1 == ~m) && 1 == 16777216 * (128 + ~e))); {32144#true} is VALID [2022-02-21 03:10:25,717 INFO L290 TraceCheckUtils]: 41: Hoare triple {32144#true} assume 0 == ~m && (0 == 16777216 * (128 + ~e) || 1 == 16777216 * (128 + ~e));~res~0 := 16777216 * (128 + ~e); {32192#(and (<= 0 base2flt_~res~0) (<= base2flt_~res~0 0))} is VALID [2022-02-21 03:10:25,717 INFO L290 TraceCheckUtils]: 42: Hoare triple {32192#(and (<= 0 base2flt_~res~0) (<= base2flt_~res~0 0))} ~__retres4~0 := ~res~0; {32190#(and (<= base2flt_~__retres4~0 0) (<= 0 base2flt_~__retres4~0))} is VALID [2022-02-21 03:10:25,717 INFO L290 TraceCheckUtils]: 43: Hoare triple {32190#(and (<= base2flt_~__retres4~0 0) (<= 0 base2flt_~__retres4~0))} #res := ~__retres4~0; {32191#(and (<= |base2flt_#res| 0) (<= 0 |base2flt_#res|))} is VALID [2022-02-21 03:10:25,718 INFO L290 TraceCheckUtils]: 44: Hoare triple {32191#(and (<= |base2flt_#res| 0) (<= 0 |base2flt_#res|))} assume true; {32191#(and (<= |base2flt_#res| 0) (<= 0 |base2flt_#res|))} is VALID [2022-02-21 03:10:25,718 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {32191#(and (<= |base2flt_#res| 0) (<= 0 |base2flt_#res|))} {32144#true} #457#return; {32333#(and (<= 0 |ULTIMATE.start_main_#t~ret24#1|) (<= |ULTIMATE.start_main_#t~ret24#1| 0))} is VALID [2022-02-21 03:10:25,719 INFO L290 TraceCheckUtils]: 46: Hoare triple {32333#(and (<= 0 |ULTIMATE.start_main_#t~ret24#1|) (<= |ULTIMATE.start_main_#t~ret24#1| 0))} main_~b~0#1 := main_#t~ret24#1;havoc main_#t~ret24#1; {32337#(and (<= 0 |ULTIMATE.start_main_~b~0#1|) (<= |ULTIMATE.start_main_~b~0#1| 0))} is VALID [2022-02-21 03:10:25,719 INFO L290 TraceCheckUtils]: 47: Hoare triple {32337#(and (<= 0 |ULTIMATE.start_main_~b~0#1|) (<= |ULTIMATE.start_main_~b~0#1| 0))} assume !(main_~a~0#1 % 4294967296 < main_~zero~0#1 % 4294967296); {32337#(and (<= 0 |ULTIMATE.start_main_~b~0#1|) (<= |ULTIMATE.start_main_~b~0#1| 0))} is VALID [2022-02-21 03:10:25,719 INFO L290 TraceCheckUtils]: 48: Hoare triple {32337#(and (<= 0 |ULTIMATE.start_main_~b~0#1|) (<= |ULTIMATE.start_main_~b~0#1| 0))} assume main_~a~0#1 % 4294967296 > main_~zero~0#1 % 4294967296;main_~tmp~2#1 := 1; {32337#(and (<= 0 |ULTIMATE.start_main_~b~0#1|) (<= |ULTIMATE.start_main_~b~0#1| 0))} is VALID [2022-02-21 03:10:25,720 INFO L290 TraceCheckUtils]: 49: Hoare triple {32337#(and (<= 0 |ULTIMATE.start_main_~b~0#1|) (<= |ULTIMATE.start_main_~b~0#1| 0))} main_~sa~0#1 := main_~tmp~2#1; {32337#(and (<= 0 |ULTIMATE.start_main_~b~0#1|) (<= |ULTIMATE.start_main_~b~0#1| 0))} is VALID [2022-02-21 03:10:25,720 INFO L290 TraceCheckUtils]: 50: Hoare triple {32337#(and (<= 0 |ULTIMATE.start_main_~b~0#1|) (<= |ULTIMATE.start_main_~b~0#1| 0))} assume !(main_~b~0#1 % 4294967296 < main_~zero~0#1 % 4294967296); {32337#(and (<= 0 |ULTIMATE.start_main_~b~0#1|) (<= |ULTIMATE.start_main_~b~0#1| 0))} is VALID [2022-02-21 03:10:25,720 INFO L290 TraceCheckUtils]: 51: Hoare triple {32337#(and (<= 0 |ULTIMATE.start_main_~b~0#1|) (<= |ULTIMATE.start_main_~b~0#1| 0))} assume main_~b~0#1 % 4294967296 > main_~zero~0#1 % 4294967296;main_~tmp___0~0#1 := 1; {32337#(and (<= 0 |ULTIMATE.start_main_~b~0#1|) (<= |ULTIMATE.start_main_~b~0#1| 0))} is VALID [2022-02-21 03:10:25,721 INFO L290 TraceCheckUtils]: 52: Hoare triple {32337#(and (<= 0 |ULTIMATE.start_main_~b~0#1|) (<= |ULTIMATE.start_main_~b~0#1| 0))} main_~sb~0#1 := main_~tmp___0~0#1; {32337#(and (<= 0 |ULTIMATE.start_main_~b~0#1|) (<= |ULTIMATE.start_main_~b~0#1| 0))} is VALID [2022-02-21 03:10:25,721 INFO L290 TraceCheckUtils]: 53: Hoare triple {32337#(and (<= 0 |ULTIMATE.start_main_~b~0#1|) (<= |ULTIMATE.start_main_~b~0#1| 0))} assume { :begin_inline_addflt } true;addflt_#in~a#1, addflt_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc addflt_#res#1;havoc addflt_#t~nondet6#1, addflt_#t~nondet7#1, addflt_#t~nondet8#1, addflt_#t~nondet9#1, addflt_#t~nondet10#1, addflt_#t~nondet11#1, addflt_~a#1, addflt_~b#1, addflt_~res~1#1, addflt_~ma~0#1, addflt_~mb~0#1, addflt_~delta~0#1, addflt_~ea~0#1, addflt_~eb~0#1, addflt_~tmp~0#1, addflt_~__retres10~0#1;addflt_~a#1 := addflt_#in~a#1;addflt_~b#1 := addflt_#in~b#1;havoc addflt_~res~1#1;havoc addflt_~ma~0#1;havoc addflt_~mb~0#1;havoc addflt_~delta~0#1;havoc addflt_~ea~0#1;havoc addflt_~eb~0#1;havoc addflt_~tmp~0#1;havoc addflt_~__retres10~0#1; {32359#(and (<= |ULTIMATE.start_addflt_~b#1| 0) (<= 0 |ULTIMATE.start_addflt_~b#1|))} is VALID [2022-02-21 03:10:25,721 INFO L290 TraceCheckUtils]: 54: Hoare triple {32359#(and (<= |ULTIMATE.start_addflt_~b#1| 0) (<= 0 |ULTIMATE.start_addflt_~b#1|))} assume !(addflt_~a#1 % 4294967296 < addflt_~b#1 % 4294967296); {32359#(and (<= |ULTIMATE.start_addflt_~b#1| 0) (<= 0 |ULTIMATE.start_addflt_~b#1|))} is VALID [2022-02-21 03:10:25,722 INFO L290 TraceCheckUtils]: 55: Hoare triple {32359#(and (<= |ULTIMATE.start_addflt_~b#1| 0) (<= 0 |ULTIMATE.start_addflt_~b#1|))} assume !(0 == addflt_~b#1 % 4294967296); {32145#false} is VALID [2022-02-21 03:10:25,722 INFO L290 TraceCheckUtils]: 56: Hoare triple {32145#false} assume !(0 == addflt_~a#1); {32145#false} is VALID [2022-02-21 03:10:25,722 INFO L290 TraceCheckUtils]: 57: Hoare triple {32145#false} assume !false; {32145#false} is VALID [2022-02-21 03:10:25,722 INFO L290 TraceCheckUtils]: 58: Hoare triple {32145#false} assume !false; {32145#false} is VALID [2022-02-21 03:10:25,722 INFO L290 TraceCheckUtils]: 59: Hoare triple {32145#false} assume addflt_~a#1 >= 0;abs_109 := (if addflt_~a#1 < 16777215 then addflt_~a#1 else 16777215);assume addflt_~a#1 >= 0;assume addflt_~ma~0#1 < abs_109; {32145#false} is VALID [2022-02-21 03:10:25,722 INFO L290 TraceCheckUtils]: 60: Hoare triple {32145#false} assume (if addflt_~a#1 / 16777216 % 4294967296 % 4294967296 <= 2147483647 then addflt_~a#1 / 16777216 % 4294967296 % 4294967296 else addflt_~a#1 / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 <= 2147483647; {32145#false} is VALID [2022-02-21 03:10:25,722 INFO L290 TraceCheckUtils]: 61: Hoare triple {32145#false} assume !((if addflt_~a#1 / 16777216 % 4294967296 % 4294967296 <= 2147483647 then addflt_~a#1 / 16777216 % 4294967296 % 4294967296 else addflt_~a#1 / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 >= -2147483648); {32145#false} is VALID [2022-02-21 03:10:25,723 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-02-21 03:10:25,723 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:10:25,989 INFO L290 TraceCheckUtils]: 61: Hoare triple {32145#false} assume !((if addflt_~a#1 / 16777216 % 4294967296 % 4294967296 <= 2147483647 then addflt_~a#1 / 16777216 % 4294967296 % 4294967296 else addflt_~a#1 / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 >= -2147483648); {32145#false} is VALID [2022-02-21 03:10:25,989 INFO L290 TraceCheckUtils]: 60: Hoare triple {32145#false} assume (if addflt_~a#1 / 16777216 % 4294967296 % 4294967296 <= 2147483647 then addflt_~a#1 / 16777216 % 4294967296 % 4294967296 else addflt_~a#1 / 16777216 % 4294967296 % 4294967296 - 4294967296) - 128 <= 2147483647; {32145#false} is VALID [2022-02-21 03:10:25,989 INFO L290 TraceCheckUtils]: 59: Hoare triple {32145#false} assume addflt_~a#1 >= 0;abs_109 := (if addflt_~a#1 < 16777215 then addflt_~a#1 else 16777215);assume addflt_~a#1 >= 0;assume addflt_~ma~0#1 < abs_109; {32145#false} is VALID [2022-02-21 03:10:25,989 INFO L290 TraceCheckUtils]: 58: Hoare triple {32145#false} assume !false; {32145#false} is VALID [2022-02-21 03:10:25,989 INFO L290 TraceCheckUtils]: 57: Hoare triple {32145#false} assume !false; {32145#false} is VALID [2022-02-21 03:10:25,989 INFO L290 TraceCheckUtils]: 56: Hoare triple {32145#false} assume !(0 == addflt_~a#1); {32145#false} is VALID [2022-02-21 03:10:25,990 INFO L290 TraceCheckUtils]: 55: Hoare triple {32402#(= (mod |ULTIMATE.start_addflt_~b#1| 4294967296) 0)} assume !(0 == addflt_~b#1 % 4294967296); {32145#false} is VALID [2022-02-21 03:10:25,990 INFO L290 TraceCheckUtils]: 54: Hoare triple {32402#(= (mod |ULTIMATE.start_addflt_~b#1| 4294967296) 0)} assume !(addflt_~a#1 % 4294967296 < addflt_~b#1 % 4294967296); {32402#(= (mod |ULTIMATE.start_addflt_~b#1| 4294967296) 0)} is VALID [2022-02-21 03:10:25,990 INFO L290 TraceCheckUtils]: 53: Hoare triple {32409#(= (mod |ULTIMATE.start_main_~b~0#1| 4294967296) 0)} assume { :begin_inline_addflt } true;addflt_#in~a#1, addflt_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc addflt_#res#1;havoc addflt_#t~nondet6#1, addflt_#t~nondet7#1, addflt_#t~nondet8#1, addflt_#t~nondet9#1, addflt_#t~nondet10#1, addflt_#t~nondet11#1, addflt_~a#1, addflt_~b#1, addflt_~res~1#1, addflt_~ma~0#1, addflt_~mb~0#1, addflt_~delta~0#1, addflt_~ea~0#1, addflt_~eb~0#1, addflt_~tmp~0#1, addflt_~__retres10~0#1;addflt_~a#1 := addflt_#in~a#1;addflt_~b#1 := addflt_#in~b#1;havoc addflt_~res~1#1;havoc addflt_~ma~0#1;havoc addflt_~mb~0#1;havoc addflt_~delta~0#1;havoc addflt_~ea~0#1;havoc addflt_~eb~0#1;havoc addflt_~tmp~0#1;havoc addflt_~__retres10~0#1; {32402#(= (mod |ULTIMATE.start_addflt_~b#1| 4294967296) 0)} is VALID [2022-02-21 03:10:25,991 INFO L290 TraceCheckUtils]: 52: Hoare triple {32409#(= (mod |ULTIMATE.start_main_~b~0#1| 4294967296) 0)} main_~sb~0#1 := main_~tmp___0~0#1; {32409#(= (mod |ULTIMATE.start_main_~b~0#1| 4294967296) 0)} is VALID [2022-02-21 03:10:25,991 INFO L290 TraceCheckUtils]: 51: Hoare triple {32409#(= (mod |ULTIMATE.start_main_~b~0#1| 4294967296) 0)} assume main_~b~0#1 % 4294967296 > main_~zero~0#1 % 4294967296;main_~tmp___0~0#1 := 1; {32409#(= (mod |ULTIMATE.start_main_~b~0#1| 4294967296) 0)} is VALID [2022-02-21 03:10:25,991 INFO L290 TraceCheckUtils]: 50: Hoare triple {32409#(= (mod |ULTIMATE.start_main_~b~0#1| 4294967296) 0)} assume !(main_~b~0#1 % 4294967296 < main_~zero~0#1 % 4294967296); {32409#(= (mod |ULTIMATE.start_main_~b~0#1| 4294967296) 0)} is VALID [2022-02-21 03:10:25,992 INFO L290 TraceCheckUtils]: 49: Hoare triple {32409#(= (mod |ULTIMATE.start_main_~b~0#1| 4294967296) 0)} main_~sa~0#1 := main_~tmp~2#1; {32409#(= (mod |ULTIMATE.start_main_~b~0#1| 4294967296) 0)} is VALID [2022-02-21 03:10:25,992 INFO L290 TraceCheckUtils]: 48: Hoare triple {32409#(= (mod |ULTIMATE.start_main_~b~0#1| 4294967296) 0)} assume main_~a~0#1 % 4294967296 > main_~zero~0#1 % 4294967296;main_~tmp~2#1 := 1; {32409#(= (mod |ULTIMATE.start_main_~b~0#1| 4294967296) 0)} is VALID [2022-02-21 03:10:25,992 INFO L290 TraceCheckUtils]: 47: Hoare triple {32409#(= (mod |ULTIMATE.start_main_~b~0#1| 4294967296) 0)} assume !(main_~a~0#1 % 4294967296 < main_~zero~0#1 % 4294967296); {32409#(= (mod |ULTIMATE.start_main_~b~0#1| 4294967296) 0)} is VALID [2022-02-21 03:10:25,993 INFO L290 TraceCheckUtils]: 46: Hoare triple {32431#(= (mod |ULTIMATE.start_main_#t~ret24#1| 4294967296) 0)} main_~b~0#1 := main_#t~ret24#1;havoc main_#t~ret24#1; {32409#(= (mod |ULTIMATE.start_main_~b~0#1| 4294967296) 0)} is VALID [2022-02-21 03:10:25,993 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {32438#(= (mod |base2flt_#res| 4294967296) 0)} {32144#true} #457#return; {32431#(= (mod |ULTIMATE.start_main_#t~ret24#1| 4294967296) 0)} is VALID [2022-02-21 03:10:25,994 INFO L290 TraceCheckUtils]: 44: Hoare triple {32438#(= (mod |base2flt_#res| 4294967296) 0)} assume true; {32438#(= (mod |base2flt_#res| 4294967296) 0)} is VALID [2022-02-21 03:10:25,994 INFO L290 TraceCheckUtils]: 43: Hoare triple {32445#(= (mod base2flt_~__retres4~0 4294967296) 0)} #res := ~__retres4~0; {32438#(= (mod |base2flt_#res| 4294967296) 0)} is VALID [2022-02-21 03:10:25,994 INFO L290 TraceCheckUtils]: 42: Hoare triple {32449#(= (mod base2flt_~res~0 4294967296) 0)} ~__retres4~0 := ~res~0; {32445#(= (mod base2flt_~__retres4~0 4294967296) 0)} is VALID [2022-02-21 03:10:25,995 INFO L290 TraceCheckUtils]: 41: Hoare triple {32144#true} assume 0 == ~m && (0 == 16777216 * (128 + ~e) || 1 == 16777216 * (128 + ~e));~res~0 := 16777216 * (128 + ~e); {32449#(= (mod base2flt_~res~0 4294967296) 0)} is VALID [2022-02-21 03:10:25,995 INFO L290 TraceCheckUtils]: 40: Hoare triple {32144#true} assume !((1 == ~m && (0 == 16777216 * (128 + ~e) || 1 == 16777216 * (128 + ~e))) || ((0 == ~m || 1 == ~m) && 1 == 16777216 * (128 + ~e))); {32144#true} is VALID [2022-02-21 03:10:25,995 INFO L290 TraceCheckUtils]: 39: Hoare triple {32144#true} assume 128 + ~e >= -2147483648; {32144#true} is VALID [2022-02-21 03:10:25,995 INFO L290 TraceCheckUtils]: 38: Hoare triple {32144#true} assume 128 + ~e <= 2147483647; {32144#true} is VALID [2022-02-21 03:10:25,995 INFO L290 TraceCheckUtils]: 37: Hoare triple {32144#true} assume 128 + ~e >= -2147483648; {32144#true} is VALID [2022-02-21 03:10:25,995 INFO L290 TraceCheckUtils]: 36: Hoare triple {32144#true} assume 128 + ~e <= 2147483647; {32144#true} is VALID [2022-02-21 03:10:25,995 INFO L290 TraceCheckUtils]: 35: Hoare triple {32144#true} assume 0 == ~m || 0 == ~bitwiseComplement(16777216);~m := 0; {32144#true} is VALID [2022-02-21 03:10:25,995 INFO L290 TraceCheckUtils]: 34: Hoare triple {32144#true} assume !(~m % 4294967296 >= 33554432); {32144#true} is VALID [2022-02-21 03:10:25,996 INFO L290 TraceCheckUtils]: 33: Hoare triple {32144#true} assume !false; {32144#true} is VALID [2022-02-21 03:10:25,996 INFO L290 TraceCheckUtils]: 32: Hoare triple {32144#true} assume !(~m % 4294967296 < 16777216); {32144#true} is VALID [2022-02-21 03:10:25,996 INFO L290 TraceCheckUtils]: 31: Hoare triple {32144#true} assume !(0 == ~m % 4294967296); {32144#true} is VALID [2022-02-21 03:10:25,996 INFO L290 TraceCheckUtils]: 30: Hoare triple {32144#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {32144#true} is VALID [2022-02-21 03:10:25,996 INFO L272 TraceCheckUtils]: 29: Hoare triple {32144#true} call main_#t~ret24#1 := base2flt(main_~mb~2#1, main_~eb~2#1); {32144#true} is VALID [2022-02-21 03:10:25,996 INFO L290 TraceCheckUtils]: 28: Hoare triple {32144#true} main_~a~0#1 := main_#t~ret23#1;havoc main_#t~ret23#1; {32144#true} is VALID [2022-02-21 03:10:25,996 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {32144#true} {32144#true} #455#return; {32144#true} is VALID [2022-02-21 03:10:25,996 INFO L290 TraceCheckUtils]: 26: Hoare triple {32144#true} assume true; {32144#true} is VALID [2022-02-21 03:10:25,996 INFO L290 TraceCheckUtils]: 25: Hoare triple {32144#true} #res := ~__retres4~0; {32144#true} is VALID [2022-02-21 03:10:25,997 INFO L290 TraceCheckUtils]: 24: Hoare triple {32144#true} ~__retres4~0 := ~res~0; {32144#true} is VALID [2022-02-21 03:10:25,997 INFO L290 TraceCheckUtils]: 23: Hoare triple {32144#true} assume ~m >= 0 && 16777216 * (128 + ~e) >= 0;abs_78 := (if ~m < 16777216 * (128 + ~e) then 16777216 * (128 + ~e) else ~m);assume ~m >= 0 && 16777216 * (128 + ~e) >= 0;assume ~res~0 >= abs_78; {32144#true} is VALID [2022-02-21 03:10:25,997 INFO L290 TraceCheckUtils]: 22: Hoare triple {32144#true} assume !((0 == ~m || 1 == ~m) && 0 == 16777216 * (128 + ~e)); {32144#true} is VALID [2022-02-21 03:10:25,997 INFO L290 TraceCheckUtils]: 21: Hoare triple {32144#true} assume !(0 == ~m && (0 == 16777216 * (128 + ~e) || 1 == 16777216 * (128 + ~e))); {32144#true} is VALID [2022-02-21 03:10:25,997 INFO L290 TraceCheckUtils]: 20: Hoare triple {32144#true} assume !((1 == ~m && (0 == 16777216 * (128 + ~e) || 1 == 16777216 * (128 + ~e))) || ((0 == ~m || 1 == ~m) && 1 == 16777216 * (128 + ~e))); {32144#true} is VALID [2022-02-21 03:10:25,997 INFO L290 TraceCheckUtils]: 19: Hoare triple {32144#true} assume 128 + ~e >= -2147483648; {32144#true} is VALID [2022-02-21 03:10:25,997 INFO L290 TraceCheckUtils]: 18: Hoare triple {32144#true} assume 128 + ~e <= 2147483647; {32144#true} is VALID [2022-02-21 03:10:25,997 INFO L290 TraceCheckUtils]: 17: Hoare triple {32144#true} assume 128 + ~e >= -2147483648; {32144#true} is VALID [2022-02-21 03:10:25,997 INFO L290 TraceCheckUtils]: 16: Hoare triple {32144#true} assume 128 + ~e <= 2147483647; {32144#true} is VALID [2022-02-21 03:10:25,998 INFO L290 TraceCheckUtils]: 15: Hoare triple {32144#true} assume 0 == ~m || 0 == ~bitwiseComplement(16777216);~m := 0; {32144#true} is VALID [2022-02-21 03:10:25,998 INFO L290 TraceCheckUtils]: 14: Hoare triple {32144#true} assume !(~m % 4294967296 >= 33554432); {32144#true} is VALID [2022-02-21 03:10:25,998 INFO L290 TraceCheckUtils]: 13: Hoare triple {32144#true} assume !false; {32144#true} is VALID [2022-02-21 03:10:25,998 INFO L290 TraceCheckUtils]: 12: Hoare triple {32144#true} assume !(~m % 4294967296 < 16777216); {32144#true} is VALID [2022-02-21 03:10:25,998 INFO L290 TraceCheckUtils]: 11: Hoare triple {32144#true} assume !(0 == ~m % 4294967296); {32144#true} is VALID [2022-02-21 03:10:25,998 INFO L290 TraceCheckUtils]: 10: Hoare triple {32144#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {32144#true} is VALID [2022-02-21 03:10:25,998 INFO L272 TraceCheckUtils]: 9: Hoare triple {32144#true} call main_#t~ret23#1 := base2flt(main_~ma~2#1, main_~ea~2#1); {32144#true} is VALID [2022-02-21 03:10:25,998 INFO L290 TraceCheckUtils]: 8: Hoare triple {32144#true} main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1; {32144#true} is VALID [2022-02-21 03:10:25,999 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {32144#true} {32144#true} #453#return; {32144#true} is VALID [2022-02-21 03:10:25,999 INFO L290 TraceCheckUtils]: 6: Hoare triple {32144#true} assume true; {32144#true} is VALID [2022-02-21 03:10:25,999 INFO L290 TraceCheckUtils]: 5: Hoare triple {32144#true} #res := ~__retres4~0; {32144#true} is VALID [2022-02-21 03:10:25,999 INFO L290 TraceCheckUtils]: 4: Hoare triple {32144#true} assume 0 == ~m % 4294967296;~__retres4~0 := 0; {32144#true} is VALID [2022-02-21 03:10:25,999 INFO L290 TraceCheckUtils]: 3: Hoare triple {32144#true} ~m := #in~m;~e := #in~e;havoc ~res~0;havoc ~__retres4~0; {32144#true} is VALID [2022-02-21 03:10:25,999 INFO L272 TraceCheckUtils]: 2: Hoare triple {32144#true} call main_#t~ret22#1 := base2flt(0, 0); {32144#true} is VALID [2022-02-21 03:10:25,999 INFO L290 TraceCheckUtils]: 1: Hoare triple {32144#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_~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_add~0#1, main_~zero~0#1, main_~sa~0#1, main_~sb~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~tmp___1~0#1, main_~tmp___2~0#1, main_~tmp___3~0#1, main_~tmp___4~0#1, main_~tmp___5~0#1, main_~tmp___6~0#1, main_~tmp___7~0#1, main_~tmp___8~0#1, main_~tmp___9~0#1, main_~__retres23~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_add~0#1;havoc main_~zero~0#1;havoc main_~sa~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_~tmp___2~0#1;havoc main_~tmp___3~0#1;havoc main_~tmp___4~0#1;havoc main_~tmp___5~0#1;havoc main_~tmp___6~0#1;havoc main_~tmp___7~0#1;havoc main_~tmp___8~0#1;havoc main_~tmp___9~0#1;havoc main_~__retres23~0#1; {32144#true} is VALID [2022-02-21 03:10:25,999 INFO L290 TraceCheckUtils]: 0: Hoare triple {32144#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(24, 2);call #Ultimate.allocInit(12, 3); {32144#true} is VALID [2022-02-21 03:10:26,000 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-02-21 03:10:26,000 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1281032834] provided 1 perfect and 1 imperfect interpolant sequences [2022-02-21 03:10:26,000 INFO L191 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-02-21 03:10:26,000 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [10, 10] total 21 [2022-02-21 03:10:26,000 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148571572] [2022-02-21 03:10:26,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:10:26,001 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 7 states have internal predecessors, (42), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 62 [2022-02-21 03:10:26,001 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 03:10:26,001 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 5.25) internal successors, (42), 7 states have internal predecessors, (42), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-21 03:10:26,030 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:10:26,030 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-21 03:10:26,030 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:10:26,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-21 03:10:26,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=369, Unknown=0, NotChecked=0, Total=420 [2022-02-21 03:10:26,031 INFO L87 Difference]: Start difference. First operand 258 states and 317 transitions. Second operand has 8 states, 8 states have (on average 5.25) internal successors, (42), 7 states have internal predecessors, (42), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-21 03:10:26,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:26,713 INFO L93 Difference]: Finished difference Result 402 states and 484 transitions. [2022-02-21 03:10:26,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-21 03:10:26,714 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 7 states have internal predecessors, (42), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 62 [2022-02-21 03:10:26,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 03:10:26,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 5.25) internal successors, (42), 7 states have internal predecessors, (42), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-21 03:10:26,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 245 transitions. [2022-02-21 03:10:26,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 5.25) internal successors, (42), 7 states have internal predecessors, (42), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-21 03:10:26,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 245 transitions. [2022-02-21 03:10:26,716 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 245 transitions. [2022-02-21 03:10:26,888 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 245 edges. 245 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:10:26,892 INFO L225 Difference]: With dead ends: 402 [2022-02-21 03:10:26,892 INFO L226 Difference]: Without dead ends: 291 [2022-02-21 03:10:26,892 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 120 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=530, Unknown=0, NotChecked=0, Total=600 [2022-02-21 03:10:26,893 INFO L933 BasicCegarLoop]: 165 mSDtfsCounter, 42 mSDsluCounter, 918 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 1083 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-21 03:10:26,894 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [44 Valid, 1083 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-21 03:10:26,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2022-02-21 03:10:27,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 252. [2022-02-21 03:10:27,025 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:10:27,025 INFO L82 GeneralOperation]: Start isEquivalent. First operand 291 states. Second operand has 252 states, 228 states have (on average 1.2719298245614035) internal successors, (290), 235 states have internal predecessors, (290), 7 states have call successors, (7), 4 states have call predecessors, (7), 7 states have return successors, (12), 12 states have call predecessors, (12), 7 states have call successors, (12) [2022-02-21 03:10:27,025 INFO L74 IsIncluded]: Start isIncluded. First operand 291 states. Second operand has 252 states, 228 states have (on average 1.2719298245614035) internal successors, (290), 235 states have internal predecessors, (290), 7 states have call successors, (7), 4 states have call predecessors, (7), 7 states have return successors, (12), 12 states have call predecessors, (12), 7 states have call successors, (12) [2022-02-21 03:10:27,026 INFO L87 Difference]: Start difference. First operand 291 states. Second operand has 252 states, 228 states have (on average 1.2719298245614035) internal successors, (290), 235 states have internal predecessors, (290), 7 states have call successors, (7), 4 states have call predecessors, (7), 7 states have return successors, (12), 12 states have call predecessors, (12), 7 states have call successors, (12) [2022-02-21 03:10:27,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:27,029 INFO L93 Difference]: Finished difference Result 291 states and 352 transitions. [2022-02-21 03:10:27,029 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 352 transitions. [2022-02-21 03:10:27,030 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:10:27,030 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:10:27,030 INFO L74 IsIncluded]: Start isIncluded. First operand has 252 states, 228 states have (on average 1.2719298245614035) internal successors, (290), 235 states have internal predecessors, (290), 7 states have call successors, (7), 4 states have call predecessors, (7), 7 states have return successors, (12), 12 states have call predecessors, (12), 7 states have call successors, (12) Second operand 291 states. [2022-02-21 03:10:27,031 INFO L87 Difference]: Start difference. First operand has 252 states, 228 states have (on average 1.2719298245614035) internal successors, (290), 235 states have internal predecessors, (290), 7 states have call successors, (7), 4 states have call predecessors, (7), 7 states have return successors, (12), 12 states have call predecessors, (12), 7 states have call successors, (12) Second operand 291 states. [2022-02-21 03:10:27,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:10:27,035 INFO L93 Difference]: Finished difference Result 291 states and 352 transitions. [2022-02-21 03:10:27,035 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 352 transitions. [2022-02-21 03:10:27,035 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:10:27,035 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:10:27,035 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:10:27,035 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:10:27,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 228 states have (on average 1.2719298245614035) internal successors, (290), 235 states have internal predecessors, (290), 7 states have call successors, (7), 4 states have call predecessors, (7), 7 states have return successors, (12), 12 states have call predecessors, (12), 7 states have call successors, (12) [2022-02-21 03:10:27,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 309 transitions. [2022-02-21 03:10:27,039 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 309 transitions. Word has length 62 [2022-02-21 03:10:27,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 03:10:27,039 INFO L470 AbstractCegarLoop]: Abstraction has 252 states and 309 transitions. [2022-02-21 03:10:27,039 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 7 states have internal predecessors, (42), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-21 03:10:27,039 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 309 transitions. [2022-02-21 03:10:27,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-02-21 03:10:27,040 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 03:10:27,040 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:10:27,057 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-02-21 03:10:27,257 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:10:27,258 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2022-02-21 03:10:27,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:10:27,258 INFO L85 PathProgramCache]: Analyzing trace with hash 158610151, now seen corresponding path program 1 times [2022-02-21 03:10:27,258 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:10:27,258 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860816837] [2022-02-21 03:10:27,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:10:27,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:10:27,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:10:27,295 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:10:27,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:10:27,345 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:10:27,346 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-21 03:10:27,346 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 20 remaining) [2022-02-21 03:10:27,348 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 20 remaining) [2022-02-21 03:10:27,349 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 20 remaining) [2022-02-21 03:10:27,349 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 20 remaining) [2022-02-21 03:10:27,349 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 20 remaining) [2022-02-21 03:10:27,349 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 20 remaining) [2022-02-21 03:10:27,349 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 20 remaining) [2022-02-21 03:10:27,350 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 20 remaining) [2022-02-21 03:10:27,350 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location base2fltErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 20 remaining) [2022-02-21 03:10:27,350 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 20 remaining) [2022-02-21 03:10:27,350 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 20 remaining) [2022-02-21 03:10:27,350 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 20 remaining) [2022-02-21 03:10:27,350 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 20 remaining) [2022-02-21 03:10:27,350 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 20 remaining) [2022-02-21 03:10:27,350 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 20 remaining) [2022-02-21 03:10:27,351 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 20 remaining) [2022-02-21 03:10:27,351 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 20 remaining) [2022-02-21 03:10:27,351 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 20 remaining) [2022-02-21 03:10:27,351 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 20 remaining) [2022-02-21 03:10:27,351 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 20 remaining) [2022-02-21 03:10:27,351 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-02-21 03:10:27,354 INFO L732 BasicCegarLoop]: Path program histogram: [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] [2022-02-21 03:10:27,356 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-21 03:10:27,405 FATAL L489 DefaultTranslator]: Callstack has procedure call flag but succeeding procedure is empty at [CALL] call #t~ret22 := base2flt(0, 0); [2022-02-21 03:10:27,406 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: callstack broken after backtranslation by InlinerBacktranslator at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator.translateProgramExecution(InlinerBacktranslator.java:230) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:216) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:225) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:225) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:206) at de.uni_freiburg.informatik.ultimate.core.lib.results.UnprovableResult.getProgramExecutionAsString(UnprovableResult.java:132) at de.uni_freiburg.informatik.ultimate.core.lib.results.UnprovableResult.getLongDescription(UnprovableResult.java:125) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ResultService.reportResult(ResultService.java:86) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResultReporter.reportResult(CegarLoopResultReporter.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.reportLocationResults(TraceAbstractionStarter.java:607) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:182) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:156) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-02-21 03:10:27,409 INFO L158 Benchmark]: Toolchain (without parser) took 42380.83ms. Allocated memory was 102.8MB in the beginning and 207.6MB in the end (delta: 104.9MB). Free memory was 67.4MB in the beginning and 121.1MB in the end (delta: -53.7MB). Peak memory consumption was 50.9MB. Max. memory is 16.1GB. [2022-02-21 03:10:27,409 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 102.8MB. Free memory was 73.8MB in the beginning and 73.8MB in the end (delta: 21.3kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:10:27,410 INFO L158 Benchmark]: CACSL2BoogieTranslator took 298.74ms. Allocated memory is still 102.8MB. Free memory was 67.2MB in the beginning and 72.1MB in the end (delta: -4.9MB). Peak memory consumption was 10.1MB. Max. memory is 16.1GB. [2022-02-21 03:10:27,410 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.67ms. Allocated memory is still 102.8MB. Free memory was 72.1MB in the beginning and 69.1MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-02-21 03:10:27,410 INFO L158 Benchmark]: Boogie Preprocessor took 34.92ms. Allocated memory is still 102.8MB. Free memory was 69.1MB in the beginning and 67.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 03:10:27,410 INFO L158 Benchmark]: RCFGBuilder took 619.36ms. Allocated memory is still 102.8MB. Free memory was 67.0MB in the beginning and 36.5MB in the end (delta: 30.5MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2022-02-21 03:10:27,411 INFO L158 Benchmark]: TraceAbstraction took 41373.38ms. Allocated memory was 102.8MB in the beginning and 207.6MB in the end (delta: 104.9MB). Free memory was 36.2MB in the beginning and 121.1MB in the end (delta: -84.9MB). Peak memory consumption was 19.9MB. Max. memory is 16.1GB. [2022-02-21 03:10:27,411 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 102.8MB. Free memory was 73.8MB in the beginning and 73.8MB in the end (delta: 21.3kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 298.74ms. Allocated memory is still 102.8MB. Free memory was 67.2MB in the beginning and 72.1MB in the end (delta: -4.9MB). Peak memory consumption was 10.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 49.67ms. Allocated memory is still 102.8MB. Free memory was 72.1MB in the beginning and 69.1MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 34.92ms. Allocated memory is still 102.8MB. Free memory was 69.1MB in the beginning and 67.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 619.36ms. Allocated memory is still 102.8MB. Free memory was 67.0MB in the beginning and 36.5MB in the end (delta: 30.5MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * TraceAbstraction took 41373.38ms. Allocated memory was 102.8MB in the beginning and 207.6MB in the end (delta: 104.9MB). Free memory was 36.2MB in the beginning and 121.1MB in the end (delta: -84.9MB). Peak memory consumption was 19.9MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - ExceptionOrErrorResult: AssertionError: callstack broken after backtranslation by InlinerBacktranslator de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: callstack broken after backtranslation by InlinerBacktranslator: de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator.translateProgramExecution(InlinerBacktranslator.java:230) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-02-21 03:10:27,430 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis No suitable file found in config dir /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config using search string *Overflow*32bit*_Bitvector*.epf No suitable settings file found using Overflow*32bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: callstack broken after backtranslation by InlinerBacktranslator