./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/float-newlib/double_req_bl_0931.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_0931.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 c87390cdeb02bfcfd0888edfd053aa6fdb8101a94f62a8bab80f07fbfb57784e --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 16:35:17,181 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 16:35:17,183 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 16:35:17,209 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 16:35:17,209 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 16:35:17,210 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 16:35:17,212 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 16:35:17,215 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 16:35:17,217 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 16:35:17,218 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 16:35:17,219 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 16:35:17,219 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 16:35:17,221 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 16:35:17,223 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 16:35:17,224 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 16:35:17,225 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 16:35:17,226 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 16:35:17,231 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 16:35:17,232 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 16:35:17,235 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 16:35:17,236 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 16:35:17,239 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 16:35:17,240 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 16:35:17,241 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 16:35:17,242 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 16:35:17,243 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 16:35:17,243 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 16:35:17,245 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 16:35:17,245 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 16:35:17,246 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 16:35:17,247 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 16:35:17,247 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 16:35:17,248 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 16:35:17,249 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 16:35:17,249 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 16:35:17,250 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 16:35:17,251 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 16:35:17,251 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 16:35:17,251 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 16:35:17,252 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 16:35:17,252 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 16:35:17,253 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:35:17,280 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 16:35:17,282 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 16:35:17,283 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 16:35:17,283 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 16:35:17,284 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 16:35:17,284 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 16:35:17,284 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 16:35:17,284 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 16:35:17,285 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 16:35:17,285 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 16:35:17,286 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 16:35:17,286 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 16:35:17,286 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 16:35:17,286 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 16:35:17,287 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 16:35:17,287 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 16:35:17,287 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 16:35:17,287 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 16:35:17,287 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 16:35:17,287 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 16:35:17,287 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 16:35:17,288 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 16:35:17,288 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 16:35:17,288 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 16:35:17,288 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:35:17,288 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 16:35:17,288 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 16:35:17,288 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 16:35:17,289 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 16:35:17,289 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 16:35:17,289 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 16:35:17,289 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 16:35:17,289 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 16:35:17,290 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 -> c87390cdeb02bfcfd0888edfd053aa6fdb8101a94f62a8bab80f07fbfb57784e [2022-02-20 16:35:17,480 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 16:35:17,510 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 16:35:17,513 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 16:35:17,514 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 16:35:17,515 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 16:35:17,516 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/double_req_bl_0931.c [2022-02-20 16:35:17,566 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d3222225/61e5342417194747b6f72cca8c01da05/FLAG0b057e697 [2022-02-20 16:35:17,969 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 16:35:17,969 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_0931.c [2022-02-20 16:35:17,976 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d3222225/61e5342417194747b6f72cca8c01da05/FLAG0b057e697 [2022-02-20 16:35:17,987 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d3222225/61e5342417194747b6f72cca8c01da05 [2022-02-20 16:35:17,989 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 16:35:17,991 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 16:35:17,993 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 16:35:17,993 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 16:35:17,996 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 16:35:17,997 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:35:17" (1/1) ... [2022-02-20 16:35:17,998 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@66d4992c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:35:17, skipping insertion in model container [2022-02-20 16:35:17,998 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:35:17" (1/1) ... [2022-02-20 16:35:18,003 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 16:35:18,018 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 16:35:18,210 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_0931.c[3610,3623] [2022-02-20 16:35:18,221 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:35:18,227 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 16:35:18,255 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_0931.c[3610,3623] [2022-02-20 16:35:18,264 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:35:18,274 INFO L208 MainTranslator]: Completed translation [2022-02-20 16:35:18,276 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:35:18 WrapperNode [2022-02-20 16:35:18,276 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 16:35:18,277 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 16:35:18,278 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 16:35:18,278 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 16:35:18,283 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:35:18" (1/1) ... [2022-02-20 16:35:18,300 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:35:18" (1/1) ... [2022-02-20 16:35:18,337 INFO L137 Inliner]: procedures = 17, calls = 28, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 176 [2022-02-20 16:35:18,338 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 16:35:18,338 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 16:35:18,338 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 16:35:18,339 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 16:35:18,344 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:35:18" (1/1) ... [2022-02-20 16:35:18,345 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:35:18" (1/1) ... [2022-02-20 16:35:18,347 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:35:18" (1/1) ... [2022-02-20 16:35:18,347 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:35:18" (1/1) ... [2022-02-20 16:35:18,358 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:35:18" (1/1) ... [2022-02-20 16:35:18,361 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:35:18" (1/1) ... [2022-02-20 16:35:18,363 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:35:18" (1/1) ... [2022-02-20 16:35:18,366 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 16:35:18,366 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 16:35:18,366 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 16:35:18,367 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 16:35:18,367 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:35:18" (1/1) ... [2022-02-20 16:35:18,382 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:35:18,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:35:18,403 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:35:18,420 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:35:18,431 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 16:35:18,431 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 16:35:18,431 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 16:35:18,431 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2022-02-20 16:35:18,431 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 16:35:18,431 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2022-02-20 16:35:18,432 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 16:35:18,432 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 16:35:18,432 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-20 16:35:18,432 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 16:35:18,526 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 16:35:18,536 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 16:35:18,977 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 16:35:18,981 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 16:35:18,982 INFO L299 CfgBuilder]: Removed 8 assume(true) statements. [2022-02-20 16:35:18,983 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:35:18 BoogieIcfgContainer [2022-02-20 16:35:18,983 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 16:35:18,984 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 16:35:18,985 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 16:35:18,987 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 16:35:18,988 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 04:35:17" (1/3) ... [2022-02-20 16:35:18,988 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@789afb6f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:35:18, skipping insertion in model container [2022-02-20 16:35:18,989 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:35:18" (2/3) ... [2022-02-20 16:35:18,989 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@789afb6f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:35:18, skipping insertion in model container [2022-02-20 16:35:18,989 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:35:18" (3/3) ... [2022-02-20 16:35:18,993 INFO L111 eAbstractionObserver]: Analyzing ICFG double_req_bl_0931.c [2022-02-20 16:35:19,000 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 16:35:19,000 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 16:35:19,037 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 16:35:19,043 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:35:19,043 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 16:35:19,055 INFO L276 IsEmpty]: Start isEmpty. Operand has 36 states, 34 states have (on average 1.7352941176470589) internal successors, (59), 35 states have internal predecessors, (59), 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:35:19,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-02-20 16:35:19,058 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:35:19,059 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:35:19,060 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:35:19,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:35:19,064 INFO L85 PathProgramCache]: Analyzing trace with hash -1519062570, now seen corresponding path program 1 times [2022-02-20 16:35:19,070 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:35:19,071 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774014827] [2022-02-20 16:35:19,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:35:19,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:35:19,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:35:19,309 INFO L290 TraceCheckUtils]: 0: Hoare triple {39#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);~ln2_hi_log~0 := 0.6931471803691238;~ln2_lo_log~0 := 1.9082149292705877E-10;~two54_log~0 := 1.8014398509481984E16;~Lg1_log~0 := 0.6666666666666735;~Lg2_log~0 := 0.3999999999940942;~Lg3_log~0 := 0.2857142874366239;~Lg4_log~0 := 0.22222198432149784;~Lg5_log~0 := 0.1818357216161805;~Lg6_log~0 := 0.15313837699209373;~Lg7_log~0 := 0.14798198605116586;~zero~0 := 0.0; {39#true} is VALID [2022-02-20 16:35:19,311 INFO L290 TraceCheckUtils]: 1: Hoare triple {39#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret11#1, main_#t~ret12#1, main_~x~0#1, main_~res~0#1;main_~x~0#1 := ~someBinaryArithmeticDOUBLEoperation(1.0, 0.0);assume { :begin_inline___ieee754_log } true;__ieee754_log_#in~x#1 := main_~x~0#1;havoc __ieee754_log_#res#1;havoc __ieee754_log_#t~mem6#1, __ieee754_log_#t~mem7#1, __ieee754_log_~#ew_u~1#1.base, __ieee754_log_~#ew_u~1#1.offset, __ieee754_log_#t~mem8#1, __ieee754_log_~#gh_u~0#1.base, __ieee754_log_~#gh_u~0#1.offset, __ieee754_log_#t~mem10#1, __ieee754_log_~#sh_u~0#1.base, __ieee754_log_~#sh_u~0#1.offset, __ieee754_log_~x#1, __ieee754_log_~hfsq~0#1, __ieee754_log_~f~0#1, __ieee754_log_~s~0#1, __ieee754_log_~z~0#1, __ieee754_log_~R~0#1, __ieee754_log_~w~0#1, __ieee754_log_~t1~0#1, __ieee754_log_~t2~0#1, __ieee754_log_~dk~0#1, __ieee754_log_~k~0#1, __ieee754_log_~hx~1#1, __ieee754_log_~i~0#1, __ieee754_log_~j~0#1, __ieee754_log_~lx~1#1, __ieee754_log_#t~nondet9#1;__ieee754_log_~x#1 := __ieee754_log_#in~x#1;havoc __ieee754_log_~hfsq~0#1;havoc __ieee754_log_~f~0#1;havoc __ieee754_log_~s~0#1;havoc __ieee754_log_~z~0#1;havoc __ieee754_log_~R~0#1;havoc __ieee754_log_~w~0#1;havoc __ieee754_log_~t1~0#1;havoc __ieee754_log_~t2~0#1;havoc __ieee754_log_~dk~0#1;havoc __ieee754_log_~k~0#1;havoc __ieee754_log_~hx~1#1;havoc __ieee754_log_~i~0#1;havoc __ieee754_log_~j~0#1;havoc __ieee754_log_~lx~1#1; {39#true} is VALID [2022-02-20 16:35:19,312 INFO L290 TraceCheckUtils]: 2: Hoare triple {39#true} assume !true; {40#false} is VALID [2022-02-20 16:35:19,312 INFO L290 TraceCheckUtils]: 3: Hoare triple {40#false} __ieee754_log_~k~0#1 := 0; {40#false} is VALID [2022-02-20 16:35:19,313 INFO L290 TraceCheckUtils]: 4: Hoare triple {40#false} assume __ieee754_log_~hx~1#1 < 1048576; {40#false} is VALID [2022-02-20 16:35:19,313 INFO L290 TraceCheckUtils]: 5: Hoare triple {40#false} assume 0 == (if (1 == (if 0 == __ieee754_log_~hx~1#1 then 0 else (if 1 == __ieee754_log_~hx~1#1 then 1 else ~bitwiseAnd(__ieee754_log_~hx~1#1, 2147483647))) || 0 == (if 0 == __ieee754_log_~hx~1#1 then 0 else (if 1 == __ieee754_log_~hx~1#1 then 1 else ~bitwiseAnd(__ieee754_log_~hx~1#1, 2147483647)))) && 0 == __ieee754_log_~lx~1#1 then (if 0 == __ieee754_log_~hx~1#1 then 0 else (if 1 == __ieee754_log_~hx~1#1 then 1 else ~bitwiseAnd(__ieee754_log_~hx~1#1, 2147483647))) else (if 0 == (if 0 == __ieee754_log_~hx~1#1 then 0 else (if 1 == __ieee754_log_~hx~1#1 then 1 else ~bitwiseAnd(__ieee754_log_~hx~1#1, 2147483647))) && (1 == __ieee754_log_~lx~1#1 || 0 == __ieee754_log_~lx~1#1) then __ieee754_log_~lx~1#1 else (if (1 == (if 0 == __ieee754_log_~hx~1#1 then 0 else (if 1 == __ieee754_log_~hx~1#1 then 1 else ~bitwiseAnd(__ieee754_log_~hx~1#1, 2147483647))) && (1 == __ieee754_log_~lx~1#1 || 0 == __ieee754_log_~lx~1#1)) || ((1 == (if 0 == __ieee754_log_~hx~1#1 then 0 else (if 1 == __ieee754_log_~hx~1#1 then 1 else ~bitwiseAnd(__ieee754_log_~hx~1#1, 2147483647))) || 0 == (if 0 == __ieee754_log_~hx~1#1 then 0 else (if 1 == __ieee754_log_~hx~1#1 then 1 else ~bitwiseAnd(__ieee754_log_~hx~1#1, 2147483647)))) && 1 == __ieee754_log_~lx~1#1) then 1 else ~bitwiseOr((if 0 == __ieee754_log_~hx~1#1 then 0 else (if 1 == __ieee754_log_~hx~1#1 then 1 else ~bitwiseAnd(__ieee754_log_~hx~1#1, 2147483647))), __ieee754_log_~lx~1#1)))) % 4294967296;__ieee754_log_#res#1 := ~someBinaryArithmeticDOUBLEoperation(~someUnaryDOUBLEoperation(~two54_log~0), ~zero~0); {40#false} is VALID [2022-02-20 16:35:19,313 INFO L290 TraceCheckUtils]: 6: Hoare triple {40#false} main_#t~ret11#1 := __ieee754_log_#res#1;assume { :end_inline___ieee754_log } true;main_~res~0#1 := main_#t~ret11#1;havoc main_#t~ret11#1;assume { :begin_inline_isinf_double } true;isinf_double_#in~x#1 := main_~res~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; {40#false} is VALID [2022-02-20 16:35:19,314 INFO L290 TraceCheckUtils]: 7: Hoare triple {40#false} assume !true; {40#false} is VALID [2022-02-20 16:35:19,320 INFO L290 TraceCheckUtils]: 8: Hoare triple {40#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); {40#false} is VALID [2022-02-20 16:35:19,322 INFO L290 TraceCheckUtils]: 9: Hoare triple {40#false} main_#t~ret12#1 := isinf_double_#res#1;assume { :end_inline_isinf_double } true;assume -2147483648 <= main_#t~ret12#1 && main_#t~ret12#1 <= 2147483647; {40#false} is VALID [2022-02-20 16:35:19,323 INFO L290 TraceCheckUtils]: 10: Hoare triple {40#false} assume 0 == main_#t~ret12#1;havoc main_#t~ret12#1; {40#false} is VALID [2022-02-20 16:35:19,323 INFO L290 TraceCheckUtils]: 11: Hoare triple {40#false} assume !false; {40#false} is VALID [2022-02-20 16:35:19,324 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:35:19,325 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:35:19,326 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774014827] [2022-02-20 16:35:19,327 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1774014827] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:35:19,327 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:35:19,327 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 16:35:19,330 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389849097] [2022-02-20 16:35:19,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:35:19,336 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:35:19,337 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:35:19,340 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:35:19,354 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:35:19,354 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 16:35:19,354 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:35:19,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 16:35:19,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 16:35:19,378 INFO L87 Difference]: Start difference. First operand has 36 states, 34 states have (on average 1.7352941176470589) internal successors, (59), 35 states have internal predecessors, (59), 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:35:19,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:35:19,421 INFO L93 Difference]: Finished difference Result 70 states and 116 transitions. [2022-02-20 16:35:19,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 16:35:19,422 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:35:19,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:35:19,423 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:35:19,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 116 transitions. [2022-02-20 16:35:19,427 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:35:19,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 116 transitions. [2022-02-20 16:35:19,428 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 116 transitions. [2022-02-20 16:35:19,523 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 116 edges. 116 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:35:19,542 INFO L225 Difference]: With dead ends: 70 [2022-02-20 16:35:19,542 INFO L226 Difference]: Without dead ends: 33 [2022-02-20 16:35:19,545 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:35:19,550 INFO L933 BasicCegarLoop]: 48 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, 48 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:35:19,553 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:35:19,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-02-20 16:35:19,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2022-02-20 16:35:19,575 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:35:19,575 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand has 33 states, 32 states have (on average 1.40625) internal successors, (45), 32 states have internal predecessors, (45), 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:35:19,577 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand has 33 states, 32 states have (on average 1.40625) internal successors, (45), 32 states have internal predecessors, (45), 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:35:19,578 INFO L87 Difference]: Start difference. First operand 33 states. Second operand has 33 states, 32 states have (on average 1.40625) internal successors, (45), 32 states have internal predecessors, (45), 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:35:19,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:35:19,580 INFO L93 Difference]: Finished difference Result 33 states and 45 transitions. [2022-02-20 16:35:19,580 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 45 transitions. [2022-02-20 16:35:19,580 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:35:19,580 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:35:19,581 INFO L74 IsIncluded]: Start isIncluded. First operand has 33 states, 32 states have (on average 1.40625) internal successors, (45), 32 states have internal predecessors, (45), 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 33 states. [2022-02-20 16:35:19,581 INFO L87 Difference]: Start difference. First operand has 33 states, 32 states have (on average 1.40625) internal successors, (45), 32 states have internal predecessors, (45), 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 33 states. [2022-02-20 16:35:19,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:35:19,583 INFO L93 Difference]: Finished difference Result 33 states and 45 transitions. [2022-02-20 16:35:19,583 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 45 transitions. [2022-02-20 16:35:19,583 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:35:19,583 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:35:19,583 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:35:19,584 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:35:19,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 1.40625) internal successors, (45), 32 states have internal predecessors, (45), 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:35:19,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 45 transitions. [2022-02-20 16:35:19,586 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 45 transitions. Word has length 12 [2022-02-20 16:35:19,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:35:19,586 INFO L470 AbstractCegarLoop]: Abstraction has 33 states and 45 transitions. [2022-02-20 16:35:19,587 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:35:19,587 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 45 transitions. [2022-02-20 16:35:19,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-02-20 16:35:19,587 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:35:19,588 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:35:19,588 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 16:35:19,588 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:35:19,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:35:19,589 INFO L85 PathProgramCache]: Analyzing trace with hash -1307828654, now seen corresponding path program 1 times [2022-02-20 16:35:19,589 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:35:19,589 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15369213] [2022-02-20 16:35:19,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:35:19,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:35:19,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 16:35:19,834 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-20 16:35:19,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 16:35:19,965 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-20 16:35:19,966 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-20 16:35:19,967 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-20 16:35:19,973 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 16:35:19,976 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1] [2022-02-20 16:35:19,979 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 16:35:20,018 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-02-20 16:35:20,018 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-02-20 16:35:20,018 WARN L170 areAnnotationChecker]: L52-2 has no Hoare annotation [2022-02-20 16:35:20,018 WARN L170 areAnnotationChecker]: L52-2 has no Hoare annotation [2022-02-20 16:35:20,018 WARN L170 areAnnotationChecker]: L52-1 has no Hoare annotation [2022-02-20 16:35:20,019 WARN L170 areAnnotationChecker]: L52-1 has no Hoare annotation [2022-02-20 16:35:20,019 WARN L170 areAnnotationChecker]: L52-3 has no Hoare annotation [2022-02-20 16:35:20,019 WARN L170 areAnnotationChecker]: L60 has no Hoare annotation [2022-02-20 16:35:20,019 WARN L170 areAnnotationChecker]: L60 has no Hoare annotation [2022-02-20 16:35:20,019 WARN L170 areAnnotationChecker]: L61 has no Hoare annotation [2022-02-20 16:35:20,019 WARN L170 areAnnotationChecker]: L61 has no Hoare annotation [2022-02-20 16:35:20,019 WARN L170 areAnnotationChecker]: L60-1 has no Hoare annotation [2022-02-20 16:35:20,019 WARN L170 areAnnotationChecker]: L60-1 has no Hoare annotation [2022-02-20 16:35:20,020 WARN L170 areAnnotationChecker]: L124 has no Hoare annotation [2022-02-20 16:35:20,020 WARN L170 areAnnotationChecker]: L63 has no Hoare annotation [2022-02-20 16:35:20,020 WARN L170 areAnnotationChecker]: L63 has no Hoare annotation [2022-02-20 16:35:20,020 WARN L170 areAnnotationChecker]: L77 has no Hoare annotation [2022-02-20 16:35:20,020 WARN L170 areAnnotationChecker]: L77 has no Hoare annotation [2022-02-20 16:35:20,021 WARN L170 areAnnotationChecker]: L22-2 has no Hoare annotation [2022-02-20 16:35:20,021 WARN L170 areAnnotationChecker]: L22-2 has no Hoare annotation [2022-02-20 16:35:20,021 WARN L170 areAnnotationChecker]: L67-2 has no Hoare annotation [2022-02-20 16:35:20,021 WARN L170 areAnnotationChecker]: L67-2 has no Hoare annotation [2022-02-20 16:35:20,021 WARN L170 areAnnotationChecker]: L78-1 has no Hoare annotation [2022-02-20 16:35:20,021 WARN L170 areAnnotationChecker]: L78-1 has no Hoare annotation [2022-02-20 16:35:20,021 WARN L170 areAnnotationChecker]: L77-2 has no Hoare annotation [2022-02-20 16:35:20,021 WARN L170 areAnnotationChecker]: L77-2 has no Hoare annotation [2022-02-20 16:35:20,022 WARN L170 areAnnotationChecker]: L22-1 has no Hoare annotation [2022-02-20 16:35:20,022 WARN L170 areAnnotationChecker]: L22-1 has no Hoare annotation [2022-02-20 16:35:20,022 WARN L170 areAnnotationChecker]: L22-3 has no Hoare annotation [2022-02-20 16:35:20,022 WARN L170 areAnnotationChecker]: L67-1 has no Hoare annotation [2022-02-20 16:35:20,022 WARN L170 areAnnotationChecker]: L67-1 has no Hoare annotation [2022-02-20 16:35:20,022 WARN L170 areAnnotationChecker]: L78 has no Hoare annotation [2022-02-20 16:35:20,022 WARN L170 areAnnotationChecker]: L78 has no Hoare annotation [2022-02-20 16:35:20,022 WARN L170 areAnnotationChecker]: L78-2 has no Hoare annotation [2022-02-20 16:35:20,022 WARN L170 areAnnotationChecker]: L77-4 has no Hoare annotation [2022-02-20 16:35:20,023 WARN L170 areAnnotationChecker]: L77-4 has no Hoare annotation [2022-02-20 16:35:20,023 WARN L170 areAnnotationChecker]: L31 has no Hoare annotation [2022-02-20 16:35:20,023 WARN L170 areAnnotationChecker]: L86 has no Hoare annotation [2022-02-20 16:35:20,023 WARN L170 areAnnotationChecker]: L86 has no Hoare annotation [2022-02-20 16:35:20,023 WARN L170 areAnnotationChecker]: L77-6 has no Hoare annotation [2022-02-20 16:35:20,024 WARN L170 areAnnotationChecker]: L77-6 has no Hoare annotation [2022-02-20 16:35:20,024 WARN L170 areAnnotationChecker]: L138 has no Hoare annotation [2022-02-20 16:35:20,024 WARN L170 areAnnotationChecker]: L138 has no Hoare annotation [2022-02-20 16:35:20,024 WARN L170 areAnnotationChecker]: L87 has no Hoare annotation [2022-02-20 16:35:20,024 WARN L170 areAnnotationChecker]: L87 has no Hoare annotation [2022-02-20 16:35:20,024 WARN L170 areAnnotationChecker]: L113 has no Hoare annotation [2022-02-20 16:35:20,024 WARN L170 areAnnotationChecker]: L113 has no Hoare annotation [2022-02-20 16:35:20,024 WARN L170 areAnnotationChecker]: L139 has no Hoare annotation [2022-02-20 16:35:20,025 WARN L170 areAnnotationChecker]: L139 has no Hoare annotation [2022-02-20 16:35:20,025 WARN L170 areAnnotationChecker]: L143 has no Hoare annotation [2022-02-20 16:35:20,025 WARN L170 areAnnotationChecker]: L88 has no Hoare annotation [2022-02-20 16:35:20,025 WARN L170 areAnnotationChecker]: L88 has no Hoare annotation [2022-02-20 16:35:20,025 WARN L170 areAnnotationChecker]: L96 has no Hoare annotation [2022-02-20 16:35:20,026 WARN L170 areAnnotationChecker]: L96 has no Hoare annotation [2022-02-20 16:35:20,026 WARN L170 areAnnotationChecker]: L115 has no Hoare annotation [2022-02-20 16:35:20,026 WARN L170 areAnnotationChecker]: L115 has no Hoare annotation [2022-02-20 16:35:20,026 WARN L170 areAnnotationChecker]: L121 has no Hoare annotation [2022-02-20 16:35:20,026 WARN L170 areAnnotationChecker]: L121 has no Hoare annotation [2022-02-20 16:35:20,026 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 16:35:20,026 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:35:20,027 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.02 04:35:20 BoogieIcfgContainer [2022-02-20 16:35:20,027 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-20 16:35:20,028 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-20 16:35:20,029 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-20 16:35:20,029 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-20 16:35:20,029 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:35:18" (3/4) ... [2022-02-20 16:35:20,031 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-02-20 16:35:20,032 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-20 16:35:20,033 INFO L158 Benchmark]: Toolchain (without parser) took 2041.46ms. Allocated memory was 123.7MB in the beginning and 161.5MB in the end (delta: 37.7MB). Free memory was 87.2MB in the beginning and 111.5MB in the end (delta: -24.3MB). Peak memory consumption was 13.1MB. Max. memory is 16.1GB. [2022-02-20 16:35:20,033 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 123.7MB. Free memory was 96.8MB in the beginning and 96.8MB in the end (delta: 24.6kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 16:35:20,036 INFO L158 Benchmark]: CACSL2BoogieTranslator took 283.58ms. Allocated memory is still 123.7MB. Free memory was 87.0MB in the beginning and 94.8MB in the end (delta: -7.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-20 16:35:20,037 INFO L158 Benchmark]: Boogie Procedure Inliner took 60.62ms. Allocated memory is still 123.7MB. Free memory was 94.8MB in the beginning and 89.1MB in the end (delta: 5.7MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-02-20 16:35:20,038 INFO L158 Benchmark]: Boogie Preprocessor took 27.54ms. Allocated memory is still 123.7MB. Free memory was 89.1MB in the beginning and 86.4MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 16:35:20,040 INFO L158 Benchmark]: RCFGBuilder took 617.00ms. Allocated memory is still 123.7MB. Free memory was 86.4MB in the beginning and 50.1MB in the end (delta: 36.3MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. [2022-02-20 16:35:20,040 INFO L158 Benchmark]: TraceAbstraction took 1043.08ms. Allocated memory was 123.7MB in the beginning and 161.5MB in the end (delta: 37.7MB). Free memory was 50.1MB in the beginning and 112.6MB in the end (delta: -62.5MB). Peak memory consumption was 18.1MB. Max. memory is 16.1GB. [2022-02-20 16:35:20,040 INFO L158 Benchmark]: Witness Printer took 3.25ms. Allocated memory is still 161.5MB. Free memory was 112.6MB in the beginning and 111.5MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 16:35:20,045 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.16ms. Allocated memory is still 123.7MB. Free memory was 96.8MB in the beginning and 96.8MB in the end (delta: 24.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 283.58ms. Allocated memory is still 123.7MB. Free memory was 87.0MB in the beginning and 94.8MB in the end (delta: -7.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 60.62ms. Allocated memory is still 123.7MB. Free memory was 94.8MB in the beginning and 89.1MB in the end (delta: 5.7MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 27.54ms. Allocated memory is still 123.7MB. Free memory was 89.1MB in the beginning and 86.4MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 617.00ms. Allocated memory is still 123.7MB. Free memory was 86.4MB in the beginning and 50.1MB in the end (delta: 36.3MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. * TraceAbstraction took 1043.08ms. Allocated memory was 123.7MB in the beginning and 161.5MB in the end (delta: 37.7MB). Free memory was 50.1MB in the beginning and 112.6MB in the end (delta: -62.5MB). Peak memory consumption was 18.1MB. Max. memory is 16.1GB. * Witness Printer took 3.25ms. Allocated memory is still 161.5MB. Free memory was 112.6MB in the beginning and 111.5MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 139]: 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 29, overapproximation of someBinaryArithmeticDOUBLEoperation at line 62, overapproximation of bitwiseAnd at line 28. Possible FailurePath: [L34-L43] static const double ln2_hi_log = 6.93147180369123816490e-01, ln2_lo_log = 1.90821492927058770002e-10, two54_log = 1.80143985094819840000e+16, Lg1_log = 6.666666666666735130e-01, Lg2_log = 3.999999999940941908e-01, Lg3_log = 2.857142874366239149e-01, Lg4_log = 2.222219843214978396e-01, Lg5_log = 1.818357216161805012e-01, Lg6_log = 1.531383769920937332e-01, Lg7_log = 1.479819860511658591e-01; [L45] static const double zero = 0.0; VAL [Lg1_log=666666666666673513/1000000000000000000, Lg2_log=999999999985235477/2500000000000000000, Lg3_log=2857142874366239149/10000000000000000000, Lg4_log=555554960803744599/2500000000000000000, Lg5_log=454589304040451253/2500000000000000000, Lg6_log=382845942480234333/2500000000000000000, Lg7_log=1479819860511658591/10000000000000000000, ln2_hi_log=69314718036912381649/100000000000000000000, ln2_lo_log=95410746463529385001/500000000000000000000000000000, two54_log=18014398509481984, zero=0] [L134] double x = 1.0 / 0.0; [L135] CALL, EXPR __ieee754_log(x) [L48] double hfsq, f, s, z, R, w, t1, t2, dk; [L49] __int32_t k, hx, i, j; [L50] __uint32_t lx; VAL [\old(x)=18014398509481986, Lg1_log=666666666666673513/1000000000000000000, Lg2_log=999999999985235477/2500000000000000000, Lg3_log=2857142874366239149/10000000000000000000, Lg4_log=555554960803744599/2500000000000000000, Lg5_log=454589304040451253/2500000000000000000, Lg6_log=382845942480234333/2500000000000000000, Lg7_log=1479819860511658591/10000000000000000000, ln2_hi_log=69314718036912381649/100000000000000000000, ln2_lo_log=95410746463529385001/500000000000000000000000000000, two54_log=18014398509481984, x=18014398509481986, zero=0] [L53] ieee_double_shape_type ew_u; [L54] ew_u.value = (x) [L55] EXPR ew_u.parts.msw [L55] (hx) = ew_u.parts.msw [L56] EXPR ew_u.parts.lsw [L56] (lx) = ew_u.parts.lsw [L59] k = 0 VAL [\old(x)=18014398509481986, hx=-1, k=0, Lg1_log=666666666666673513/1000000000000000000, Lg2_log=999999999985235477/2500000000000000000, Lg3_log=2857142874366239149/10000000000000000000, Lg4_log=555554960803744599/2500000000000000000, Lg5_log=454589304040451253/2500000000000000000, Lg6_log=382845942480234333/2500000000000000000, Lg7_log=1479819860511658591/10000000000000000000, ln2_hi_log=69314718036912381649/100000000000000000000, ln2_lo_log=95410746463529385001/500000000000000000000000000000, lx=0, two54_log=18014398509481984, x=18014398509481986, zero=0] [L60] COND TRUE hx < 0x00100000 VAL [\old(x)=18014398509481986, hx=-1, k=0, Lg1_log=666666666666673513/1000000000000000000, Lg2_log=999999999985235477/2500000000000000000, Lg3_log=2857142874366239149/10000000000000000000, Lg4_log=555554960803744599/2500000000000000000, Lg5_log=454589304040451253/2500000000000000000, Lg6_log=382845942480234333/2500000000000000000, Lg7_log=1479819860511658591/10000000000000000000, ln2_hi_log=69314718036912381649/100000000000000000000, ln2_lo_log=95410746463529385001/500000000000000000000000000000, lx=0, two54_log=18014398509481984, x=18014398509481986, zero=0] [L61] COND TRUE ((hx & 0x7fffffff) | lx) == 0 [L62] return -two54_log / zero; VAL [\old(x)=18014398509481986, hx=-1, k=0, Lg1_log=666666666666673513/1000000000000000000, Lg2_log=999999999985235477/2500000000000000000, Lg3_log=2857142874366239149/10000000000000000000, Lg4_log=555554960803744599/2500000000000000000, Lg5_log=454589304040451253/2500000000000000000, Lg6_log=382845942480234333/2500000000000000000, Lg7_log=1479819860511658591/10000000000000000000, ln2_hi_log=69314718036912381649/100000000000000000000, ln2_lo_log=95410746463529385001/500000000000000000000000000000, lx=0, two54_log=18014398509481984, x=18014398509481986, zero=0] [L135] RET, EXPR __ieee754_log(x) [L135] double res = __ieee754_log(x); [L138] CALL, EXPR isinf_double(res) [L21] __int32_t hx, lx; VAL [\old(x)=18014398509481985, Lg1_log=666666666666673513/1000000000000000000, Lg2_log=999999999985235477/2500000000000000000, Lg3_log=2857142874366239149/10000000000000000000, Lg4_log=555554960803744599/2500000000000000000, Lg5_log=454589304040451253/2500000000000000000, Lg6_log=382845942480234333/2500000000000000000, Lg7_log=1479819860511658591/10000000000000000000, ln2_hi_log=69314718036912381649/100000000000000000000, ln2_lo_log=95410746463529385001/500000000000000000000000000000, two54_log=18014398509481984, x=18014398509481985, zero=0] [L23] ieee_double_shape_type ew_u; [L24] ew_u.value = (x) [L25] EXPR ew_u.parts.msw [L25] (hx) = ew_u.parts.msw [L26] EXPR ew_u.parts.lsw [L26] (lx) = ew_u.parts.lsw [L28] hx &= 0x7fffffff [L29] hx |= (__uint32_t)(lx | (-lx)) >> 31 [L30] hx = 0x7ff00000 - hx [L31] return 1 - (int)((__uint32_t)(hx | (-hx)) >> 31); VAL [\old(x)=18014398509481985, \result=0, hx=1, Lg1_log=666666666666673513/1000000000000000000, Lg2_log=999999999985235477/2500000000000000000, Lg3_log=2857142874366239149/10000000000000000000, Lg4_log=555554960803744599/2500000000000000000, Lg5_log=454589304040451253/2500000000000000000, Lg6_log=382845942480234333/2500000000000000000, Lg7_log=1479819860511658591/10000000000000000000, ln2_hi_log=69314718036912381649/100000000000000000000, ln2_lo_log=95410746463529385001/500000000000000000000000000000, lx=0, two54_log=18014398509481984, x=18014398509481985, zero=0] [L138] RET, EXPR isinf_double(res) [L138] COND TRUE !isinf_double(res) [L139] reach_error() VAL [Lg1_log=666666666666673513/1000000000000000000, Lg2_log=999999999985235477/2500000000000000000, Lg3_log=2857142874366239149/10000000000000000000, Lg4_log=555554960803744599/2500000000000000000, Lg5_log=454589304040451253/2500000000000000000, Lg6_log=382845942480234333/2500000000000000000, Lg7_log=1479819860511658591/10000000000000000000, ln2_hi_log=69314718036912381649/100000000000000000000, ln2_lo_log=95410746463529385001/500000000000000000000000000000, res=18014398509481985, two54_log=18014398509481984, x=18014398509481986, zero=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 36 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.9s, OverallIterations: 2, 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, 48 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 0 IncrementalHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 48 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=36occurred in iteration=0, InterpolantAutomatonStates: 2, 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, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 26 NumberOfCodeBlocks, 26 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 11 ConstructedInterpolants, 0 QuantifiedInterpolants, 11 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 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:35:20,080 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_0931.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 c87390cdeb02bfcfd0888edfd053aa6fdb8101a94f62a8bab80f07fbfb57784e --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 16:35:21,771 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 16:35:21,773 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 16:35:21,814 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 16:35:21,814 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 16:35:21,817 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 16:35:21,818 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 16:35:21,822 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 16:35:21,824 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 16:35:21,828 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 16:35:21,829 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 16:35:21,832 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 16:35:21,832 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 16:35:21,834 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 16:35:21,835 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 16:35:21,837 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 16:35:21,838 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 16:35:21,839 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 16:35:21,840 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 16:35:21,844 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 16:35:21,846 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 16:35:21,846 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 16:35:21,847 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 16:35:21,849 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 16:35:21,853 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 16:35:21,854 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 16:35:21,854 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 16:35:21,855 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 16:35:21,855 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 16:35:21,856 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 16:35:21,856 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 16:35:21,857 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 16:35:21,858 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 16:35:21,858 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 16:35:21,859 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 16:35:21,860 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 16:35:21,860 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 16:35:21,860 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 16:35:21,860 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 16:35:21,862 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 16:35:21,862 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 16:35:21,865 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:35:21,893 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 16:35:21,894 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 16:35:21,895 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 16:35:21,895 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 16:35:21,896 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 16:35:21,896 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 16:35:21,897 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 16:35:21,897 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 16:35:21,897 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 16:35:21,897 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 16:35:21,898 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 16:35:21,898 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 16:35:21,898 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 16:35:21,898 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 16:35:21,898 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 16:35:21,899 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 16:35:21,899 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 16:35:21,899 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-02-20 16:35:21,899 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-02-20 16:35:21,899 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 16:35:21,899 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 16:35:21,900 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 16:35:21,900 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 16:35:21,900 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 16:35:21,900 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 16:35:21,900 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 16:35:21,900 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:35:21,900 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 16:35:21,901 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 16:35:21,901 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 16:35:21,901 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-02-20 16:35:21,901 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-02-20 16:35:21,901 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 16:35:21,901 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 16:35:21,902 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 16:35:21,902 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-02-20 16:35:21,902 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 -> c87390cdeb02bfcfd0888edfd053aa6fdb8101a94f62a8bab80f07fbfb57784e [2022-02-20 16:35:22,194 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 16:35:22,219 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 16:35:22,221 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 16:35:22,221 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 16:35:22,222 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 16:35:22,224 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/double_req_bl_0931.c [2022-02-20 16:35:22,281 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa1038c13/88626be9f442498798d6309313472d00/FLAG9727be865 [2022-02-20 16:35:22,629 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 16:35:22,630 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_0931.c [2022-02-20 16:35:22,634 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa1038c13/88626be9f442498798d6309313472d00/FLAG9727be865 [2022-02-20 16:35:23,055 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa1038c13/88626be9f442498798d6309313472d00 [2022-02-20 16:35:23,057 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 16:35:23,058 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 16:35:23,063 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 16:35:23,063 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 16:35:23,066 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 16:35:23,069 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:35:23" (1/1) ... [2022-02-20 16:35:23,070 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@483e26ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:35:23, skipping insertion in model container [2022-02-20 16:35:23,070 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:35:23" (1/1) ... [2022-02-20 16:35:23,075 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 16:35:23,095 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 16:35:23,224 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_0931.c[3610,3623] [2022-02-20 16:35:23,232 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:35:23,272 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 16:35:23,324 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_0931.c[3610,3623] [2022-02-20 16:35:23,334 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:35:23,347 INFO L208 MainTranslator]: Completed translation [2022-02-20 16:35:23,348 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:35:23 WrapperNode [2022-02-20 16:35:23,348 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 16:35:23,349 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 16:35:23,349 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 16:35:23,349 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 16:35:23,354 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:35:23" (1/1) ... [2022-02-20 16:35:23,372 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:35:23" (1/1) ... [2022-02-20 16:35:23,406 INFO L137 Inliner]: procedures = 20, calls = 28, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 164 [2022-02-20 16:35:23,408 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 16:35:23,410 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 16:35:23,410 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 16:35:23,410 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 16:35:23,416 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:35:23" (1/1) ... [2022-02-20 16:35:23,417 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:35:23" (1/1) ... [2022-02-20 16:35:23,432 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:35:23" (1/1) ... [2022-02-20 16:35:23,433 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:35:23" (1/1) ... [2022-02-20 16:35:23,440 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:35:23" (1/1) ... [2022-02-20 16:35:23,450 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:35:23" (1/1) ... [2022-02-20 16:35:23,456 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:35:23" (1/1) ... [2022-02-20 16:35:23,462 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 16:35:23,465 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 16:35:23,466 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 16:35:23,466 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 16:35:23,467 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:35:23" (1/1) ... [2022-02-20 16:35:23,472 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:35:23,480 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:35:23,493 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:35:23,511 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:35:23,524 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 16:35:23,525 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8 [2022-02-20 16:35:23,525 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2022-02-20 16:35:23,525 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-02-20 16:35:23,525 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 16:35:23,525 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-02-20 16:35:23,525 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 16:35:23,526 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 16:35:23,526 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-02-20 16:35:23,526 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 16:35:23,619 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 16:35:23,621 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 16:35:46,701 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 16:35:46,711 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 16:35:46,714 INFO L299 CfgBuilder]: Removed 8 assume(true) statements. [2022-02-20 16:35:46,716 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:35:46 BoogieIcfgContainer [2022-02-20 16:35:46,716 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 16:35:46,717 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 16:35:46,717 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 16:35:46,719 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 16:35:46,719 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 04:35:23" (1/3) ... [2022-02-20 16:35:46,720 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37602aa8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:35:46, skipping insertion in model container [2022-02-20 16:35:46,720 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:35:23" (2/3) ... [2022-02-20 16:35:46,720 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37602aa8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:35:46, skipping insertion in model container [2022-02-20 16:35:46,720 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:35:46" (3/3) ... [2022-02-20 16:35:46,721 INFO L111 eAbstractionObserver]: Analyzing ICFG double_req_bl_0931.c [2022-02-20 16:35:46,724 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 16:35:46,725 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 16:35:46,753 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 16:35:46,758 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:35:46,758 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 16:35:46,768 INFO L276 IsEmpty]: Start isEmpty. Operand has 32 states, 30 states have (on average 1.7) internal successors, (51), 31 states have internal predecessors, (51), 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:35:46,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-02-20 16:35:46,772 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:35:46,772 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:35:46,773 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:35:46,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:35:46,776 INFO L85 PathProgramCache]: Analyzing trace with hash -2110731690, now seen corresponding path program 1 times [2022-02-20 16:35:46,785 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:35:46,786 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1148702193] [2022-02-20 16:35:46,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:35:46,787 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:35:46,787 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:35:46,789 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:35:46,790 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:35:47,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:35:47,547 INFO L263 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 1 conjunts are in the unsatisfiable core [2022-02-20 16:35:47,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:35:47,565 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:35:47,805 INFO L290 TraceCheckUtils]: 0: Hoare triple {35#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);~ln2_hi_log~0 := ~to_fp~DOUBLE(currentRoundingMode, 0.6931471803691238);~ln2_lo_log~0 := ~to_fp~DOUBLE(currentRoundingMode, 1.9082149292705877E-10);~two54_log~0 := ~to_fp~DOUBLE(currentRoundingMode, 1.8014398509481984E16);~Lg1_log~0 := ~to_fp~DOUBLE(currentRoundingMode, 0.6666666666666735);~Lg2_log~0 := ~to_fp~DOUBLE(currentRoundingMode, 0.3999999999940942);~Lg3_log~0 := ~to_fp~DOUBLE(currentRoundingMode, 0.2857142874366239);~Lg4_log~0 := ~to_fp~DOUBLE(currentRoundingMode, 0.22222198432149784);~Lg5_log~0 := ~to_fp~DOUBLE(currentRoundingMode, 0.1818357216161805);~Lg6_log~0 := ~to_fp~DOUBLE(currentRoundingMode, 0.15313837699209373);~Lg7_log~0 := ~to_fp~DOUBLE(currentRoundingMode, 0.14798198605116586);~zero~0 := ~Pluszero~DOUBLE(); {35#true} is VALID [2022-02-20 16:35:47,805 INFO L290 TraceCheckUtils]: 1: Hoare triple {35#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret10#1, main_#t~ret11#1, main_~x~0#1, main_~res~0#1;main_~x~0#1 := ~fp.div~DOUBLE(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 1.0), ~Pluszero~DOUBLE());assume { :begin_inline___ieee754_log } true;__ieee754_log_#in~x#1 := main_~x~0#1;havoc __ieee754_log_#res#1;havoc __ieee754_log_#t~mem6#1, __ieee754_log_#t~mem7#1, __ieee754_log_~#ew_u~1#1.base, __ieee754_log_~#ew_u~1#1.offset, __ieee754_log_#t~mem8#1, __ieee754_log_~#gh_u~0#1.base, __ieee754_log_~#gh_u~0#1.offset, __ieee754_log_#t~mem9#1, __ieee754_log_~#sh_u~0#1.base, __ieee754_log_~#sh_u~0#1.offset, __ieee754_log_~x#1, __ieee754_log_~hfsq~0#1, __ieee754_log_~f~0#1, __ieee754_log_~s~0#1, __ieee754_log_~z~0#1, __ieee754_log_~R~0#1, __ieee754_log_~w~0#1, __ieee754_log_~t1~0#1, __ieee754_log_~t2~0#1, __ieee754_log_~dk~0#1, __ieee754_log_~k~0#1, __ieee754_log_~hx~1#1, __ieee754_log_~i~0#1, __ieee754_log_~j~0#1, __ieee754_log_~lx~1#1;__ieee754_log_~x#1 := __ieee754_log_#in~x#1;havoc __ieee754_log_~hfsq~0#1;havoc __ieee754_log_~f~0#1;havoc __ieee754_log_~s~0#1;havoc __ieee754_log_~z~0#1;havoc __ieee754_log_~R~0#1;havoc __ieee754_log_~w~0#1;havoc __ieee754_log_~t1~0#1;havoc __ieee754_log_~t2~0#1;havoc __ieee754_log_~dk~0#1;havoc __ieee754_log_~k~0#1;havoc __ieee754_log_~hx~1#1;havoc __ieee754_log_~i~0#1;havoc __ieee754_log_~j~0#1;havoc __ieee754_log_~lx~1#1; {35#true} is VALID [2022-02-20 16:35:47,806 INFO L290 TraceCheckUtils]: 2: Hoare triple {35#true} assume !true; {36#false} is VALID [2022-02-20 16:35:47,806 INFO L290 TraceCheckUtils]: 3: Hoare triple {36#false} __ieee754_log_~k~0#1 := 0bv32; {36#false} is VALID [2022-02-20 16:35:47,806 INFO L290 TraceCheckUtils]: 4: Hoare triple {36#false} assume ~bvslt32(__ieee754_log_~hx~1#1, 1048576bv32); {36#false} is VALID [2022-02-20 16:35:47,806 INFO L290 TraceCheckUtils]: 5: Hoare triple {36#false} assume 0bv32 == ~bvor32(~bvand32(2147483647bv32, __ieee754_log_~hx~1#1), __ieee754_log_~lx~1#1);__ieee754_log_#res#1 := ~fp.div~DOUBLE(currentRoundingMode, ~fp.neg~DOUBLE(~two54_log~0), ~zero~0); {36#false} is VALID [2022-02-20 16:35:47,807 INFO L290 TraceCheckUtils]: 6: Hoare triple {36#false} main_#t~ret10#1 := __ieee754_log_#res#1;assume { :end_inline___ieee754_log } true;main_~res~0#1 := main_#t~ret10#1;havoc main_#t~ret10#1;assume { :begin_inline_isinf_double } true;isinf_double_#in~x#1 := main_~res~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; {36#false} is VALID [2022-02-20 16:35:47,807 INFO L290 TraceCheckUtils]: 7: Hoare triple {36#false} assume !true; {36#false} is VALID [2022-02-20 16:35:47,807 INFO L290 TraceCheckUtils]: 8: Hoare triple {36#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)); {36#false} is VALID [2022-02-20 16:35:47,807 INFO L290 TraceCheckUtils]: 9: Hoare triple {36#false} main_#t~ret11#1 := isinf_double_#res#1;assume { :end_inline_isinf_double } true; {36#false} is VALID [2022-02-20 16:35:47,808 INFO L290 TraceCheckUtils]: 10: Hoare triple {36#false} assume 0bv32 == main_#t~ret11#1;havoc main_#t~ret11#1; {36#false} is VALID [2022-02-20 16:35:47,808 INFO L290 TraceCheckUtils]: 11: Hoare triple {36#false} assume !false; {36#false} is VALID [2022-02-20 16:35:47,809 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:35:47,809 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:35:47,809 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:35:47,810 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1148702193] [2022-02-20 16:35:47,810 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1148702193] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:35:47,810 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:35:47,811 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 16:35:47,812 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835454953] [2022-02-20 16:35:47,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:35:47,815 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:35:47,816 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:35:47,818 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:35:48,526 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:35:48,531 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 16:35:48,531 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:35:48,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 16:35:48,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 16:35:48,546 INFO L87 Difference]: Start difference. First operand has 32 states, 30 states have (on average 1.7) internal successors, (51), 31 states have internal predecessors, (51), 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:36:12,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:36:12,195 INFO L93 Difference]: Finished difference Result 62 states and 100 transitions. [2022-02-20 16:36:12,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 16:36:12,195 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:36:12,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:36:12,196 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:36:12,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 100 transitions. [2022-02-20 16:36:12,200 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:36:12,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 100 transitions. [2022-02-20 16:36:12,202 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 100 transitions. [2022-02-20 16:36:24,975 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 100 edges. 100 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:36:24,981 INFO L225 Difference]: With dead ends: 62 [2022-02-20 16:36:24,981 INFO L226 Difference]: Without dead ends: 29 [2022-02-20 16:36:24,985 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:36:24,988 INFO L933 BasicCegarLoop]: 42 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, 42 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:36:24,989 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:36:24,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-02-20 16:36:25,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2022-02-20 16:36:25,006 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:36:25,007 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand has 29 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 28 states have internal predecessors, (39), 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:36:25,009 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand has 29 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 28 states have internal predecessors, (39), 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:36:25,009 INFO L87 Difference]: Start difference. First operand 29 states. Second operand has 29 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 28 states have internal predecessors, (39), 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:36:25,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:36:25,013 INFO L93 Difference]: Finished difference Result 29 states and 39 transitions. [2022-02-20 16:36:25,013 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 39 transitions. [2022-02-20 16:36:25,014 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:36:25,014 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:36:25,014 INFO L74 IsIncluded]: Start isIncluded. First operand has 29 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 28 states have internal predecessors, (39), 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 29 states. [2022-02-20 16:36:25,015 INFO L87 Difference]: Start difference. First operand has 29 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 28 states have internal predecessors, (39), 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 29 states. [2022-02-20 16:36:25,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:36:25,017 INFO L93 Difference]: Finished difference Result 29 states and 39 transitions. [2022-02-20 16:36:25,017 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 39 transitions. [2022-02-20 16:36:25,018 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:36:25,018 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:36:25,018 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:36:25,018 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:36:25,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 28 states have internal predecessors, (39), 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:36:25,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 39 transitions. [2022-02-20 16:36:25,021 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 39 transitions. Word has length 12 [2022-02-20 16:36:25,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:36:25,021 INFO L470 AbstractCegarLoop]: Abstraction has 29 states and 39 transitions. [2022-02-20 16:36:25,021 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:36:25,021 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 39 transitions. [2022-02-20 16:36:25,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-02-20 16:36:25,022 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:36:25,022 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:36:25,044 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2022-02-20 16:36:25,231 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:36:25,232 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:36:25,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:36:25,232 INFO L85 PathProgramCache]: Analyzing trace with hash 1825265086, now seen corresponding path program 1 times [2022-02-20 16:36:25,233 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:36:25,233 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1885161917] [2022-02-20 16:36:25,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:36:25,233 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:36:25,234 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:36:25,235 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:36:25,236 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:36:25,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:36:25,945 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 9 conjunts are in the unsatisfiable core [2022-02-20 16:36:25,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:36:25,961 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:36:27,176 INFO L290 TraceCheckUtils]: 0: Hoare triple {241#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);~ln2_hi_log~0 := ~to_fp~DOUBLE(currentRoundingMode, 0.6931471803691238);~ln2_lo_log~0 := ~to_fp~DOUBLE(currentRoundingMode, 1.9082149292705877E-10);~two54_log~0 := ~to_fp~DOUBLE(currentRoundingMode, 1.8014398509481984E16);~Lg1_log~0 := ~to_fp~DOUBLE(currentRoundingMode, 0.6666666666666735);~Lg2_log~0 := ~to_fp~DOUBLE(currentRoundingMode, 0.3999999999940942);~Lg3_log~0 := ~to_fp~DOUBLE(currentRoundingMode, 0.2857142874366239);~Lg4_log~0 := ~to_fp~DOUBLE(currentRoundingMode, 0.22222198432149784);~Lg5_log~0 := ~to_fp~DOUBLE(currentRoundingMode, 0.1818357216161805);~Lg6_log~0 := ~to_fp~DOUBLE(currentRoundingMode, 0.15313837699209373);~Lg7_log~0 := ~to_fp~DOUBLE(currentRoundingMode, 0.14798198605116586);~zero~0 := ~Pluszero~DOUBLE(); {241#true} is VALID [2022-02-20 16:36:27,179 INFO L290 TraceCheckUtils]: 1: Hoare triple {241#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret10#1, main_#t~ret11#1, main_~x~0#1, main_~res~0#1;main_~x~0#1 := ~fp.div~DOUBLE(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 1.0), ~Pluszero~DOUBLE());assume { :begin_inline___ieee754_log } true;__ieee754_log_#in~x#1 := main_~x~0#1;havoc __ieee754_log_#res#1;havoc __ieee754_log_#t~mem6#1, __ieee754_log_#t~mem7#1, __ieee754_log_~#ew_u~1#1.base, __ieee754_log_~#ew_u~1#1.offset, __ieee754_log_#t~mem8#1, __ieee754_log_~#gh_u~0#1.base, __ieee754_log_~#gh_u~0#1.offset, __ieee754_log_#t~mem9#1, __ieee754_log_~#sh_u~0#1.base, __ieee754_log_~#sh_u~0#1.offset, __ieee754_log_~x#1, __ieee754_log_~hfsq~0#1, __ieee754_log_~f~0#1, __ieee754_log_~s~0#1, __ieee754_log_~z~0#1, __ieee754_log_~R~0#1, __ieee754_log_~w~0#1, __ieee754_log_~t1~0#1, __ieee754_log_~t2~0#1, __ieee754_log_~dk~0#1, __ieee754_log_~k~0#1, __ieee754_log_~hx~1#1, __ieee754_log_~i~0#1, __ieee754_log_~j~0#1, __ieee754_log_~lx~1#1;__ieee754_log_~x#1 := __ieee754_log_#in~x#1;havoc __ieee754_log_~hfsq~0#1;havoc __ieee754_log_~f~0#1;havoc __ieee754_log_~s~0#1;havoc __ieee754_log_~z~0#1;havoc __ieee754_log_~R~0#1;havoc __ieee754_log_~w~0#1;havoc __ieee754_log_~t1~0#1;havoc __ieee754_log_~t2~0#1;havoc __ieee754_log_~dk~0#1;havoc __ieee754_log_~k~0#1;havoc __ieee754_log_~hx~1#1;havoc __ieee754_log_~i~0#1;havoc __ieee754_log_~j~0#1;havoc __ieee754_log_~lx~1#1; {249#(exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start___ieee754_log_~x#1| (fp.div currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 1.0) (_ +zero 11 53))))} is VALID [2022-02-20 16:36:27,183 INFO L290 TraceCheckUtils]: 2: Hoare triple {249#(exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start___ieee754_log_~x#1| (fp.div currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 1.0) (_ +zero 11 53))))} call __ieee754_log_~#ew_u~1#1.base, __ieee754_log_~#ew_u~1#1.offset := #Ultimate.allocOnStack(8bv32);call write~intFLOATTYPE8(__ieee754_log_~x#1, __ieee754_log_~#ew_u~1#1.base, __ieee754_log_~#ew_u~1#1.offset, 8bv32);call __ieee754_log_#t~mem6#1 := read~intINTTYPE4(__ieee754_log_~#ew_u~1#1.base, ~bvadd32(4bv32, __ieee754_log_~#ew_u~1#1.offset), 4bv32);__ieee754_log_~hx~1#1 := __ieee754_log_#t~mem6#1;havoc __ieee754_log_#t~mem6#1;call __ieee754_log_#t~mem7#1 := read~intINTTYPE4(__ieee754_log_~#ew_u~1#1.base, __ieee754_log_~#ew_u~1#1.offset, 4bv32);__ieee754_log_~lx~1#1 := __ieee754_log_#t~mem7#1;havoc __ieee754_log_#t~mem7#1;call ULTIMATE.dealloc(__ieee754_log_~#ew_u~1#1.base, __ieee754_log_~#ew_u~1#1.offset);havoc __ieee754_log_~#ew_u~1#1.base, __ieee754_log_~#ew_u~1#1.offset; {253#(exists ((|v_skolemized_q#valueAsBitvector_11| (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_11|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_11|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_11|)) (fp.div currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 1.0) (_ +zero 11 53))) (= ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_11|) |ULTIMATE.start___ieee754_log_~hx~1#1|)))} is VALID [2022-02-20 16:36:27,186 INFO L290 TraceCheckUtils]: 3: Hoare triple {253#(exists ((|v_skolemized_q#valueAsBitvector_11| (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_11|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_11|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_11|)) (fp.div currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 1.0) (_ +zero 11 53))) (= ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_11|) |ULTIMATE.start___ieee754_log_~hx~1#1|)))} goto; {253#(exists ((|v_skolemized_q#valueAsBitvector_11| (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_11|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_11|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_11|)) (fp.div currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 1.0) (_ +zero 11 53))) (= ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_11|) |ULTIMATE.start___ieee754_log_~hx~1#1|)))} is VALID [2022-02-20 16:36:27,194 INFO L290 TraceCheckUtils]: 4: Hoare triple {253#(exists ((|v_skolemized_q#valueAsBitvector_11| (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_11|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_11|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_11|)) (fp.div currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 1.0) (_ +zero 11 53))) (= ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_11|) |ULTIMATE.start___ieee754_log_~hx~1#1|)))} __ieee754_log_~k~0#1 := 0bv32; {253#(exists ((|v_skolemized_q#valueAsBitvector_11| (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_11|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_11|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_11|)) (fp.div currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 1.0) (_ +zero 11 53))) (= ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_11|) |ULTIMATE.start___ieee754_log_~hx~1#1|)))} is VALID [2022-02-20 16:36:27,197 INFO L290 TraceCheckUtils]: 5: Hoare triple {253#(exists ((|v_skolemized_q#valueAsBitvector_11| (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_11|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_11|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_11|)) (fp.div currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 1.0) (_ +zero 11 53))) (= ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_11|) |ULTIMATE.start___ieee754_log_~hx~1#1|)))} assume ~bvslt32(__ieee754_log_~hx~1#1, 1048576bv32); {242#false} is VALID [2022-02-20 16:36:27,197 INFO L290 TraceCheckUtils]: 6: Hoare triple {242#false} assume 0bv32 == ~bvor32(~bvand32(2147483647bv32, __ieee754_log_~hx~1#1), __ieee754_log_~lx~1#1);__ieee754_log_#res#1 := ~fp.div~DOUBLE(currentRoundingMode, ~fp.neg~DOUBLE(~two54_log~0), ~zero~0); {242#false} is VALID [2022-02-20 16:36:27,197 INFO L290 TraceCheckUtils]: 7: Hoare triple {242#false} main_#t~ret10#1 := __ieee754_log_#res#1;assume { :end_inline___ieee754_log } true;main_~res~0#1 := main_#t~ret10#1;havoc main_#t~ret10#1;assume { :begin_inline_isinf_double } true;isinf_double_#in~x#1 := main_~res~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; {242#false} is VALID [2022-02-20 16:36:27,197 INFO L290 TraceCheckUtils]: 8: Hoare triple {242#false} 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; {242#false} is VALID [2022-02-20 16:36:27,198 INFO L290 TraceCheckUtils]: 9: Hoare triple {242#false} goto; {242#false} is VALID [2022-02-20 16:36:27,198 INFO L290 TraceCheckUtils]: 10: Hoare triple {242#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)); {242#false} is VALID [2022-02-20 16:36:27,198 INFO L290 TraceCheckUtils]: 11: Hoare triple {242#false} main_#t~ret11#1 := isinf_double_#res#1;assume { :end_inline_isinf_double } true; {242#false} is VALID [2022-02-20 16:36:27,198 INFO L290 TraceCheckUtils]: 12: Hoare triple {242#false} assume 0bv32 == main_#t~ret11#1;havoc main_#t~ret11#1; {242#false} is VALID [2022-02-20 16:36:27,198 INFO L290 TraceCheckUtils]: 13: Hoare triple {242#false} assume !false; {242#false} is VALID [2022-02-20 16:36:27,198 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:36:27,198 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:36:27,199 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:36:27,199 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1885161917] [2022-02-20 16:36:27,200 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1885161917] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:36:27,200 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:36:27,200 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 16:36:27,200 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8736156] [2022-02-20 16:36:27,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:36:27,201 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 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:36:27,201 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:36:27,201 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 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:36:27,974 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:36:27,975 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 16:36:27,975 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:36:27,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 16:36:27,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 16:36:27,975 INFO L87 Difference]: Start difference. First operand 29 states and 39 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 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)