./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/float-newlib/double_req_bl_1300.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability 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/float-newlib/double_req_bl_1300.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-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 ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 70dcbfd71e657ebb73c2a6863351c66fa81e26e34ca397217ae05e2d3c176a8d --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 16:37:34,245 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 16:37:34,247 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 16:37:34,279 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 16:37:34,279 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 16:37:34,280 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 16:37:34,281 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 16:37:34,282 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 16:37:34,283 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 16:37:34,284 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 16:37:34,285 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 16:37:34,285 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 16:37:34,286 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 16:37:34,286 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 16:37:34,287 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 16:37:34,288 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 16:37:34,289 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 16:37:34,289 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 16:37:34,290 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 16:37:34,292 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 16:37:34,293 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 16:37:34,294 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 16:37:34,294 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 16:37:34,295 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 16:37:34,297 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 16:37:34,297 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 16:37:34,297 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 16:37:34,298 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 16:37:34,299 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 16:37:34,299 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 16:37:34,299 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 16:37:34,300 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 16:37:34,301 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 16:37:34,301 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 16:37:34,302 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 16:37:34,302 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 16:37:34,303 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 16:37:34,303 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 16:37:34,303 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 16:37:34,304 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 16:37:34,304 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 16:37:34,307 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-02-20 16:37:34,321 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 16:37:34,321 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 16:37:34,321 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 16:37:34,321 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 16:37:34,322 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 16:37:34,322 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 16:37:34,323 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 16:37:34,323 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 16:37:34,323 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 16:37:34,323 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 16:37:34,323 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 16:37:34,323 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 16:37:34,324 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 16:37:34,324 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 16:37:34,324 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 16:37:34,324 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 16:37:34,324 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 16:37:34,324 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 16:37:34,325 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 16:37:34,325 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 16:37:34,325 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 16:37:34,325 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 16:37:34,325 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 16:37:34,325 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 16:37:34,326 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:37:34,326 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 16:37:34,326 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 16:37:34,326 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 16:37:34,326 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 16:37:34,326 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 16:37:34,327 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 16:37:34,327 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 16:37:34,327 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 16:37:34,327 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 ! call(reach_error())) ) 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 -> 70dcbfd71e657ebb73c2a6863351c66fa81e26e34ca397217ae05e2d3c176a8d [2022-02-20 16:37:34,493 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 16:37:34,507 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 16:37:34,508 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 16:37:34,509 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 16:37:34,510 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 16:37:34,510 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/double_req_bl_1300.c [2022-02-20 16:37:34,556 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1088cf667/d47425bda0e74624b020cf3635d4fabb/FLAGf388c5de7 [2022-02-20 16:37:34,889 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 16:37:34,889 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1300.c [2022-02-20 16:37:34,895 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1088cf667/d47425bda0e74624b020cf3635d4fabb/FLAGf388c5de7 [2022-02-20 16:37:35,329 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1088cf667/d47425bda0e74624b020cf3635d4fabb [2022-02-20 16:37:35,333 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 16:37:35,334 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 16:37:35,346 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 16:37:35,347 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 16:37:35,349 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 16:37:35,350 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:37:35" (1/1) ... [2022-02-20 16:37:35,351 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56dc8e5b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:37:35, skipping insertion in model container [2022-02-20 16:37:35,351 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:37:35" (1/1) ... [2022-02-20 16:37:35,364 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 16:37:35,379 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 16:37:35,518 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/float-newlib/double_req_bl_1300.c[1563,1576] [2022-02-20 16:37:35,519 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:37:35,544 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 16:37:35,576 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/float-newlib/double_req_bl_1300.c[1563,1576] [2022-02-20 16:37:35,578 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:37:35,587 INFO L208 MainTranslator]: Completed translation [2022-02-20 16:37:35,588 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:37:35 WrapperNode [2022-02-20 16:37:35,588 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 16:37:35,589 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 16:37:35,589 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 16:37:35,589 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 16:37:35,601 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:37:35" (1/1) ... [2022-02-20 16:37:35,616 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:37:35" (1/1) ... [2022-02-20 16:37:35,688 INFO L137 Inliner]: procedures = 18, calls = 19, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 76 [2022-02-20 16:37:35,688 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 16:37:35,689 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 16:37:35,689 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 16:37:35,689 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 16:37:35,709 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:37:35" (1/1) ... [2022-02-20 16:37:35,709 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:37:35" (1/1) ... [2022-02-20 16:37:35,712 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:37:35" (1/1) ... [2022-02-20 16:37:35,715 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:37:35" (1/1) ... [2022-02-20 16:37:35,724 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:37:35" (1/1) ... [2022-02-20 16:37:35,741 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:37:35" (1/1) ... [2022-02-20 16:37:35,742 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:37:35" (1/1) ... [2022-02-20 16:37:35,745 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 16:37:35,745 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 16:37:35,745 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 16:37:35,745 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 16:37:35,749 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:37:35" (1/1) ... [2022-02-20 16:37:35,757 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:37:35,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:37:35,777 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-20 16:37:35,795 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-20 16:37:35,809 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 16:37:35,809 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 16:37:35,809 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 16:37:35,809 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2022-02-20 16:37:35,810 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 16:37:35,810 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 16:37:35,810 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-20 16:37:35,810 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 16:37:35,869 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 16:37:35,870 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 16:37:36,225 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 16:37:36,229 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 16:37:36,230 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-02-20 16:37:36,231 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:37:36 BoogieIcfgContainer [2022-02-20 16:37:36,231 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 16:37:36,232 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 16:37:36,232 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 16:37:36,235 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 16:37:36,235 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 04:37:35" (1/3) ... [2022-02-20 16:37:36,235 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2539cc2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:37:36, skipping insertion in model container [2022-02-20 16:37:36,236 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:37:35" (2/3) ... [2022-02-20 16:37:36,236 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2539cc2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:37:36, skipping insertion in model container [2022-02-20 16:37:36,236 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:37:36" (3/3) ... [2022-02-20 16:37:36,237 INFO L111 eAbstractionObserver]: Analyzing ICFG double_req_bl_1300.c [2022-02-20 16:37:36,240 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 16:37:36,240 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 16:37:36,277 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 16:37:36,281 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=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 16:37:36,282 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 16:37:36,291 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 19 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:37:36,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-02-20 16:37:36,294 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:37:36,294 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:37:36,295 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:37:36,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:37:36,298 INFO L85 PathProgramCache]: Analyzing trace with hash 1033094394, now seen corresponding path program 1 times [2022-02-20 16:37:36,304 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:37:36,304 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643520323] [2022-02-20 16:37:36,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:37:36,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:37:36,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:37:36,504 INFO L290 TraceCheckUtils]: 0: Hoare triple {23#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(21, 2);call #Ultimate.allocInit(12, 3); {23#true} is VALID [2022-02-20 16:37:36,505 INFO L290 TraceCheckUtils]: 1: Hoare triple {23#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~ret8#1, main_#t~ret9#1, main_#t~short10#1, main_#t~ret11#1, main_~res~0#1, main_~x~0#1;main_~x~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;assume { :begin_inline_isinf_double } true;isinf_double_#in~x#1 := main_~x~0#1;havoc isinf_double_#res#1;havoc isinf_double_#t~mem4#1, isinf_double_#t~mem5#1, isinf_double_~#ew_u~0#1.base, isinf_double_~#ew_u~0#1.offset, isinf_double_~x#1, isinf_double_~hx~0#1, isinf_double_~lx~0#1;isinf_double_~x#1 := isinf_double_#in~x#1;havoc isinf_double_~hx~0#1;havoc isinf_double_~lx~0#1; {23#true} is VALID [2022-02-20 16:37:36,506 INFO L290 TraceCheckUtils]: 2: Hoare triple {23#true} assume !true; {24#false} is VALID [2022-02-20 16:37:36,507 INFO L290 TraceCheckUtils]: 3: Hoare triple {24#false} isinf_double_~hx~0#1 := (if 0 == isinf_double_~hx~0#1 then 0 else (if 1 == isinf_double_~hx~0#1 then 1 else ~bitwiseAnd(isinf_double_~hx~0#1, 2147483647)));isinf_double_~hx~0#1 := (if (if (1 == isinf_double_~hx~0#1 || 0 == isinf_double_~hx~0#1) && 0 == (if (if (1 == isinf_double_~lx~0#1 || 0 == isinf_double_~lx~0#1) && 0 == -isinf_double_~lx~0#1 then isinf_double_~lx~0#1 else (if 0 == isinf_double_~lx~0#1 && (1 == -isinf_double_~lx~0#1 || 0 == -isinf_double_~lx~0#1) then -isinf_double_~lx~0#1 else (if (1 == isinf_double_~lx~0#1 && (1 == -isinf_double_~lx~0#1 || 0 == -isinf_double_~lx~0#1)) || ((1 == isinf_double_~lx~0#1 || 0 == isinf_double_~lx~0#1) && 1 == -isinf_double_~lx~0#1) then 1 else ~bitwiseOr(isinf_double_~lx~0#1, -isinf_double_~lx~0#1)))) >= 0 then 0 else 1) then isinf_double_~hx~0#1 else (if 0 == isinf_double_~hx~0#1 && (1 == (if (if (1 == isinf_double_~lx~0#1 || 0 == isinf_double_~lx~0#1) && 0 == -isinf_double_~lx~0#1 then isinf_double_~lx~0#1 else (if 0 == isinf_double_~lx~0#1 && (1 == -isinf_double_~lx~0#1 || 0 == -isinf_double_~lx~0#1) then -isinf_double_~lx~0#1 else (if (1 == isinf_double_~lx~0#1 && (1 == -isinf_double_~lx~0#1 || 0 == -isinf_double_~lx~0#1)) || ((1 == isinf_double_~lx~0#1 || 0 == isinf_double_~lx~0#1) && 1 == -isinf_double_~lx~0#1) then 1 else ~bitwiseOr(isinf_double_~lx~0#1, -isinf_double_~lx~0#1)))) >= 0 then 0 else 1) || 0 == (if (if (1 == isinf_double_~lx~0#1 || 0 == isinf_double_~lx~0#1) && 0 == -isinf_double_~lx~0#1 then isinf_double_~lx~0#1 else (if 0 == isinf_double_~lx~0#1 && (1 == -isinf_double_~lx~0#1 || 0 == -isinf_double_~lx~0#1) then -isinf_double_~lx~0#1 else (if (1 == isinf_double_~lx~0#1 && (1 == -isinf_double_~lx~0#1 || 0 == -isinf_double_~lx~0#1)) || ((1 == isinf_double_~lx~0#1 || 0 == isinf_double_~lx~0#1) && 1 == -isinf_double_~lx~0#1) then 1 else ~bitwiseOr(isinf_double_~lx~0#1, -isinf_double_~lx~0#1)))) >= 0 then 0 else 1)) then (if (if (1 == isinf_double_~lx~0#1 || 0 == isinf_double_~lx~0#1) && 0 == -isinf_double_~lx~0#1 then isinf_double_~lx~0#1 else (if 0 == isinf_double_~lx~0#1 && (1 == -isinf_double_~lx~0#1 || 0 == -isinf_double_~lx~0#1) then -isinf_double_~lx~0#1 else (if (1 == isinf_double_~lx~0#1 && (1 == -isinf_double_~lx~0#1 || 0 == -isinf_double_~lx~0#1)) || ((1 == isinf_double_~lx~0#1 || 0 == isinf_double_~lx~0#1) && 1 == -isinf_double_~lx~0#1) then 1 else ~bitwiseOr(isinf_double_~lx~0#1, -isinf_double_~lx~0#1)))) >= 0 then 0 else 1) else (if (1 == isinf_double_~hx~0#1 && (1 == (if (if (1 == isinf_double_~lx~0#1 || 0 == isinf_double_~lx~0#1) && 0 == -isinf_double_~lx~0#1 then isinf_double_~lx~0#1 else (if 0 == isinf_double_~lx~0#1 && (1 == -isinf_double_~lx~0#1 || 0 == -isinf_double_~lx~0#1) then -isinf_double_~lx~0#1 else (if (1 == isinf_double_~lx~0#1 && (1 == -isinf_double_~lx~0#1 || 0 == -isinf_double_~lx~0#1)) || ((1 == isinf_double_~lx~0#1 || 0 == isinf_double_~lx~0#1) && 1 == -isinf_double_~lx~0#1) then 1 else ~bitwiseOr(isinf_double_~lx~0#1, -isinf_double_~lx~0#1)))) >= 0 then 0 else 1) || 0 == (if (if (1 == isinf_double_~lx~0#1 || 0 == isinf_double_~lx~0#1) && 0 == -isinf_double_~lx~0#1 then isinf_double_~lx~0#1 else (if 0 == isinf_double_~lx~0#1 && (1 == -isinf_double_~lx~0#1 || 0 == -isinf_double_~lx~0#1) then -isinf_double_~lx~0#1 else (if (1 == isinf_double_~lx~0#1 && (1 == -isinf_double_~lx~0#1 || 0 == -isinf_double_~lx~0#1)) || ((1 == isinf_double_~lx~0#1 || 0 == isinf_double_~lx~0#1) && 1 == -isinf_double_~lx~0#1) then 1 else ~bitwiseOr(isinf_double_~lx~0#1, -isinf_double_~lx~0#1)))) >= 0 then 0 else 1))) || ((1 == isinf_double_~hx~0#1 || 0 == isinf_double_~hx~0#1) && 1 == (if (if (1 == isinf_double_~lx~0#1 || 0 == isinf_double_~lx~0#1) && 0 == -isinf_double_~lx~0#1 then isinf_double_~lx~0#1 else (if 0 == isinf_double_~lx~0#1 && (1 == -isinf_double_~lx~0#1 || 0 == -isinf_double_~lx~0#1) then -isinf_double_~lx~0#1 else (if (1 == isinf_double_~lx~0#1 && (1 == -isinf_double_~lx~0#1 || 0 == -isinf_double_~lx~0#1)) || ((1 == isinf_double_~lx~0#1 || 0 == isinf_double_~lx~0#1) && 1 == -isinf_double_~lx~0#1) then 1 else ~bitwiseOr(isinf_double_~lx~0#1, -isinf_double_~lx~0#1)))) >= 0 then 0 else 1)) then 1 else ~bitwiseOr(isinf_double_~hx~0#1, (if (if (1 == isinf_double_~lx~0#1 || 0 == isinf_double_~lx~0#1) && 0 == -isinf_double_~lx~0#1 then isinf_double_~lx~0#1 else (if 0 == isinf_double_~lx~0#1 && (1 == -isinf_double_~lx~0#1 || 0 == -isinf_double_~lx~0#1) then -isinf_double_~lx~0#1 else (if (1 == isinf_double_~lx~0#1 && (1 == -isinf_double_~lx~0#1 || 0 == -isinf_double_~lx~0#1)) || ((1 == isinf_double_~lx~0#1 || 0 == isinf_double_~lx~0#1) && 1 == -isinf_double_~lx~0#1) then 1 else ~bitwiseOr(isinf_double_~lx~0#1, -isinf_double_~lx~0#1)))) >= 0 then 0 else 1))))) % 4294967296 % 4294967296 <= 2147483647 then (if (1 == isinf_double_~hx~0#1 || 0 == isinf_double_~hx~0#1) && 0 == (if (if (1 == isinf_double_~lx~0#1 || 0 == isinf_double_~lx~0#1) && 0 == -isinf_double_~lx~0#1 then isinf_double_~lx~0#1 else (if 0 == isinf_double_~lx~0#1 && (1 == -isinf_double_~lx~0#1 || 0 == -isinf_double_~lx~0#1) then -isinf_double_~lx~0#1 else (if (1 == isinf_double_~lx~0#1 && (1 == -isinf_double_~lx~0#1 || 0 == -isinf_double_~lx~0#1)) || ((1 == isinf_double_~lx~0#1 || 0 == isinf_double_~lx~0#1) && 1 == -isinf_double_~lx~0#1) then 1 else ~bitwiseOr(isinf_double_~lx~0#1, -isinf_double_~lx~0#1)))) >= 0 then 0 else 1) then isinf_double_~hx~0#1 else (if 0 == isinf_double_~hx~0#1 && (1 == (if (if (1 == isinf_double_~lx~0#1 || 0 == isinf_double_~lx~0#1) && 0 == -isinf_double_~lx~0#1 then isinf_double_~lx~0#1 else (if 0 == isinf_double_~lx~0#1 && (1 == -isinf_double_~lx~0#1 || 0 == -isinf_double_~lx~0#1) then -isinf_double_~lx~0#1 else (if (1 == isinf_double_~lx~0#1 && (1 == -isinf_double_~lx~0#1 || 0 == -isinf_double_~lx~0#1)) || ((1 == isinf_double_~lx~0#1 || 0 == isinf_double_~lx~0#1) && 1 == -isinf_double_~lx~0#1) then 1 else ~bitwiseOr(isinf_double_~lx~0#1, -isinf_double_~lx~0#1)))) >= 0 then 0 else 1) || 0 == (if (if (1 == isinf_double_~lx~0#1 || 0 == isinf_double_~lx~0#1) && 0 == -isinf_double_~lx~0#1 then isinf_double_~lx~0#1 else (if 0 == isinf_double_~lx~0#1 && (1 == -isinf_double_~lx~0#1 || 0 == -isinf_double_~lx~0#1) then -isinf_double_~lx~0#1 else (if (1 == isinf_double_~lx~0#1 && (1 == -isinf_double_~lx~0#1 || 0 == -isinf_double_~lx~0#1)) || ((1 == isinf_double_~lx~0#1 || 0 == isinf_double_~lx~0#1) && 1 == -isinf_double_~lx~0#1) then 1 else ~bitwiseOr(isinf_double_~lx~0#1, -isinf_double_~lx~0#1)))) >= 0 then 0 else 1)) then (if (if (1 == isinf_double_~lx~0#1 || 0 == isinf_double_~lx~0#1) && 0 == -isinf_double_~lx~0#1 then isinf_double_~lx~0#1 else (if 0 == isinf_double_~lx~0#1 && (1 == -isinf_double_~lx~0#1 || 0 == -isinf_double_~lx~0#1) then -isinf_double_~lx~0#1 else (if (1 == isinf_double_~lx~0#1 && (1 == -isinf_double_~lx~0#1 || 0 == -isinf_double_~lx~0#1)) || ((1 == isinf_double_~lx~0#1 || 0 == isinf_double_~lx~0#1) && 1 == -isinf_double_~lx~0#1) then 1 else ~bitwiseOr(isinf_double_~lx~0#1, -isinf_double_~lx~0#1)))) >= 0 then 0 else 1) else (if (1 == isinf_double_~hx~0#1 && (1 == (if (if (1 == isinf_double_~lx~0#1 || 0 == isinf_double_~lx~0#1) && 0 == -isinf_double_~lx~0#1 then isinf_double_~lx~0#1 else (if 0 == isinf_double_~lx~0#1 && (1 == -isinf_double_~lx~0#1 || 0 == -isinf_double_~lx~0#1) then -isinf_double_~lx~0#1 else (if (1 == isinf_double_~lx~0#1 && (1 == -isinf_double_~lx~0#1 || 0 == -isinf_double_~lx~0#1)) || ((1 == isinf_double_~lx~0#1 || 0 == isinf_double_~lx~0#1) && 1 == -isinf_double_~lx~0#1) then 1 else ~bitwiseOr(isinf_double_~lx~0#1, -isinf_double_~lx~0#1)))) >= 0 then 0 else 1) || 0 == (if (if (1 == isinf_double_~lx~0#1 || 0 == isinf_double_~lx~0#1) && 0 == -isinf_double_~lx~0#1 then isinf_double_~lx~0#1 else (if 0 == isinf_double_~lx~0#1 && (1 == -isinf_double_~lx~0#1 || 0 == -isinf_double_~lx~0#1) then -isinf_double_~lx~0#1 else (if (1 == isinf_double_~lx~0#1 && (1 == -isinf_double_~lx~0#1 || 0 == -isinf_double_~lx~0#1)) || ((1 == isinf_double_~lx~0#1 || 0 == isinf_double_~lx~0#1) && 1 == -isinf_double_~lx~0#1) then 1 else ~bitwiseOr(isinf_double_~lx~0#1, -isinf_double_~lx~0#1)))) >= 0 then 0 else 1))) || ((1 == isinf_double_~hx~0#1 || 0 == isinf_double_~hx~0#1) && 1 == (if (if (1 == isinf_double_~lx~0#1 || 0 == isinf_double_~lx~0#1) && 0 == -isinf_double_~lx~0#1 then isinf_double_~lx~0#1 else (if 0 == isinf_double_~lx~0#1 && (1 == -isinf_double_~lx~0#1 || 0 == -isinf_double_~lx~0#1) then -isinf_double_~lx~0#1 else (if (1 == isinf_double_~lx~0#1 && (1 == -isinf_double_~lx~0#1 || 0 == -isinf_double_~lx~0#1)) || ((1 == isinf_double_~lx~0#1 || 0 == isinf_double_~lx~0#1) && 1 == -isinf_double_~lx~0#1) then 1 else ~bitwiseOr(isinf_double_~lx~0#1, -isinf_double_~lx~0#1)))) >= 0 then 0 else 1)) then 1 else ~bitwiseOr(isinf_double_~hx~0#1, (if (if (1 == isinf_double_~lx~0#1 || 0 == isinf_double_~lx~0#1) && 0 == -isinf_double_~lx~0#1 then isinf_double_~lx~0#1 else (if 0 == isinf_double_~lx~0#1 && (1 == -isinf_double_~lx~0#1 || 0 == -isinf_double_~lx~0#1) then -isinf_double_~lx~0#1 else (if (1 == isinf_double_~lx~0#1 && (1 == -isinf_double_~lx~0#1 || 0 == -isinf_double_~lx~0#1)) || ((1 == isinf_double_~lx~0#1 || 0 == isinf_double_~lx~0#1) && 1 == -isinf_double_~lx~0#1) then 1 else ~bitwiseOr(isinf_double_~lx~0#1, -isinf_double_~lx~0#1)))) >= 0 then 0 else 1))))) % 4294967296 % 4294967296 else (if (1 == isinf_double_~hx~0#1 || 0 == isinf_double_~hx~0#1) && 0 == (if (if (1 == isinf_double_~lx~0#1 || 0 == isinf_double_~lx~0#1) && 0 == -isinf_double_~lx~0#1 then isinf_double_~lx~0#1 else (if 0 == isinf_double_~lx~0#1 && (1 == -isinf_double_~lx~0#1 || 0 == -isinf_double_~lx~0#1) then -isinf_double_~lx~0#1 else (if (1 == isinf_double_~lx~0#1 && (1 == -isinf_double_~lx~0#1 || 0 == -isinf_double_~lx~0#1)) || ((1 == isinf_double_~lx~0#1 || 0 == isinf_double_~lx~0#1) && 1 == -isinf_double_~lx~0#1) then 1 else ~bitwiseOr(isinf_double_~lx~0#1, -isinf_double_~lx~0#1)))) >= 0 then 0 else 1) then isinf_double_~hx~0#1 else (if 0 == isinf_double_~hx~0#1 && (1 == (if (if (1 == isinf_double_~lx~0#1 || 0 == isinf_double_~lx~0#1) && 0 == -isinf_double_~lx~0#1 then isinf_double_~lx~0#1 else (if 0 == isinf_double_~lx~0#1 && (1 == -isinf_double_~lx~0#1 || 0 == -isinf_double_~lx~0#1) then -isinf_double_~lx~0#1 else (if (1 == isinf_double_~lx~0#1 && (1 == -isinf_double_~lx~0#1 || 0 == -isinf_double_~lx~0#1)) || ((1 == isinf_double_~lx~0#1 || 0 == isinf_double_~lx~0#1) && 1 == -isinf_double_~lx~0#1) then 1 else ~bitwiseOr(isinf_double_~lx~0#1, -isinf_double_~lx~0#1)))) >= 0 then 0 else 1) || 0 == (if (if (1 == isinf_double_~lx~0#1 || 0 == isinf_double_~lx~0#1) && 0 == -isinf_double_~lx~0#1 then isinf_double_~lx~0#1 else (if 0 == isinf_double_~lx~0#1 && (1 == -isinf_double_~lx~0#1 || 0 == -isinf_double_~lx~0#1) then -isinf_double_~lx~0#1 else (if (1 == isinf_double_~lx~0#1 && (1 == -isinf_double_~lx~0#1 || 0 == -isinf_double_~lx~0#1)) || ((1 == isinf_double_~lx~0#1 || 0 == isinf_double_~lx~0#1) && 1 == -isinf_double_~lx~0#1) then 1 else ~bitwiseOr(isinf_double_~lx~0#1, -isinf_double_~lx~0#1)))) >= 0 then 0 else 1)) then (if (if (1 == isinf_double_~lx~0#1 || 0 == isinf_double_~lx~0#1) && 0 == -isinf_double_~lx~0#1 then isinf_double_~lx~0#1 else (if 0 == isinf_double_~lx~0#1 && (1 == -isinf_double_~lx~0#1 || 0 == -isinf_double_~lx~0#1) then -isinf_double_~lx~0#1 else (if (1 == isinf_double_~lx~0#1 && (1 == -isinf_double_~lx~0#1 || 0 == -isinf_double_~lx~0#1)) || ((1 == isinf_double_~lx~0#1 || 0 == isinf_double_~lx~0#1) && 1 == -isinf_double_~lx~0#1) then 1 else ~bitwiseOr(isinf_double_~lx~0#1, -isinf_double_~lx~0#1)))) >= 0 then 0 else 1) else (if (1 == isinf_double_~hx~0#1 && (1 == (if (if (1 == isinf_double_~lx~0#1 || 0 == isinf_double_~lx~0#1) && 0 == -isinf_double_~lx~0#1 then isinf_double_~lx~0#1 else (if 0 == isinf_double_~lx~0#1 && (1 == -isinf_double_~lx~0#1 || 0 == -isinf_double_~lx~0#1) then -isinf_double_~lx~0#1 else (if (1 == isinf_double_~lx~0#1 && (1 == -isinf_double_~lx~0#1 || 0 == -isinf_double_~lx~0#1)) || ((1 == isinf_double_~lx~0#1 || 0 == isinf_double_~lx~0#1) && 1 == -isinf_double_~lx~0#1) then 1 else ~bitwiseOr(isinf_double_~lx~0#1, -isinf_double_~lx~0#1)))) >= 0 then 0 else 1) || 0 == (if (if (1 == isinf_double_~lx~0#1 || 0 == isinf_double_~lx~0#1) && 0 == -isinf_double_~lx~0#1 then isinf_double_~lx~0#1 else (if 0 == isinf_double_~lx~0#1 && (1 == -isinf_double_~lx~0#1 || 0 == -isinf_double_~lx~0#1) then -isinf_double_~lx~0#1 else (if (1 == isinf_double_~lx~0#1 && (1 == -isinf_double_~lx~0#1 || 0 == -isinf_double_~lx~0#1)) || ((1 == isinf_double_~lx~0#1 || 0 == isinf_double_~lx~0#1) && 1 == -isinf_double_~lx~0#1) then 1 else ~bitwiseOr(isinf_double_~lx~0#1, -isinf_double_~lx~0#1)))) >= 0 then 0 else 1))) || ((1 == isinf_double_~hx~0#1 || 0 == isinf_double_~hx~0#1) && 1 == (if (if (1 == isinf_double_~lx~0#1 || 0 == isinf_double_~lx~0#1) && 0 == -isinf_double_~lx~0#1 then isinf_double_~lx~0#1 else (if 0 == isinf_double_~lx~0#1 && (1 == -isinf_double_~lx~0#1 || 0 == -isinf_double_~lx~0#1) then -isinf_double_~lx~0#1 else (if (1 == isinf_double_~lx~0#1 && (1 == -isinf_double_~lx~0#1 || 0 == -isinf_double_~lx~0#1)) || ((1 == isinf_double_~lx~0#1 || 0 == isinf_double_~lx~0#1) && 1 == -isinf_double_~lx~0#1) then 1 else ~bitwiseOr(isinf_double_~lx~0#1, -isinf_double_~lx~0#1)))) >= 0 then 0 else 1)) then 1 else ~bitwiseOr(isinf_double_~hx~0#1, (if (if (1 == isinf_double_~lx~0#1 || 0 == isinf_double_~lx~0#1) && 0 == -isinf_double_~lx~0#1 then isinf_double_~lx~0#1 else (if 0 == isinf_double_~lx~0#1 && (1 == -isinf_double_~lx~0#1 || 0 == -isinf_double_~lx~0#1) then -isinf_double_~lx~0#1 else (if (1 == isinf_double_~lx~0#1 && (1 == -isinf_double_~lx~0#1 || 0 == -isinf_double_~lx~0#1)) || ((1 == isinf_double_~lx~0#1 || 0 == isinf_double_~lx~0#1) && 1 == -isinf_double_~lx~0#1) then 1 else ~bitwiseOr(isinf_double_~lx~0#1, -isinf_double_~lx~0#1)))) >= 0 then 0 else 1))))) % 4294967296 % 4294967296 - 4294967296);isinf_double_~hx~0#1 := 2146435072 - isinf_double_~hx~0#1;isinf_double_#res#1 := 1 - (if (if (if (1 == isinf_double_~hx~0#1 || 0 == isinf_double_~hx~0#1) && 0 == -isinf_double_~hx~0#1 then isinf_double_~hx~0#1 else (if 0 == isinf_double_~hx~0#1 && (1 == -isinf_double_~hx~0#1 || 0 == -isinf_double_~hx~0#1) then -isinf_double_~hx~0#1 else (if (1 == isinf_double_~hx~0#1 && (1 == -isinf_double_~hx~0#1 || 0 == -isinf_double_~hx~0#1)) || ((1 == isinf_double_~hx~0#1 || 0 == isinf_double_~hx~0#1) && 1 == -isinf_double_~hx~0#1) then 1 else ~bitwiseOr(isinf_double_~hx~0#1, -isinf_double_~hx~0#1)))) >= 0 then 0 else 1) % 4294967296 % 4294967296 <= 2147483647 then (if (if (1 == isinf_double_~hx~0#1 || 0 == isinf_double_~hx~0#1) && 0 == -isinf_double_~hx~0#1 then isinf_double_~hx~0#1 else (if 0 == isinf_double_~hx~0#1 && (1 == -isinf_double_~hx~0#1 || 0 == -isinf_double_~hx~0#1) then -isinf_double_~hx~0#1 else (if (1 == isinf_double_~hx~0#1 && (1 == -isinf_double_~hx~0#1 || 0 == -isinf_double_~hx~0#1)) || ((1 == isinf_double_~hx~0#1 || 0 == isinf_double_~hx~0#1) && 1 == -isinf_double_~hx~0#1) then 1 else ~bitwiseOr(isinf_double_~hx~0#1, -isinf_double_~hx~0#1)))) >= 0 then 0 else 1) % 4294967296 % 4294967296 else (if (if (1 == isinf_double_~hx~0#1 || 0 == isinf_double_~hx~0#1) && 0 == -isinf_double_~hx~0#1 then isinf_double_~hx~0#1 else (if 0 == isinf_double_~hx~0#1 && (1 == -isinf_double_~hx~0#1 || 0 == -isinf_double_~hx~0#1) then -isinf_double_~hx~0#1 else (if (1 == isinf_double_~hx~0#1 && (1 == -isinf_double_~hx~0#1 || 0 == -isinf_double_~hx~0#1)) || ((1 == isinf_double_~hx~0#1 || 0 == isinf_double_~hx~0#1) && 1 == -isinf_double_~hx~0#1) then 1 else ~bitwiseOr(isinf_double_~hx~0#1, -isinf_double_~hx~0#1)))) >= 0 then 0 else 1) % 4294967296 % 4294967296 - 4294967296); {24#false} is VALID [2022-02-20 16:37:36,507 INFO L290 TraceCheckUtils]: 4: Hoare triple {24#false} main_#t~ret8#1 := isinf_double_#res#1;assume { :end_inline_isinf_double } true;assume -2147483648 <= main_#t~ret8#1 && main_#t~ret8#1 <= 2147483647;main_#t~short10#1 := 0 == main_#t~ret8#1; {24#false} is VALID [2022-02-20 16:37:36,508 INFO L290 TraceCheckUtils]: 5: Hoare triple {24#false} assume !main_#t~short10#1; {24#false} is VALID [2022-02-20 16:37:36,508 INFO L290 TraceCheckUtils]: 6: Hoare triple {24#false} assume main_#t~short10#1;havoc main_#t~ret8#1;havoc main_#t~ret9#1;havoc main_#t~short10#1;assume { :begin_inline_isfinite_double } true;isfinite_double_#in~x#1 := main_~x~0#1;havoc isfinite_double_#res#1;havoc isfinite_double_#t~mem6#1, isfinite_double_~#gh_u~0#1.base, isfinite_double_~#gh_u~0#1.offset, isfinite_double_~x#1, isfinite_double_~hx~1#1;isfinite_double_~x#1 := isfinite_double_#in~x#1;havoc isfinite_double_~hx~1#1; {24#false} is VALID [2022-02-20 16:37:36,508 INFO L290 TraceCheckUtils]: 7: Hoare triple {24#false} assume !true; {24#false} is VALID [2022-02-20 16:37:36,508 INFO L290 TraceCheckUtils]: 8: Hoare triple {24#false} isfinite_double_#res#1 := (if (if (if 0 == isfinite_double_~hx~1#1 then 0 else (if 1 == isfinite_double_~hx~1#1 then 1 else ~bitwiseAnd(isfinite_double_~hx~1#1, 2147483647))) - 2146435072 >= 0 then 0 else 1) % 4294967296 % 4294967296 <= 2147483647 then (if (if 0 == isfinite_double_~hx~1#1 then 0 else (if 1 == isfinite_double_~hx~1#1 then 1 else ~bitwiseAnd(isfinite_double_~hx~1#1, 2147483647))) - 2146435072 >= 0 then 0 else 1) % 4294967296 % 4294967296 else (if (if 0 == isfinite_double_~hx~1#1 then 0 else (if 1 == isfinite_double_~hx~1#1 then 1 else ~bitwiseAnd(isfinite_double_~hx~1#1, 2147483647))) - 2146435072 >= 0 then 0 else 1) % 4294967296 % 4294967296 - 4294967296); {24#false} is VALID [2022-02-20 16:37:36,514 INFO L290 TraceCheckUtils]: 9: Hoare triple {24#false} main_#t~ret11#1 := isfinite_double_#res#1;assume { :end_inline_isfinite_double } true;assume -2147483648 <= main_#t~ret11#1 && main_#t~ret11#1 <= 2147483647;main_~res~0#1 := ~convertINTToDOUBLE(main_#t~ret11#1);havoc main_#t~ret11#1; {24#false} is VALID [2022-02-20 16:37:36,514 INFO L290 TraceCheckUtils]: 10: Hoare triple {24#false} assume ~someBinaryDOUBLEComparisonOperation(main_~res~0#1, 0.0); {24#false} is VALID [2022-02-20 16:37:36,514 INFO L290 TraceCheckUtils]: 11: Hoare triple {24#false} assume !false; {24#false} is VALID [2022-02-20 16:37:36,515 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-20 16:37:36,515 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:37:36,515 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643520323] [2022-02-20 16:37:36,516 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1643520323] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:37:36,516 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:37:36,516 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 16:37:36,517 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189507222] [2022-02-20 16:37:36,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:37:36,521 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-02-20 16:37:36,540 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:37:36,543 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:37:36,557 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:37:36,558 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 16:37:36,558 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:37:36,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 16:37:36,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 16:37:36,581 INFO L87 Difference]: Start difference. First operand has 20 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 19 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:37:36,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:37:36,613 INFO L93 Difference]: Finished difference Result 38 states and 50 transitions. [2022-02-20 16:37:36,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 16:37:36,613 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-02-20 16:37:36,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:37:36,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:37:36,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 50 transitions. [2022-02-20 16:37:36,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:37:36,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 50 transitions. [2022-02-20 16:37:36,625 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 50 transitions. [2022-02-20 16:37:36,698 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-20 16:37:36,707 INFO L225 Difference]: With dead ends: 38 [2022-02-20 16:37:36,707 INFO L226 Difference]: Without dead ends: 16 [2022-02-20 16:37:36,710 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-20 16:37:36,713 INFO L933 BasicCegarLoop]: 21 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, 21 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-20 16:37:36,714 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:37:36,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2022-02-20 16:37:36,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2022-02-20 16:37:36,734 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:37:36,735 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states. Second operand has 16 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 15 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:37:36,736 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand has 16 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 15 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:37:36,736 INFO L87 Difference]: Start difference. First operand 16 states. Second operand has 16 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 15 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:37:36,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:37:36,738 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2022-02-20 16:37:36,739 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2022-02-20 16:37:36,739 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:37:36,739 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:37:36,740 INFO L74 IsIncluded]: Start isIncluded. First operand has 16 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 15 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 16 states. [2022-02-20 16:37:36,740 INFO L87 Difference]: Start difference. First operand has 16 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 15 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 16 states. [2022-02-20 16:37:36,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:37:36,742 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2022-02-20 16:37:36,742 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2022-02-20 16:37:36,742 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:37:36,742 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:37:36,743 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:37:36,743 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:37:36,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 15 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:37:36,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2022-02-20 16:37:36,745 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 12 [2022-02-20 16:37:36,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:37:36,745 INFO L470 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2022-02-20 16:37:36,746 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:37:36,746 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2022-02-20 16:37:36,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-02-20 16:37:36,747 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:37:36,747 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:37:36,748 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 16:37:36,750 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:37:36,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:37:36,752 INFO L85 PathProgramCache]: Analyzing trace with hash 499625812, now seen corresponding path program 1 times [2022-02-20 16:37:36,753 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:37:36,753 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191781850] [2022-02-20 16:37:36,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:37:36,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:37:36,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:37:36,885 INFO L290 TraceCheckUtils]: 0: Hoare triple {130#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(21, 2);call #Ultimate.allocInit(12, 3); {130#true} is VALID [2022-02-20 16:37:36,886 INFO L290 TraceCheckUtils]: 1: Hoare triple {130#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~ret8#1, main_#t~ret9#1, main_#t~short10#1, main_#t~ret11#1, main_~res~0#1, main_~x~0#1;main_~x~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;assume { :begin_inline_isinf_double } true;isinf_double_#in~x#1 := main_~x~0#1;havoc isinf_double_#res#1;havoc isinf_double_#t~mem4#1, isinf_double_#t~mem5#1, isinf_double_~#ew_u~0#1.base, isinf_double_~#ew_u~0#1.offset, isinf_double_~x#1, isinf_double_~hx~0#1, isinf_double_~lx~0#1;isinf_double_~x#1 := isinf_double_#in~x#1;havoc isinf_double_~hx~0#1;havoc isinf_double_~lx~0#1; {130#true} is VALID [2022-02-20 16:37:36,886 INFO L290 TraceCheckUtils]: 2: Hoare triple {130#true} call isinf_double_~#ew_u~0#1.base, isinf_double_~#ew_u~0#1.offset := #Ultimate.allocOnStack(8);call write~real(isinf_double_~x#1, isinf_double_~#ew_u~0#1.base, isinf_double_~#ew_u~0#1.offset, 8);call isinf_double_#t~mem4#1 := read~int(isinf_double_~#ew_u~0#1.base, 4 + isinf_double_~#ew_u~0#1.offset, 4);isinf_double_~hx~0#1 := (if isinf_double_#t~mem4#1 % 4294967296 % 4294967296 <= 2147483647 then isinf_double_#t~mem4#1 % 4294967296 % 4294967296 else isinf_double_#t~mem4#1 % 4294967296 % 4294967296 - 4294967296);havoc isinf_double_#t~mem4#1;call isinf_double_#t~mem5#1 := read~int(isinf_double_~#ew_u~0#1.base, isinf_double_~#ew_u~0#1.offset, 4);isinf_double_~lx~0#1 := (if isinf_double_#t~mem5#1 % 4294967296 % 4294967296 <= 2147483647 then isinf_double_#t~mem5#1 % 4294967296 % 4294967296 else isinf_double_#t~mem5#1 % 4294967296 % 4294967296 - 4294967296);havoc isinf_double_#t~mem5#1;call ULTIMATE.dealloc(isinf_double_~#ew_u~0#1.base, isinf_double_~#ew_u~0#1.offset);havoc isinf_double_~#ew_u~0#1.base, isinf_double_~#ew_u~0#1.offset; {130#true} is VALID [2022-02-20 16:37:36,886 INFO L290 TraceCheckUtils]: 3: Hoare triple {130#true} goto; {130#true} is VALID [2022-02-20 16:37:36,886 INFO L290 TraceCheckUtils]: 4: Hoare triple {130#true} isinf_double_~hx~0#1 := (if 0 == isinf_double_~hx~0#1 then 0 else (if 1 == isinf_double_~hx~0#1 then 1 else ~bitwiseAnd(isinf_double_~hx~0#1, 2147483647)));isinf_double_~hx~0#1 := (if (if (1 == isinf_double_~hx~0#1 || 0 == isinf_double_~hx~0#1) && 0 == (if (if (1 == isinf_double_~lx~0#1 || 0 == isinf_double_~lx~0#1) && 0 == -isinf_double_~lx~0#1 then isinf_double_~lx~0#1 else (if 0 == isinf_double_~lx~0#1 && (1 == -isinf_double_~lx~0#1 || 0 == -isinf_double_~lx~0#1) then -isinf_double_~lx~0#1 else (if (1 == isinf_double_~lx~0#1 && (1 == -isinf_double_~lx~0#1 || 0 == -isinf_double_~lx~0#1)) || ((1 == isinf_double_~lx~0#1 || 0 == isinf_double_~lx~0#1) && 1 == -isinf_double_~lx~0#1) then 1 else ~bitwiseOr(isinf_double_~lx~0#1, -isinf_double_~lx~0#1)))) >= 0 then 0 else 1) then isinf_double_~hx~0#1 else (if 0 == isinf_double_~hx~0#1 && (1 == (if (if (1 == isinf_double_~lx~0#1 || 0 == isinf_double_~lx~0#1) && 0 == -isinf_double_~lx~0#1 then isinf_double_~lx~0#1 else (if 0 == isinf_double_~lx~0#1 && (1 == -isinf_double_~lx~0#1 || 0 == -isinf_double_~lx~0#1) then -isinf_double_~lx~0#1 else (if (1 == isinf_double_~lx~0#1 && (1 == -isinf_double_~lx~0#1 || 0 == -isinf_double_~lx~0#1)) || ((1 == isinf_double_~lx~0#1 || 0 == isinf_double_~lx~0#1) && 1 == -isinf_double_~lx~0#1) then 1 else ~bitwiseOr(isinf_double_~lx~0#1, -isinf_double_~lx~0#1)))) >= 0 then 0 else 1) || 0 == (if (if (1 == isinf_double_~lx~0#1 || 0 == isinf_double_~lx~0#1) && 0 == -isinf_double_~lx~0#1 then isinf_double_~lx~0#1 else (if 0 == isinf_double_~lx~0#1 && (1 == -isinf_double_~lx~0#1 || 0 == -isinf_double_~lx~0#1) then -isinf_double_~lx~0#1 else (if (1 == isinf_double_~lx~0#1 && (1 == -isinf_double_~lx~0#1 || 0 == -isinf_double_~lx~0#1)) || ((1 == isinf_double_~lx~0#1 || 0 == isinf_double_~lx~0#1) && 1 == -isinf_double_~lx~0#1) then 1 else ~bitwiseOr(isinf_double_~lx~0#1, -isinf_double_~lx~0#1)))) >= 0 then 0 else 1)) then (if (if (1 == isinf_double_~lx~0#1 || 0 == isinf_double_~lx~0#1) && 0 == -isinf_double_~lx~0#1 then isinf_double_~lx~0#1 else (if 0 == isinf_double_~lx~0#1 && (1 == -isinf_double_~lx~0#1 || 0 == -isinf_double_~lx~0#1) then -isinf_double_~lx~0#1 else (if (1 == isinf_double_~lx~0#1 && (1 == -isinf_double_~lx~0#1 || 0 == -isinf_double_~lx~0#1)) || ((1 == isinf_double_~lx~0#1 || 0 == isinf_double_~lx~0#1) && 1 == -isinf_double_~lx~0#1) then 1 else ~bitwiseOr(isinf_double_~lx~0#1, -isinf_double_~lx~0#1)))) >= 0 then 0 else 1) else (if (1 == isinf_double_~hx~0#1 && (1 == (if (if (1 == isinf_double_~lx~0#1 || 0 == isinf_double_~lx~0#1) && 0 == -isinf_double_~lx~0#1 then isinf_double_~lx~0#1 else (if 0 == isinf_double_~lx~0#1 && (1 == -isinf_double_~lx~0#1 || 0 == -isinf_double_~lx~0#1) then -isinf_double_~lx~0#1 else (if (1 == isinf_double_~lx~0#1 && (1 == -isinf_double_~lx~0#1 || 0 == -isinf_double_~lx~0#1)) || ((1 == isinf_double_~lx~0#1 || 0 == isinf_double_~lx~0#1) && 1 == -isinf_double_~lx~0#1) then 1 else ~bitwiseOr(isinf_double_~lx~0#1, -isinf_double_~lx~0#1)))) >= 0 then 0 else 1) || 0 == (if (if (1 == isinf_double_~lx~0#1 || 0 == isinf_double_~lx~0#1) && 0 == -isinf_double_~lx~0#1 then isinf_double_~lx~0#1 else (if 0 == isinf_double_~lx~0#1 && (1 == -isinf_double_~lx~0#1 || 0 == -isinf_double_~lx~0#1) then -isinf_double_~lx~0#1 else (if (1 == isinf_double_~lx~0#1 && (1 == -isinf_double_~lx~0#1 || 0 == -isinf_double_~lx~0#1)) || ((1 == isinf_double_~lx~0#1 || 0 == isinf_double_~lx~0#1) && 1 == -isinf_double_~lx~0#1) then 1 else ~bitwiseOr(isinf_double_~lx~0#1, -isinf_double_~lx~0#1)))) >= 0 then 0 else 1))) || ((1 == isinf_double_~hx~0#1 || 0 == isinf_double_~hx~0#1) && 1 == (if (if (1 == isinf_double_~lx~0#1 || 0 == isinf_double_~lx~0#1) && 0 == -isinf_double_~lx~0#1 then isinf_double_~lx~0#1 else (if 0 == isinf_double_~lx~0#1 && (1 == -isinf_double_~lx~0#1 || 0 == -isinf_double_~lx~0#1) then -isinf_double_~lx~0#1 else (if (1 == isinf_double_~lx~0#1 && (1 == -isinf_double_~lx~0#1 || 0 == -isinf_double_~lx~0#1)) || ((1 == isinf_double_~lx~0#1 || 0 == isinf_double_~lx~0#1) && 1 == -isinf_double_~lx~0#1) then 1 else ~bitwiseOr(isinf_double_~lx~0#1, -isinf_double_~lx~0#1)))) >= 0 then 0 else 1)) then 1 else ~bitwiseOr(isinf_double_~hx~0#1, (if (if (1 == isinf_double_~lx~0#1 || 0 == isinf_double_~lx~0#1) && 0 == -isinf_double_~lx~0#1 then isinf_double_~lx~0#1 else (if 0 == isinf_double_~lx~0#1 && (1 == -isinf_double_~lx~0#1 || 0 == -isinf_double_~lx~0#1) then -isinf_double_~lx~0#1 else (if (1 == isinf_double_~lx~0#1 && (1 == -isinf_double_~lx~0#1 || 0 == -isinf_double_~lx~0#1)) || ((1 == isinf_double_~lx~0#1 || 0 == isinf_double_~lx~0#1) && 1 == -isinf_double_~lx~0#1) then 1 else ~bitwiseOr(isinf_double_~lx~0#1, -isinf_double_~lx~0#1)))) >= 0 then 0 else 1))))) % 4294967296 % 4294967296 <= 2147483647 then (if (1 == isinf_double_~hx~0#1 || 0 == isinf_double_~hx~0#1) && 0 == (if (if (1 == isinf_double_~lx~0#1 || 0 == isinf_double_~lx~0#1) && 0 == -isinf_double_~lx~0#1 then isinf_double_~lx~0#1 else (if 0 == isinf_double_~lx~0#1 && (1 == -isinf_double_~lx~0#1 || 0 == -isinf_double_~lx~0#1) then -isinf_double_~lx~0#1 else (if (1 == isinf_double_~lx~0#1 && (1 == -isinf_double_~lx~0#1 || 0 == -isinf_double_~lx~0#1)) || ((1 == isinf_double_~lx~0#1 || 0 == isinf_double_~lx~0#1) && 1 == -isinf_double_~lx~0#1) then 1 else ~bitwiseOr(isinf_double_~lx~0#1, -isinf_double_~lx~0#1)))) >= 0 then 0 else 1) then isinf_double_~hx~0#1 else (if 0 == isinf_double_~hx~0#1 && (1 == (if (if (1 == isinf_double_~lx~0#1 || 0 == isinf_double_~lx~0#1) && 0 == -isinf_double_~lx~0#1 then isinf_double_~lx~0#1 else (if 0 == isinf_double_~lx~0#1 && (1 == -isinf_double_~lx~0#1 || 0 == -isinf_double_~lx~0#1) then -isinf_double_~lx~0#1 else (if (1 == isinf_double_~lx~0#1 && (1 == -isinf_double_~lx~0#1 || 0 == -isinf_double_~lx~0#1)) || ((1 == isinf_double_~lx~0#1 || 0 == isinf_double_~lx~0#1) && 1 == -isinf_double_~lx~0#1) then 1 else ~bitwiseOr(isinf_double_~lx~0#1, -isinf_double_~lx~0#1)))) >= 0 then 0 else 1) || 0 == (if (if (1 == isinf_double_~lx~0#1 || 0 == isinf_double_~lx~0#1) && 0 == -isinf_double_~lx~0#1 then isinf_double_~lx~0#1 else (if 0 == isinf_double_~lx~0#1 && (1 == -isinf_double_~lx~0#1 || 0 == -isinf_double_~lx~0#1) then -isinf_double_~lx~0#1 else (if (1 == isinf_double_~lx~0#1 && (1 == -isinf_double_~lx~0#1 || 0 == -isinf_double_~lx~0#1)) || ((1 == isinf_double_~lx~0#1 || 0 == isinf_double_~lx~0#1) && 1 == -isinf_double_~lx~0#1) then 1 else ~bitwiseOr(isinf_double_~lx~0#1, -isinf_double_~lx~0#1)))) >= 0 then 0 else 1)) then (if (if (1 == isinf_double_~lx~0#1 || 0 == isinf_double_~lx~0#1) && 0 == -isinf_double_~lx~0#1 then isinf_double_~lx~0#1 else (if 0 == isinf_double_~lx~0#1 && (1 == -isinf_double_~lx~0#1 || 0 == -isinf_double_~lx~0#1) then -isinf_double_~lx~0#1 else (if (1 == isinf_double_~lx~0#1 && (1 == -isinf_double_~lx~0#1 || 0 == -isinf_double_~lx~0#1)) || ((1 == isinf_double_~lx~0#1 || 0 == isinf_double_~lx~0#1) && 1 == -isinf_double_~lx~0#1) then 1 else ~bitwiseOr(isinf_double_~lx~0#1, -isinf_double_~lx~0#1)))) >= 0 then 0 else 1) else (if (1 == isinf_double_~hx~0#1 && (1 == (if (if (1 == isinf_double_~lx~0#1 || 0 == isinf_double_~lx~0#1) && 0 == -isinf_double_~lx~0#1 then isinf_double_~lx~0#1 else (if 0 == isinf_double_~lx~0#1 && (1 == -isinf_double_~lx~0#1 || 0 == -isinf_double_~lx~0#1) then -isinf_double_~lx~0#1 else (if (1 == isinf_double_~lx~0#1 && (1 == -isinf_double_~lx~0#1 || 0 == -isinf_double_~lx~0#1)) || ((1 == isinf_double_~lx~0#1 || 0 == isinf_double_~lx~0#1) && 1 == -isinf_double_~lx~0#1) then 1 else ~bitwiseOr(isinf_double_~lx~0#1, -isinf_double_~lx~0#1)))) >= 0 then 0 else 1) || 0 == (if (if (1 == isinf_double_~lx~0#1 || 0 == isinf_double_~lx~0#1) && 0 == -isinf_double_~lx~0#1 then isinf_double_~lx~0#1 else (if 0 == isinf_double_~lx~0#1 && (1 == -isinf_double_~lx~0#1 || 0 == -isinf_double_~lx~0#1) then -isinf_double_~lx~0#1 else (if (1 == isinf_double_~lx~0#1 && (1 == -isinf_double_~lx~0#1 || 0 == -isinf_double_~lx~0#1)) || ((1 == isinf_double_~lx~0#1 || 0 == isinf_double_~lx~0#1) && 1 == -isinf_double_~lx~0#1) then 1 else ~bitwiseOr(isinf_double_~lx~0#1, -isinf_double_~lx~0#1)))) >= 0 then 0 else 1))) || ((1 == isinf_double_~hx~0#1 || 0 == isinf_double_~hx~0#1) && 1 == (if (if (1 == isinf_double_~lx~0#1 || 0 == isinf_double_~lx~0#1) && 0 == -isinf_double_~lx~0#1 then isinf_double_~lx~0#1 else (if 0 == isinf_double_~lx~0#1 && (1 == -isinf_double_~lx~0#1 || 0 == -isinf_double_~lx~0#1) then -isinf_double_~lx~0#1 else (if (1 == isinf_double_~lx~0#1 && (1 == -isinf_double_~lx~0#1 || 0 == -isinf_double_~lx~0#1)) || ((1 == isinf_double_~lx~0#1 || 0 == isinf_double_~lx~0#1) && 1 == -isinf_double_~lx~0#1) then 1 else ~bitwiseOr(isinf_double_~lx~0#1, -isinf_double_~lx~0#1)))) >= 0 then 0 else 1)) then 1 else ~bitwiseOr(isinf_double_~hx~0#1, (if (if (1 == isinf_double_~lx~0#1 || 0 == isinf_double_~lx~0#1) && 0 == -isinf_double_~lx~0#1 then isinf_double_~lx~0#1 else (if 0 == isinf_double_~lx~0#1 && (1 == -isinf_double_~lx~0#1 || 0 == -isinf_double_~lx~0#1) then -isinf_double_~lx~0#1 else (if (1 == isinf_double_~lx~0#1 && (1 == -isinf_double_~lx~0#1 || 0 == -isinf_double_~lx~0#1)) || ((1 == isinf_double_~lx~0#1 || 0 == isinf_double_~lx~0#1) && 1 == -isinf_double_~lx~0#1) then 1 else ~bitwiseOr(isinf_double_~lx~0#1, -isinf_double_~lx~0#1)))) >= 0 then 0 else 1))))) % 4294967296 % 4294967296 else (if (1 == isinf_double_~hx~0#1 || 0 == isinf_double_~hx~0#1) && 0 == (if (if (1 == isinf_double_~lx~0#1 || 0 == isinf_double_~lx~0#1) && 0 == -isinf_double_~lx~0#1 then isinf_double_~lx~0#1 else (if 0 == isinf_double_~lx~0#1 && (1 == -isinf_double_~lx~0#1 || 0 == -isinf_double_~lx~0#1) then -isinf_double_~lx~0#1 else (if (1 == isinf_double_~lx~0#1 && (1 == -isinf_double_~lx~0#1 || 0 == -isinf_double_~lx~0#1)) || ((1 == isinf_double_~lx~0#1 || 0 == isinf_double_~lx~0#1) && 1 == -isinf_double_~lx~0#1) then 1 else ~bitwiseOr(isinf_double_~lx~0#1, -isinf_double_~lx~0#1)))) >= 0 then 0 else 1) then isinf_double_~hx~0#1 else (if 0 == isinf_double_~hx~0#1 && (1 == (if (if (1 == isinf_double_~lx~0#1 || 0 == isinf_double_~lx~0#1) && 0 == -isinf_double_~lx~0#1 then isinf_double_~lx~0#1 else (if 0 == isinf_double_~lx~0#1 && (1 == -isinf_double_~lx~0#1 || 0 == -isinf_double_~lx~0#1) then -isinf_double_~lx~0#1 else (if (1 == isinf_double_~lx~0#1 && (1 == -isinf_double_~lx~0#1 || 0 == -isinf_double_~lx~0#1)) || ((1 == isinf_double_~lx~0#1 || 0 == isinf_double_~lx~0#1) && 1 == -isinf_double_~lx~0#1) then 1 else ~bitwiseOr(isinf_double_~lx~0#1, -isinf_double_~lx~0#1)))) >= 0 then 0 else 1) || 0 == (if (if (1 == isinf_double_~lx~0#1 || 0 == isinf_double_~lx~0#1) && 0 == -isinf_double_~lx~0#1 then isinf_double_~lx~0#1 else (if 0 == isinf_double_~lx~0#1 && (1 == -isinf_double_~lx~0#1 || 0 == -isinf_double_~lx~0#1) then -isinf_double_~lx~0#1 else (if (1 == isinf_double_~lx~0#1 && (1 == -isinf_double_~lx~0#1 || 0 == -isinf_double_~lx~0#1)) || ((1 == isinf_double_~lx~0#1 || 0 == isinf_double_~lx~0#1) && 1 == -isinf_double_~lx~0#1) then 1 else ~bitwiseOr(isinf_double_~lx~0#1, -isinf_double_~lx~0#1)))) >= 0 then 0 else 1)) then (if (if (1 == isinf_double_~lx~0#1 || 0 == isinf_double_~lx~0#1) && 0 == -isinf_double_~lx~0#1 then isinf_double_~lx~0#1 else (if 0 == isinf_double_~lx~0#1 && (1 == -isinf_double_~lx~0#1 || 0 == -isinf_double_~lx~0#1) then -isinf_double_~lx~0#1 else (if (1 == isinf_double_~lx~0#1 && (1 == -isinf_double_~lx~0#1 || 0 == -isinf_double_~lx~0#1)) || ((1 == isinf_double_~lx~0#1 || 0 == isinf_double_~lx~0#1) && 1 == -isinf_double_~lx~0#1) then 1 else ~bitwiseOr(isinf_double_~lx~0#1, -isinf_double_~lx~0#1)))) >= 0 then 0 else 1) else (if (1 == isinf_double_~hx~0#1 && (1 == (if (if (1 == isinf_double_~lx~0#1 || 0 == isinf_double_~lx~0#1) && 0 == -isinf_double_~lx~0#1 then isinf_double_~lx~0#1 else (if 0 == isinf_double_~lx~0#1 && (1 == -isinf_double_~lx~0#1 || 0 == -isinf_double_~lx~0#1) then -isinf_double_~lx~0#1 else (if (1 == isinf_double_~lx~0#1 && (1 == -isinf_double_~lx~0#1 || 0 == -isinf_double_~lx~0#1)) || ((1 == isinf_double_~lx~0#1 || 0 == isinf_double_~lx~0#1) && 1 == -isinf_double_~lx~0#1) then 1 else ~bitwiseOr(isinf_double_~lx~0#1, -isinf_double_~lx~0#1)))) >= 0 then 0 else 1) || 0 == (if (if (1 == isinf_double_~lx~0#1 || 0 == isinf_double_~lx~0#1) && 0 == -isinf_double_~lx~0#1 then isinf_double_~lx~0#1 else (if 0 == isinf_double_~lx~0#1 && (1 == -isinf_double_~lx~0#1 || 0 == -isinf_double_~lx~0#1) then -isinf_double_~lx~0#1 else (if (1 == isinf_double_~lx~0#1 && (1 == -isinf_double_~lx~0#1 || 0 == -isinf_double_~lx~0#1)) || ((1 == isinf_double_~lx~0#1 || 0 == isinf_double_~lx~0#1) && 1 == -isinf_double_~lx~0#1) then 1 else ~bitwiseOr(isinf_double_~lx~0#1, -isinf_double_~lx~0#1)))) >= 0 then 0 else 1))) || ((1 == isinf_double_~hx~0#1 || 0 == isinf_double_~hx~0#1) && 1 == (if (if (1 == isinf_double_~lx~0#1 || 0 == isinf_double_~lx~0#1) && 0 == -isinf_double_~lx~0#1 then isinf_double_~lx~0#1 else (if 0 == isinf_double_~lx~0#1 && (1 == -isinf_double_~lx~0#1 || 0 == -isinf_double_~lx~0#1) then -isinf_double_~lx~0#1 else (if (1 == isinf_double_~lx~0#1 && (1 == -isinf_double_~lx~0#1 || 0 == -isinf_double_~lx~0#1)) || ((1 == isinf_double_~lx~0#1 || 0 == isinf_double_~lx~0#1) && 1 == -isinf_double_~lx~0#1) then 1 else ~bitwiseOr(isinf_double_~lx~0#1, -isinf_double_~lx~0#1)))) >= 0 then 0 else 1)) then 1 else ~bitwiseOr(isinf_double_~hx~0#1, (if (if (1 == isinf_double_~lx~0#1 || 0 == isinf_double_~lx~0#1) && 0 == -isinf_double_~lx~0#1 then isinf_double_~lx~0#1 else (if 0 == isinf_double_~lx~0#1 && (1 == -isinf_double_~lx~0#1 || 0 == -isinf_double_~lx~0#1) then -isinf_double_~lx~0#1 else (if (1 == isinf_double_~lx~0#1 && (1 == -isinf_double_~lx~0#1 || 0 == -isinf_double_~lx~0#1)) || ((1 == isinf_double_~lx~0#1 || 0 == isinf_double_~lx~0#1) && 1 == -isinf_double_~lx~0#1) then 1 else ~bitwiseOr(isinf_double_~lx~0#1, -isinf_double_~lx~0#1)))) >= 0 then 0 else 1))))) % 4294967296 % 4294967296 - 4294967296);isinf_double_~hx~0#1 := 2146435072 - isinf_double_~hx~0#1;isinf_double_#res#1 := 1 - (if (if (if (1 == isinf_double_~hx~0#1 || 0 == isinf_double_~hx~0#1) && 0 == -isinf_double_~hx~0#1 then isinf_double_~hx~0#1 else (if 0 == isinf_double_~hx~0#1 && (1 == -isinf_double_~hx~0#1 || 0 == -isinf_double_~hx~0#1) then -isinf_double_~hx~0#1 else (if (1 == isinf_double_~hx~0#1 && (1 == -isinf_double_~hx~0#1 || 0 == -isinf_double_~hx~0#1)) || ((1 == isinf_double_~hx~0#1 || 0 == isinf_double_~hx~0#1) && 1 == -isinf_double_~hx~0#1) then 1 else ~bitwiseOr(isinf_double_~hx~0#1, -isinf_double_~hx~0#1)))) >= 0 then 0 else 1) % 4294967296 % 4294967296 <= 2147483647 then (if (if (1 == isinf_double_~hx~0#1 || 0 == isinf_double_~hx~0#1) && 0 == -isinf_double_~hx~0#1 then isinf_double_~hx~0#1 else (if 0 == isinf_double_~hx~0#1 && (1 == -isinf_double_~hx~0#1 || 0 == -isinf_double_~hx~0#1) then -isinf_double_~hx~0#1 else (if (1 == isinf_double_~hx~0#1 && (1 == -isinf_double_~hx~0#1 || 0 == -isinf_double_~hx~0#1)) || ((1 == isinf_double_~hx~0#1 || 0 == isinf_double_~hx~0#1) && 1 == -isinf_double_~hx~0#1) then 1 else ~bitwiseOr(isinf_double_~hx~0#1, -isinf_double_~hx~0#1)))) >= 0 then 0 else 1) % 4294967296 % 4294967296 else (if (if (1 == isinf_double_~hx~0#1 || 0 == isinf_double_~hx~0#1) && 0 == -isinf_double_~hx~0#1 then isinf_double_~hx~0#1 else (if 0 == isinf_double_~hx~0#1 && (1 == -isinf_double_~hx~0#1 || 0 == -isinf_double_~hx~0#1) then -isinf_double_~hx~0#1 else (if (1 == isinf_double_~hx~0#1 && (1 == -isinf_double_~hx~0#1 || 0 == -isinf_double_~hx~0#1)) || ((1 == isinf_double_~hx~0#1 || 0 == isinf_double_~hx~0#1) && 1 == -isinf_double_~hx~0#1) then 1 else ~bitwiseOr(isinf_double_~hx~0#1, -isinf_double_~hx~0#1)))) >= 0 then 0 else 1) % 4294967296 % 4294967296 - 4294967296); {130#true} is VALID [2022-02-20 16:37:36,887 INFO L290 TraceCheckUtils]: 5: Hoare triple {130#true} main_#t~ret8#1 := isinf_double_#res#1;assume { :end_inline_isinf_double } true;assume -2147483648 <= main_#t~ret8#1 && main_#t~ret8#1 <= 2147483647;main_#t~short10#1 := 0 == main_#t~ret8#1; {130#true} is VALID [2022-02-20 16:37:36,887 INFO L290 TraceCheckUtils]: 6: Hoare triple {130#true} assume !main_#t~short10#1; {132#(not |ULTIMATE.start_main_#t~short10#1|)} is VALID [2022-02-20 16:37:36,888 INFO L290 TraceCheckUtils]: 7: Hoare triple {132#(not |ULTIMATE.start_main_#t~short10#1|)} assume main_#t~short10#1;havoc main_#t~ret8#1;havoc main_#t~ret9#1;havoc main_#t~short10#1;assume { :begin_inline_isfinite_double } true;isfinite_double_#in~x#1 := main_~x~0#1;havoc isfinite_double_#res#1;havoc isfinite_double_#t~mem6#1, isfinite_double_~#gh_u~0#1.base, isfinite_double_~#gh_u~0#1.offset, isfinite_double_~x#1, isfinite_double_~hx~1#1;isfinite_double_~x#1 := isfinite_double_#in~x#1;havoc isfinite_double_~hx~1#1; {131#false} is VALID [2022-02-20 16:37:36,888 INFO L290 TraceCheckUtils]: 8: Hoare triple {131#false} call isfinite_double_~#gh_u~0#1.base, isfinite_double_~#gh_u~0#1.offset := #Ultimate.allocOnStack(8);call write~real(isfinite_double_~x#1, isfinite_double_~#gh_u~0#1.base, isfinite_double_~#gh_u~0#1.offset, 8);call isfinite_double_#t~mem6#1 := read~int(isfinite_double_~#gh_u~0#1.base, 4 + isfinite_double_~#gh_u~0#1.offset, 4);isfinite_double_~hx~1#1 := (if isfinite_double_#t~mem6#1 % 4294967296 % 4294967296 <= 2147483647 then isfinite_double_#t~mem6#1 % 4294967296 % 4294967296 else isfinite_double_#t~mem6#1 % 4294967296 % 4294967296 - 4294967296);havoc isfinite_double_#t~mem6#1;call ULTIMATE.dealloc(isfinite_double_~#gh_u~0#1.base, isfinite_double_~#gh_u~0#1.offset);havoc isfinite_double_~#gh_u~0#1.base, isfinite_double_~#gh_u~0#1.offset; {131#false} is VALID [2022-02-20 16:37:36,888 INFO L290 TraceCheckUtils]: 9: Hoare triple {131#false} goto; {131#false} is VALID [2022-02-20 16:37:36,888 INFO L290 TraceCheckUtils]: 10: Hoare triple {131#false} isfinite_double_#res#1 := (if (if (if 0 == isfinite_double_~hx~1#1 then 0 else (if 1 == isfinite_double_~hx~1#1 then 1 else ~bitwiseAnd(isfinite_double_~hx~1#1, 2147483647))) - 2146435072 >= 0 then 0 else 1) % 4294967296 % 4294967296 <= 2147483647 then (if (if 0 == isfinite_double_~hx~1#1 then 0 else (if 1 == isfinite_double_~hx~1#1 then 1 else ~bitwiseAnd(isfinite_double_~hx~1#1, 2147483647))) - 2146435072 >= 0 then 0 else 1) % 4294967296 % 4294967296 else (if (if 0 == isfinite_double_~hx~1#1 then 0 else (if 1 == isfinite_double_~hx~1#1 then 1 else ~bitwiseAnd(isfinite_double_~hx~1#1, 2147483647))) - 2146435072 >= 0 then 0 else 1) % 4294967296 % 4294967296 - 4294967296); {131#false} is VALID [2022-02-20 16:37:36,888 INFO L290 TraceCheckUtils]: 11: Hoare triple {131#false} main_#t~ret11#1 := isfinite_double_#res#1;assume { :end_inline_isfinite_double } true;assume -2147483648 <= main_#t~ret11#1 && main_#t~ret11#1 <= 2147483647;main_~res~0#1 := ~convertINTToDOUBLE(main_#t~ret11#1);havoc main_#t~ret11#1; {131#false} is VALID [2022-02-20 16:37:36,889 INFO L290 TraceCheckUtils]: 12: Hoare triple {131#false} assume ~someBinaryDOUBLEComparisonOperation(main_~res~0#1, 0.0); {131#false} is VALID [2022-02-20 16:37:36,889 INFO L290 TraceCheckUtils]: 13: Hoare triple {131#false} assume !false; {131#false} is VALID [2022-02-20 16:37:36,889 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-20 16:37:36,889 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:37:36,889 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191781850] [2022-02-20 16:37:36,890 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1191781850] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:37:36,890 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:37:36,890 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 16:37:36,890 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524571724] [2022-02-20 16:37:36,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:37:36,891 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-02-20 16:37:36,891 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:37:36,891 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:37:36,904 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-20 16:37:36,904 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 16:37:36,904 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:37:36,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 16:37:36,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 16:37:36,905 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:37:36,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:37:36,932 INFO L93 Difference]: Finished difference Result 24 states and 23 transitions. [2022-02-20 16:37:36,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 16:37:36,933 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-02-20 16:37:36,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:37:36,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:37:36,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 23 transitions. [2022-02-20 16:37:36,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:37:36,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 23 transitions. [2022-02-20 16:37:36,934 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 23 transitions. [2022-02-20 16:37:36,953 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:37:36,953 INFO L225 Difference]: With dead ends: 24 [2022-02-20 16:37:36,953 INFO L226 Difference]: Without dead ends: 16 [2022-02-20 16:37:36,953 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 16:37:36,954 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 0 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:37:36,955 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 26 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:37:36,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2022-02-20 16:37:36,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2022-02-20 16:37:36,956 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:37:36,957 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states. Second operand has 16 states, 15 states have (on average 1.0) internal successors, (15), 15 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:37:36,957 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand has 16 states, 15 states have (on average 1.0) internal successors, (15), 15 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:37:36,957 INFO L87 Difference]: Start difference. First operand 16 states. Second operand has 16 states, 15 states have (on average 1.0) internal successors, (15), 15 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:37:36,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:37:36,958 INFO L93 Difference]: Finished difference Result 16 states and 15 transitions. [2022-02-20 16:37:36,958 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 15 transitions. [2022-02-20 16:37:36,958 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:37:36,958 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:37:36,959 INFO L74 IsIncluded]: Start isIncluded. First operand has 16 states, 15 states have (on average 1.0) internal successors, (15), 15 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 16 states. [2022-02-20 16:37:36,959 INFO L87 Difference]: Start difference. First operand has 16 states, 15 states have (on average 1.0) internal successors, (15), 15 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 16 states. [2022-02-20 16:37:36,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:37:36,960 INFO L93 Difference]: Finished difference Result 16 states and 15 transitions. [2022-02-20 16:37:36,960 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 15 transitions. [2022-02-20 16:37:36,960 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:37:36,960 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:37:36,960 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:37:36,960 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:37:36,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.0) internal successors, (15), 15 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:37:36,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 15 transitions. [2022-02-20 16:37:36,961 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 15 transitions. Word has length 14 [2022-02-20 16:37:36,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:37:36,961 INFO L470 AbstractCegarLoop]: Abstraction has 16 states and 15 transitions. [2022-02-20 16:37:36,962 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:37:36,962 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 15 transitions. [2022-02-20 16:37:36,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-02-20 16:37:36,962 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:37:36,962 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:37:36,962 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 16:37:36,963 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:37:36,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:37:36,963 INFO L85 PathProgramCache]: Analyzing trace with hash 2210040, now seen corresponding path program 1 times [2022-02-20 16:37:36,963 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:37:36,964 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765216062] [2022-02-20 16:37:36,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:37:36,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:37:37,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 16:37:37,166 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-20 16:37:37,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 16:37:37,268 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-20 16:37:37,268 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-20 16:37:37,276 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-20 16:37:37,278 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 16:37:37,280 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2022-02-20 16:37:37,282 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 16:37:37,311 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-02-20 16:37:37,311 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-02-20 16:37:37,311 WARN L170 areAnnotationChecker]: L20-2 has no Hoare annotation [2022-02-20 16:37:37,311 WARN L170 areAnnotationChecker]: L20-2 has no Hoare annotation [2022-02-20 16:37:37,311 WARN L170 areAnnotationChecker]: L20-1 has no Hoare annotation [2022-02-20 16:37:37,311 WARN L170 areAnnotationChecker]: L20-1 has no Hoare annotation [2022-02-20 16:37:37,312 WARN L170 areAnnotationChecker]: L20-3 has no Hoare annotation [2022-02-20 16:37:37,312 WARN L170 areAnnotationChecker]: L29 has no Hoare annotation [2022-02-20 16:37:37,312 WARN L170 areAnnotationChecker]: L55 has no Hoare annotation [2022-02-20 16:37:37,312 WARN L170 areAnnotationChecker]: L55 has no Hoare annotation [2022-02-20 16:37:37,312 WARN L170 areAnnotationChecker]: L33 has no Hoare annotation [2022-02-20 16:37:37,312 WARN L170 areAnnotationChecker]: L55-2 has no Hoare annotation [2022-02-20 16:37:37,312 WARN L170 areAnnotationChecker]: L55-2 has no Hoare annotation [2022-02-20 16:37:37,312 WARN L170 areAnnotationChecker]: L37-2 has no Hoare annotation [2022-02-20 16:37:37,312 WARN L170 areAnnotationChecker]: L37-2 has no Hoare annotation [2022-02-20 16:37:37,312 WARN L170 areAnnotationChecker]: L55-4 has no Hoare annotation [2022-02-20 16:37:37,313 WARN L170 areAnnotationChecker]: L37-1 has no Hoare annotation [2022-02-20 16:37:37,313 WARN L170 areAnnotationChecker]: L37-1 has no Hoare annotation [2022-02-20 16:37:37,313 WARN L170 areAnnotationChecker]: L37-3 has no Hoare annotation [2022-02-20 16:37:37,313 WARN L170 areAnnotationChecker]: L66 has no Hoare annotation [2022-02-20 16:37:37,313 WARN L170 areAnnotationChecker]: L42 has no Hoare annotation [2022-02-20 16:37:37,313 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 16:37:37,313 WARN L170 areAnnotationChecker]: L60 has no Hoare annotation [2022-02-20 16:37:37,313 WARN L170 areAnnotationChecker]: L60 has no Hoare annotation [2022-02-20 16:37:37,313 WARN L170 areAnnotationChecker]: L61 has no Hoare annotation [2022-02-20 16:37:37,314 WARN L170 areAnnotationChecker]: L61 has no Hoare annotation [2022-02-20 16:37:37,314 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-02-20 16:37:37,314 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.02 04:37:37 BoogieIcfgContainer [2022-02-20 16:37:37,314 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-20 16:37:37,315 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-20 16:37:37,315 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-20 16:37:37,319 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-20 16:37:37,320 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:37:36" (3/4) ... [2022-02-20 16:37:37,322 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-02-20 16:37:37,322 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-20 16:37:37,326 INFO L158 Benchmark]: Toolchain (without parser) took 1991.84ms. Allocated memory was 81.8MB in the beginning and 98.6MB in the end (delta: 16.8MB). Free memory was 51.7MB in the beginning and 70.6MB in the end (delta: -18.8MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 16:37:37,326 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 81.8MB. Free memory was 50.3MB in the beginning and 50.3MB in the end (delta: 28.2kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 16:37:37,327 INFO L158 Benchmark]: CACSL2BoogieTranslator took 241.96ms. Allocated memory is still 81.8MB. Free memory was 51.7MB in the beginning and 57.3MB in the end (delta: -5.6MB). Peak memory consumption was 9.8MB. Max. memory is 16.1GB. [2022-02-20 16:37:37,344 INFO L158 Benchmark]: Boogie Procedure Inliner took 99.75ms. Allocated memory is still 81.8MB. Free memory was 57.3MB in the beginning and 52.8MB in the end (delta: 4.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-02-20 16:37:37,345 INFO L158 Benchmark]: Boogie Preprocessor took 55.49ms. Allocated memory is still 81.8MB. Free memory was 52.8MB in the beginning and 50.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 16:37:37,345 INFO L158 Benchmark]: RCFGBuilder took 486.13ms. Allocated memory was 81.8MB in the beginning and 98.6MB in the end (delta: 16.8MB). Free memory was 50.3MB in the beginning and 69.1MB in the end (delta: -18.7MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2022-02-20 16:37:37,345 INFO L158 Benchmark]: TraceAbstraction took 1082.06ms. Allocated memory is still 98.6MB. Free memory was 68.6MB in the beginning and 71.3MB in the end (delta: -2.7MB). Peak memory consumption was 31.0MB. Max. memory is 16.1GB. [2022-02-20 16:37:37,345 INFO L158 Benchmark]: Witness Printer took 10.26ms. Allocated memory is still 98.6MB. Free memory was 71.3MB in the beginning and 70.6MB in the end (delta: 696.8kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 16:37:37,347 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.14ms. Allocated memory is still 81.8MB. Free memory was 50.3MB in the beginning and 50.3MB in the end (delta: 28.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 241.96ms. Allocated memory is still 81.8MB. Free memory was 51.7MB in the beginning and 57.3MB in the end (delta: -5.6MB). Peak memory consumption was 9.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 99.75ms. Allocated memory is still 81.8MB. Free memory was 57.3MB in the beginning and 52.8MB in the end (delta: 4.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 55.49ms. Allocated memory is still 81.8MB. Free memory was 52.8MB in the beginning and 50.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 486.13ms. Allocated memory was 81.8MB in the beginning and 98.6MB in the end (delta: 16.8MB). Free memory was 50.3MB in the beginning and 69.1MB in the end (delta: -18.7MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * TraceAbstraction took 1082.06ms. Allocated memory is still 98.6MB. Free memory was 68.6MB in the beginning and 71.3MB in the end (delta: -2.7MB). Peak memory consumption was 31.0MB. Max. memory is 16.1GB. * Witness Printer took 10.26ms. Allocated memory is still 98.6MB. Free memory was 71.3MB in the beginning and 70.6MB in the end (delta: 696.8kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 61]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of bitwiseOr at line 27, overapproximation of bitwiseAnd at line 42, overapproximation of someBinaryDOUBLEComparisonOperation at line 60, overapproximation of to_real at line 57. Possible FailurePath: [L52] double x = __VERIFIER_nondet_double(); [L55] CALL, EXPR isinf_double(x) [L19] __int32_t hx, lx; VAL [\old(x)=8589934592, x=8589934592] [L21] ieee_double_shape_type ew_u; [L22] ew_u.value = (x) [L23] EXPR ew_u.parts.msw [L23] (hx) = ew_u.parts.msw [L24] EXPR ew_u.parts.lsw [L24] (lx) = ew_u.parts.lsw [L26] hx &= 0x7fffffff [L27] hx |= (__uint32_t)(lx | (-lx)) >> 31 [L28] hx = 0x7ff00000 - hx [L29] return 1 - (int)((__uint32_t)(hx | (-hx)) >> 31); VAL [\old(x)=8589934592, \result=0, hx=-1, lx=-1, x=8589934592] [L55] RET, EXPR isinf_double(x) [L55] !isinf_double(x) && !isnan_double(x) [L55] CALL, EXPR isnan_double(x) [L33] return x != x; VAL [\old(x)=8589934592, \result=0, x=8589934592] [L55] RET, EXPR isnan_double(x) [L55] !isinf_double(x) && !isnan_double(x) VAL [!isinf_double(x) && !isnan_double(x)=1, isinf_double(x)=0, isnan_double(x)=0, x=8589934592] [L55] COND TRUE !isinf_double(x) && !isnan_double(x) [L57] CALL, EXPR isfinite_double(x) [L36] __int32_t hx; VAL [\old(x)=8589934592, x=8589934592] [L38] ieee_double_shape_type gh_u; [L39] gh_u.value = (x) [L40] EXPR gh_u.parts.msw [L40] (hx) = gh_u.parts.msw [L42] return (int)((__uint32_t)((hx & 0x7fffffff) - 0x7ff00000) >> 31); VAL [\old(x)=8589934592, \result=0, hx=-3, x=8589934592] [L57] RET, EXPR isfinite_double(x) [L57] double res = isfinite_double(x); [L60] COND TRUE res == 0.0 VAL [x=8589934592] [L61] reach_error() VAL [x=8589934592] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 20 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.0s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 47 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 10 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5 IncrementalHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 37 mSDtfsCounter, 5 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=20occurred in iteration=0, InterpolantAutomatonStates: 5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 41 NumberOfCodeBlocks, 41 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 24 ConstructedInterpolants, 0 QuantifiedInterpolants, 25 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-02-20 16:37:37,377 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -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/float-newlib/double_req_bl_1300.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 70dcbfd71e657ebb73c2a6863351c66fa81e26e34ca397217ae05e2d3c176a8d --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 16:37:38,971 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 16:37:38,973 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 16:37:39,008 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 16:37:39,009 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 16:37:39,011 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 16:37:39,012 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 16:37:39,017 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 16:37:39,018 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 16:37:39,023 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 16:37:39,023 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 16:37:39,024 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 16:37:39,024 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 16:37:39,025 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 16:37:39,027 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 16:37:39,027 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 16:37:39,028 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 16:37:39,028 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 16:37:39,029 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 16:37:39,030 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 16:37:39,031 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 16:37:39,034 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 16:37:39,035 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 16:37:39,037 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 16:37:39,042 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 16:37:39,042 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 16:37:39,042 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 16:37:39,042 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 16:37:39,043 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 16:37:39,043 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 16:37:39,043 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 16:37:39,044 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 16:37:39,044 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 16:37:39,045 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 16:37:39,045 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 16:37:39,045 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 16:37:39,046 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 16:37:39,046 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 16:37:39,046 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 16:37:39,047 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 16:37:39,047 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 16:37:39,049 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2022-02-20 16:37:39,094 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 16:37:39,094 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 16:37:39,096 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 16:37:39,096 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 16:37:39,097 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 16:37:39,097 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 16:37:39,097 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 16:37:39,099 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 16:37:39,099 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 16:37:39,099 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 16:37:39,099 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 16:37:39,100 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 16:37:39,100 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 16:37:39,100 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 16:37:39,100 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 16:37:39,100 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 16:37:39,100 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 16:37:39,101 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-02-20 16:37:39,101 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-02-20 16:37:39,101 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 16:37:39,101 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 16:37:39,102 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 16:37:39,102 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 16:37:39,102 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 16:37:39,102 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 16:37:39,102 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 16:37:39,103 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:37:39,103 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 16:37:39,103 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 16:37:39,103 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 16:37:39,103 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-02-20 16:37:39,103 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-02-20 16:37:39,104 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 16:37:39,104 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 16:37:39,104 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 16:37:39,104 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-02-20 16:37:39,104 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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 ! call(reach_error())) ) 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 -> 70dcbfd71e657ebb73c2a6863351c66fa81e26e34ca397217ae05e2d3c176a8d [2022-02-20 16:37:39,393 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 16:37:39,407 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 16:37:39,410 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 16:37:39,411 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 16:37:39,411 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 16:37:39,413 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/double_req_bl_1300.c [2022-02-20 16:37:39,481 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e11d6d9d9/afcbb691ad0d470291bf4e19f0b634d6/FLAG31814a0af [2022-02-20 16:37:39,841 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 16:37:39,842 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1300.c [2022-02-20 16:37:39,846 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e11d6d9d9/afcbb691ad0d470291bf4e19f0b634d6/FLAG31814a0af [2022-02-20 16:37:40,296 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e11d6d9d9/afcbb691ad0d470291bf4e19f0b634d6 [2022-02-20 16:37:40,305 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 16:37:40,307 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 16:37:40,308 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 16:37:40,308 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 16:37:40,310 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 16:37:40,311 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:37:40" (1/1) ... [2022-02-20 16:37:40,313 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a1e6317 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:37:40, skipping insertion in model container [2022-02-20 16:37:40,313 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:37:40" (1/1) ... [2022-02-20 16:37:40,317 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 16:37:40,328 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 16:37:40,449 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/float-newlib/double_req_bl_1300.c[1563,1576] [2022-02-20 16:37:40,451 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:37:40,458 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 16:37:40,493 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/float-newlib/double_req_bl_1300.c[1563,1576] [2022-02-20 16:37:40,494 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:37:40,511 INFO L208 MainTranslator]: Completed translation [2022-02-20 16:37:40,511 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:37:40 WrapperNode [2022-02-20 16:37:40,511 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 16:37:40,512 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 16:37:40,512 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 16:37:40,512 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 16:37:40,516 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:37:40" (1/1) ... [2022-02-20 16:37:40,534 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:37:40" (1/1) ... [2022-02-20 16:37:40,560 INFO L137 Inliner]: procedures = 21, calls = 19, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 74 [2022-02-20 16:37:40,560 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 16:37:40,561 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 16:37:40,561 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 16:37:40,561 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 16:37:40,566 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:37:40" (1/1) ... [2022-02-20 16:37:40,567 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:37:40" (1/1) ... [2022-02-20 16:37:40,570 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:37:40" (1/1) ... [2022-02-20 16:37:40,571 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:37:40" (1/1) ... [2022-02-20 16:37:40,576 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:37:40" (1/1) ... [2022-02-20 16:37:40,585 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:37:40" (1/1) ... [2022-02-20 16:37:40,586 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:37:40" (1/1) ... [2022-02-20 16:37:40,588 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 16:37:40,588 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 16:37:40,588 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 16:37:40,588 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 16:37:40,589 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:37:40" (1/1) ... [2022-02-20 16:37:40,602 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:37:40,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:37:40,619 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-20 16:37:40,636 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-20 16:37:40,646 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 16:37:40,646 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2022-02-20 16:37:40,646 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-02-20 16:37:40,646 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 16:37:40,646 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-02-20 16:37:40,646 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 16:37:40,646 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 16:37:40,646 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 16:37:40,691 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 16:37:40,692 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 16:37:40,848 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 16:37:40,852 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 16:37:40,852 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-02-20 16:37:40,853 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:37:40 BoogieIcfgContainer [2022-02-20 16:37:40,853 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 16:37:40,854 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 16:37:40,854 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 16:37:40,856 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 16:37:40,856 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 04:37:40" (1/3) ... [2022-02-20 16:37:40,856 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@212ea79f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:37:40, skipping insertion in model container [2022-02-20 16:37:40,857 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:37:40" (2/3) ... [2022-02-20 16:37:40,857 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@212ea79f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:37:40, skipping insertion in model container [2022-02-20 16:37:40,857 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:37:40" (3/3) ... [2022-02-20 16:37:40,858 INFO L111 eAbstractionObserver]: Analyzing ICFG double_req_bl_1300.c [2022-02-20 16:37:40,861 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 16:37:40,861 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 16:37:40,894 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 16:37:40,898 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=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 16:37:40,898 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 16:37:40,907 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 19 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:37:40,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-02-20 16:37:40,910 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:37:40,910 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:37:40,910 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:37:40,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:37:40,913 INFO L85 PathProgramCache]: Analyzing trace with hash 1033094394, now seen corresponding path program 1 times [2022-02-20 16:37:40,921 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:37:40,921 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [967065464] [2022-02-20 16:37:40,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:37:40,922 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:37:40,922 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:37:40,924 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 16:37:40,959 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-02-20 16:37:41,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:37:41,019 INFO L263 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 1 conjunts are in the unsatisfiable core [2022-02-20 16:37:41,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:37:41,033 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:37:41,090 INFO L290 TraceCheckUtils]: 0: Hoare triple {23#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(21bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32); {23#true} is VALID [2022-02-20 16:37:41,091 INFO L290 TraceCheckUtils]: 1: Hoare triple {23#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~ret8#1, main_#t~ret9#1, main_#t~short10#1, main_#t~ret11#1, main_~res~0#1, main_~x~0#1;main_~x~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;assume { :begin_inline_isinf_double } true;isinf_double_#in~x#1 := main_~x~0#1;havoc isinf_double_#res#1;havoc isinf_double_#t~mem4#1, isinf_double_#t~mem5#1, isinf_double_~#ew_u~0#1.base, isinf_double_~#ew_u~0#1.offset, isinf_double_~x#1, isinf_double_~hx~0#1, isinf_double_~lx~0#1;isinf_double_~x#1 := isinf_double_#in~x#1;havoc isinf_double_~hx~0#1;havoc isinf_double_~lx~0#1; {23#true} is VALID [2022-02-20 16:37:41,092 INFO L290 TraceCheckUtils]: 2: Hoare triple {23#true} assume !true; {24#false} is VALID [2022-02-20 16:37:41,092 INFO L290 TraceCheckUtils]: 3: Hoare triple {24#false} isinf_double_~hx~0#1 := ~bvand32(2147483647bv32, isinf_double_~hx~0#1);isinf_double_~hx~0#1 := ~bvor32(isinf_double_~hx~0#1, ~bvlshr32(~bvor32(isinf_double_~lx~0#1, ~bvneg32(isinf_double_~lx~0#1)), 31bv32));isinf_double_~hx~0#1 := ~bvsub32(2146435072bv32, isinf_double_~hx~0#1);isinf_double_#res#1 := ~bvsub32(1bv32, ~bvlshr32(~bvor32(isinf_double_~hx~0#1, ~bvneg32(isinf_double_~hx~0#1)), 31bv32)); {24#false} is VALID [2022-02-20 16:37:41,092 INFO L290 TraceCheckUtils]: 4: Hoare triple {24#false} main_#t~ret8#1 := isinf_double_#res#1;assume { :end_inline_isinf_double } true;main_#t~short10#1 := 0bv32 == main_#t~ret8#1; {24#false} is VALID [2022-02-20 16:37:41,093 INFO L290 TraceCheckUtils]: 5: Hoare triple {24#false} assume !main_#t~short10#1; {24#false} is VALID [2022-02-20 16:37:41,093 INFO L290 TraceCheckUtils]: 6: Hoare triple {24#false} assume main_#t~short10#1;havoc main_#t~ret8#1;havoc main_#t~ret9#1;havoc main_#t~short10#1;assume { :begin_inline_isfinite_double } true;isfinite_double_#in~x#1 := main_~x~0#1;havoc isfinite_double_#res#1;havoc isfinite_double_#t~mem6#1, isfinite_double_~#gh_u~0#1.base, isfinite_double_~#gh_u~0#1.offset, isfinite_double_~x#1, isfinite_double_~hx~1#1;isfinite_double_~x#1 := isfinite_double_#in~x#1;havoc isfinite_double_~hx~1#1; {24#false} is VALID [2022-02-20 16:37:41,093 INFO L290 TraceCheckUtils]: 7: Hoare triple {24#false} assume !true; {24#false} is VALID [2022-02-20 16:37:41,093 INFO L290 TraceCheckUtils]: 8: Hoare triple {24#false} isfinite_double_#res#1 := ~bvlshr32(~bvsub32(~bvand32(2147483647bv32, isfinite_double_~hx~1#1), 2146435072bv32), 31bv32); {24#false} is VALID [2022-02-20 16:37:41,094 INFO L290 TraceCheckUtils]: 9: Hoare triple {24#false} main_#t~ret11#1 := isfinite_double_#res#1;assume { :end_inline_isfinite_double } true;main_~res~0#1 := ~convertINTToDOUBLE(currentRoundingMode, main_#t~ret11#1);havoc main_#t~ret11#1; {24#false} is VALID [2022-02-20 16:37:41,094 INFO L290 TraceCheckUtils]: 10: Hoare triple {24#false} assume ~fp.eq~DOUBLE(main_~res~0#1, ~Pluszero~DOUBLE()); {24#false} is VALID [2022-02-20 16:37:41,094 INFO L290 TraceCheckUtils]: 11: Hoare triple {24#false} assume !false; {24#false} is VALID [2022-02-20 16:37:41,095 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-20 16:37:41,095 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:37:41,096 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:37:41,096 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [967065464] [2022-02-20 16:37:41,097 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [967065464] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:37:41,097 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:37:41,097 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 16:37:41,099 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949309599] [2022-02-20 16:37:41,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:37:41,104 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-02-20 16:37:41,104 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:37:41,106 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:37:41,178 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:37:41,178 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 16:37:41,178 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:37:41,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 16:37:41,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 16:37:41,200 INFO L87 Difference]: Start difference. First operand has 20 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 19 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:37:41,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:37:41,260 INFO L93 Difference]: Finished difference Result 38 states and 50 transitions. [2022-02-20 16:37:41,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 16:37:41,260 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-02-20 16:37:41,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:37:41,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:37:41,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 50 transitions. [2022-02-20 16:37:41,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:37:41,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 50 transitions. [2022-02-20 16:37:41,272 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 50 transitions. [2022-02-20 16:37:41,374 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-20 16:37:41,380 INFO L225 Difference]: With dead ends: 38 [2022-02-20 16:37:41,380 INFO L226 Difference]: Without dead ends: 16 [2022-02-20 16:37:41,383 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 11 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-20 16:37:41,390 INFO L933 BasicCegarLoop]: 21 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, 21 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-20 16:37:41,395 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:37:41,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2022-02-20 16:37:41,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2022-02-20 16:37:41,434 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:37:41,434 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states. Second operand has 16 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 15 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:37:41,435 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand has 16 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 15 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:37:41,435 INFO L87 Difference]: Start difference. First operand 16 states. Second operand has 16 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 15 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:37:41,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:37:41,436 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2022-02-20 16:37:41,437 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2022-02-20 16:37:41,437 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:37:41,437 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:37:41,437 INFO L74 IsIncluded]: Start isIncluded. First operand has 16 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 15 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 16 states. [2022-02-20 16:37:41,437 INFO L87 Difference]: Start difference. First operand has 16 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 15 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 16 states. [2022-02-20 16:37:41,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:37:41,438 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2022-02-20 16:37:41,438 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2022-02-20 16:37:41,439 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:37:41,439 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:37:41,439 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:37:41,439 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:37:41,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 15 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:37:41,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2022-02-20 16:37:41,441 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 12 [2022-02-20 16:37:41,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:37:41,441 INFO L470 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2022-02-20 16:37:41,441 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:37:41,441 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2022-02-20 16:37:41,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-02-20 16:37:41,442 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:37:41,442 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:37:41,452 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-02-20 16:37:41,649 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 16:37:41,650 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:37:41,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:37:41,651 INFO L85 PathProgramCache]: Analyzing trace with hash 499625812, now seen corresponding path program 1 times [2022-02-20 16:37:41,651 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:37:41,651 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1553385345] [2022-02-20 16:37:41,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:37:41,652 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:37:41,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:37:41,653 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 16:37:41,667 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-02-20 16:37:41,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:37:41,738 INFO L263 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-20 16:37:41,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:37:41,745 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:37:41,781 INFO L290 TraceCheckUtils]: 0: Hoare triple {163#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(21bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32); {163#true} is VALID [2022-02-20 16:37:41,781 INFO L290 TraceCheckUtils]: 1: Hoare triple {163#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~ret8#1, main_#t~ret9#1, main_#t~short10#1, main_#t~ret11#1, main_~res~0#1, main_~x~0#1;main_~x~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;assume { :begin_inline_isinf_double } true;isinf_double_#in~x#1 := main_~x~0#1;havoc isinf_double_#res#1;havoc isinf_double_#t~mem4#1, isinf_double_#t~mem5#1, isinf_double_~#ew_u~0#1.base, isinf_double_~#ew_u~0#1.offset, isinf_double_~x#1, isinf_double_~hx~0#1, isinf_double_~lx~0#1;isinf_double_~x#1 := isinf_double_#in~x#1;havoc isinf_double_~hx~0#1;havoc isinf_double_~lx~0#1; {163#true} is VALID [2022-02-20 16:37:41,782 INFO L290 TraceCheckUtils]: 2: Hoare triple {163#true} call isinf_double_~#ew_u~0#1.base, isinf_double_~#ew_u~0#1.offset := #Ultimate.allocOnStack(8bv32);call write~intFLOATTYPE8(isinf_double_~x#1, isinf_double_~#ew_u~0#1.base, isinf_double_~#ew_u~0#1.offset, 8bv32);call isinf_double_#t~mem4#1 := read~intINTTYPE4(isinf_double_~#ew_u~0#1.base, ~bvadd32(4bv32, isinf_double_~#ew_u~0#1.offset), 4bv32);isinf_double_~hx~0#1 := isinf_double_#t~mem4#1;havoc isinf_double_#t~mem4#1;call isinf_double_#t~mem5#1 := read~intINTTYPE4(isinf_double_~#ew_u~0#1.base, isinf_double_~#ew_u~0#1.offset, 4bv32);isinf_double_~lx~0#1 := isinf_double_#t~mem5#1;havoc isinf_double_#t~mem5#1;call ULTIMATE.dealloc(isinf_double_~#ew_u~0#1.base, isinf_double_~#ew_u~0#1.offset);havoc isinf_double_~#ew_u~0#1.base, isinf_double_~#ew_u~0#1.offset; {163#true} is VALID [2022-02-20 16:37:41,782 INFO L290 TraceCheckUtils]: 3: Hoare triple {163#true} goto; {163#true} is VALID [2022-02-20 16:37:41,782 INFO L290 TraceCheckUtils]: 4: Hoare triple {163#true} isinf_double_~hx~0#1 := ~bvand32(2147483647bv32, isinf_double_~hx~0#1);isinf_double_~hx~0#1 := ~bvor32(isinf_double_~hx~0#1, ~bvlshr32(~bvor32(isinf_double_~lx~0#1, ~bvneg32(isinf_double_~lx~0#1)), 31bv32));isinf_double_~hx~0#1 := ~bvsub32(2146435072bv32, isinf_double_~hx~0#1);isinf_double_#res#1 := ~bvsub32(1bv32, ~bvlshr32(~bvor32(isinf_double_~hx~0#1, ~bvneg32(isinf_double_~hx~0#1)), 31bv32)); {163#true} is VALID [2022-02-20 16:37:41,782 INFO L290 TraceCheckUtils]: 5: Hoare triple {163#true} main_#t~ret8#1 := isinf_double_#res#1;assume { :end_inline_isinf_double } true;main_#t~short10#1 := 0bv32 == main_#t~ret8#1; {163#true} is VALID [2022-02-20 16:37:41,783 INFO L290 TraceCheckUtils]: 6: Hoare triple {163#true} assume !main_#t~short10#1; {186#(not |ULTIMATE.start_main_#t~short10#1|)} is VALID [2022-02-20 16:37:41,783 INFO L290 TraceCheckUtils]: 7: Hoare triple {186#(not |ULTIMATE.start_main_#t~short10#1|)} assume main_#t~short10#1;havoc main_#t~ret8#1;havoc main_#t~ret9#1;havoc main_#t~short10#1;assume { :begin_inline_isfinite_double } true;isfinite_double_#in~x#1 := main_~x~0#1;havoc isfinite_double_#res#1;havoc isfinite_double_#t~mem6#1, isfinite_double_~#gh_u~0#1.base, isfinite_double_~#gh_u~0#1.offset, isfinite_double_~x#1, isfinite_double_~hx~1#1;isfinite_double_~x#1 := isfinite_double_#in~x#1;havoc isfinite_double_~hx~1#1; {164#false} is VALID [2022-02-20 16:37:41,783 INFO L290 TraceCheckUtils]: 8: Hoare triple {164#false} call isfinite_double_~#gh_u~0#1.base, isfinite_double_~#gh_u~0#1.offset := #Ultimate.allocOnStack(8bv32);call write~intFLOATTYPE8(isfinite_double_~x#1, isfinite_double_~#gh_u~0#1.base, isfinite_double_~#gh_u~0#1.offset, 8bv32);call isfinite_double_#t~mem6#1 := read~intINTTYPE4(isfinite_double_~#gh_u~0#1.base, ~bvadd32(4bv32, isfinite_double_~#gh_u~0#1.offset), 4bv32);isfinite_double_~hx~1#1 := isfinite_double_#t~mem6#1;havoc isfinite_double_#t~mem6#1;call ULTIMATE.dealloc(isfinite_double_~#gh_u~0#1.base, isfinite_double_~#gh_u~0#1.offset);havoc isfinite_double_~#gh_u~0#1.base, isfinite_double_~#gh_u~0#1.offset; {164#false} is VALID [2022-02-20 16:37:41,783 INFO L290 TraceCheckUtils]: 9: Hoare triple {164#false} goto; {164#false} is VALID [2022-02-20 16:37:41,784 INFO L290 TraceCheckUtils]: 10: Hoare triple {164#false} isfinite_double_#res#1 := ~bvlshr32(~bvsub32(~bvand32(2147483647bv32, isfinite_double_~hx~1#1), 2146435072bv32), 31bv32); {164#false} is VALID [2022-02-20 16:37:41,784 INFO L290 TraceCheckUtils]: 11: Hoare triple {164#false} main_#t~ret11#1 := isfinite_double_#res#1;assume { :end_inline_isfinite_double } true;main_~res~0#1 := ~convertINTToDOUBLE(currentRoundingMode, main_#t~ret11#1);havoc main_#t~ret11#1; {164#false} is VALID [2022-02-20 16:37:41,784 INFO L290 TraceCheckUtils]: 12: Hoare triple {164#false} assume ~fp.eq~DOUBLE(main_~res~0#1, ~Pluszero~DOUBLE()); {164#false} is VALID [2022-02-20 16:37:41,784 INFO L290 TraceCheckUtils]: 13: Hoare triple {164#false} assume !false; {164#false} is VALID [2022-02-20 16:37:41,785 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-20 16:37:41,785 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:37:41,785 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:37:41,785 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1553385345] [2022-02-20 16:37:41,785 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1553385345] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:37:41,786 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:37:41,786 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 16:37:41,786 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701454294] [2022-02-20 16:37:41,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:37:41,796 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-02-20 16:37:41,797 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:37:41,798 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:37:41,830 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-20 16:37:41,830 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 16:37:41,831 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:37:41,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 16:37:41,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 16:37:41,833 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:37:42,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:37:42,014 INFO L93 Difference]: Finished difference Result 24 states and 23 transitions. [2022-02-20 16:37:42,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 16:37:42,014 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-02-20 16:37:42,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:37:42,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:37:42,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 23 transitions. [2022-02-20 16:37:42,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:37:42,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 23 transitions. [2022-02-20 16:37:42,016 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 23 transitions. [2022-02-20 16:37:42,080 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:37:42,080 INFO L225 Difference]: With dead ends: 24 [2022-02-20 16:37:42,080 INFO L226 Difference]: Without dead ends: 16 [2022-02-20 16:37:42,081 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 16:37:42,082 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 0 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:37:42,082 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 26 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:37:42,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2022-02-20 16:37:42,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2022-02-20 16:37:42,084 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:37:42,084 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states. Second operand has 16 states, 15 states have (on average 1.0) internal successors, (15), 15 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:37:42,084 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand has 16 states, 15 states have (on average 1.0) internal successors, (15), 15 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:37:42,084 INFO L87 Difference]: Start difference. First operand 16 states. Second operand has 16 states, 15 states have (on average 1.0) internal successors, (15), 15 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:37:42,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:37:42,085 INFO L93 Difference]: Finished difference Result 16 states and 15 transitions. [2022-02-20 16:37:42,085 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 15 transitions. [2022-02-20 16:37:42,085 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:37:42,085 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:37:42,086 INFO L74 IsIncluded]: Start isIncluded. First operand has 16 states, 15 states have (on average 1.0) internal successors, (15), 15 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 16 states. [2022-02-20 16:37:42,086 INFO L87 Difference]: Start difference. First operand has 16 states, 15 states have (on average 1.0) internal successors, (15), 15 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 16 states. [2022-02-20 16:37:42,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:37:42,086 INFO L93 Difference]: Finished difference Result 16 states and 15 transitions. [2022-02-20 16:37:42,086 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 15 transitions. [2022-02-20 16:37:42,087 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:37:42,087 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:37:42,087 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:37:42,087 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:37:42,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.0) internal successors, (15), 15 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:37:42,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 15 transitions. [2022-02-20 16:37:42,088 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 15 transitions. Word has length 14 [2022-02-20 16:37:42,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:37:42,088 INFO L470 AbstractCegarLoop]: Abstraction has 16 states and 15 transitions. [2022-02-20 16:37:42,088 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:37:42,089 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 15 transitions. [2022-02-20 16:37:42,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-02-20 16:37:42,089 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:37:42,089 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:37:42,098 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-02-20 16:37:42,297 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 16:37:42,298 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:37:42,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:37:42,299 INFO L85 PathProgramCache]: Analyzing trace with hash 2210040, now seen corresponding path program 1 times [2022-02-20 16:37:42,299 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:37:42,299 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1050806216] [2022-02-20 16:37:42,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:37:42,300 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:37:42,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:37:42,303 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 16:37:42,304 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-02-20 16:37:42,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:37:42,426 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 30 conjunts are in the unsatisfiable core [2022-02-20 16:37:42,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:37:42,551 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:37:42,645 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2022-02-20 16:37:43,730 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-20 16:37:43,733 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 76 treesize of output 44 [2022-02-20 16:37:45,610 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_skolemized_q#valueAsBitvector_9| (_ BitVec 64)) (|v_skolemized_q#valueAsBitvector_10| (_ BitVec 64))) (let ((.cse2 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_9|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_9|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_9|)))) (and (= (bvadd (bvneg (bvlshr (let ((.cse0 (bvadd (_ bv2146435072 32) (bvneg (bvor (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_9|)) (bvlshr (let ((.cse1 ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_9|))) (bvor (bvneg .cse1) .cse1)) (_ bv31 32))))))) (bvor (bvneg .cse0) .cse0)) (_ bv31 32))) (_ bv1 32)) (_ bv0 32)) (fp.eq .cse2 .cse2) (= |c_ULTIMATE.start_isfinite_double_~hx~1#1| ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_10|)) (= .cse2 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_10|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_10|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_10|)))))) is different from true [2022-02-20 16:37:47,019 INFO L290 TraceCheckUtils]: 0: Hoare triple {291#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(21bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32); {291#true} is VALID [2022-02-20 16:37:47,020 INFO L290 TraceCheckUtils]: 1: Hoare triple {291#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~ret8#1, main_#t~ret9#1, main_#t~short10#1, main_#t~ret11#1, main_~res~0#1, main_~x~0#1;main_~x~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;assume { :begin_inline_isinf_double } true;isinf_double_#in~x#1 := main_~x~0#1;havoc isinf_double_#res#1;havoc isinf_double_#t~mem4#1, isinf_double_#t~mem5#1, isinf_double_~#ew_u~0#1.base, isinf_double_~#ew_u~0#1.offset, isinf_double_~x#1, isinf_double_~hx~0#1, isinf_double_~lx~0#1;isinf_double_~x#1 := isinf_double_#in~x#1;havoc isinf_double_~hx~0#1;havoc isinf_double_~lx~0#1; {299#(= |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_isinf_double_~x#1|)} is VALID [2022-02-20 16:37:47,023 INFO L290 TraceCheckUtils]: 2: Hoare triple {299#(= |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_isinf_double_~x#1|)} call isinf_double_~#ew_u~0#1.base, isinf_double_~#ew_u~0#1.offset := #Ultimate.allocOnStack(8bv32);call write~intFLOATTYPE8(isinf_double_~x#1, isinf_double_~#ew_u~0#1.base, isinf_double_~#ew_u~0#1.offset, 8bv32);call isinf_double_#t~mem4#1 := read~intINTTYPE4(isinf_double_~#ew_u~0#1.base, ~bvadd32(4bv32, isinf_double_~#ew_u~0#1.offset), 4bv32);isinf_double_~hx~0#1 := isinf_double_#t~mem4#1;havoc isinf_double_#t~mem4#1;call isinf_double_#t~mem5#1 := read~intINTTYPE4(isinf_double_~#ew_u~0#1.base, isinf_double_~#ew_u~0#1.offset, 4bv32);isinf_double_~lx~0#1 := isinf_double_#t~mem5#1;havoc isinf_double_#t~mem5#1;call ULTIMATE.dealloc(isinf_double_~#ew_u~0#1.base, isinf_double_~#ew_u~0#1.offset);havoc isinf_double_~#ew_u~0#1.base, isinf_double_~#ew_u~0#1.offset; {303#(exists ((|v_skolemized_q#valueAsBitvector_9| (_ BitVec 64)) (|v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7| (_ BitVec 32))) (and (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_9|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_9|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_9|)) |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_isinf_double_~lx~0#1| (select (select |#memory_int| |v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7|) (_ bv0 32))) (= |ULTIMATE.start_isinf_double_~hx~0#1| (select (select |#memory_int| |v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7|) (_ bv4 32))) (= ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_9|) (select (select |#memory_int| |v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7|) (_ bv4 32))) (= ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_9|) (select (select |#memory_int| |v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7|) (_ bv0 32)))))} is VALID [2022-02-20 16:37:47,025 INFO L290 TraceCheckUtils]: 3: Hoare triple {303#(exists ((|v_skolemized_q#valueAsBitvector_9| (_ BitVec 64)) (|v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7| (_ BitVec 32))) (and (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_9|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_9|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_9|)) |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_isinf_double_~lx~0#1| (select (select |#memory_int| |v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7|) (_ bv0 32))) (= |ULTIMATE.start_isinf_double_~hx~0#1| (select (select |#memory_int| |v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7|) (_ bv4 32))) (= ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_9|) (select (select |#memory_int| |v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7|) (_ bv4 32))) (= ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_9|) (select (select |#memory_int| |v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7|) (_ bv0 32)))))} goto; {303#(exists ((|v_skolemized_q#valueAsBitvector_9| (_ BitVec 64)) (|v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7| (_ BitVec 32))) (and (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_9|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_9|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_9|)) |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_isinf_double_~lx~0#1| (select (select |#memory_int| |v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7|) (_ bv0 32))) (= |ULTIMATE.start_isinf_double_~hx~0#1| (select (select |#memory_int| |v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7|) (_ bv4 32))) (= ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_9|) (select (select |#memory_int| |v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7|) (_ bv4 32))) (= ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_9|) (select (select |#memory_int| |v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7|) (_ bv0 32)))))} is VALID [2022-02-20 16:37:47,032 INFO L290 TraceCheckUtils]: 4: Hoare triple {303#(exists ((|v_skolemized_q#valueAsBitvector_9| (_ BitVec 64)) (|v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7| (_ BitVec 32))) (and (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_9|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_9|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_9|)) |ULTIMATE.start_main_~x~0#1|) (= |ULTIMATE.start_isinf_double_~lx~0#1| (select (select |#memory_int| |v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7|) (_ bv0 32))) (= |ULTIMATE.start_isinf_double_~hx~0#1| (select (select |#memory_int| |v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7|) (_ bv4 32))) (= ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_9|) (select (select |#memory_int| |v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7|) (_ bv4 32))) (= ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_9|) (select (select |#memory_int| |v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7|) (_ bv0 32)))))} isinf_double_~hx~0#1 := ~bvand32(2147483647bv32, isinf_double_~hx~0#1);isinf_double_~hx~0#1 := ~bvor32(isinf_double_~hx~0#1, ~bvlshr32(~bvor32(isinf_double_~lx~0#1, ~bvneg32(isinf_double_~lx~0#1)), 31bv32));isinf_double_~hx~0#1 := ~bvsub32(2146435072bv32, isinf_double_~hx~0#1);isinf_double_#res#1 := ~bvsub32(1bv32, ~bvlshr32(~bvor32(isinf_double_~hx~0#1, ~bvneg32(isinf_double_~hx~0#1)), 31bv32)); {310#(exists ((|v_skolemized_q#valueAsBitvector_9| (_ BitVec 64)) (|v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7| (_ BitVec 32))) (and (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_9|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_9|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_9|)) |ULTIMATE.start_main_~x~0#1|) (= (bvadd (bvneg (bvlshr (bvor (bvneg (bvadd (_ bv2146435072 32) (bvneg (bvor (bvand (_ bv2147483647 32) (select (select |#memory_int| |v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7|) (_ bv4 32))) (bvlshr (bvor (select (select |#memory_int| |v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7|) (_ bv0 32)) (bvneg (select (select |#memory_int| |v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7|) (_ bv0 32)))) (_ bv31 32)))))) (bvadd (_ bv2146435072 32) (bvneg (bvor (bvand (_ bv2147483647 32) (select (select |#memory_int| |v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7|) (_ bv4 32))) (bvlshr (bvor (select (select |#memory_int| |v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7|) (_ bv0 32)) (bvneg (select (select |#memory_int| |v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7|) (_ bv0 32)))) (_ bv31 32)))))) (_ bv31 32))) (_ bv1 32)) |ULTIMATE.start_isinf_double_#res#1|) (= ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_9|) (select (select |#memory_int| |v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7|) (_ bv4 32))) (= ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_9|) (select (select |#memory_int| |v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7|) (_ bv0 32)))))} is VALID [2022-02-20 16:37:47,036 INFO L290 TraceCheckUtils]: 5: Hoare triple {310#(exists ((|v_skolemized_q#valueAsBitvector_9| (_ BitVec 64)) (|v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7| (_ BitVec 32))) (and (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_9|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_9|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_9|)) |ULTIMATE.start_main_~x~0#1|) (= (bvadd (bvneg (bvlshr (bvor (bvneg (bvadd (_ bv2146435072 32) (bvneg (bvor (bvand (_ bv2147483647 32) (select (select |#memory_int| |v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7|) (_ bv4 32))) (bvlshr (bvor (select (select |#memory_int| |v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7|) (_ bv0 32)) (bvneg (select (select |#memory_int| |v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7|) (_ bv0 32)))) (_ bv31 32)))))) (bvadd (_ bv2146435072 32) (bvneg (bvor (bvand (_ bv2147483647 32) (select (select |#memory_int| |v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7|) (_ bv4 32))) (bvlshr (bvor (select (select |#memory_int| |v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7|) (_ bv0 32)) (bvneg (select (select |#memory_int| |v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7|) (_ bv0 32)))) (_ bv31 32)))))) (_ bv31 32))) (_ bv1 32)) |ULTIMATE.start_isinf_double_#res#1|) (= ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_9|) (select (select |#memory_int| |v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7|) (_ bv4 32))) (= ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_9|) (select (select |#memory_int| |v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7|) (_ bv0 32)))))} main_#t~ret8#1 := isinf_double_#res#1;assume { :end_inline_isinf_double } true;main_#t~short10#1 := 0bv32 == main_#t~ret8#1; {314#(exists ((|v_skolemized_q#valueAsBitvector_9| (_ BitVec 64)) (|v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7| (_ BitVec 32))) (and (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_9|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_9|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_9|)) |ULTIMATE.start_main_~x~0#1|) (or (and (not (= (bvadd (bvneg (bvlshr (bvor (bvneg (bvadd (_ bv2146435072 32) (bvneg (bvor (bvand (_ bv2147483647 32) (select (select |#memory_int| |v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7|) (_ bv4 32))) (bvlshr (bvor (select (select |#memory_int| |v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7|) (_ bv0 32)) (bvneg (select (select |#memory_int| |v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7|) (_ bv0 32)))) (_ bv31 32)))))) (bvadd (_ bv2146435072 32) (bvneg (bvor (bvand (_ bv2147483647 32) (select (select |#memory_int| |v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7|) (_ bv4 32))) (bvlshr (bvor (select (select |#memory_int| |v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7|) (_ bv0 32)) (bvneg (select (select |#memory_int| |v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7|) (_ bv0 32)))) (_ bv31 32)))))) (_ bv31 32))) (_ bv1 32)) (_ bv0 32))) (not |ULTIMATE.start_main_#t~short10#1|)) (and (= (bvadd (bvneg (bvlshr (bvor (bvneg (bvadd (_ bv2146435072 32) (bvneg (bvor (bvand (_ bv2147483647 32) (select (select |#memory_int| |v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7|) (_ bv4 32))) (bvlshr (bvor (select (select |#memory_int| |v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7|) (_ bv0 32)) (bvneg (select (select |#memory_int| |v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7|) (_ bv0 32)))) (_ bv31 32)))))) (bvadd (_ bv2146435072 32) (bvneg (bvor (bvand (_ bv2147483647 32) (select (select |#memory_int| |v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7|) (_ bv4 32))) (bvlshr (bvor (select (select |#memory_int| |v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7|) (_ bv0 32)) (bvneg (select (select |#memory_int| |v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7|) (_ bv0 32)))) (_ bv31 32)))))) (_ bv31 32))) (_ bv1 32)) (_ bv0 32)) |ULTIMATE.start_main_#t~short10#1|)) (= ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_9|) (select (select |#memory_int| |v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7|) (_ bv4 32))) (= ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_9|) (select (select |#memory_int| |v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7|) (_ bv0 32)))))} is VALID [2022-02-20 16:37:47,040 INFO L290 TraceCheckUtils]: 6: Hoare triple {314#(exists ((|v_skolemized_q#valueAsBitvector_9| (_ BitVec 64)) (|v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7| (_ BitVec 32))) (and (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_9|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_9|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_9|)) |ULTIMATE.start_main_~x~0#1|) (or (and (not (= (bvadd (bvneg (bvlshr (bvor (bvneg (bvadd (_ bv2146435072 32) (bvneg (bvor (bvand (_ bv2147483647 32) (select (select |#memory_int| |v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7|) (_ bv4 32))) (bvlshr (bvor (select (select |#memory_int| |v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7|) (_ bv0 32)) (bvneg (select (select |#memory_int| |v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7|) (_ bv0 32)))) (_ bv31 32)))))) (bvadd (_ bv2146435072 32) (bvneg (bvor (bvand (_ bv2147483647 32) (select (select |#memory_int| |v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7|) (_ bv4 32))) (bvlshr (bvor (select (select |#memory_int| |v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7|) (_ bv0 32)) (bvneg (select (select |#memory_int| |v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7|) (_ bv0 32)))) (_ bv31 32)))))) (_ bv31 32))) (_ bv1 32)) (_ bv0 32))) (not |ULTIMATE.start_main_#t~short10#1|)) (and (= (bvadd (bvneg (bvlshr (bvor (bvneg (bvadd (_ bv2146435072 32) (bvneg (bvor (bvand (_ bv2147483647 32) (select (select |#memory_int| |v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7|) (_ bv4 32))) (bvlshr (bvor (select (select |#memory_int| |v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7|) (_ bv0 32)) (bvneg (select (select |#memory_int| |v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7|) (_ bv0 32)))) (_ bv31 32)))))) (bvadd (_ bv2146435072 32) (bvneg (bvor (bvand (_ bv2147483647 32) (select (select |#memory_int| |v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7|) (_ bv4 32))) (bvlshr (bvor (select (select |#memory_int| |v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7|) (_ bv0 32)) (bvneg (select (select |#memory_int| |v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7|) (_ bv0 32)))) (_ bv31 32)))))) (_ bv31 32))) (_ bv1 32)) (_ bv0 32)) |ULTIMATE.start_main_#t~short10#1|)) (= ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_9|) (select (select |#memory_int| |v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7|) (_ bv4 32))) (= ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_9|) (select (select |#memory_int| |v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7|) (_ bv0 32)))))} assume main_#t~short10#1;assume { :begin_inline_isnan_double } true;isnan_double_#in~x#1 := main_~x~0#1;havoc isnan_double_#res#1;havoc isnan_double_~x#1;isnan_double_~x#1 := isnan_double_#in~x#1;isnan_double_#res#1 := (if !~fp.eq~DOUBLE(isnan_double_~x#1, isnan_double_~x#1) then 1bv32 else 0bv32); {318#(and (or (and (= (_ bv0 32) |ULTIMATE.start_isnan_double_#res#1|) (fp.eq |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~x~0#1|)) (and (= (_ bv1 32) |ULTIMATE.start_isnan_double_#res#1|) (not (fp.eq |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~x~0#1|)))) (exists ((|v_skolemized_q#valueAsBitvector_9| (_ BitVec 64)) (|v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7| (_ BitVec 32))) (and (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_9|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_9|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_9|)) |ULTIMATE.start_main_~x~0#1|) (= (bvadd (bvneg (bvlshr (bvor (bvneg (bvadd (_ bv2146435072 32) (bvneg (bvor (bvand (_ bv2147483647 32) (select (select |#memory_int| |v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7|) (_ bv4 32))) (bvlshr (bvor (select (select |#memory_int| |v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7|) (_ bv0 32)) (bvneg (select (select |#memory_int| |v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7|) (_ bv0 32)))) (_ bv31 32)))))) (bvadd (_ bv2146435072 32) (bvneg (bvor (bvand (_ bv2147483647 32) (select (select |#memory_int| |v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7|) (_ bv4 32))) (bvlshr (bvor (select (select |#memory_int| |v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7|) (_ bv0 32)) (bvneg (select (select |#memory_int| |v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7|) (_ bv0 32)))) (_ bv31 32)))))) (_ bv31 32))) (_ bv1 32)) (_ bv0 32)) (= ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_9|) (select (select |#memory_int| |v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7|) (_ bv4 32))) (= ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_9|) (select (select |#memory_int| |v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7|) (_ bv0 32))))))} is VALID [2022-02-20 16:37:47,044 INFO L290 TraceCheckUtils]: 7: Hoare triple {318#(and (or (and (= (_ bv0 32) |ULTIMATE.start_isnan_double_#res#1|) (fp.eq |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~x~0#1|)) (and (= (_ bv1 32) |ULTIMATE.start_isnan_double_#res#1|) (not (fp.eq |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~x~0#1|)))) (exists ((|v_skolemized_q#valueAsBitvector_9| (_ BitVec 64)) (|v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7| (_ BitVec 32))) (and (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_9|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_9|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_9|)) |ULTIMATE.start_main_~x~0#1|) (= (bvadd (bvneg (bvlshr (bvor (bvneg (bvadd (_ bv2146435072 32) (bvneg (bvor (bvand (_ bv2147483647 32) (select (select |#memory_int| |v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7|) (_ bv4 32))) (bvlshr (bvor (select (select |#memory_int| |v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7|) (_ bv0 32)) (bvneg (select (select |#memory_int| |v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7|) (_ bv0 32)))) (_ bv31 32)))))) (bvadd (_ bv2146435072 32) (bvneg (bvor (bvand (_ bv2147483647 32) (select (select |#memory_int| |v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7|) (_ bv4 32))) (bvlshr (bvor (select (select |#memory_int| |v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7|) (_ bv0 32)) (bvneg (select (select |#memory_int| |v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7|) (_ bv0 32)))) (_ bv31 32)))))) (_ bv31 32))) (_ bv1 32)) (_ bv0 32)) (= ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_9|) (select (select |#memory_int| |v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7|) (_ bv4 32))) (= ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_9|) (select (select |#memory_int| |v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7|) (_ bv0 32))))))} main_#t~ret9#1 := isnan_double_#res#1;assume { :end_inline_isnan_double } true;main_#t~short10#1 := 0bv32 == main_#t~ret9#1; {322#(and (or (and |ULTIMATE.start_main_#t~short10#1| (fp.eq |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~x~0#1|)) (and (not (fp.eq |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~x~0#1|)) (not |ULTIMATE.start_main_#t~short10#1|))) (exists ((|v_skolemized_q#valueAsBitvector_9| (_ BitVec 64)) (|v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7| (_ BitVec 32))) (and (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_9|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_9|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_9|)) |ULTIMATE.start_main_~x~0#1|) (= (bvadd (bvneg (bvlshr (bvor (bvneg (bvadd (_ bv2146435072 32) (bvneg (bvor (bvand (_ bv2147483647 32) (select (select |#memory_int| |v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7|) (_ bv4 32))) (bvlshr (bvor (select (select |#memory_int| |v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7|) (_ bv0 32)) (bvneg (select (select |#memory_int| |v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7|) (_ bv0 32)))) (_ bv31 32)))))) (bvadd (_ bv2146435072 32) (bvneg (bvor (bvand (_ bv2147483647 32) (select (select |#memory_int| |v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7|) (_ bv4 32))) (bvlshr (bvor (select (select |#memory_int| |v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7|) (_ bv0 32)) (bvneg (select (select |#memory_int| |v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7|) (_ bv0 32)))) (_ bv31 32)))))) (_ bv31 32))) (_ bv1 32)) (_ bv0 32)) (= ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_9|) (select (select |#memory_int| |v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7|) (_ bv4 32))) (= ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_9|) (select (select |#memory_int| |v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7|) (_ bv0 32))))))} is VALID [2022-02-20 16:37:47,047 INFO L290 TraceCheckUtils]: 8: Hoare triple {322#(and (or (and |ULTIMATE.start_main_#t~short10#1| (fp.eq |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~x~0#1|)) (and (not (fp.eq |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~x~0#1|)) (not |ULTIMATE.start_main_#t~short10#1|))) (exists ((|v_skolemized_q#valueAsBitvector_9| (_ BitVec 64)) (|v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7| (_ BitVec 32))) (and (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_9|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_9|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_9|)) |ULTIMATE.start_main_~x~0#1|) (= (bvadd (bvneg (bvlshr (bvor (bvneg (bvadd (_ bv2146435072 32) (bvneg (bvor (bvand (_ bv2147483647 32) (select (select |#memory_int| |v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7|) (_ bv4 32))) (bvlshr (bvor (select (select |#memory_int| |v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7|) (_ bv0 32)) (bvneg (select (select |#memory_int| |v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7|) (_ bv0 32)))) (_ bv31 32)))))) (bvadd (_ bv2146435072 32) (bvneg (bvor (bvand (_ bv2147483647 32) (select (select |#memory_int| |v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7|) (_ bv4 32))) (bvlshr (bvor (select (select |#memory_int| |v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7|) (_ bv0 32)) (bvneg (select (select |#memory_int| |v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7|) (_ bv0 32)))) (_ bv31 32)))))) (_ bv31 32))) (_ bv1 32)) (_ bv0 32)) (= ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_9|) (select (select |#memory_int| |v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7|) (_ bv4 32))) (= ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_9|) (select (select |#memory_int| |v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7|) (_ bv0 32))))))} assume main_#t~short10#1;havoc main_#t~ret8#1;havoc main_#t~ret9#1;havoc main_#t~short10#1;assume { :begin_inline_isfinite_double } true;isfinite_double_#in~x#1 := main_~x~0#1;havoc isfinite_double_#res#1;havoc isfinite_double_#t~mem6#1, isfinite_double_~#gh_u~0#1.base, isfinite_double_~#gh_u~0#1.offset, isfinite_double_~x#1, isfinite_double_~hx~1#1;isfinite_double_~x#1 := isfinite_double_#in~x#1;havoc isfinite_double_~hx~1#1; {326#(exists ((|v_skolemized_q#valueAsBitvector_9| (_ BitVec 64)) (|v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7| (_ BitVec 32))) (and (= (bvadd (bvneg (bvlshr (bvor (bvneg (bvadd (_ bv2146435072 32) (bvneg (bvor (bvand (_ bv2147483647 32) (select (select |#memory_int| |v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7|) (_ bv4 32))) (bvlshr (bvor (select (select |#memory_int| |v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7|) (_ bv0 32)) (bvneg (select (select |#memory_int| |v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7|) (_ bv0 32)))) (_ bv31 32)))))) (bvadd (_ bv2146435072 32) (bvneg (bvor (bvand (_ bv2147483647 32) (select (select |#memory_int| |v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7|) (_ bv4 32))) (bvlshr (bvor (select (select |#memory_int| |v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7|) (_ bv0 32)) (bvneg (select (select |#memory_int| |v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7|) (_ bv0 32)))) (_ bv31 32)))))) (_ bv31 32))) (_ bv1 32)) (_ bv0 32)) (fp.eq (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_9|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_9|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_9|)) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_9|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_9|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_9|))) (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_9|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_9|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_9|)) |ULTIMATE.start_isfinite_double_~x#1|) (= ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_9|) (select (select |#memory_int| |v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7|) (_ bv4 32))) (= ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_9|) (select (select |#memory_int| |v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7|) (_ bv0 32)))))} is VALID [2022-02-20 16:37:48,968 INFO L290 TraceCheckUtils]: 9: Hoare triple {326#(exists ((|v_skolemized_q#valueAsBitvector_9| (_ BitVec 64)) (|v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7| (_ BitVec 32))) (and (= (bvadd (bvneg (bvlshr (bvor (bvneg (bvadd (_ bv2146435072 32) (bvneg (bvor (bvand (_ bv2147483647 32) (select (select |#memory_int| |v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7|) (_ bv4 32))) (bvlshr (bvor (select (select |#memory_int| |v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7|) (_ bv0 32)) (bvneg (select (select |#memory_int| |v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7|) (_ bv0 32)))) (_ bv31 32)))))) (bvadd (_ bv2146435072 32) (bvneg (bvor (bvand (_ bv2147483647 32) (select (select |#memory_int| |v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7|) (_ bv4 32))) (bvlshr (bvor (select (select |#memory_int| |v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7|) (_ bv0 32)) (bvneg (select (select |#memory_int| |v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7|) (_ bv0 32)))) (_ bv31 32)))))) (_ bv31 32))) (_ bv1 32)) (_ bv0 32)) (fp.eq (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_9|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_9|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_9|)) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_9|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_9|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_9|))) (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_9|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_9|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_9|)) |ULTIMATE.start_isfinite_double_~x#1|) (= ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_9|) (select (select |#memory_int| |v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7|) (_ bv4 32))) (= ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_9|) (select (select |#memory_int| |v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7|) (_ bv0 32)))))} call isfinite_double_~#gh_u~0#1.base, isfinite_double_~#gh_u~0#1.offset := #Ultimate.allocOnStack(8bv32);call write~intFLOATTYPE8(isfinite_double_~x#1, isfinite_double_~#gh_u~0#1.base, isfinite_double_~#gh_u~0#1.offset, 8bv32);call isfinite_double_#t~mem6#1 := read~intINTTYPE4(isfinite_double_~#gh_u~0#1.base, ~bvadd32(4bv32, isfinite_double_~#gh_u~0#1.offset), 4bv32);isfinite_double_~hx~1#1 := isfinite_double_#t~mem6#1;havoc isfinite_double_#t~mem6#1;call ULTIMATE.dealloc(isfinite_double_~#gh_u~0#1.base, isfinite_double_~#gh_u~0#1.offset);havoc isfinite_double_~#gh_u~0#1.base, isfinite_double_~#gh_u~0#1.offset; {330#(exists ((|v_skolemized_q#valueAsBitvector_9| (_ BitVec 64)) (|v_skolemized_q#valueAsBitvector_10| (_ BitVec 64))) (and (= (bvadd (bvneg (bvlshr (bvor (bvneg (bvadd (_ bv2146435072 32) (bvneg (bvor (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_9|)) (bvlshr (bvor (bvneg ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_9|)) ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_9|)) (_ bv31 32)))))) (bvadd (_ bv2146435072 32) (bvneg (bvor (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_9|)) (bvlshr (bvor (bvneg ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_9|)) ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_9|)) (_ bv31 32)))))) (_ bv31 32))) (_ bv1 32)) (_ bv0 32)) (= ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_10|) |ULTIMATE.start_isfinite_double_~hx~1#1|) (fp.eq (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_9|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_9|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_9|)) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_9|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_9|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_9|))) (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_9|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_9|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_9|)) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_10|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_10|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_10|)))))} is VALID [2022-02-20 16:37:48,977 INFO L290 TraceCheckUtils]: 10: Hoare triple {330#(exists ((|v_skolemized_q#valueAsBitvector_9| (_ BitVec 64)) (|v_skolemized_q#valueAsBitvector_10| (_ BitVec 64))) (and (= (bvadd (bvneg (bvlshr (bvor (bvneg (bvadd (_ bv2146435072 32) (bvneg (bvor (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_9|)) (bvlshr (bvor (bvneg ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_9|)) ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_9|)) (_ bv31 32)))))) (bvadd (_ bv2146435072 32) (bvneg (bvor (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_9|)) (bvlshr (bvor (bvneg ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_9|)) ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_9|)) (_ bv31 32)))))) (_ bv31 32))) (_ bv1 32)) (_ bv0 32)) (= ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_10|) |ULTIMATE.start_isfinite_double_~hx~1#1|) (fp.eq (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_9|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_9|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_9|)) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_9|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_9|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_9|))) (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_9|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_9|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_9|)) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_10|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_10|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_10|)))))} goto; {330#(exists ((|v_skolemized_q#valueAsBitvector_9| (_ BitVec 64)) (|v_skolemized_q#valueAsBitvector_10| (_ BitVec 64))) (and (= (bvadd (bvneg (bvlshr (bvor (bvneg (bvadd (_ bv2146435072 32) (bvneg (bvor (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_9|)) (bvlshr (bvor (bvneg ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_9|)) ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_9|)) (_ bv31 32)))))) (bvadd (_ bv2146435072 32) (bvneg (bvor (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_9|)) (bvlshr (bvor (bvneg ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_9|)) ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_9|)) (_ bv31 32)))))) (_ bv31 32))) (_ bv1 32)) (_ bv0 32)) (= ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_10|) |ULTIMATE.start_isfinite_double_~hx~1#1|) (fp.eq (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_9|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_9|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_9|)) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_9|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_9|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_9|))) (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_9|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_9|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_9|)) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_10|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_10|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_10|)))))} is VALID [2022-02-20 16:37:48,980 INFO L290 TraceCheckUtils]: 11: Hoare triple {330#(exists ((|v_skolemized_q#valueAsBitvector_9| (_ BitVec 64)) (|v_skolemized_q#valueAsBitvector_10| (_ BitVec 64))) (and (= (bvadd (bvneg (bvlshr (bvor (bvneg (bvadd (_ bv2146435072 32) (bvneg (bvor (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_9|)) (bvlshr (bvor (bvneg ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_9|)) ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_9|)) (_ bv31 32)))))) (bvadd (_ bv2146435072 32) (bvneg (bvor (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_9|)) (bvlshr (bvor (bvneg ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_9|)) ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_9|)) (_ bv31 32)))))) (_ bv31 32))) (_ bv1 32)) (_ bv0 32)) (= ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_10|) |ULTIMATE.start_isfinite_double_~hx~1#1|) (fp.eq (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_9|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_9|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_9|)) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_9|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_9|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_9|))) (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_9|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_9|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_9|)) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_10|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_10|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_10|)))))} isfinite_double_#res#1 := ~bvlshr32(~bvsub32(~bvand32(2147483647bv32, isfinite_double_~hx~1#1), 2146435072bv32), 31bv32); {337#(exists ((|v_skolemized_q#valueAsBitvector_9| (_ BitVec 64)) (|v_skolemized_q#valueAsBitvector_10| (_ BitVec 64))) (and (= (bvlshr (bvadd (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_10|)) (_ bv2148532224 32)) (_ bv31 32)) |ULTIMATE.start_isfinite_double_#res#1|) (= (bvadd (bvneg (bvlshr (bvor (bvneg (bvadd (_ bv2146435072 32) (bvneg (bvor (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_9|)) (bvlshr (bvor (bvneg ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_9|)) ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_9|)) (_ bv31 32)))))) (bvadd (_ bv2146435072 32) (bvneg (bvor (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_9|)) (bvlshr (bvor (bvneg ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_9|)) ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_9|)) (_ bv31 32)))))) (_ bv31 32))) (_ bv1 32)) (_ bv0 32)) (fp.eq (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_9|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_9|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_9|)) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_9|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_9|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_9|))) (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_9|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_9|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_9|)) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_10|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_10|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_10|)))))} is VALID [2022-02-20 16:37:49,019 INFO L290 TraceCheckUtils]: 12: Hoare triple {337#(exists ((|v_skolemized_q#valueAsBitvector_9| (_ BitVec 64)) (|v_skolemized_q#valueAsBitvector_10| (_ BitVec 64))) (and (= (bvlshr (bvadd (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_10|)) (_ bv2148532224 32)) (_ bv31 32)) |ULTIMATE.start_isfinite_double_#res#1|) (= (bvadd (bvneg (bvlshr (bvor (bvneg (bvadd (_ bv2146435072 32) (bvneg (bvor (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_9|)) (bvlshr (bvor (bvneg ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_9|)) ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_9|)) (_ bv31 32)))))) (bvadd (_ bv2146435072 32) (bvneg (bvor (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_9|)) (bvlshr (bvor (bvneg ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_9|)) ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_9|)) (_ bv31 32)))))) (_ bv31 32))) (_ bv1 32)) (_ bv0 32)) (fp.eq (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_9|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_9|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_9|)) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_9|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_9|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_9|))) (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_9|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_9|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_9|)) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_10|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_10|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_10|)))))} main_#t~ret11#1 := isfinite_double_#res#1;assume { :end_inline_isfinite_double } true;main_~res~0#1 := ~convertINTToDOUBLE(currentRoundingMode, main_#t~ret11#1);havoc main_#t~ret11#1; {341#(exists ((|v_skolemized_q#valueAsBitvector_9| (_ BitVec 64)) (|v_skolemized_q#valueAsBitvector_10| (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= (bvadd (bvneg (bvlshr (bvor (bvneg (bvadd (_ bv2146435072 32) (bvneg (bvor (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_9|)) (bvlshr (bvor (bvneg ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_9|)) ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_9|)) (_ bv31 32)))))) (bvadd (_ bv2146435072 32) (bvneg (bvor (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_9|)) (bvlshr (bvor (bvneg ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_9|)) ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_9|)) (_ bv31 32)))))) (_ bv31 32))) (_ bv1 32)) (_ bv0 32)) (fp.eq (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_9|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_9|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_9|)) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_9|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_9|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_9|))) (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_9|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_9|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_9|)) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_10|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_10|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_10|))) (= |ULTIMATE.start_main_~res~0#1| ((_ to_fp 11 53) currentRoundingMode (bvlshr (bvadd (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_10|)) (_ bv2148532224 32)) (_ bv31 32))))))} is VALID [2022-02-20 16:37:49,066 INFO L290 TraceCheckUtils]: 13: Hoare triple {341#(exists ((|v_skolemized_q#valueAsBitvector_9| (_ BitVec 64)) (|v_skolemized_q#valueAsBitvector_10| (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= (bvadd (bvneg (bvlshr (bvor (bvneg (bvadd (_ bv2146435072 32) (bvneg (bvor (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_9|)) (bvlshr (bvor (bvneg ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_9|)) ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_9|)) (_ bv31 32)))))) (bvadd (_ bv2146435072 32) (bvneg (bvor (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_9|)) (bvlshr (bvor (bvneg ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_9|)) ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_9|)) (_ bv31 32)))))) (_ bv31 32))) (_ bv1 32)) (_ bv0 32)) (fp.eq (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_9|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_9|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_9|)) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_9|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_9|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_9|))) (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_9|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_9|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_9|)) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_10|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_10|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_10|))) (= |ULTIMATE.start_main_~res~0#1| ((_ to_fp 11 53) currentRoundingMode (bvlshr (bvadd (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_10|)) (_ bv2148532224 32)) (_ bv31 32))))))} assume ~fp.eq~DOUBLE(main_~res~0#1, ~Pluszero~DOUBLE()); {292#false} is VALID [2022-02-20 16:37:49,069 INFO L290 TraceCheckUtils]: 14: Hoare triple {292#false} assume !false; {292#false} is VALID [2022-02-20 16:37:49,070 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-20 16:37:49,070 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:37:49,070 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:37:49,070 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1050806216] [2022-02-20 16:37:49,070 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1050806216] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:37:49,070 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:37:49,070 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-02-20 16:37:49,070 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425492673] [2022-02-20 16:37:49,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:37:49,071 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-02-20 16:37:49,071 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:37:49,071 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:37:49,188 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-20 16:37:49,188 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-02-20 16:37:49,188 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:37:49,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-02-20 16:37:49,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=92, Unknown=1, NotChecked=18, Total=132 [2022-02-20 16:37:49,189 INFO L87 Difference]: Start difference. First operand 16 states and 15 transitions. Second operand has 12 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:37:49,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:37:49,382 INFO L93 Difference]: Finished difference Result 16 states and 15 transitions. [2022-02-20 16:37:49,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-20 16:37:49,382 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-02-20 16:37:49,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:37:49,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:37:49,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 15 transitions. [2022-02-20 16:37:49,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:37:49,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 15 transitions. [2022-02-20 16:37:49,383 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 15 transitions. [2022-02-20 16:37:49,494 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-20 16:37:49,494 INFO L225 Difference]: With dead ends: 16 [2022-02-20 16:37:49,494 INFO L226 Difference]: Without dead ends: 0 [2022-02-20 16:37:49,494 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=25, Invalid=110, Unknown=1, NotChecked=20, Total=156 [2022-02-20 16:37:49,495 INFO L933 BasicCegarLoop]: 4 mSDtfsCounter, 2 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 40 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:37:49,495 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 16 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 40 Unchecked, 0.0s Time] [2022-02-20 16:37:49,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-02-20 16:37:49,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-02-20 16:37:49,496 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:37:49,496 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:37:49,496 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:37:49,496 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:37:49,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:37:49,496 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-20 16:37:49,496 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 16:37:49,496 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:37:49,496 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:37:49,497 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-02-20 16:37:49,497 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-02-20 16:37:49,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:37:49,497 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-20 16:37:49,497 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 16:37:49,497 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:37:49,497 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:37:49,497 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:37:49,497 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:37:49,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:37:49,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-02-20 16:37:49,497 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 15 [2022-02-20 16:37:49,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:37:49,498 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-20 16:37:49,498 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:37:49,498 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 16:37:49,498 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:37:49,500 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-20 16:37:49,528 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-02-20 16:37:49,701 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 16:37:49,703 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-02-20 16:37:49,770 INFO L858 garLoopResultBuilder]: For program point L60(lines 60 63) no Hoare annotation was computed. [2022-02-20 16:37:49,770 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-02-20 16:37:49,770 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-02-20 16:37:49,770 INFO L858 garLoopResultBuilder]: For program point L61(line 61) no Hoare annotation was computed. [2022-02-20 16:37:49,770 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-02-20 16:37:49,770 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 61) no Hoare annotation was computed. [2022-02-20 16:37:49,770 INFO L858 garLoopResultBuilder]: For program point L20-1(lines 20 25) no Hoare annotation was computed. [2022-02-20 16:37:49,770 INFO L854 garLoopResultBuilder]: At program point L20-2(lines 20 25) the Hoare annotation is: (= |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_isinf_double_~x#1|) [2022-02-20 16:37:49,770 INFO L858 garLoopResultBuilder]: For program point L20-3(lines 20 25) no Hoare annotation was computed. [2022-02-20 16:37:49,770 INFO L858 garLoopResultBuilder]: For program point L37-1(lines 37 41) no Hoare annotation was computed. [2022-02-20 16:37:49,771 INFO L854 garLoopResultBuilder]: At program point L37-2(lines 37 41) the Hoare annotation is: (exists ((|v_skolemized_q#valueAsBitvector_9| (_ BitVec 64)) (|v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7| (_ BitVec 32))) (let ((.cse4 (select |#memory_int| |v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7|))) (let ((.cse3 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_9|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_9|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_9|))) (.cse1 (select .cse4 (_ bv4 32))) (.cse2 (select .cse4 (_ bv0 32)))) (and (= (bvadd (bvneg (bvlshr (let ((.cse0 (bvadd (_ bv2146435072 32) (bvneg (bvor (bvand (_ bv2147483647 32) .cse1) (bvlshr (bvor .cse2 (bvneg .cse2)) (_ bv31 32))))))) (bvor (bvneg .cse0) .cse0)) (_ bv31 32))) (_ bv1 32)) (_ bv0 32)) (fp.eq .cse3 .cse3) (= .cse3 |ULTIMATE.start_isfinite_double_~x#1|) (= ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_9|) .cse1) (= ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_9|) .cse2))))) [2022-02-20 16:37:49,771 INFO L858 garLoopResultBuilder]: For program point L37-3(lines 37 41) no Hoare annotation was computed. [2022-02-20 16:37:49,771 INFO L861 garLoopResultBuilder]: At program point L66(lines 45 67) the Hoare annotation is: true [2022-02-20 16:37:49,771 INFO L854 garLoopResultBuilder]: At program point L33(line 33) the Hoare annotation is: (and (let ((.cse0 (fp.eq |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~x~0#1|))) (or (and (= (_ bv0 32) |ULTIMATE.start_isnan_double_#res#1|) .cse0) (and (= (_ bv1 32) |ULTIMATE.start_isnan_double_#res#1|) (not .cse0)))) (exists ((|v_skolemized_q#valueAsBitvector_9| (_ BitVec 64)) (|v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7| (_ BitVec 32))) (let ((.cse4 (select |#memory_int| |v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7|))) (let ((.cse2 (select .cse4 (_ bv4 32))) (.cse3 (select .cse4 (_ bv0 32)))) (and (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_9|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_9|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_9|)) |ULTIMATE.start_main_~x~0#1|) (= (bvadd (bvneg (bvlshr (let ((.cse1 (bvadd (_ bv2146435072 32) (bvneg (bvor (bvand (_ bv2147483647 32) .cse2) (bvlshr (bvor .cse3 (bvneg .cse3)) (_ bv31 32))))))) (bvor (bvneg .cse1) .cse1)) (_ bv31 32))) (_ bv1 32)) (_ bv0 32)) (= ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_9|) .cse2) (= ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_9|) .cse3)))))) [2022-02-20 16:37:49,771 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-02-20 16:37:49,771 INFO L854 garLoopResultBuilder]: At program point L29(lines 18 30) the Hoare annotation is: (exists ((|v_skolemized_q#valueAsBitvector_9| (_ BitVec 64)) (|v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7| (_ BitVec 32))) (let ((.cse3 (select |#memory_int| |v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7|))) (let ((.cse1 (select .cse3 (_ bv4 32))) (.cse2 (select .cse3 (_ bv0 32)))) (and (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_9|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_9|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_9|)) |ULTIMATE.start_main_~x~0#1|) (= (bvadd (bvneg (bvlshr (let ((.cse0 (bvadd (_ bv2146435072 32) (bvneg (bvor (bvand (_ bv2147483647 32) .cse1) (bvlshr (bvor .cse2 (bvneg .cse2)) (_ bv31 32))))))) (bvor (bvneg .cse0) .cse0)) (_ bv31 32))) (_ bv1 32)) |ULTIMATE.start_isinf_double_#res#1|) (= ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_9|) .cse1) (= ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_9|) .cse2))))) [2022-02-20 16:37:49,771 INFO L854 garLoopResultBuilder]: At program point L42(lines 35 43) the Hoare annotation is: (exists ((|v_skolemized_q#valueAsBitvector_9| (_ BitVec 64)) (|v_skolemized_q#valueAsBitvector_10| (_ BitVec 64))) (let ((.cse2 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_9|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_9|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_9|)))) (and (= (bvlshr (bvadd (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_10|)) (_ bv2148532224 32)) (_ bv31 32)) |ULTIMATE.start_isfinite_double_#res#1|) (= (bvadd (bvneg (bvlshr (let ((.cse0 (bvadd (_ bv2146435072 32) (bvneg (bvor (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_9|)) (bvlshr (let ((.cse1 ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_9|))) (bvor (bvneg .cse1) .cse1)) (_ bv31 32))))))) (bvor (bvneg .cse0) .cse0)) (_ bv31 32))) (_ bv1 32)) (_ bv0 32)) (fp.eq .cse2 .cse2) (= .cse2 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_10|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_10|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_10|)))))) [2022-02-20 16:37:49,772 INFO L858 garLoopResultBuilder]: For program point L55(line 55) no Hoare annotation was computed. [2022-02-20 16:37:49,772 INFO L858 garLoopResultBuilder]: For program point L55-2(lines 55 64) no Hoare annotation was computed. [2022-02-20 16:37:49,772 INFO L858 garLoopResultBuilder]: For program point L55-4(lines 55 64) no Hoare annotation was computed. [2022-02-20 16:37:49,774 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2022-02-20 16:37:49,775 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 16:37:49,778 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-02-20 16:37:49,778 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-02-20 16:37:49,778 WARN L170 areAnnotationChecker]: L20-1 has no Hoare annotation [2022-02-20 16:37:49,778 WARN L170 areAnnotationChecker]: L20-3 has no Hoare annotation [2022-02-20 16:37:49,778 WARN L170 areAnnotationChecker]: L20-1 has no Hoare annotation [2022-02-20 16:37:49,779 WARN L170 areAnnotationChecker]: L20-1 has no Hoare annotation [2022-02-20 16:37:49,779 WARN L170 areAnnotationChecker]: L20-3 has no Hoare annotation [2022-02-20 16:37:49,779 WARN L170 areAnnotationChecker]: L55 has no Hoare annotation [2022-02-20 16:37:49,779 WARN L170 areAnnotationChecker]: L55 has no Hoare annotation [2022-02-20 16:37:49,779 WARN L170 areAnnotationChecker]: L55 has no Hoare annotation [2022-02-20 16:37:49,779 WARN L170 areAnnotationChecker]: L55-2 has no Hoare annotation [2022-02-20 16:37:49,779 WARN L170 areAnnotationChecker]: L55-2 has no Hoare annotation [2022-02-20 16:37:49,779 WARN L170 areAnnotationChecker]: L55-2 has no Hoare annotation [2022-02-20 16:37:49,779 WARN L170 areAnnotationChecker]: L37-1 has no Hoare annotation [2022-02-20 16:37:49,779 WARN L170 areAnnotationChecker]: L37-3 has no Hoare annotation [2022-02-20 16:37:49,779 WARN L170 areAnnotationChecker]: L55-4 has no Hoare annotation [2022-02-20 16:37:49,780 WARN L170 areAnnotationChecker]: L37-1 has no Hoare annotation [2022-02-20 16:37:49,780 WARN L170 areAnnotationChecker]: L37-1 has no Hoare annotation [2022-02-20 16:37:49,780 WARN L170 areAnnotationChecker]: L37-3 has no Hoare annotation [2022-02-20 16:37:49,780 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 16:37:49,780 WARN L170 areAnnotationChecker]: L60 has no Hoare annotation [2022-02-20 16:37:49,780 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 16:37:49,780 WARN L170 areAnnotationChecker]: L60 has no Hoare annotation [2022-02-20 16:37:49,780 WARN L170 areAnnotationChecker]: L60 has no Hoare annotation [2022-02-20 16:37:49,780 WARN L170 areAnnotationChecker]: L61 has no Hoare annotation [2022-02-20 16:37:49,780 WARN L170 areAnnotationChecker]: L61 has no Hoare annotation [2022-02-20 16:37:49,780 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-02-20 16:37:49,783 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7,QUANTIFIED] [2022-02-20 16:37:49,784 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7,QUANTIFIED] [2022-02-20 16:37:49,784 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7,QUANTIFIED] [2022-02-20 16:37:49,786 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7,QUANTIFIED] [2022-02-20 16:37:49,786 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7,QUANTIFIED] [2022-02-20 16:37:49,786 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7,QUANTIFIED] [2022-02-20 16:37:49,786 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_9,QUANTIFIED] [2022-02-20 16:37:49,786 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_9,QUANTIFIED] [2022-02-20 16:37:49,786 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_9,QUANTIFIED] [2022-02-20 16:37:49,786 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_9,QUANTIFIED] [2022-02-20 16:37:49,787 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_9,QUANTIFIED] [2022-02-20 16:37:49,787 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_9,QUANTIFIED] [2022-02-20 16:37:49,787 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_9,QUANTIFIED] [2022-02-20 16:37:49,787 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_9,QUANTIFIED] [2022-02-20 16:37:49,787 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_9,QUANTIFIED] [2022-02-20 16:37:49,787 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_9,QUANTIFIED] [2022-02-20 16:37:49,787 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7,QUANTIFIED] [2022-02-20 16:37:49,787 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_9,QUANTIFIED] [2022-02-20 16:37:49,788 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7,QUANTIFIED] [2022-02-20 16:37:49,792 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7,QUANTIFIED] [2022-02-20 16:37:49,792 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7,QUANTIFIED] [2022-02-20 16:37:49,792 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7,QUANTIFIED] [2022-02-20 16:37:49,792 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7,QUANTIFIED] [2022-02-20 16:37:49,793 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7,QUANTIFIED] [2022-02-20 16:37:49,793 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7,QUANTIFIED] [2022-02-20 16:37:49,793 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_9,QUANTIFIED] [2022-02-20 16:37:49,793 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_9,QUANTIFIED] [2022-02-20 16:37:49,793 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_9,QUANTIFIED] [2022-02-20 16:37:49,793 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_9,QUANTIFIED] [2022-02-20 16:37:49,793 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_9,QUANTIFIED] [2022-02-20 16:37:49,793 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_9,QUANTIFIED] [2022-02-20 16:37:49,793 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_9,QUANTIFIED] [2022-02-20 16:37:49,794 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_9,QUANTIFIED] [2022-02-20 16:37:49,794 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_9,QUANTIFIED] [2022-02-20 16:37:49,794 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_9,QUANTIFIED] [2022-02-20 16:37:49,794 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7,QUANTIFIED] [2022-02-20 16:37:49,794 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_9,QUANTIFIED] [2022-02-20 16:37:49,794 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7,QUANTIFIED] [2022-02-20 16:37:49,800 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_9,QUANTIFIED] [2022-02-20 16:37:49,800 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_9,QUANTIFIED] [2022-02-20 16:37:49,800 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_9,QUANTIFIED] [2022-02-20 16:37:49,800 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7,QUANTIFIED] [2022-02-20 16:37:49,800 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7,QUANTIFIED] [2022-02-20 16:37:49,800 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7,QUANTIFIED] [2022-02-20 16:37:49,801 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7,QUANTIFIED] [2022-02-20 16:37:49,801 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7,QUANTIFIED] [2022-02-20 16:37:49,801 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7,QUANTIFIED] [2022-02-20 16:37:49,801 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_9,QUANTIFIED] [2022-02-20 16:37:49,801 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7,QUANTIFIED] [2022-02-20 16:37:49,801 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_9,QUANTIFIED] [2022-02-20 16:37:49,801 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7,QUANTIFIED] [2022-02-20 16:37:49,802 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_9,QUANTIFIED] [2022-02-20 16:37:49,802 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_9,QUANTIFIED] [2022-02-20 16:37:49,802 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_9,QUANTIFIED] [2022-02-20 16:37:49,802 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7,QUANTIFIED] [2022-02-20 16:37:49,803 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7,QUANTIFIED] [2022-02-20 16:37:49,804 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7,QUANTIFIED] [2022-02-20 16:37:49,804 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7,QUANTIFIED] [2022-02-20 16:37:49,804 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7,QUANTIFIED] [2022-02-20 16:37:49,804 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7,QUANTIFIED] [2022-02-20 16:37:49,804 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_9,QUANTIFIED] [2022-02-20 16:37:49,804 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7,QUANTIFIED] [2022-02-20 16:37:49,804 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_9,QUANTIFIED] [2022-02-20 16:37:49,805 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7,QUANTIFIED] [2022-02-20 16:37:49,807 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_9,QUANTIFIED] [2022-02-20 16:37:49,809 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_9,QUANTIFIED] [2022-02-20 16:37:49,809 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_9,QUANTIFIED] [2022-02-20 16:37:49,809 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7,QUANTIFIED] [2022-02-20 16:37:49,809 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7,QUANTIFIED] [2022-02-20 16:37:49,809 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7,QUANTIFIED] [2022-02-20 16:37:49,809 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7,QUANTIFIED] [2022-02-20 16:37:49,810 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7,QUANTIFIED] [2022-02-20 16:37:49,810 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7,QUANTIFIED] [2022-02-20 16:37:49,810 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_9,QUANTIFIED] [2022-02-20 16:37:49,811 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7,QUANTIFIED] [2022-02-20 16:37:49,811 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_9,QUANTIFIED] [2022-02-20 16:37:49,811 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7,QUANTIFIED] [2022-02-20 16:37:49,811 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_9,QUANTIFIED] [2022-02-20 16:37:49,811 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_9,QUANTIFIED] [2022-02-20 16:37:49,812 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_9,QUANTIFIED] [2022-02-20 16:37:49,812 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7,QUANTIFIED] [2022-02-20 16:37:49,812 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7,QUANTIFIED] [2022-02-20 16:37:49,812 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7,QUANTIFIED] [2022-02-20 16:37:49,812 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7,QUANTIFIED] [2022-02-20 16:37:49,813 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7,QUANTIFIED] [2022-02-20 16:37:49,813 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7,QUANTIFIED] [2022-02-20 16:37:49,813 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_9,QUANTIFIED] [2022-02-20 16:37:49,813 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7,QUANTIFIED] [2022-02-20 16:37:49,813 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_9,QUANTIFIED] [2022-02-20 16:37:49,814 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7,QUANTIFIED] [2022-02-20 16:37:49,814 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_10,QUANTIFIED] [2022-02-20 16:37:49,815 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_9,QUANTIFIED] [2022-02-20 16:37:49,815 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_9,QUANTIFIED] [2022-02-20 16:37:49,815 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_9,QUANTIFIED] [2022-02-20 16:37:49,815 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_9,QUANTIFIED] [2022-02-20 16:37:49,815 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_9,QUANTIFIED] [2022-02-20 16:37:49,815 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_9,QUANTIFIED] [2022-02-20 16:37:49,815 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_9,QUANTIFIED] [2022-02-20 16:37:49,816 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_9,QUANTIFIED] [2022-02-20 16:37:49,816 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_9,QUANTIFIED] [2022-02-20 16:37:49,816 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_9,QUANTIFIED] [2022-02-20 16:37:49,816 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_9,QUANTIFIED] [2022-02-20 16:37:49,816 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_9,QUANTIFIED] [2022-02-20 16:37:49,816 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_9,QUANTIFIED] [2022-02-20 16:37:49,816 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_9,QUANTIFIED] [2022-02-20 16:37:49,816 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_9,QUANTIFIED] [2022-02-20 16:37:49,816 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_10,QUANTIFIED] [2022-02-20 16:37:49,816 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_10,QUANTIFIED] [2022-02-20 16:37:49,817 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_10,QUANTIFIED] [2022-02-20 16:37:49,817 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_10,QUANTIFIED] [2022-02-20 16:37:49,817 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_9,QUANTIFIED] [2022-02-20 16:37:49,817 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_9,QUANTIFIED] [2022-02-20 16:37:49,817 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_9,QUANTIFIED] [2022-02-20 16:37:49,817 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_9,QUANTIFIED] [2022-02-20 16:37:49,818 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_9,QUANTIFIED] [2022-02-20 16:37:49,818 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_9,QUANTIFIED] [2022-02-20 16:37:49,818 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_9,QUANTIFIED] [2022-02-20 16:37:49,818 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_9,QUANTIFIED] [2022-02-20 16:37:49,818 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_9,QUANTIFIED] [2022-02-20 16:37:49,818 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_9,QUANTIFIED] [2022-02-20 16:37:49,818 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_9,QUANTIFIED] [2022-02-20 16:37:49,818 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_9,QUANTIFIED] [2022-02-20 16:37:49,818 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_9,QUANTIFIED] [2022-02-20 16:37:49,819 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_9,QUANTIFIED] [2022-02-20 16:37:49,819 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_9,QUANTIFIED] [2022-02-20 16:37:49,819 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_10,QUANTIFIED] [2022-02-20 16:37:49,819 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_10,QUANTIFIED] [2022-02-20 16:37:49,819 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_10,QUANTIFIED] [2022-02-20 16:37:49,820 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.02 04:37:49 BoogieIcfgContainer [2022-02-20 16:37:49,820 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-20 16:37:49,821 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-20 16:37:49,821 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-20 16:37:49,821 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-20 16:37:49,822 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:37:40" (3/4) ... [2022-02-20 16:37:49,824 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-02-20 16:37:49,831 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 20 nodes and edges [2022-02-20 16:37:49,831 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2022-02-20 16:37:49,831 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-02-20 16:37:49,831 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-02-20 16:37:49,849 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (\exists v_skolemized_q#valueAsBitvector_9 : bv64, v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7 : bv32 :: ((~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_9[63:63], v_skolemized_q#valueAsBitvector_9[62:52], v_skolemized_q#valueAsBitvector_9[51:0]) == x && ~bvadd64(~bvneg64(~bvlshr32(~bvor32(~bvneg64(~bvadd64(2146435072bv32, ~bvneg64(~bvor32(~bvand32(2147483647bv32, unknown-#memory_int-unknown[v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7][4bv32]), ~bvlshr32(~bvor32(unknown-#memory_int-unknown[v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7][0bv32], ~bvneg64(unknown-#memory_int-unknown[v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7][0bv32])), 31bv32))))), ~bvadd64(2146435072bv32, ~bvneg64(~bvor32(~bvand32(2147483647bv32, unknown-#memory_int-unknown[v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7][4bv32]), ~bvlshr32(~bvor32(unknown-#memory_int-unknown[v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7][0bv32], ~bvneg64(unknown-#memory_int-unknown[v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7][0bv32])), 31bv32))))), 31bv32)), 1bv32) == \result) && v_skolemized_q#valueAsBitvector_9[63:32] == unknown-#memory_int-unknown[v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7][4bv32]) && v_skolemized_q#valueAsBitvector_9[31:0] == unknown-#memory_int-unknown[v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7][0bv32]) [2022-02-20 16:37:49,849 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((0bv32 == \result && ~fp.eq~DOUBLE(x, x)) || (1bv32 == \result && !~fp.eq~DOUBLE(x, x))) && (\exists v_skolemized_q#valueAsBitvector_9 : bv64, v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7 : bv32 :: ((~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_9[63:63], v_skolemized_q#valueAsBitvector_9[62:52], v_skolemized_q#valueAsBitvector_9[51:0]) == x && ~bvadd64(~bvneg64(~bvlshr32(~bvor32(~bvneg64(~bvadd64(2146435072bv32, ~bvneg64(~bvor32(~bvand32(2147483647bv32, unknown-#memory_int-unknown[v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7][4bv32]), ~bvlshr32(~bvor32(unknown-#memory_int-unknown[v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7][0bv32], ~bvneg64(unknown-#memory_int-unknown[v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7][0bv32])), 31bv32))))), ~bvadd64(2146435072bv32, ~bvneg64(~bvor32(~bvand32(2147483647bv32, unknown-#memory_int-unknown[v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7][4bv32]), ~bvlshr32(~bvor32(unknown-#memory_int-unknown[v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7][0bv32], ~bvneg64(unknown-#memory_int-unknown[v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7][0bv32])), 31bv32))))), 31bv32)), 1bv32) == 0bv32) && v_skolemized_q#valueAsBitvector_9[63:32] == unknown-#memory_int-unknown[v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7][4bv32]) && v_skolemized_q#valueAsBitvector_9[31:0] == unknown-#memory_int-unknown[v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7][0bv32]) [2022-02-20 16:37:49,850 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (\exists v_skolemized_q#valueAsBitvector_9 : bv64, v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7 : bv32 :: (((~bvadd64(~bvneg64(~bvlshr32(~bvor32(~bvneg64(~bvadd64(2146435072bv32, ~bvneg64(~bvor32(~bvand32(2147483647bv32, unknown-#memory_int-unknown[v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7][4bv32]), ~bvlshr32(~bvor32(unknown-#memory_int-unknown[v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7][0bv32], ~bvneg64(unknown-#memory_int-unknown[v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7][0bv32])), 31bv32))))), ~bvadd64(2146435072bv32, ~bvneg64(~bvor32(~bvand32(2147483647bv32, unknown-#memory_int-unknown[v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7][4bv32]), ~bvlshr32(~bvor32(unknown-#memory_int-unknown[v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7][0bv32], ~bvneg64(unknown-#memory_int-unknown[v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7][0bv32])), 31bv32))))), 31bv32)), 1bv32) == 0bv32 && ~fp.eq~DOUBLE(~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_9[63:63], v_skolemized_q#valueAsBitvector_9[62:52], v_skolemized_q#valueAsBitvector_9[51:0]), ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_9[63:63], v_skolemized_q#valueAsBitvector_9[62:52], v_skolemized_q#valueAsBitvector_9[51:0]))) && ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_9[63:63], v_skolemized_q#valueAsBitvector_9[62:52], v_skolemized_q#valueAsBitvector_9[51:0]) == x) && v_skolemized_q#valueAsBitvector_9[63:32] == unknown-#memory_int-unknown[v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7][4bv32]) && v_skolemized_q#valueAsBitvector_9[31:0] == unknown-#memory_int-unknown[v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7][0bv32]) [2022-02-20 16:37:49,850 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (\exists v_skolemized_q#valueAsBitvector_9 : bv64, v_skolemized_q#valueAsBitvector_10 : bv64 :: ((~bvlshr32(~bvadd64(~bvand32(2147483647bv32, v_skolemized_q#valueAsBitvector_10[63:32]), 2148532224bv32), 31bv32) == \result && ~bvadd64(~bvneg64(~bvlshr32(~bvor32(~bvneg64(~bvadd64(2146435072bv32, ~bvneg64(~bvor32(~bvand32(2147483647bv32, v_skolemized_q#valueAsBitvector_9[63:32]), ~bvlshr32(~bvor32(~bvneg64(v_skolemized_q#valueAsBitvector_9[31:0]), v_skolemized_q#valueAsBitvector_9[31:0]), 31bv32))))), ~bvadd64(2146435072bv32, ~bvneg64(~bvor32(~bvand32(2147483647bv32, v_skolemized_q#valueAsBitvector_9[63:32]), ~bvlshr32(~bvor32(~bvneg64(v_skolemized_q#valueAsBitvector_9[31:0]), v_skolemized_q#valueAsBitvector_9[31:0]), 31bv32))))), 31bv32)), 1bv32) == 0bv32) && ~fp.eq~DOUBLE(~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_9[63:63], v_skolemized_q#valueAsBitvector_9[62:52], v_skolemized_q#valueAsBitvector_9[51:0]), ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_9[63:63], v_skolemized_q#valueAsBitvector_9[62:52], v_skolemized_q#valueAsBitvector_9[51:0]))) && ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_9[63:63], v_skolemized_q#valueAsBitvector_9[62:52], v_skolemized_q#valueAsBitvector_9[51:0]) == ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_10[63:63], v_skolemized_q#valueAsBitvector_10[62:52], v_skolemized_q#valueAsBitvector_10[51:0])) [2022-02-20 16:37:49,860 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-02-20 16:37:49,860 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-20 16:37:49,861 INFO L158 Benchmark]: Toolchain (without parser) took 9553.98ms. Allocated memory was 75.5MB in the beginning and 98.6MB in the end (delta: 23.1MB). Free memory was 59.3MB in the beginning and 46.5MB in the end (delta: 12.8MB). Peak memory consumption was 35.2MB. Max. memory is 16.1GB. [2022-02-20 16:37:49,861 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 75.5MB. Free memory is still 56.8MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 16:37:49,861 INFO L158 Benchmark]: CACSL2BoogieTranslator took 203.71ms. Allocated memory is still 75.5MB. Free memory was 59.1MB in the beginning and 47.8MB in the end (delta: 11.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-20 16:37:49,861 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.49ms. Allocated memory is still 75.5MB. Free memory was 47.8MB in the beginning and 46.0MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 16:37:49,862 INFO L158 Benchmark]: Boogie Preprocessor took 26.54ms. Allocated memory is still 75.5MB. Free memory was 46.0MB in the beginning and 44.4MB in the end (delta: 1.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-02-20 16:37:49,862 INFO L158 Benchmark]: RCFGBuilder took 264.93ms. Allocated memory is still 75.5MB. Free memory was 44.4MB in the beginning and 54.5MB in the end (delta: -10.1MB). Peak memory consumption was 14.6MB. Max. memory is 16.1GB. [2022-02-20 16:37:49,862 INFO L158 Benchmark]: TraceAbstraction took 8966.42ms. Allocated memory was 75.5MB in the beginning and 98.6MB in the end (delta: 23.1MB). Free memory was 54.1MB in the beginning and 48.6MB in the end (delta: 5.5MB). Peak memory consumption was 29.0MB. Max. memory is 16.1GB. [2022-02-20 16:37:49,862 INFO L158 Benchmark]: Witness Printer took 39.11ms. Allocated memory is still 98.6MB. Free memory was 48.6MB in the beginning and 46.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 16:37:49,864 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.20ms. Allocated memory is still 75.5MB. Free memory is still 56.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 203.71ms. Allocated memory is still 75.5MB. Free memory was 59.1MB in the beginning and 47.8MB in the end (delta: 11.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 48.49ms. Allocated memory is still 75.5MB. Free memory was 47.8MB in the beginning and 46.0MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 26.54ms. Allocated memory is still 75.5MB. Free memory was 46.0MB in the beginning and 44.4MB in the end (delta: 1.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 264.93ms. Allocated memory is still 75.5MB. Free memory was 44.4MB in the beginning and 54.5MB in the end (delta: -10.1MB). Peak memory consumption was 14.6MB. Max. memory is 16.1GB. * TraceAbstraction took 8966.42ms. Allocated memory was 75.5MB in the beginning and 98.6MB in the end (delta: 23.1MB). Free memory was 54.1MB in the beginning and 48.6MB in the end (delta: 5.5MB). Peak memory consumption was 29.0MB. Max. memory is 16.1GB. * Witness Printer took 39.11ms. Allocated memory is still 98.6MB. Free memory was 48.6MB in the beginning and 46.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_10,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_10,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_10,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_10,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_10,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_10,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_10,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_10,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 61]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 20 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 8.9s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2 mSDsluCounter, 63 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 40 IncrementalHoareTripleChecker+Unchecked, 22 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6 IncrementalHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 41 mSDtfsCounter, 6 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 39 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=20occurred in iteration=0, InterpolantAutomatonStates: 17, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 6 LocationsWithAnnotation, 6 PreInvPairs, 12 NumberOfFragments, 377 HoareAnnotationTreeSize, 6 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 6 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 6.8s InterpolantComputationTime, 41 NumberOfCodeBlocks, 41 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 38 ConstructedInterpolants, 11 QuantifiedInterpolants, 976 SizeOfPredicates, 19 NumberOfNonLiveVariables, 152 ConjunctsInSsa, 33 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 37]: Loop Invariant [2022-02-20 16:37:49,888 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7,QUANTIFIED] [2022-02-20 16:37:49,888 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7,QUANTIFIED] [2022-02-20 16:37:49,889 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7,QUANTIFIED] [2022-02-20 16:37:49,889 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7,QUANTIFIED] [2022-02-20 16:37:49,889 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7,QUANTIFIED] [2022-02-20 16:37:49,889 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7,QUANTIFIED] [2022-02-20 16:37:49,889 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_9,QUANTIFIED] [2022-02-20 16:37:49,889 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_9,QUANTIFIED] [2022-02-20 16:37:49,889 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_9,QUANTIFIED] [2022-02-20 16:37:49,889 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_9,QUANTIFIED] [2022-02-20 16:37:49,889 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_9,QUANTIFIED] [2022-02-20 16:37:49,889 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_9,QUANTIFIED] [2022-02-20 16:37:49,890 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_9,QUANTIFIED] [2022-02-20 16:37:49,890 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_9,QUANTIFIED] [2022-02-20 16:37:49,890 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_9,QUANTIFIED] [2022-02-20 16:37:49,890 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_9,QUANTIFIED] [2022-02-20 16:37:49,890 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7,QUANTIFIED] [2022-02-20 16:37:49,890 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_9,QUANTIFIED] [2022-02-20 16:37:49,890 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7,QUANTIFIED] [2022-02-20 16:37:49,891 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7,QUANTIFIED] [2022-02-20 16:37:49,891 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7,QUANTIFIED] [2022-02-20 16:37:49,891 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7,QUANTIFIED] [2022-02-20 16:37:49,891 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7,QUANTIFIED] [2022-02-20 16:37:49,891 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7,QUANTIFIED] [2022-02-20 16:37:49,891 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7,QUANTIFIED] [2022-02-20 16:37:49,892 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_9,QUANTIFIED] [2022-02-20 16:37:49,892 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_9,QUANTIFIED] [2022-02-20 16:37:49,892 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_9,QUANTIFIED] [2022-02-20 16:37:49,892 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_9,QUANTIFIED] [2022-02-20 16:37:49,892 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_9,QUANTIFIED] [2022-02-20 16:37:49,892 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_9,QUANTIFIED] [2022-02-20 16:37:49,892 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_9,QUANTIFIED] [2022-02-20 16:37:49,892 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_9,QUANTIFIED] [2022-02-20 16:37:49,892 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_9,QUANTIFIED] [2022-02-20 16:37:49,892 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_9,QUANTIFIED] [2022-02-20 16:37:49,893 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7,QUANTIFIED] [2022-02-20 16:37:49,893 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_9,QUANTIFIED] [2022-02-20 16:37:49,893 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7,QUANTIFIED] Derived loop invariant: (\exists v_skolemized_q#valueAsBitvector_9 : bv64, v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7 : bv32 :: (((~bvadd64(~bvneg64(~bvlshr32(~bvor32(~bvneg64(~bvadd64(2146435072bv32, ~bvneg64(~bvor32(~bvand32(2147483647bv32, unknown-#memory_int-unknown[v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7][4bv32]), ~bvlshr32(~bvor32(unknown-#memory_int-unknown[v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7][0bv32], ~bvneg64(unknown-#memory_int-unknown[v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7][0bv32])), 31bv32))))), ~bvadd64(2146435072bv32, ~bvneg64(~bvor32(~bvand32(2147483647bv32, unknown-#memory_int-unknown[v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7][4bv32]), ~bvlshr32(~bvor32(unknown-#memory_int-unknown[v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7][0bv32], ~bvneg64(unknown-#memory_int-unknown[v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7][0bv32])), 31bv32))))), 31bv32)), 1bv32) == 0bv32 && ~fp.eq~DOUBLE(~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_9[63:63], v_skolemized_q#valueAsBitvector_9[62:52], v_skolemized_q#valueAsBitvector_9[51:0]), ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_9[63:63], v_skolemized_q#valueAsBitvector_9[62:52], v_skolemized_q#valueAsBitvector_9[51:0]))) && ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_9[63:63], v_skolemized_q#valueAsBitvector_9[62:52], v_skolemized_q#valueAsBitvector_9[51:0]) == x) && v_skolemized_q#valueAsBitvector_9[63:32] == unknown-#memory_int-unknown[v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7][4bv32]) && v_skolemized_q#valueAsBitvector_9[31:0] == unknown-#memory_int-unknown[v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7][0bv32]) - InvariantResult [Line: 45]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 20]: Loop Invariant Derived loop invariant: x == x - InvariantResult [Line: 18]: Loop Invariant [2022-02-20 16:37:49,894 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_9,QUANTIFIED] [2022-02-20 16:37:49,894 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_9,QUANTIFIED] [2022-02-20 16:37:49,894 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_9,QUANTIFIED] [2022-02-20 16:37:49,894 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7,QUANTIFIED] [2022-02-20 16:37:49,894 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7,QUANTIFIED] [2022-02-20 16:37:49,894 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7,QUANTIFIED] [2022-02-20 16:37:49,894 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7,QUANTIFIED] [2022-02-20 16:37:49,895 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7,QUANTIFIED] [2022-02-20 16:37:49,895 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7,QUANTIFIED] [2022-02-20 16:37:49,895 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_9,QUANTIFIED] [2022-02-20 16:37:49,895 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7,QUANTIFIED] [2022-02-20 16:37:49,895 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_9,QUANTIFIED] [2022-02-20 16:37:49,895 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7,QUANTIFIED] [2022-02-20 16:37:49,896 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_9,QUANTIFIED] [2022-02-20 16:37:49,896 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_9,QUANTIFIED] [2022-02-20 16:37:49,896 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_9,QUANTIFIED] [2022-02-20 16:37:49,896 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7,QUANTIFIED] [2022-02-20 16:37:49,896 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7,QUANTIFIED] [2022-02-20 16:37:49,897 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7,QUANTIFIED] [2022-02-20 16:37:49,897 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7,QUANTIFIED] [2022-02-20 16:37:49,897 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7,QUANTIFIED] [2022-02-20 16:37:49,897 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7,QUANTIFIED] [2022-02-20 16:37:49,897 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_9,QUANTIFIED] [2022-02-20 16:37:49,897 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7,QUANTIFIED] [2022-02-20 16:37:49,897 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_9,QUANTIFIED] [2022-02-20 16:37:49,897 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7,QUANTIFIED] Derived loop invariant: (\exists v_skolemized_q#valueAsBitvector_9 : bv64, v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7 : bv32 :: ((~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_9[63:63], v_skolemized_q#valueAsBitvector_9[62:52], v_skolemized_q#valueAsBitvector_9[51:0]) == x && ~bvadd64(~bvneg64(~bvlshr32(~bvor32(~bvneg64(~bvadd64(2146435072bv32, ~bvneg64(~bvor32(~bvand32(2147483647bv32, unknown-#memory_int-unknown[v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7][4bv32]), ~bvlshr32(~bvor32(unknown-#memory_int-unknown[v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7][0bv32], ~bvneg64(unknown-#memory_int-unknown[v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7][0bv32])), 31bv32))))), ~bvadd64(2146435072bv32, ~bvneg64(~bvor32(~bvand32(2147483647bv32, unknown-#memory_int-unknown[v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7][4bv32]), ~bvlshr32(~bvor32(unknown-#memory_int-unknown[v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7][0bv32], ~bvneg64(unknown-#memory_int-unknown[v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7][0bv32])), 31bv32))))), 31bv32)), 1bv32) == \result) && v_skolemized_q#valueAsBitvector_9[63:32] == unknown-#memory_int-unknown[v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7][4bv32]) && v_skolemized_q#valueAsBitvector_9[31:0] == unknown-#memory_int-unknown[v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7][0bv32]) - InvariantResult [Line: 33]: Loop Invariant [2022-02-20 16:37:49,898 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_9,QUANTIFIED] [2022-02-20 16:37:49,898 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_9,QUANTIFIED] [2022-02-20 16:37:49,898 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_9,QUANTIFIED] [2022-02-20 16:37:49,898 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7,QUANTIFIED] [2022-02-20 16:37:49,898 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7,QUANTIFIED] [2022-02-20 16:37:49,899 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7,QUANTIFIED] [2022-02-20 16:37:49,899 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7,QUANTIFIED] [2022-02-20 16:37:49,899 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7,QUANTIFIED] [2022-02-20 16:37:49,900 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7,QUANTIFIED] [2022-02-20 16:37:49,900 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_9,QUANTIFIED] [2022-02-20 16:37:49,900 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7,QUANTIFIED] [2022-02-20 16:37:49,900 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_9,QUANTIFIED] [2022-02-20 16:37:49,900 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7,QUANTIFIED] [2022-02-20 16:37:49,901 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_9,QUANTIFIED] [2022-02-20 16:37:49,901 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_9,QUANTIFIED] [2022-02-20 16:37:49,901 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_9,QUANTIFIED] [2022-02-20 16:37:49,901 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7,QUANTIFIED] [2022-02-20 16:37:49,901 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7,QUANTIFIED] [2022-02-20 16:37:49,901 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7,QUANTIFIED] [2022-02-20 16:37:49,901 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7,QUANTIFIED] [2022-02-20 16:37:49,901 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7,QUANTIFIED] [2022-02-20 16:37:49,901 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7,QUANTIFIED] [2022-02-20 16:37:49,902 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_9,QUANTIFIED] [2022-02-20 16:37:49,902 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7,QUANTIFIED] [2022-02-20 16:37:49,902 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_9,QUANTIFIED] [2022-02-20 16:37:49,902 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7,QUANTIFIED] Derived loop invariant: ((0bv32 == \result && ~fp.eq~DOUBLE(x, x)) || (1bv32 == \result && !~fp.eq~DOUBLE(x, x))) && (\exists v_skolemized_q#valueAsBitvector_9 : bv64, v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7 : bv32 :: ((~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_9[63:63], v_skolemized_q#valueAsBitvector_9[62:52], v_skolemized_q#valueAsBitvector_9[51:0]) == x && ~bvadd64(~bvneg64(~bvlshr32(~bvor32(~bvneg64(~bvadd64(2146435072bv32, ~bvneg64(~bvor32(~bvand32(2147483647bv32, unknown-#memory_int-unknown[v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7][4bv32]), ~bvlshr32(~bvor32(unknown-#memory_int-unknown[v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7][0bv32], ~bvneg64(unknown-#memory_int-unknown[v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7][0bv32])), 31bv32))))), ~bvadd64(2146435072bv32, ~bvneg64(~bvor32(~bvand32(2147483647bv32, unknown-#memory_int-unknown[v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7][4bv32]), ~bvlshr32(~bvor32(unknown-#memory_int-unknown[v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7][0bv32], ~bvneg64(unknown-#memory_int-unknown[v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7][0bv32])), 31bv32))))), 31bv32)), 1bv32) == 0bv32) && v_skolemized_q#valueAsBitvector_9[63:32] == unknown-#memory_int-unknown[v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7][4bv32]) && v_skolemized_q#valueAsBitvector_9[31:0] == unknown-#memory_int-unknown[v_ULTIMATE.start_isinf_double_~#ew_u~0#1.base_7][0bv32]) - InvariantResult [Line: 35]: Loop Invariant [2022-02-20 16:37:49,903 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_10,QUANTIFIED] [2022-02-20 16:37:49,903 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_9,QUANTIFIED] [2022-02-20 16:37:49,903 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_9,QUANTIFIED] [2022-02-20 16:37:49,903 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_9,QUANTIFIED] [2022-02-20 16:37:49,903 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_9,QUANTIFIED] [2022-02-20 16:37:49,903 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_9,QUANTIFIED] [2022-02-20 16:37:49,903 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_9,QUANTIFIED] [2022-02-20 16:37:49,903 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_9,QUANTIFIED] [2022-02-20 16:37:49,904 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_9,QUANTIFIED] [2022-02-20 16:37:49,904 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_9,QUANTIFIED] [2022-02-20 16:37:49,904 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_9,QUANTIFIED] [2022-02-20 16:37:49,904 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_9,QUANTIFIED] [2022-02-20 16:37:49,904 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_9,QUANTIFIED] [2022-02-20 16:37:49,904 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_9,QUANTIFIED] [2022-02-20 16:37:49,904 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_9,QUANTIFIED] [2022-02-20 16:37:49,904 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_9,QUANTIFIED] [2022-02-20 16:37:49,904 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_10,QUANTIFIED] [2022-02-20 16:37:49,904 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_10,QUANTIFIED] [2022-02-20 16:37:49,904 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_10,QUANTIFIED] [2022-02-20 16:37:49,905 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_10,QUANTIFIED] [2022-02-20 16:37:49,905 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_9,QUANTIFIED] [2022-02-20 16:37:49,905 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_9,QUANTIFIED] [2022-02-20 16:37:49,905 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_9,QUANTIFIED] [2022-02-20 16:37:49,905 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_9,QUANTIFIED] [2022-02-20 16:37:49,905 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_9,QUANTIFIED] [2022-02-20 16:37:49,905 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_9,QUANTIFIED] [2022-02-20 16:37:49,906 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_9,QUANTIFIED] [2022-02-20 16:37:49,906 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_9,QUANTIFIED] [2022-02-20 16:37:49,906 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_9,QUANTIFIED] [2022-02-20 16:37:49,906 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_9,QUANTIFIED] [2022-02-20 16:37:49,907 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_9,QUANTIFIED] [2022-02-20 16:37:49,907 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_9,QUANTIFIED] [2022-02-20 16:37:49,907 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_9,QUANTIFIED] [2022-02-20 16:37:49,907 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_9,QUANTIFIED] [2022-02-20 16:37:49,907 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_9,QUANTIFIED] [2022-02-20 16:37:49,907 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_10,QUANTIFIED] [2022-02-20 16:37:49,907 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_10,QUANTIFIED] [2022-02-20 16:37:49,908 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_10,QUANTIFIED] Derived loop invariant: (\exists v_skolemized_q#valueAsBitvector_9 : bv64, v_skolemized_q#valueAsBitvector_10 : bv64 :: ((~bvlshr32(~bvadd64(~bvand32(2147483647bv32, v_skolemized_q#valueAsBitvector_10[63:32]), 2148532224bv32), 31bv32) == \result && ~bvadd64(~bvneg64(~bvlshr32(~bvor32(~bvneg64(~bvadd64(2146435072bv32, ~bvneg64(~bvor32(~bvand32(2147483647bv32, v_skolemized_q#valueAsBitvector_9[63:32]), ~bvlshr32(~bvor32(~bvneg64(v_skolemized_q#valueAsBitvector_9[31:0]), v_skolemized_q#valueAsBitvector_9[31:0]), 31bv32))))), ~bvadd64(2146435072bv32, ~bvneg64(~bvor32(~bvand32(2147483647bv32, v_skolemized_q#valueAsBitvector_9[63:32]), ~bvlshr32(~bvor32(~bvneg64(v_skolemized_q#valueAsBitvector_9[31:0]), v_skolemized_q#valueAsBitvector_9[31:0]), 31bv32))))), 31bv32)), 1bv32) == 0bv32) && ~fp.eq~DOUBLE(~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_9[63:63], v_skolemized_q#valueAsBitvector_9[62:52], v_skolemized_q#valueAsBitvector_9[51:0]), ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_9[63:63], v_skolemized_q#valueAsBitvector_9[62:52], v_skolemized_q#valueAsBitvector_9[51:0]))) && ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_9[63:63], v_skolemized_q#valueAsBitvector_9[62:52], v_skolemized_q#valueAsBitvector_9[51:0]) == ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_10[63:63], v_skolemized_q#valueAsBitvector_10[62:52], v_skolemized_q#valueAsBitvector_10[51:0])) RESULT: Ultimate proved your program to be correct! [2022-02-20 16:37:49,968 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 Writing output log to file Ultimate.log Result: TRUE