./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/float-benchs/inv_Newton-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 791161d1 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/float-benchs/inv_Newton-1.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 7c5bb845798e00aa3572bfadf1cd4653d0b05182832339d0260ef999baa89392 --- Real Ultimate output --- This is Ultimate 0.2.2-?-791161d [2022-07-22 13:54:10,375 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-22 13:54:10,376 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-22 13:54:10,405 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-22 13:54:10,405 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-22 13:54:10,406 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-22 13:54:10,407 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-22 13:54:10,409 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-22 13:54:10,410 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-22 13:54:10,411 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-22 13:54:10,412 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-22 13:54:10,413 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-22 13:54:10,413 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-22 13:54:10,414 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-22 13:54:10,415 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-22 13:54:10,416 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-22 13:54:10,417 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-22 13:54:10,418 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-22 13:54:10,419 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-22 13:54:10,421 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-22 13:54:10,422 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-22 13:54:10,427 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-22 13:54:10,430 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-22 13:54:10,432 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-22 13:54:10,435 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-22 13:54:10,445 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-22 13:54:10,447 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-22 13:54:10,447 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-22 13:54:10,448 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-22 13:54:10,449 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-22 13:54:10,450 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-22 13:54:10,450 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-22 13:54:10,452 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-22 13:54:10,453 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-22 13:54:10,453 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-22 13:54:10,455 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-22 13:54:10,455 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-22 13:54:10,456 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-22 13:54:10,456 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-22 13:54:10,456 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-22 13:54:10,457 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-22 13:54:10,459 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-22 13:54:10,460 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-22 13:54:10,489 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-22 13:54:10,490 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-22 13:54:10,490 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-22 13:54:10,490 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-22 13:54:10,491 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-22 13:54:10,491 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-22 13:54:10,492 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-22 13:54:10,492 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-22 13:54:10,492 INFO L138 SettingsManager]: * Use SBE=true [2022-07-22 13:54:10,493 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-22 13:54:10,493 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-22 13:54:10,494 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-22 13:54:10,494 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-22 13:54:10,494 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-22 13:54:10,494 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-22 13:54:10,494 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-22 13:54:10,494 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-22 13:54:10,495 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-22 13:54:10,495 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-22 13:54:10,495 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-22 13:54:10,495 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-22 13:54:10,495 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-22 13:54:10,496 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-22 13:54:10,497 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-22 13:54:10,497 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 13:54:10,497 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-22 13:54:10,498 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-22 13:54:10,498 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-22 13:54:10,498 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-22 13:54:10,498 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-22 13:54:10,498 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-22 13:54:10,499 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-22 13:54:10,499 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-22 13:54:10,499 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 -> 7c5bb845798e00aa3572bfadf1cd4653d0b05182832339d0260ef999baa89392 [2022-07-22 13:54:10,721 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-22 13:54:10,738 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-22 13:54:10,740 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-22 13:54:10,741 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-22 13:54:10,742 INFO L275 PluginConnector]: CDTParser initialized [2022-07-22 13:54:10,743 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-benchs/inv_Newton-1.c [2022-07-22 13:54:10,808 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f93cf0213/8b3a6418c22740e881b1c0598be1611c/FLAGf762e8243 [2022-07-22 13:54:11,252 INFO L306 CDTParser]: Found 1 translation units. [2022-07-22 13:54:11,253 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/inv_Newton-1.c [2022-07-22 13:54:11,258 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f93cf0213/8b3a6418c22740e881b1c0598be1611c/FLAGf762e8243 [2022-07-22 13:54:11,272 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f93cf0213/8b3a6418c22740e881b1c0598be1611c [2022-07-22 13:54:11,274 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-22 13:54:11,276 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-22 13:54:11,277 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-22 13:54:11,277 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-22 13:54:11,280 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-22 13:54:11,281 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 01:54:11" (1/1) ... [2022-07-22 13:54:11,282 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a6b5c99 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:54:11, skipping insertion in model container [2022-07-22 13:54:11,282 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 01:54:11" (1/1) ... [2022-07-22 13:54:11,288 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-22 13:54:11,302 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-22 13:54:11,474 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-benchs/inv_Newton-1.c[598,611] [2022-07-22 13:54:11,497 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 13:54:11,504 INFO L203 MainTranslator]: Completed pre-run [2022-07-22 13:54:11,517 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-benchs/inv_Newton-1.c[598,611] [2022-07-22 13:54:11,538 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 13:54:11,552 INFO L208 MainTranslator]: Completed translation [2022-07-22 13:54:11,553 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:54:11 WrapperNode [2022-07-22 13:54:11,553 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-22 13:54:11,555 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-22 13:54:11,555 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-22 13:54:11,555 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-22 13:54:11,561 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:54:11" (1/1) ... [2022-07-22 13:54:11,574 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:54:11" (1/1) ... [2022-07-22 13:54:11,597 INFO L137 Inliner]: procedures = 18, calls = 21, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 66 [2022-07-22 13:54:11,597 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-22 13:54:11,598 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-22 13:54:11,599 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-22 13:54:11,599 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-22 13:54:11,606 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:54:11" (1/1) ... [2022-07-22 13:54:11,606 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:54:11" (1/1) ... [2022-07-22 13:54:11,610 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:54:11" (1/1) ... [2022-07-22 13:54:11,611 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:54:11" (1/1) ... [2022-07-22 13:54:11,626 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:54:11" (1/1) ... [2022-07-22 13:54:11,629 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:54:11" (1/1) ... [2022-07-22 13:54:11,636 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:54:11" (1/1) ... [2022-07-22 13:54:11,638 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-22 13:54:11,641 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-22 13:54:11,641 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-22 13:54:11,641 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-22 13:54:11,642 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:54:11" (1/1) ... [2022-07-22 13:54:11,648 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 13:54:11,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 13:54:11,677 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-07-22 13:54:11,693 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-07-22 13:54:11,717 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-22 13:54:11,717 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-22 13:54:11,718 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-22 13:54:11,718 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2022-07-22 13:54:11,718 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-22 13:54:11,718 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2022-07-22 13:54:11,718 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-22 13:54:11,718 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-22 13:54:11,718 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-22 13:54:11,719 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-22 13:54:11,791 INFO L234 CfgBuilder]: Building ICFG [2022-07-22 13:54:11,792 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-22 13:54:11,931 INFO L275 CfgBuilder]: Performing block encoding [2022-07-22 13:54:11,936 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-22 13:54:11,937 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-22 13:54:11,938 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 01:54:11 BoogieIcfgContainer [2022-07-22 13:54:11,938 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-22 13:54:11,940 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-22 13:54:11,940 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-22 13:54:11,943 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-22 13:54:11,943 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.07 01:54:11" (1/3) ... [2022-07-22 13:54:11,944 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76b5f02b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 01:54:11, skipping insertion in model container [2022-07-22 13:54:11,944 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:54:11" (2/3) ... [2022-07-22 13:54:11,944 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76b5f02b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 01:54:11, skipping insertion in model container [2022-07-22 13:54:11,945 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 01:54:11" (3/3) ... [2022-07-22 13:54:11,946 INFO L111 eAbstractionObserver]: Analyzing ICFG inv_Newton-1.c [2022-07-22 13:54:11,958 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-22 13:54:11,958 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-22 13:54:11,995 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-22 13:54:12,001 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@4001df5d, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@610e12bb [2022-07-22 13:54:12,015 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-22 13:54:12,021 INFO L276 IsEmpty]: Start isEmpty. Operand has 14 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 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-07-22 13:54:12,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-07-22 13:54:12,027 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 13:54:12,028 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 13:54:12,029 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 13:54:12,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 13:54:12,033 INFO L85 PathProgramCache]: Analyzing trace with hash -590190995, now seen corresponding path program 1 times [2022-07-22 13:54:12,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 13:54:12,051 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753937191] [2022-07-22 13:54:12,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 13:54:12,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 13:54:12,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 13:54:12,212 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 13:54:12,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 13:54:12,214 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753937191] [2022-07-22 13:54:12,215 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [753937191] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 13:54:12,215 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 13:54:12,215 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-22 13:54:12,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031091387] [2022-07-22 13:54:12,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 13:54:12,221 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-22 13:54:12,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 13:54:12,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-22 13:54:12,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-22 13:54:12,254 INFO L87 Difference]: Start difference. First operand has 14 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 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 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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-07-22 13:54:12,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 13:54:12,267 INFO L93 Difference]: Finished difference Result 25 states and 30 transitions. [2022-07-22 13:54:12,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-22 13:54:12,269 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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 9 [2022-07-22 13:54:12,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 13:54:12,275 INFO L225 Difference]: With dead ends: 25 [2022-07-22 13:54:12,276 INFO L226 Difference]: Without dead ends: 10 [2022-07-22 13:54:12,278 INFO L412 NwaCegarLoop]: 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-07-22 13:54:12,282 INFO L413 NwaCegarLoop]: 14 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, 14 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-07-22 13:54:12,283 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 13:54:12,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2022-07-22 13:54:12,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2022-07-22 13:54:12,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 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-07-22 13:54:12,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2022-07-22 13:54:12,312 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 9 [2022-07-22 13:54:12,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 13:54:12,313 INFO L495 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2022-07-22 13:54:12,313 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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-07-22 13:54:12,313 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2022-07-22 13:54:12,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-07-22 13:54:12,314 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 13:54:12,314 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 13:54:12,315 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-22 13:54:12,315 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 13:54:12,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 13:54:12,318 INFO L85 PathProgramCache]: Analyzing trace with hash 1184816367, now seen corresponding path program 1 times [2022-07-22 13:54:12,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 13:54:12,319 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7164574] [2022-07-22 13:54:12,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 13:54:12,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 13:54:12,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 13:54:12,460 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 13:54:12,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 13:54:12,462 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7164574] [2022-07-22 13:54:12,462 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [7164574] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 13:54:12,462 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 13:54:12,463 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 13:54:12,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111870785] [2022-07-22 13:54:12,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 13:54:12,465 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 13:54:12,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 13:54:12,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 13:54:12,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 13:54:12,467 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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-07-22 13:54:12,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 13:54:12,478 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2022-07-22 13:54:12,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 13:54:12,480 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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 9 [2022-07-22 13:54:12,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 13:54:12,481 INFO L225 Difference]: With dead ends: 16 [2022-07-22 13:54:12,481 INFO L226 Difference]: Without dead ends: 11 [2022-07-22 13:54:12,485 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 13:54:12,486 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 0 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 13:54:12,487 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 16 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 13:54:12,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2022-07-22 13:54:12,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2022-07-22 13:54:12,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 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-07-22 13:54:12,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2022-07-22 13:54:12,496 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2022-07-22 13:54:12,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 13:54:12,499 INFO L495 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2022-07-22 13:54:12,500 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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-07-22 13:54:12,500 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2022-07-22 13:54:12,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-22 13:54:12,501 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 13:54:12,502 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 13:54:12,502 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-22 13:54:12,502 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 13:54:12,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 13:54:12,512 INFO L85 PathProgramCache]: Analyzing trace with hash -1873743609, now seen corresponding path program 1 times [2022-07-22 13:54:12,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 13:54:12,512 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105823839] [2022-07-22 13:54:12,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 13:54:12,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 13:54:12,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 13:54:12,558 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 13:54:12,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 13:54:12,608 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 13:54:12,608 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-22 13:54:12,614 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-22 13:54:12,615 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-22 13:54:12,618 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2022-07-22 13:54:12,623 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-22 13:54:12,654 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.07 01:54:12 BoogieIcfgContainer [2022-07-22 13:54:12,654 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-22 13:54:12,655 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-22 13:54:12,655 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-22 13:54:12,656 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-22 13:54:12,656 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 01:54:11" (3/4) ... [2022-07-22 13:54:12,659 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-07-22 13:54:12,659 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-22 13:54:12,660 INFO L158 Benchmark]: Toolchain (without parser) took 1384.00ms. Allocated memory is still 115.3MB. Free memory was 81.7MB in the beginning and 40.1MB in the end (delta: 41.7MB). Peak memory consumption was 39.2MB. Max. memory is 16.1GB. [2022-07-22 13:54:12,662 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 86.0MB. Free memory was 47.7MB in the beginning and 47.6MB in the end (delta: 84.0kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-22 13:54:12,662 INFO L158 Benchmark]: CACSL2BoogieTranslator took 276.96ms. Allocated memory is still 115.3MB. Free memory was 81.7MB in the beginning and 89.9MB in the end (delta: -8.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-22 13:54:12,662 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.67ms. Allocated memory is still 115.3MB. Free memory was 89.9MB in the beginning and 88.3MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-22 13:54:12,663 INFO L158 Benchmark]: Boogie Preprocessor took 41.59ms. Allocated memory is still 115.3MB. Free memory was 88.3MB in the beginning and 87.0MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-22 13:54:12,664 INFO L158 Benchmark]: RCFGBuilder took 297.74ms. Allocated memory is still 115.3MB. Free memory was 87.0MB in the beginning and 75.3MB in the end (delta: 11.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-07-22 13:54:12,664 INFO L158 Benchmark]: TraceAbstraction took 714.42ms. Allocated memory is still 115.3MB. Free memory was 74.5MB in the beginning and 40.5MB in the end (delta: 34.0MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2022-07-22 13:54:12,664 INFO L158 Benchmark]: Witness Printer took 3.95ms. Allocated memory is still 115.3MB. Free memory was 40.5MB in the beginning and 40.1MB in the end (delta: 425.3kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-22 13:54:12,666 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 86.0MB. Free memory was 47.7MB in the beginning and 47.6MB in the end (delta: 84.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 276.96ms. Allocated memory is still 115.3MB. Free memory was 81.7MB in the beginning and 89.9MB in the end (delta: -8.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 42.67ms. Allocated memory is still 115.3MB. Free memory was 89.9MB in the beginning and 88.3MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 41.59ms. Allocated memory is still 115.3MB. Free memory was 88.3MB in the beginning and 87.0MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 297.74ms. Allocated memory is still 115.3MB. Free memory was 87.0MB in the beginning and 75.3MB in the end (delta: 11.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 714.42ms. Allocated memory is still 115.3MB. Free memory was 74.5MB in the beginning and 40.5MB in the end (delta: 34.0MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * Witness Printer took 3.95ms. Allocated memory is still 115.3MB. Free memory was 40.5MB in the beginning and 40.1MB in the end (delta: 425.3kB). 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: 16]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of bitwiseAnd at line 30, overapproximation of someBinaryArithmeticDOUBLEoperation at line 36, overapproximation of someBinaryDOUBLEComparisonOperation at line 53, overapproximation of to_real at line 31. Possible FailurePath: [L46] double a,r; [L48] a = __VERIFIER_nondet_double() [L49] CALL assume_abort_if_not(a >= 20. && a <= 30.) [L14] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L49] RET assume_abort_if_not(a >= 20. && a <= 30.) [L51] CALL, EXPR inv(a) [L26] double xi, xsi, temp; [L27] signed int cond, exp; [L28] union double_int A_u, xi_u; [L29] A_u.d = A [L30] EXPR A_u.i [L30] exp = (signed int) ((A_u.i & 0x7FF0000000000000) >> 52) - 1023 [L31] xi_u.d = 1 [L32] xi_u.i = (((long long)(1023-exp)) << 52) [L33] EXPR xi_u.d [L33] xi = xi_u.d [L34] cond = 1 VAL [\old(A)=9214364837600034821, A=9214364837600034821, A_u={4:0}, cond=1, exp=-1023, xi=9214364837600034820, xi_u={5:0}] [L35] COND TRUE \read(cond) [L36] xsi = 2*xi-A*xi*xi [L37] temp = xsi-xi [L38] cond = ((temp > 1e-10) || (temp < -1e-10)) [L39] xi = xsi VAL [\old(A)=9214364837600034821, A=9214364837600034821, A_u={4:0}, cond=0, exp=-1023, xi=9214364837600034817, xi_u={5:0}, xsi=9214364837600034817] [L35] COND FALSE !(\read(cond)) VAL [\old(A)=9214364837600034821, A=9214364837600034821, A_u={4:0}, cond=0, exp=-1023, xi=9214364837600034817, xi_u={5:0}, xsi=9214364837600034817] [L41] return xi; [L41] return xi; [L41] return xi; VAL [\old(A)=9214364837600034821, \result=9214364837600034817, A=9214364837600034821, cond=0, exp=-1023, xi=9214364837600034817, xsi=9214364837600034817] [L51] RET, EXPR inv(a) [L51] r = inv(a) [L53] CALL __VERIFIER_assert(r >= 0 && r <= 0.06) [L16] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L16] reach_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 14 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.6s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 30 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3 IncrementalHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 23 mSDtfsCounter, 3 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=14occurred in iteration=0, InterpolantAutomatonStates: 5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 28 NumberOfCodeBlocks, 28 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 16 ConstructedInterpolants, 0 QuantifiedInterpolants, 18 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-07-22 13:54:12,703 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/float-benchs/inv_Newton-1.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 7c5bb845798e00aa3572bfadf1cd4653d0b05182832339d0260ef999baa89392 --- Real Ultimate output --- This is Ultimate 0.2.2-?-791161d [2022-07-22 13:54:14,632 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-22 13:54:14,635 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-22 13:54:14,674 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-22 13:54:14,674 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-22 13:54:14,676 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-22 13:54:14,680 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-22 13:54:14,683 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-22 13:54:14,685 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-22 13:54:14,689 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-22 13:54:14,690 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-22 13:54:14,694 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-22 13:54:14,695 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-22 13:54:14,696 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-22 13:54:14,697 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-22 13:54:14,700 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-22 13:54:14,701 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-22 13:54:14,702 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-22 13:54:14,703 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-22 13:54:14,709 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-22 13:54:14,710 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-22 13:54:14,711 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-22 13:54:14,713 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-22 13:54:14,714 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-22 13:54:14,716 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-22 13:54:14,722 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-22 13:54:14,722 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-22 13:54:14,722 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-22 13:54:14,723 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-22 13:54:14,724 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-22 13:54:14,724 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-22 13:54:14,725 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-22 13:54:14,726 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-22 13:54:14,727 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-22 13:54:14,728 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-22 13:54:14,729 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-22 13:54:14,729 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-22 13:54:14,729 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-22 13:54:14,730 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-22 13:54:14,730 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-22 13:54:14,731 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-22 13:54:14,732 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-22 13:54:14,737 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2022-07-22 13:54:14,777 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-22 13:54:14,777 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-22 13:54:14,778 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-22 13:54:14,778 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-22 13:54:14,779 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-22 13:54:14,779 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-22 13:54:14,780 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-22 13:54:14,780 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-22 13:54:14,780 INFO L138 SettingsManager]: * Use SBE=true [2022-07-22 13:54:14,781 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-22 13:54:14,781 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-22 13:54:14,781 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-22 13:54:14,781 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-22 13:54:14,782 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-22 13:54:14,782 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-22 13:54:14,782 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-22 13:54:14,782 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-22 13:54:14,782 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-22 13:54:14,783 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-22 13:54:14,783 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-22 13:54:14,783 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-22 13:54:14,783 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-22 13:54:14,783 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-22 13:54:14,784 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-22 13:54:14,784 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-22 13:54:14,784 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-22 13:54:14,784 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 13:54:14,784 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-22 13:54:14,785 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-22 13:54:14,785 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-22 13:54:14,785 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-22 13:54:14,785 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-22 13:54:14,786 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-22 13:54:14,786 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-22 13:54:14,786 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-22 13:54:14,786 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-22 13:54:14,786 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 -> 7c5bb845798e00aa3572bfadf1cd4653d0b05182832339d0260ef999baa89392 [2022-07-22 13:54:15,118 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-22 13:54:15,139 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-22 13:54:15,141 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-22 13:54:15,142 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-22 13:54:15,143 INFO L275 PluginConnector]: CDTParser initialized [2022-07-22 13:54:15,144 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-benchs/inv_Newton-1.c [2022-07-22 13:54:15,198 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e66b9f77d/7608b19bea624a168531c4e1f7bc01e1/FLAGe0ebb2b35 [2022-07-22 13:54:15,634 INFO L306 CDTParser]: Found 1 translation units. [2022-07-22 13:54:15,635 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/inv_Newton-1.c [2022-07-22 13:54:15,641 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e66b9f77d/7608b19bea624a168531c4e1f7bc01e1/FLAGe0ebb2b35 [2022-07-22 13:54:16,029 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e66b9f77d/7608b19bea624a168531c4e1f7bc01e1 [2022-07-22 13:54:16,031 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-22 13:54:16,033 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-22 13:54:16,034 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-22 13:54:16,034 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-22 13:54:16,037 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-22 13:54:16,038 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 01:54:16" (1/1) ... [2022-07-22 13:54:16,039 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69faa173 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:54:16, skipping insertion in model container [2022-07-22 13:54:16,039 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 01:54:16" (1/1) ... [2022-07-22 13:54:16,045 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-22 13:54:16,056 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-22 13:54:16,172 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-benchs/inv_Newton-1.c[598,611] [2022-07-22 13:54:16,196 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 13:54:16,215 INFO L203 MainTranslator]: Completed pre-run [2022-07-22 13:54:16,227 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-benchs/inv_Newton-1.c[598,611] [2022-07-22 13:54:16,257 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 13:54:16,294 INFO L208 MainTranslator]: Completed translation [2022-07-22 13:54:16,295 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:54:16 WrapperNode [2022-07-22 13:54:16,295 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-22 13:54:16,296 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-22 13:54:16,296 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-22 13:54:16,296 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-22 13:54:16,302 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:54:16" (1/1) ... [2022-07-22 13:54:16,320 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:54:16" (1/1) ... [2022-07-22 13:54:16,343 INFO L137 Inliner]: procedures = 21, calls = 21, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 67 [2022-07-22 13:54:16,344 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-22 13:54:16,345 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-22 13:54:16,345 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-22 13:54:16,345 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-22 13:54:16,352 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:54:16" (1/1) ... [2022-07-22 13:54:16,353 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:54:16" (1/1) ... [2022-07-22 13:54:16,362 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:54:16" (1/1) ... [2022-07-22 13:54:16,363 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:54:16" (1/1) ... [2022-07-22 13:54:16,379 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:54:16" (1/1) ... [2022-07-22 13:54:16,384 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:54:16" (1/1) ... [2022-07-22 13:54:16,392 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:54:16" (1/1) ... [2022-07-22 13:54:16,396 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-22 13:54:16,396 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-22 13:54:16,397 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-22 13:54:16,397 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-22 13:54:16,397 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:54:16" (1/1) ... [2022-07-22 13:54:16,404 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 13:54:16,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 13:54:16,429 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-07-22 13:54:16,455 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-07-22 13:54:16,471 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-22 13:54:16,472 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8 [2022-07-22 13:54:16,472 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2022-07-22 13:54:16,472 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-22 13:54:16,472 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-22 13:54:16,472 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8 [2022-07-22 13:54:16,473 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-22 13:54:16,473 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-22 13:54:16,473 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8 [2022-07-22 13:54:16,473 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-22 13:54:16,559 INFO L234 CfgBuilder]: Building ICFG [2022-07-22 13:54:16,561 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-22 13:54:18,880 INFO L275 CfgBuilder]: Performing block encoding [2022-07-22 13:54:18,885 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-22 13:54:18,885 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-22 13:54:18,887 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 01:54:18 BoogieIcfgContainer [2022-07-22 13:54:18,887 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-22 13:54:18,888 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-22 13:54:18,888 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-22 13:54:18,891 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-22 13:54:18,891 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.07 01:54:16" (1/3) ... [2022-07-22 13:54:18,892 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23febc7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 01:54:18, skipping insertion in model container [2022-07-22 13:54:18,892 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:54:16" (2/3) ... [2022-07-22 13:54:18,892 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23febc7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 01:54:18, skipping insertion in model container [2022-07-22 13:54:18,893 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 01:54:18" (3/3) ... [2022-07-22 13:54:18,894 INFO L111 eAbstractionObserver]: Analyzing ICFG inv_Newton-1.c [2022-07-22 13:54:18,904 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-22 13:54:18,904 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-22 13:54:18,956 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-22 13:54:18,965 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@538ae21a, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@6857b875 [2022-07-22 13:54:18,965 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-22 13:54:18,969 INFO L276 IsEmpty]: Start isEmpty. Operand has 14 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 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-07-22 13:54:18,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-07-22 13:54:18,974 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 13:54:18,975 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 13:54:18,975 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 13:54:18,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 13:54:18,980 INFO L85 PathProgramCache]: Analyzing trace with hash -590190995, now seen corresponding path program 1 times [2022-07-22 13:54:18,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-22 13:54:18,991 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [119422609] [2022-07-22 13:54:18,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 13:54:18,992 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-22 13:54:18,992 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-22 13:54:18,995 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-07-22 13:54:19,002 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-07-22 13:54:19,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 13:54:19,086 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 1 conjunts are in the unsatisfiable core [2022-07-22 13:54:19,090 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 13:54:19,107 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 13:54:19,107 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 13:54:19,108 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-22 13:54:19,109 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [119422609] [2022-07-22 13:54:19,110 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [119422609] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 13:54:19,110 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 13:54:19,110 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-22 13:54:19,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785444720] [2022-07-22 13:54:19,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 13:54:19,117 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-22 13:54:19,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-22 13:54:19,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-22 13:54:19,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-22 13:54:19,149 INFO L87 Difference]: Start difference. First operand has 14 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 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 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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-07-22 13:54:19,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 13:54:19,160 INFO L93 Difference]: Finished difference Result 25 states and 30 transitions. [2022-07-22 13:54:19,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-22 13:54:19,162 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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 9 [2022-07-22 13:54:19,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 13:54:19,170 INFO L225 Difference]: With dead ends: 25 [2022-07-22 13:54:19,171 INFO L226 Difference]: Without dead ends: 10 [2022-07-22 13:54:19,173 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-22 13:54:19,177 INFO L413 NwaCegarLoop]: 14 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, 14 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-07-22 13:54:19,179 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 13:54:19,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2022-07-22 13:54:19,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2022-07-22 13:54:19,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 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-07-22 13:54:19,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2022-07-22 13:54:19,209 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 9 [2022-07-22 13:54:19,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 13:54:19,209 INFO L495 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2022-07-22 13:54:19,210 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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-07-22 13:54:19,210 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2022-07-22 13:54:19,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-07-22 13:54:19,210 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 13:54:19,211 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 13:54:19,227 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-07-22 13:54:19,423 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-22 13:54:19,424 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 13:54:19,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 13:54:19,425 INFO L85 PathProgramCache]: Analyzing trace with hash 1184816367, now seen corresponding path program 1 times [2022-07-22 13:54:19,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-22 13:54:19,429 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [939075377] [2022-07-22 13:54:19,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 13:54:19,429 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-22 13:54:19,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-22 13:54:19,431 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-07-22 13:54:19,433 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-07-22 13:54:19,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 13:54:19,522 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 13:54:19,523 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 13:54:19,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 13:54:19,563 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 13:54:19,563 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-22 13:54:19,563 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [939075377] [2022-07-22 13:54:19,563 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [939075377] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 13:54:19,564 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 13:54:19,564 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 13:54:19,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800131953] [2022-07-22 13:54:19,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 13:54:19,565 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 13:54:19,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-22 13:54:19,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 13:54:19,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 13:54:19,567 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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-07-22 13:54:21,776 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.21s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-22 13:54:21,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 13:54:21,890 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2022-07-22 13:54:21,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 13:54:21,891 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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 9 [2022-07-22 13:54:21,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 13:54:21,891 INFO L225 Difference]: With dead ends: 16 [2022-07-22 13:54:21,891 INFO L226 Difference]: Without dead ends: 11 [2022-07-22 13:54:21,891 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 13:54:21,892 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 0 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-07-22 13:54:21,893 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 16 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-07-22 13:54:21,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2022-07-22 13:54:21,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2022-07-22 13:54:21,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 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-07-22 13:54:21,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2022-07-22 13:54:21,897 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2022-07-22 13:54:21,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 13:54:21,897 INFO L495 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2022-07-22 13:54:21,897 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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-07-22 13:54:21,898 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2022-07-22 13:54:21,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-22 13:54:21,898 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 13:54:21,898 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 13:54:21,907 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-07-22 13:54:22,103 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-22 13:54:22,104 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 13:54:22,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 13:54:22,105 INFO L85 PathProgramCache]: Analyzing trace with hash -1873743609, now seen corresponding path program 1 times [2022-07-22 13:54:22,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-22 13:54:22,105 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1394088766] [2022-07-22 13:54:22,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 13:54:22,106 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-22 13:54:22,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-22 13:54:22,107 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-22 13:54:22,108 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-07-22 13:54:23,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 13:54:23,332 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 25 conjunts are in the unsatisfiable core [2022-07-22 13:54:23,336 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 13:55:34,857 WARN L833 $PredicateComparison]: unable to prove that (and (or (and (exists ((v_ArrVal_53 (_ BitVec 32)) (|v_skolemized_q#valueAsBitvector_6| (_ BitVec 64)) (v_ArrVal_49 (_ BitVec 32))) (let ((.cse3 (let ((.cse4 (concat ((_ extract 63 32) (bvshl ((_ sign_extend 32) (bvadd (_ bv1023 32) (bvneg (bvadd ((_ extract 31 0) (bvashr (bvand (concat ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_6|) v_ArrVal_53) (_ bv9218868437227405312 64)) (_ bv52 64))) (_ bv4294966273 32))))) (_ bv52 64))) v_ArrVal_49))) (fp ((_ extract 63 63) .cse4) ((_ extract 62 52) .cse4) ((_ extract 51 0) .cse4))))) (let ((.cse0 (fp.sub c_currentRoundingMode |c_ULTIMATE.start_inv_~xi~0#1| .cse3)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 10000000000.0))) (.cse2 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_6|)))) (and (not (fp.lt .cse0 (fp.neg .cse1))) (not (fp.gt .cse0 .cse1)) (fp.geq .cse2 ((_ to_fp 11 53) c_currentRoundingMode 20.0)) (fp.leq .cse2 ((_ to_fp 11 53) c_currentRoundingMode 30.0)) (= (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) .cse3) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse3) .cse3)) |c_ULTIMATE.start_inv_~xi~0#1|))))) (= |c_ULTIMATE.start_inv_~cond~0#1| (_ bv0 32))) (and (or (exists ((|v_skolemized_q#valueAsBitvector_6| (_ BitVec 64))) (let ((.cse7 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_6|)))) (and (exists ((v_ArrVal_53 (_ BitVec 32)) (v_ArrVal_49 (_ BitVec 32))) (let ((.cse5 (let ((.cse6 (concat ((_ extract 63 32) (bvshl ((_ sign_extend 32) (bvadd (_ bv1023 32) (bvneg (bvadd ((_ extract 31 0) (bvashr (bvand (concat ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_6|) v_ArrVal_53) (_ bv9218868437227405312 64)) (_ bv52 64))) (_ bv4294966273 32))))) (_ bv52 64))) v_ArrVal_49))) (fp ((_ extract 63 63) .cse6) ((_ extract 62 52) .cse6) ((_ extract 51 0) .cse6))))) (and (fp.gt (fp.sub c_currentRoundingMode |c_ULTIMATE.start_inv_~xi~0#1| .cse5) ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 10000000000.0))) (= (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) .cse5) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_6|)) .cse5) .cse5)) |c_ULTIMATE.start_inv_~xi~0#1|)))) (fp.geq .cse7 ((_ to_fp 11 53) c_currentRoundingMode 20.0)) (fp.leq .cse7 ((_ to_fp 11 53) c_currentRoundingMode 30.0))))) (exists ((|v_skolemized_q#valueAsBitvector_6| (_ BitVec 64))) (let ((.cse10 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_6|)))) (and (exists ((v_ArrVal_53 (_ BitVec 32)) (v_ArrVal_49 (_ BitVec 32))) (let ((.cse8 (let ((.cse9 (concat ((_ extract 63 32) (bvshl ((_ sign_extend 32) (bvadd (_ bv1023 32) (bvneg (bvadd ((_ extract 31 0) (bvashr (bvand (concat ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_6|) v_ArrVal_53) (_ bv9218868437227405312 64)) (_ bv52 64))) (_ bv4294966273 32))))) (_ bv52 64))) v_ArrVal_49))) (fp ((_ extract 63 63) .cse9) ((_ extract 62 52) .cse9) ((_ extract 51 0) .cse9))))) (and (fp.lt (fp.sub c_currentRoundingMode |c_ULTIMATE.start_inv_~xi~0#1| .cse8) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 10000000000.0)))) (= (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) .cse8) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_6|)) .cse8) .cse8)) |c_ULTIMATE.start_inv_~xi~0#1|)))) (fp.geq .cse10 ((_ to_fp 11 53) c_currentRoundingMode 20.0)) (fp.leq .cse10 ((_ to_fp 11 53) c_currentRoundingMode 30.0)))))) (= |c_ULTIMATE.start_inv_~cond~0#1| (_ bv1 32)))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2022-07-22 13:55:58,426 WARN L833 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_53 (_ BitVec 32)) (|v_skolemized_q#valueAsBitvector_6| (_ BitVec 64)) (v_ArrVal_49 (_ BitVec 32))) (let ((.cse3 (let ((.cse4 (concat ((_ extract 63 32) (bvshl ((_ sign_extend 32) (bvadd (_ bv1023 32) (bvneg (bvadd ((_ extract 31 0) (bvashr (bvand (concat ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_6|) v_ArrVal_53) (_ bv9218868437227405312 64)) (_ bv52 64))) (_ bv4294966273 32))))) (_ bv52 64))) v_ArrVal_49))) (fp ((_ extract 63 63) .cse4) ((_ extract 62 52) .cse4) ((_ extract 51 0) .cse4))))) (let ((.cse0 (fp.sub c_currentRoundingMode |c_ULTIMATE.start_inv_~xi~0#1| .cse3)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 10000000000.0))) (.cse2 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_6|)))) (and (not (fp.lt .cse0 (fp.neg .cse1))) (not (fp.gt .cse0 .cse1)) (fp.geq .cse2 ((_ to_fp 11 53) c_currentRoundingMode 20.0)) (fp.leq .cse2 ((_ to_fp 11 53) c_currentRoundingMode 30.0)) (= (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) .cse3) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse3) .cse3)) |c_ULTIMATE.start_inv_~xi~0#1|))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2022-07-22 13:56:22,034 WARN L833 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_53 (_ BitVec 32)) (|v_skolemized_q#valueAsBitvector_6| (_ BitVec 64)) (v_ArrVal_49 (_ BitVec 32))) (let ((.cse3 (let ((.cse4 (concat ((_ extract 63 32) (bvshl ((_ sign_extend 32) (bvadd (_ bv1023 32) (bvneg (bvadd ((_ extract 31 0) (bvashr (bvand (concat ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_6|) v_ArrVal_53) (_ bv9218868437227405312 64)) (_ bv52 64))) (_ bv4294966273 32))))) (_ bv52 64))) v_ArrVal_49))) (fp ((_ extract 63 63) .cse4) ((_ extract 62 52) .cse4) ((_ extract 51 0) .cse4))))) (let ((.cse0 (fp.sub c_currentRoundingMode |c_ULTIMATE.start_inv_#res#1| .cse3)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 10000000000.0))) (.cse2 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_6|)))) (and (not (fp.gt .cse0 .cse1)) (not (fp.lt .cse0 (fp.neg .cse1))) (fp.geq .cse2 ((_ to_fp 11 53) c_currentRoundingMode 20.0)) (fp.leq .cse2 ((_ to_fp 11 53) c_currentRoundingMode 30.0)) (= (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) .cse3) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 .cse3) .cse3)) |c_ULTIMATE.start_inv_#res#1|))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2022-07-22 13:57:36,509 WARN L833 $PredicateComparison]: unable to prove that (and (or (exists ((|v_skolemized_q#valueAsBitvector_6| (_ BitVec 64))) (let ((.cse0 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_6|)))) (and (fp.geq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven 20.0)) (exists ((v_ArrVal_53 (_ BitVec 32)) (v_ArrVal_49 (_ BitVec 32))) (let ((.cse4 (let ((.cse5 (concat ((_ extract 63 32) (bvshl ((_ sign_extend 32) (bvadd (_ bv1023 32) (bvneg (bvadd ((_ extract 31 0) (bvashr (bvand (concat ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_6|) v_ArrVal_53) (_ bv9218868437227405312 64)) (_ bv52 64))) (_ bv4294966273 32))))) (_ bv52 64))) v_ArrVal_49))) (fp ((_ extract 63 63) .cse5) ((_ extract 62 52) .cse5) ((_ extract 51 0) .cse5))))) (let ((.cse3 (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32)) .cse4) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_6|)) .cse4) .cse4)))) (let ((.cse1 (fp.sub roundNearestTiesToEven .cse3 .cse4)) (.cse2 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 10000000000.0)))) (and (not (fp.gt .cse1 .cse2)) (not (fp.lt .cse1 (fp.neg .cse2))) (not (fp.leq .cse3 ((_ to_fp 11 53) roundNearestTiesToEven (/ 3.0 50.0))))))))) (fp.leq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven 30.0))))) (exists ((|v_skolemized_q#valueAsBitvector_6| (_ BitVec 64))) (let ((.cse6 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_6|)))) (and (fp.geq .cse6 ((_ to_fp 11 53) roundNearestTiesToEven 20.0)) (exists ((v_ArrVal_53 (_ BitVec 32)) (v_ArrVal_49 (_ BitVec 32))) (let ((.cse8 (let ((.cse9 (concat ((_ extract 63 32) (bvshl ((_ sign_extend 32) (bvadd (_ bv1023 32) (bvneg (bvadd ((_ extract 31 0) (bvashr (bvand (concat ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_6|) v_ArrVal_53) (_ bv9218868437227405312 64)) (_ bv52 64))) (_ bv4294966273 32))))) (_ bv52 64))) v_ArrVal_49))) (fp ((_ extract 63 63) .cse9) ((_ extract 62 52) .cse9) ((_ extract 51 0) .cse9))))) (let ((.cse7 (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32)) .cse8) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_6|)) .cse8) .cse8)))) (and (not (fp.lt (fp.sub roundNearestTiesToEven .cse7 .cse8) (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 10000000000.0))))) (not (fp.geq .cse7 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))))))) (fp.leq .cse6 ((_ to_fp 11 53) roundNearestTiesToEven 30.0)))))) (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv0 32))) is different from false [2022-07-22 13:58:04,652 WARN L833 $PredicateComparison]: unable to prove that (or (exists ((|v_skolemized_q#valueAsBitvector_6| (_ BitVec 64))) (let ((.cse0 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_6|)))) (and (fp.geq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven 20.0)) (exists ((v_ArrVal_53 (_ BitVec 32)) (v_ArrVal_49 (_ BitVec 32))) (let ((.cse4 (let ((.cse5 (concat ((_ extract 63 32) (bvshl ((_ sign_extend 32) (bvadd (_ bv1023 32) (bvneg (bvadd ((_ extract 31 0) (bvashr (bvand (concat ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_6|) v_ArrVal_53) (_ bv9218868437227405312 64)) (_ bv52 64))) (_ bv4294966273 32))))) (_ bv52 64))) v_ArrVal_49))) (fp ((_ extract 63 63) .cse5) ((_ extract 62 52) .cse5) ((_ extract 51 0) .cse5))))) (let ((.cse3 (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32)) .cse4) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_6|)) .cse4) .cse4)))) (let ((.cse1 (fp.sub roundNearestTiesToEven .cse3 .cse4)) (.cse2 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 10000000000.0)))) (and (not (fp.gt .cse1 .cse2)) (not (fp.lt .cse1 (fp.neg .cse2))) (not (fp.leq .cse3 ((_ to_fp 11 53) roundNearestTiesToEven (/ 3.0 50.0))))))))) (fp.leq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven 30.0))))) (exists ((|v_skolemized_q#valueAsBitvector_6| (_ BitVec 64))) (let ((.cse6 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_6|)))) (and (fp.geq .cse6 ((_ to_fp 11 53) roundNearestTiesToEven 20.0)) (exists ((v_ArrVal_53 (_ BitVec 32)) (v_ArrVal_49 (_ BitVec 32))) (let ((.cse8 (let ((.cse9 (concat ((_ extract 63 32) (bvshl ((_ sign_extend 32) (bvadd (_ bv1023 32) (bvneg (bvadd ((_ extract 31 0) (bvashr (bvand (concat ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_6|) v_ArrVal_53) (_ bv9218868437227405312 64)) (_ bv52 64))) (_ bv4294966273 32))))) (_ bv52 64))) v_ArrVal_49))) (fp ((_ extract 63 63) .cse9) ((_ extract 62 52) .cse9) ((_ extract 51 0) .cse9))))) (let ((.cse7 (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32)) .cse8) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_6|)) .cse8) .cse8)))) (and (not (fp.lt (fp.sub roundNearestTiesToEven .cse7 .cse8) (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 10000000000.0))))) (not (fp.geq .cse7 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))))))) (fp.leq .cse6 ((_ to_fp 11 53) roundNearestTiesToEven 30.0)))))) is different from false [2022-07-22 13:58:06,738 WARN L855 $PredicateComparison]: unable to prove that (or (exists ((|v_skolemized_q#valueAsBitvector_6| (_ BitVec 64))) (let ((.cse0 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_6|)))) (and (fp.geq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven 20.0)) (exists ((v_ArrVal_53 (_ BitVec 32)) (v_ArrVal_49 (_ BitVec 32))) (let ((.cse4 (let ((.cse5 (concat ((_ extract 63 32) (bvshl ((_ sign_extend 32) (bvadd (_ bv1023 32) (bvneg (bvadd ((_ extract 31 0) (bvashr (bvand (concat ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_6|) v_ArrVal_53) (_ bv9218868437227405312 64)) (_ bv52 64))) (_ bv4294966273 32))))) (_ bv52 64))) v_ArrVal_49))) (fp ((_ extract 63 63) .cse5) ((_ extract 62 52) .cse5) ((_ extract 51 0) .cse5))))) (let ((.cse3 (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32)) .cse4) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_6|)) .cse4) .cse4)))) (let ((.cse1 (fp.sub roundNearestTiesToEven .cse3 .cse4)) (.cse2 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 10000000000.0)))) (and (not (fp.gt .cse1 .cse2)) (not (fp.lt .cse1 (fp.neg .cse2))) (not (fp.leq .cse3 ((_ to_fp 11 53) roundNearestTiesToEven (/ 3.0 50.0))))))))) (fp.leq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven 30.0))))) (exists ((|v_skolemized_q#valueAsBitvector_6| (_ BitVec 64))) (let ((.cse6 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_6|)))) (and (fp.geq .cse6 ((_ to_fp 11 53) roundNearestTiesToEven 20.0)) (exists ((v_ArrVal_53 (_ BitVec 32)) (v_ArrVal_49 (_ BitVec 32))) (let ((.cse8 (let ((.cse9 (concat ((_ extract 63 32) (bvshl ((_ sign_extend 32) (bvadd (_ bv1023 32) (bvneg (bvadd ((_ extract 31 0) (bvashr (bvand (concat ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_6|) v_ArrVal_53) (_ bv9218868437227405312 64)) (_ bv52 64))) (_ bv4294966273 32))))) (_ bv52 64))) v_ArrVal_49))) (fp ((_ extract 63 63) .cse9) ((_ extract 62 52) .cse9) ((_ extract 51 0) .cse9))))) (let ((.cse7 (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32)) .cse8) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_6|)) .cse8) .cse8)))) (and (not (fp.lt (fp.sub roundNearestTiesToEven .cse7 .cse8) (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 10000000000.0))))) (not (fp.geq .cse7 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))))))) (fp.leq .cse6 ((_ to_fp 11 53) roundNearestTiesToEven 30.0)))))) is different from true [2022-07-22 13:58:06,739 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-07-22 13:58:06,739 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 13:58:27,262 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) |c_ULTIMATE.start_inv_~xi~0#1|) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_inv_~A#1| |c_ULTIMATE.start_inv_~xi~0#1|) |c_ULTIMATE.start_inv_~xi~0#1|)))) (let ((.cse0 (fp.sub c_currentRoundingMode .cse2 |c_ULTIMATE.start_inv_~xi~0#1|)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 10000000000.0)))) (or (fp.lt .cse0 (fp.neg .cse1)) (fp.gt .cse0 .cse1) (and (fp.leq .cse2 ((_ to_fp 11 53) c_currentRoundingMode (/ 3.0 50.0))) (fp.geq .cse2 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))))))) is different from false [2022-07-22 13:58:29,398 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse2 (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) |c_ULTIMATE.start_inv_~xi~0#1|) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_inv_~A#1| |c_ULTIMATE.start_inv_~xi~0#1|) |c_ULTIMATE.start_inv_~xi~0#1|)))) (let ((.cse0 (fp.sub c_currentRoundingMode .cse2 |c_ULTIMATE.start_inv_~xi~0#1|)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 10000000000.0)))) (or (fp.lt .cse0 (fp.neg .cse1)) (fp.gt .cse0 .cse1) (and (fp.leq .cse2 ((_ to_fp 11 53) c_currentRoundingMode (/ 3.0 50.0))) (fp.geq .cse2 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))))))) is different from true