./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/float-benchs/zonotope_loose.c.v+cfa-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 20ed64ec 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/zonotope_loose.c.v+cfa-reducer.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 bbabbac29d53fb5c08c994976f0cc24cf1493748 ............................................................................................................................................................................................................................................................................................................. Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis 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/zonotope_loose.c.v+cfa-reducer.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 bbabbac29d53fb5c08c994976f0cc24cf1493748 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.1-dev-20ed64e [2021-08-26 01:07:27,662 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-26 01:07:27,664 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-26 01:07:27,695 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-26 01:07:27,695 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-26 01:07:27,696 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-26 01:07:27,698 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-26 01:07:27,699 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-26 01:07:27,701 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-26 01:07:27,702 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-26 01:07:27,703 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-26 01:07:27,704 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-26 01:07:27,704 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-26 01:07:27,716 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-26 01:07:27,717 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-26 01:07:27,718 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-26 01:07:27,719 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-26 01:07:27,720 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-26 01:07:27,721 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-26 01:07:27,723 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-26 01:07:27,724 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-26 01:07:27,729 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-26 01:07:27,732 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-26 01:07:27,733 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-26 01:07:27,740 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-26 01:07:27,745 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-26 01:07:27,746 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-26 01:07:27,747 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-26 01:07:27,750 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-26 01:07:27,751 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-26 01:07:27,751 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-26 01:07:27,752 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-26 01:07:27,753 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-26 01:07:27,754 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-26 01:07:27,755 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-26 01:07:27,756 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-26 01:07:27,756 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-26 01:07:27,757 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-26 01:07:27,757 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-26 01:07:27,759 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-26 01:07:27,759 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-26 01:07:27,762 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-08-26 01:07:27,803 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-26 01:07:27,803 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-26 01:07:27,805 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-26 01:07:27,805 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-26 01:07:27,807 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-26 01:07:27,807 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-26 01:07:27,808 INFO L138 SettingsManager]: * Use SBE=true [2021-08-26 01:07:27,808 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-26 01:07:27,808 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-26 01:07:27,808 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-26 01:07:27,809 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-26 01:07:27,810 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-26 01:07:27,810 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-08-26 01:07:27,810 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-26 01:07:27,810 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-08-26 01:07:27,810 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-26 01:07:27,810 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-26 01:07:27,811 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-26 01:07:27,811 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-08-26 01:07:27,811 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-26 01:07:27,811 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-26 01:07:27,812 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-26 01:07:27,812 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-26 01:07:27,812 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-26 01:07:27,812 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-26 01:07:27,813 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-08-26 01:07:27,813 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-26 01:07:27,813 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-08-26 01:07:27,813 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-08-26 01:07:27,813 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-26 01:07:27,814 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 -> bbabbac29d53fb5c08c994976f0cc24cf1493748 [2021-08-26 01:07:28,145 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-26 01:07:28,161 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-26 01:07:28,163 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-26 01:07:28,164 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-26 01:07:28,165 INFO L275 PluginConnector]: CDTParser initialized [2021-08-26 01:07:28,165 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-benchs/zonotope_loose.c.v+cfa-reducer.c [2021-08-26 01:07:28,217 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3e375c864/05e1a59085274d5093f5b932380de8fd/FLAG88b26f661 [2021-08-26 01:07:28,650 INFO L306 CDTParser]: Found 1 translation units. [2021-08-26 01:07:28,650 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/zonotope_loose.c.v+cfa-reducer.c [2021-08-26 01:07:28,656 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3e375c864/05e1a59085274d5093f5b932380de8fd/FLAG88b26f661 [2021-08-26 01:07:29,047 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3e375c864/05e1a59085274d5093f5b932380de8fd [2021-08-26 01:07:29,050 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-26 01:07:29,052 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-08-26 01:07:29,055 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-26 01:07:29,055 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-26 01:07:29,058 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-26 01:07:29,059 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 01:07:29" (1/1) ... [2021-08-26 01:07:29,060 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@29f9aaa5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:07:29, skipping insertion in model container [2021-08-26 01:07:29,061 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 01:07:29" (1/1) ... [2021-08-26 01:07:29,067 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-26 01:07:29,082 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-26 01:07:29,232 WARN L228 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/zonotope_loose.c.v+cfa-reducer.c[1094,1107] [2021-08-26 01:07:29,238 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-26 01:07:29,246 INFO L203 MainTranslator]: Completed pre-run [2021-08-26 01:07:29,264 WARN L228 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/zonotope_loose.c.v+cfa-reducer.c[1094,1107] [2021-08-26 01:07:29,267 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-26 01:07:29,321 INFO L208 MainTranslator]: Completed translation [2021-08-26 01:07:29,321 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:07:29 WrapperNode [2021-08-26 01:07:29,322 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-26 01:07:29,323 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-26 01:07:29,323 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-26 01:07:29,323 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-26 01:07:29,329 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:07:29" (1/1) ... [2021-08-26 01:07:29,335 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:07:29" (1/1) ... [2021-08-26 01:07:29,350 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-26 01:07:29,351 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-26 01:07:29,352 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-26 01:07:29,352 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-26 01:07:29,358 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:07:29" (1/1) ... [2021-08-26 01:07:29,358 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:07:29" (1/1) ... [2021-08-26 01:07:29,366 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:07:29" (1/1) ... [2021-08-26 01:07:29,366 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:07:29" (1/1) ... [2021-08-26 01:07:29,378 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:07:29" (1/1) ... [2021-08-26 01:07:29,380 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:07:29" (1/1) ... [2021-08-26 01:07:29,382 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:07:29" (1/1) ... [2021-08-26 01:07:29,386 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-26 01:07:29,388 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-26 01:07:29,388 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-26 01:07:29,388 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-26 01:07:29,389 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:07:29" (1/1) ... [2021-08-26 01:07:29,395 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-26 01:07:29,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 01:07:29,414 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) [2021-08-26 01:07:29,425 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 [2021-08-26 01:07:29,460 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-08-26 01:07:29,460 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-26 01:07:29,462 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-26 01:07:29,463 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-26 01:07:29,729 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-26 01:07:29,730 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2021-08-26 01:07:29,731 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 01:07:29 BoogieIcfgContainer [2021-08-26 01:07:29,731 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-26 01:07:29,733 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-26 01:07:29,733 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-26 01:07:29,735 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-26 01:07:29,735 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.08 01:07:29" (1/3) ... [2021-08-26 01:07:29,736 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24f02104 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 01:07:29, skipping insertion in model container [2021-08-26 01:07:29,736 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:07:29" (2/3) ... [2021-08-26 01:07:29,736 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24f02104 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 01:07:29, skipping insertion in model container [2021-08-26 01:07:29,736 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 01:07:29" (3/3) ... [2021-08-26 01:07:29,737 INFO L111 eAbstractionObserver]: Analyzing ICFG zonotope_loose.c.v+cfa-reducer.c [2021-08-26 01:07:29,741 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-26 01:07:29,742 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-08-26 01:07:29,796 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-08-26 01:07:29,801 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-08-26 01:07:29,802 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-08-26 01:07:29,815 INFO L276 IsEmpty]: Start isEmpty. Operand has 17 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 16 states have internal predecessors, (23), 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) [2021-08-26 01:07:29,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-08-26 01:07:29,821 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 01:07:29,822 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 01:07:29,823 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 01:07:29,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 01:07:29,831 INFO L82 PathProgramCache]: Analyzing trace with hash 570602568, now seen corresponding path program 1 times [2021-08-26 01:07:29,838 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 01:07:29,840 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818827144] [2021-08-26 01:07:29,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 01:07:29,841 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 01:07:29,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 01:07:30,074 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 01:07:30,075 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 01:07:30,076 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818827144] [2021-08-26 01:07:30,077 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1818827144] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 01:07:30,077 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 01:07:30,077 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-26 01:07:30,079 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757469590] [2021-08-26 01:07:30,092 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-26 01:07:30,092 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 01:07:30,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-26 01:07:30,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-26 01:07:30,109 INFO L87 Difference]: Start difference. First operand has 17 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 16 states have internal predecessors, (23), 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 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 01:07:30,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 01:07:30,209 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2021-08-26 01:07:30,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-26 01:07:30,211 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2021-08-26 01:07:30,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 01:07:30,218 INFO L225 Difference]: With dead ends: 30 [2021-08-26 01:07:30,218 INFO L226 Difference]: Without dead ends: 14 [2021-08-26 01:07:30,221 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 78.5ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-08-26 01:07:30,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2021-08-26 01:07:30,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2021-08-26 01:07:30,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 01:07:30,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2021-08-26 01:07:30,245 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 12 [2021-08-26 01:07:30,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 01:07:30,246 INFO L470 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2021-08-26 01:07:30,246 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 01:07:30,246 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2021-08-26 01:07:30,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-08-26 01:07:30,247 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 01:07:30,247 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 01:07:30,247 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-08-26 01:07:30,247 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 01:07:30,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 01:07:30,248 INFO L82 PathProgramCache]: Analyzing trace with hash 587613229, now seen corresponding path program 1 times [2021-08-26 01:07:30,248 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 01:07:30,249 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999353602] [2021-08-26 01:07:30,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 01:07:30,249 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 01:07:30,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-26 01:07:30,262 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-26 01:07:30,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-26 01:07:30,299 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-26 01:07:30,299 INFO L626 BasicCegarLoop]: Counterexample is feasible [2021-08-26 01:07:30,301 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-08-26 01:07:30,302 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-08-26 01:07:30,307 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-08-26 01:07:30,340 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.08 01:07:30 BoogieIcfgContainer [2021-08-26 01:07:30,340 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-08-26 01:07:30,341 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-08-26 01:07:30,341 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-08-26 01:07:30,342 INFO L275 PluginConnector]: Witness Printer initialized [2021-08-26 01:07:30,342 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 01:07:29" (3/4) ... [2021-08-26 01:07:30,349 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-08-26 01:07:30,349 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-08-26 01:07:30,352 INFO L168 Benchmark]: Toolchain (without parser) took 1297.90 ms. Allocated memory was 50.3 MB in the beginning and 73.4 MB in the end (delta: 23.1 MB). Free memory was 25.7 MB in the beginning and 55.6 MB in the end (delta: -29.9 MB). Peak memory consumption was 12.1 MB. Max. memory is 16.1 GB. [2021-08-26 01:07:30,353 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 50.3 MB. Free memory was 32.2 MB in the beginning and 32.2 MB in the end (delta: 51.7 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-26 01:07:30,355 INFO L168 Benchmark]: CACSL2BoogieTranslator took 267.23 ms. Allocated memory was 50.3 MB in the beginning and 60.8 MB in the end (delta: 10.5 MB). Free memory was 25.5 MB in the beginning and 44.4 MB in the end (delta: -18.9 MB). Peak memory consumption was 5.6 MB. Max. memory is 16.1 GB. [2021-08-26 01:07:30,356 INFO L168 Benchmark]: Boogie Procedure Inliner took 27.54 ms. Allocated memory is still 60.8 MB. Free memory was 44.4 MB in the beginning and 43.0 MB in the end (delta: 1.4 MB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-26 01:07:30,361 INFO L168 Benchmark]: Boogie Preprocessor took 35.56 ms. Allocated memory is still 60.8 MB. Free memory was 43.0 MB in the beginning and 42.0 MB in the end (delta: 1.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-08-26 01:07:30,362 INFO L168 Benchmark]: RCFGBuilder took 343.67 ms. Allocated memory is still 60.8 MB. Free memory was 41.9 MB in the beginning and 42.8 MB in the end (delta: -951.8 kB). Peak memory consumption was 13.7 MB. Max. memory is 16.1 GB. [2021-08-26 01:07:30,362 INFO L168 Benchmark]: TraceAbstraction took 607.67 ms. Allocated memory is still 60.8 MB. Free memory was 42.4 MB in the beginning and 26.9 MB in the end (delta: 15.5 MB). Peak memory consumption was 15.2 MB. Max. memory is 16.1 GB. [2021-08-26 01:07:30,363 INFO L168 Benchmark]: Witness Printer took 8.19 ms. Allocated memory was 60.8 MB in the beginning and 73.4 MB in the end (delta: 12.6 MB). Free memory was 26.7 MB in the beginning and 55.6 MB in the end (delta: -28.9 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-08-26 01:07:30,369 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.17 ms. Allocated memory is still 50.3 MB. Free memory was 32.2 MB in the beginning and 32.2 MB in the end (delta: 51.7 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 267.23 ms. Allocated memory was 50.3 MB in the beginning and 60.8 MB in the end (delta: 10.5 MB). Free memory was 25.5 MB in the beginning and 44.4 MB in the end (delta: -18.9 MB). Peak memory consumption was 5.6 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 27.54 ms. Allocated memory is still 60.8 MB. Free memory was 44.4 MB in the beginning and 43.0 MB in the end (delta: 1.4 MB). There was no memory consumed. Max. memory is 16.1 GB. * Boogie Preprocessor took 35.56 ms. Allocated memory is still 60.8 MB. Free memory was 43.0 MB in the beginning and 42.0 MB in the end (delta: 1.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 343.67 ms. Allocated memory is still 60.8 MB. Free memory was 41.9 MB in the beginning and 42.8 MB in the end (delta: -951.8 kB). Peak memory consumption was 13.7 MB. Max. memory is 16.1 GB. * TraceAbstraction took 607.67 ms. Allocated memory is still 60.8 MB. Free memory was 42.4 MB in the beginning and 26.9 MB in the end (delta: 15.5 MB). Peak memory consumption was 15.2 MB. Max. memory is 16.1 GB. * Witness Printer took 8.19 ms. Allocated memory was 60.8 MB in the beginning and 73.4 MB in the end (delta: 12.6 MB). Free memory was 26.7 MB in the beginning and 55.6 MB in the end (delta: -28.9 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 45]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 32, overapproximation of someBinaryArithmeticDOUBLEoperation at line 69. Possible FailurePath: [L1] int __return_main; [L12] int __return_76; VAL [__return_76=0, __return_main=0] [L15] double main__x; [L16] double main__y; [L17] main__x = __VERIFIER_nondet_double() [L18] int main____CPAchecker_TMP_0; VAL [__return_76=0, __return_main=0] [L19] COND TRUE main__x >= 0.0 VAL [__return_76=0, __return_main=0] [L21] COND TRUE main__x <= 10.0 [L23] main____CPAchecker_TMP_0 = 1 VAL [__return_76=0, __return_main=0] [L24] COND TRUE main____CPAchecker_TMP_0 != 0 [L26] main__y = (main__x * main__x) - main__x VAL [__return_76=0, __return_main=0] [L27] COND FALSE !(main__y >= 0) [L69] main__y = (main__x * main__x) + 2.0 VAL [__return_76=0, __return_main=0] [L31] int main____CPAchecker_TMP_1; VAL [__return_76=0, __return_main=0] [L32] COND FALSE !(main__y >= 0.0) VAL [__return_76=0, __return_main=0] [L58] main____CPAchecker_TMP_1 = 0 VAL [__return_76=0, __return_main=0] [L39] int __tmp_1; [L40] __tmp_1 = main____CPAchecker_TMP_1 [L41] int __VERIFIER_assert__cond; [L42] __VERIFIER_assert__cond = __tmp_1 VAL [__return_76=0, __return_main=0] [L43] COND TRUE __VERIFIER_assert__cond == 0 VAL [__return_76=0, __return_main=0] [L45] reach_error() VAL [__return_76=0, __return_main=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 17 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 511.8ms, OverallIterations: 2, TraceHistogramMax: 1, EmptinessCheckTime: 10.2ms, AutomataDifference: 128.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 9.4ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 20 SDtfs, 28 SDslu, 39 SDs, 0 SdLazy, 13 SolverSat, 2 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 24.0ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 78.5ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=17occurred in iteration=0, InterpolantAutomatonStates: 6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 12.5ms AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 10.1ms SsaConstructionTime, 38.4ms SatisfiabilityAnalysisTime, 141.8ms InterpolantComputationTime, 24 NumberOfCodeBlocks, 24 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 11 ConstructedInterpolants, 0 QuantifiedInterpolants, 19 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2021-08-26 01:07:30,410 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... ### Bit-precise run ### This is Ultimate 0.2.1-dev-20ed64e [2021-08-26 01:07:32,300 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-26 01:07:32,303 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-26 01:07:32,345 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-26 01:07:32,346 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-26 01:07:32,349 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-26 01:07:32,351 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-26 01:07:32,356 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-26 01:07:32,358 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-26 01:07:32,371 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-26 01:07:32,372 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-26 01:07:32,376 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-26 01:07:32,376 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-26 01:07:32,379 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-26 01:07:32,380 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-26 01:07:32,384 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-26 01:07:32,385 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-26 01:07:32,388 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-26 01:07:32,391 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-26 01:07:32,396 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-26 01:07:32,398 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-26 01:07:32,399 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-26 01:07:32,400 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-26 01:07:32,401 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-26 01:07:32,408 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-26 01:07:32,410 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-26 01:07:32,410 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-26 01:07:32,411 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-26 01:07:32,412 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-26 01:07:32,417 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-26 01:07:32,417 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-26 01:07:32,418 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-26 01:07:32,419 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-26 01:07:32,420 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-26 01:07:32,421 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-26 01:07:32,421 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-26 01:07:32,422 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-26 01:07:32,422 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-26 01:07:32,422 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-26 01:07:32,424 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-26 01:07:32,424 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-26 01:07:32,425 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2021-08-26 01:07:32,459 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-26 01:07:32,459 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-26 01:07:32,460 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-26 01:07:32,461 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-26 01:07:32,463 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-26 01:07:32,463 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-26 01:07:32,463 INFO L138 SettingsManager]: * Use SBE=true [2021-08-26 01:07:32,463 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-26 01:07:32,464 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-26 01:07:32,464 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-26 01:07:32,465 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-26 01:07:32,465 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-08-26 01:07:32,465 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-26 01:07:32,465 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-08-26 01:07:32,465 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-08-26 01:07:32,466 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-08-26 01:07:32,466 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-26 01:07:32,466 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-26 01:07:32,466 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-26 01:07:32,466 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-08-26 01:07:32,467 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-26 01:07:32,467 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-26 01:07:32,467 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-26 01:07:32,467 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-26 01:07:32,467 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-26 01:07:32,467 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-26 01:07:32,468 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-08-26 01:07:32,468 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-08-26 01:07:32,468 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-08-26 01:07:32,468 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-08-26 01:07:32,468 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-26 01:07:32,469 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-08-26 01:07:32,469 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 -> bbabbac29d53fb5c08c994976f0cc24cf1493748 [2021-08-26 01:07:32,796 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-26 01:07:32,820 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-26 01:07:32,822 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-26 01:07:32,823 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-26 01:07:32,824 INFO L275 PluginConnector]: CDTParser initialized [2021-08-26 01:07:32,825 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-benchs/zonotope_loose.c.v+cfa-reducer.c [2021-08-26 01:07:32,873 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6923eb035/a669579f559f4033821eaab2f15737d3/FLAG6c24d1a83 [2021-08-26 01:07:33,268 INFO L306 CDTParser]: Found 1 translation units. [2021-08-26 01:07:33,269 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/zonotope_loose.c.v+cfa-reducer.c [2021-08-26 01:07:33,275 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6923eb035/a669579f559f4033821eaab2f15737d3/FLAG6c24d1a83 [2021-08-26 01:07:33,672 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6923eb035/a669579f559f4033821eaab2f15737d3 [2021-08-26 01:07:33,674 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-26 01:07:33,675 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-08-26 01:07:33,677 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-26 01:07:33,677 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-26 01:07:33,680 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-26 01:07:33,681 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 01:07:33" (1/1) ... [2021-08-26 01:07:33,682 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@195b3662 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:07:33, skipping insertion in model container [2021-08-26 01:07:33,683 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 01:07:33" (1/1) ... [2021-08-26 01:07:33,688 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-26 01:07:33,701 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-26 01:07:33,816 WARN L228 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/zonotope_loose.c.v+cfa-reducer.c[1094,1107] [2021-08-26 01:07:33,821 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-26 01:07:33,834 INFO L203 MainTranslator]: Completed pre-run [2021-08-26 01:07:33,847 WARN L228 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/zonotope_loose.c.v+cfa-reducer.c[1094,1107] [2021-08-26 01:07:33,849 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-26 01:07:33,862 INFO L208 MainTranslator]: Completed translation [2021-08-26 01:07:33,862 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:07:33 WrapperNode [2021-08-26 01:07:33,863 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-26 01:07:33,864 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-26 01:07:33,864 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-26 01:07:33,864 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-26 01:07:33,870 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:07:33" (1/1) ... [2021-08-26 01:07:33,877 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:07:33" (1/1) ... [2021-08-26 01:07:33,931 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-26 01:07:33,932 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-26 01:07:33,932 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-26 01:07:33,932 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-26 01:07:33,938 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:07:33" (1/1) ... [2021-08-26 01:07:33,939 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:07:33" (1/1) ... [2021-08-26 01:07:33,951 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:07:33" (1/1) ... [2021-08-26 01:07:33,951 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:07:33" (1/1) ... [2021-08-26 01:07:33,963 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:07:33" (1/1) ... [2021-08-26 01:07:33,966 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:07:33" (1/1) ... [2021-08-26 01:07:33,971 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:07:33" (1/1) ... [2021-08-26 01:07:33,976 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-26 01:07:33,977 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-26 01:07:33,978 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-26 01:07:33,978 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-26 01:07:33,979 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:07:33" (1/1) ... [2021-08-26 01:07:33,988 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-26 01:07:33,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 01:07:34,014 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) [2021-08-26 01:07:34,039 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 [2021-08-26 01:07:34,058 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-08-26 01:07:34,058 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-26 01:07:34,059 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-26 01:07:34,059 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-26 01:07:37,312 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-26 01:07:37,312 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2021-08-26 01:07:37,314 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 01:07:37 BoogieIcfgContainer [2021-08-26 01:07:37,314 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-26 01:07:37,315 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-26 01:07:37,315 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-26 01:07:37,318 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-26 01:07:37,318 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.08 01:07:33" (1/3) ... [2021-08-26 01:07:37,319 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33c9678b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 01:07:37, skipping insertion in model container [2021-08-26 01:07:37,319 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:07:33" (2/3) ... [2021-08-26 01:07:37,319 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33c9678b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 01:07:37, skipping insertion in model container [2021-08-26 01:07:37,319 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 01:07:37" (3/3) ... [2021-08-26 01:07:37,321 INFO L111 eAbstractionObserver]: Analyzing ICFG zonotope_loose.c.v+cfa-reducer.c [2021-08-26 01:07:37,330 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-26 01:07:37,330 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-08-26 01:07:37,378 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-08-26 01:07:37,394 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-08-26 01:07:37,394 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-08-26 01:07:37,404 INFO L276 IsEmpty]: Start isEmpty. Operand has 17 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 16 states have internal predecessors, (23), 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) [2021-08-26 01:07:37,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-08-26 01:07:37,408 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 01:07:37,408 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 01:07:37,408 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 01:07:37,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 01:07:37,413 INFO L82 PathProgramCache]: Analyzing trace with hash 570602568, now seen corresponding path program 1 times [2021-08-26 01:07:37,424 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-26 01:07:37,424 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [962224934] [2021-08-26 01:07:37,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 01:07:37,426 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-26 01:07:37,426 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-26 01:07:37,428 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) [2021-08-26 01:07:37,461 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-08-26 01:07:37,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 01:07:37,857 INFO L263 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 4 conjunts are in the unsatisfiable core [2021-08-26 01:07:37,861 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 01:07:38,044 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 01:07:38,044 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-26 01:07:38,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 01:07:38,182 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-26 01:07:38,182 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [962224934] [2021-08-26 01:07:38,182 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [962224934] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-26 01:07:38,183 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-26 01:07:38,183 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2021-08-26 01:07:38,184 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194942674] [2021-08-26 01:07:38,188 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-26 01:07:38,189 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-26 01:07:38,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-26 01:07:38,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-08-26 01:07:38,200 INFO L87 Difference]: Start difference. First operand has 17 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 16 states have internal predecessors, (23), 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 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 01:07:38,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 01:07:38,324 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2021-08-26 01:07:38,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-26 01:07:38,326 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2021-08-26 01:07:38,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 01:07:38,332 INFO L225 Difference]: With dead ends: 30 [2021-08-26 01:07:38,332 INFO L226 Difference]: Without dead ends: 14 [2021-08-26 01:07:38,335 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 137.5ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-08-26 01:07:38,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2021-08-26 01:07:38,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2021-08-26 01:07:38,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 01:07:38,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2021-08-26 01:07:38,355 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 12 [2021-08-26 01:07:38,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 01:07:38,355 INFO L470 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2021-08-26 01:07:38,356 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 01:07:38,356 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2021-08-26 01:07:38,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-08-26 01:07:38,356 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 01:07:38,357 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 01:07:38,371 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2021-08-26 01:07:38,561 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-26 01:07:38,561 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 01:07:38,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 01:07:38,562 INFO L82 PathProgramCache]: Analyzing trace with hash 587613229, now seen corresponding path program 1 times [2021-08-26 01:07:38,562 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-26 01:07:38,563 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [354907565] [2021-08-26 01:07:38,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 01:07:38,563 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-26 01:07:38,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-26 01:07:38,564 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) [2021-08-26 01:07:38,566 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-08-26 01:07:38,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 01:07:38,915 INFO L263 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 4 conjunts are in the unsatisfiable core [2021-08-26 01:07:38,916 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 01:07:46,171 WARN L860 $PredicateComparison]: unable to prove that (exists ((ULTIMATE.start_main_~main__x~0 (_ FloatingPoint 11 53))) (and (= c_ULTIMATE.start_main_~main__y~0 (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven ULTIMATE.start_main_~main__x~0 ULTIMATE.start_main_~main__x~0) ((_ to_fp 11 53) roundNearestTiesToEven 2.0))) (fp.geq ULTIMATE.start_main_~main__x~0 (_ +zero 11 53)))) is different from true [2021-08-26 01:08:04,325 WARN L838 $PredicateComparison]: unable to prove that (exists ((ULTIMATE.start_main_~main__x~0 (_ FloatingPoint 11 53))) (and (fp.geq ULTIMATE.start_main_~main__x~0 (_ +zero 11 53)) (not (fp.geq (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven ULTIMATE.start_main_~main__x~0 ULTIMATE.start_main_~main__x~0) ((_ to_fp 11 53) roundNearestTiesToEven 2.0)) (_ +zero 11 53))))) is different from false [2021-08-26 01:08:06,358 WARN L860 $PredicateComparison]: unable to prove that (exists ((ULTIMATE.start_main_~main__x~0 (_ FloatingPoint 11 53))) (and (fp.geq ULTIMATE.start_main_~main__x~0 (_ +zero 11 53)) (not (fp.geq (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven ULTIMATE.start_main_~main__x~0 ULTIMATE.start_main_~main__x~0) ((_ to_fp 11 53) roundNearestTiesToEven 2.0)) (_ +zero 11 53))))) is different from true [2021-08-26 01:08:35,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 01:08:35,335 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-26 01:08:43,003 WARN L860 $PredicateComparison]: unable to prove that (fp.geq (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~main__x~0 c_ULTIMATE.start_main_~main__x~0) ((_ to_fp 11 53) c_currentRoundingMode 2.0)) (_ +zero 11 53)) is different from true [2021-08-26 01:09:00,502 WARN L838 $PredicateComparison]: unable to prove that (forall ((ULTIMATE.start_main_~main__x~0 (_ FloatingPoint 11 53))) (or (fp.geq (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ULTIMATE.start_main_~main__x~0 ULTIMATE.start_main_~main__x~0) ((_ to_fp 11 53) c_currentRoundingMode 2.0)) (_ +zero 11 53)) (not (fp.geq ULTIMATE.start_main_~main__x~0 (_ +zero 11 53))))) is different from false [2021-08-26 01:09:02,557 WARN L860 $PredicateComparison]: unable to prove that (forall ((ULTIMATE.start_main_~main__x~0 (_ FloatingPoint 11 53))) (or (fp.geq (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ULTIMATE.start_main_~main__x~0 ULTIMATE.start_main_~main__x~0) ((_ to_fp 11 53) c_currentRoundingMode 2.0)) (_ +zero 11 53)) (not (fp.geq ULTIMATE.start_main_~main__x~0 (_ +zero 11 53))))) is different from true [2021-08-26 01:09:10,792 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 01:09:10,793 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-26 01:09:10,793 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [354907565] [2021-08-26 01:09:10,793 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [354907565] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-26 01:09:10,793 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-26 01:09:10,793 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 8 [2021-08-26 01:09:10,793 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654445485] [2021-08-26 01:09:10,794 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-08-26 01:09:10,795 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-26 01:09:10,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-08-26 01:09:10,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=14, Unknown=6, NotChecked=36, Total=72 [2021-08-26 01:09:10,796 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 8 states have internal predecessors, (24), 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) [2021-08-26 01:09:12,851 WARN L838 $PredicateComparison]: unable to prove that (and (= c_currentRoundingMode roundNearestTiesToEven) (forall ((ULTIMATE.start_main_~main__x~0 (_ FloatingPoint 11 53))) (or (fp.geq (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ULTIMATE.start_main_~main__x~0 ULTIMATE.start_main_~main__x~0) ((_ to_fp 11 53) c_currentRoundingMode 2.0)) (_ +zero 11 53)) (not (fp.geq ULTIMATE.start_main_~main__x~0 (_ +zero 11 53)))))) is different from false [2021-08-26 01:09:18,159 WARN L860 $PredicateComparison]: unable to prove that (and (fp.geq c_ULTIMATE.start_main_~main__x~0 (_ +zero 11 53)) (fp.geq (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~main__x~0 c_ULTIMATE.start_main_~main__x~0) ((_ to_fp 11 53) c_currentRoundingMode 2.0)) (_ +zero 11 53)) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2021-08-26 01:09:28,486 WARN L207 SmtUtils]: Spent 6.63 s on a formula simplification that was a NOOP. DAG size: 14 [2021-08-26 01:09:30,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 01:09:30,640 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2021-08-26 01:09:30,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-26 01:09:30,641 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 8 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2021-08-26 01:09:30,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 01:09:30,641 INFO L225 Difference]: With dead ends: 21 [2021-08-26 01:09:30,642 INFO L226 Difference]: Without dead ends: 16 [2021-08-26 01:09:30,643 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 31912.2ms TimeCoverageRelationStatistics Valid=23, Invalid=22, Unknown=9, NotChecked=78, Total=132 [2021-08-26 01:09:30,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2021-08-26 01:09:30,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2021-08-26 01:09:30,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 15 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) [2021-08-26 01:09:30,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2021-08-26 01:09:30,646 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 12 [2021-08-26 01:09:30,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 01:09:30,646 INFO L470 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2021-08-26 01:09:30,647 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 8 states have internal predecessors, (24), 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) [2021-08-26 01:09:30,647 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2021-08-26 01:09:30,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-08-26 01:09:30,647 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 01:09:30,648 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 01:09:30,664 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2021-08-26 01:09:30,848 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-26 01:09:30,849 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 01:09:30,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 01:09:30,849 INFO L82 PathProgramCache]: Analyzing trace with hash -125142316, now seen corresponding path program 1 times [2021-08-26 01:09:30,850 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-26 01:09:30,850 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [547145925] [2021-08-26 01:09:30,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 01:09:30,851 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-26 01:09:30,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-26 01:09:30,852 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) [2021-08-26 01:09:30,853 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-08-26 01:09:31,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 01:09:31,264 INFO L263 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 3 conjunts are in the unsatisfiable core [2021-08-26 01:09:31,266 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 01:09:43,337 WARN L860 $PredicateComparison]: unable to prove that (exists ((ULTIMATE.start_main_~main__x~0 (_ FloatingPoint 11 53)) (currentRoundingMode RoundingMode)) (and (= (fp.div currentRoundingMode ULTIMATE.start_main_~main__x~0 ((_ to_fp 11 53) currentRoundingMode 10.0)) c_ULTIMATE.start_main_~main__y~0) (fp.geq ULTIMATE.start_main_~main__x~0 (_ +zero 11 53)))) is different from true [2021-08-26 01:10:10,425 WARN L838 $PredicateComparison]: unable to prove that (exists ((ULTIMATE.start_main_~main__x~0 (_ FloatingPoint 11 53)) (currentRoundingMode RoundingMode)) (and (fp.geq ULTIMATE.start_main_~main__x~0 (_ +zero 11 53)) (not (fp.geq (fp.div currentRoundingMode ULTIMATE.start_main_~main__x~0 ((_ to_fp 11 53) currentRoundingMode 10.0)) (_ +zero 11 53))))) is different from false [2021-08-26 01:10:12,515 WARN L860 $PredicateComparison]: unable to prove that (exists ((ULTIMATE.start_main_~main__x~0 (_ FloatingPoint 11 53)) (currentRoundingMode RoundingMode)) (and (fp.geq ULTIMATE.start_main_~main__x~0 (_ +zero 11 53)) (not (fp.geq (fp.div currentRoundingMode ULTIMATE.start_main_~main__x~0 ((_ to_fp 11 53) currentRoundingMode 10.0)) (_ +zero 11 53))))) is different from true [2021-08-26 01:10:57,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 01:10:57,955 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-26 01:11:04,180 WARN L860 $PredicateComparison]: unable to prove that (forall ((currentRoundingMode RoundingMode)) (fp.geq (fp.div currentRoundingMode c_ULTIMATE.start_main_~main__x~0 ((_ to_fp 11 53) currentRoundingMode 10.0)) (_ +zero 11 53))) is different from true [2021-08-26 01:11:25,096 WARN L838 $PredicateComparison]: unable to prove that (forall ((ULTIMATE.start_main_~main__x~0 (_ FloatingPoint 11 53))) (or (not (fp.geq ULTIMATE.start_main_~main__x~0 (_ +zero 11 53))) (forall ((currentRoundingMode RoundingMode)) (fp.geq (fp.div currentRoundingMode ULTIMATE.start_main_~main__x~0 ((_ to_fp 11 53) currentRoundingMode 10.0)) (_ +zero 11 53))))) is different from false [2021-08-26 01:11:27,219 WARN L860 $PredicateComparison]: unable to prove that (forall ((ULTIMATE.start_main_~main__x~0 (_ FloatingPoint 11 53))) (or (not (fp.geq ULTIMATE.start_main_~main__x~0 (_ +zero 11 53))) (forall ((currentRoundingMode RoundingMode)) (fp.geq (fp.div currentRoundingMode ULTIMATE.start_main_~main__x~0 ((_ to_fp 11 53) currentRoundingMode 10.0)) (_ +zero 11 53))))) is different from true [2021-08-26 01:11:37,864 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 01:11:37,864 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-26 01:11:37,865 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [547145925] [2021-08-26 01:11:37,865 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [547145925] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-26 01:11:37,865 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-26 01:11:37,865 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 8 [2021-08-26 01:11:37,865 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124827570] [2021-08-26 01:11:37,865 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-08-26 01:11:37,865 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-26 01:11:37,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-26 01:11:37,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=9, Unknown=6, NotChecked=28, Total=56 [2021-08-26 01:11:37,866 INFO L87 Difference]: Start difference. First operand 16 states and 17 transitions. Second operand has 8 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 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) [2021-08-26 01:11:39,997 WARN L860 $PredicateComparison]: unable to prove that (and (fp.geq c_ULTIMATE.start_main_~main__x~0 (_ +zero 11 53)) (forall ((currentRoundingMode RoundingMode)) (fp.geq (fp.div currentRoundingMode c_ULTIMATE.start_main_~main__x~0 ((_ to_fp 11 53) currentRoundingMode 10.0)) (_ +zero 11 53)))) is different from true [2021-08-26 01:11:52,505 WARN L207 SmtUtils]: Spent 9.35 s on a formula simplification that was a NOOP. DAG size: 13 [2021-08-26 01:11:54,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 01:11:54,981 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2021-08-26 01:11:54,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-26 01:11:54,982 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2021-08-26 01:11:54,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 01:11:54,983 INFO L225 Difference]: With dead ends: 21 [2021-08-26 01:11:54,983 INFO L226 Difference]: Without dead ends: 16 [2021-08-26 01:11:54,983 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 27878.8ms TimeCoverageRelationStatistics Valid=18, Invalid=14, Unknown=8, NotChecked=50, Total=90 [2021-08-26 01:11:54,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2021-08-26 01:11:54,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 14. [2021-08-26 01:11:54,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 01:11:54,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2021-08-26 01:11:54,986 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2021-08-26 01:11:54,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 01:11:54,986 INFO L470 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2021-08-26 01:11:54,986 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 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) [2021-08-26 01:11:54,987 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2021-08-26 01:11:54,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-08-26 01:11:54,987 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 01:11:54,987 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 01:11:55,005 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2021-08-26 01:11:55,195 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-26 01:11:55,195 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 01:11:55,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 01:11:55,196 INFO L82 PathProgramCache]: Analyzing trace with hash 519293970, now seen corresponding path program 1 times [2021-08-26 01:11:55,196 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-26 01:11:55,196 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [816827022] [2021-08-26 01:11:55,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 01:11:55,197 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-26 01:11:55,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-26 01:11:55,199 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-26 01:11:55,201 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-08-26 01:11:55,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 01:11:55,587 INFO L263 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 8 conjunts are in the unsatisfiable core [2021-08-26 01:11:55,588 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 01:12:09,656 WARN L838 $PredicateComparison]: unable to prove that (and (fp.geq c_ULTIMATE.start_main_~main__x~0 (_ +zero 11 53)) (fp.leq c_ULTIMATE.start_main_~main__x~0 ((_ to_fp 11 53) c_currentRoundingMode 10.0)) (= (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~main__x~0 c_ULTIMATE.start_main_~main__x~0) c_ULTIMATE.start_main_~main__x~0) c_ULTIMATE.start_main_~main__y~0) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2021-08-26 01:12:11,700 WARN L860 $PredicateComparison]: unable to prove that (and (fp.geq c_ULTIMATE.start_main_~main__x~0 (_ +zero 11 53)) (fp.leq c_ULTIMATE.start_main_~main__x~0 ((_ to_fp 11 53) c_currentRoundingMode 10.0)) (= (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~main__x~0 c_ULTIMATE.start_main_~main__x~0) c_ULTIMATE.start_main_~main__x~0) c_ULTIMATE.start_main_~main__y~0) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2021-08-26 01:12:30,001 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((ULTIMATE.start_main_~main__x~0 (_ FloatingPoint 11 53))) (let ((.cse0 (fp.mul c_currentRoundingMode ULTIMATE.start_main_~main__x~0 ULTIMATE.start_main_~main__x~0))) (and (fp.geq ULTIMATE.start_main_~main__x~0 (_ +zero 11 53)) (fp.leq ULTIMATE.start_main_~main__x~0 ((_ to_fp 11 53) c_currentRoundingMode 10.0)) (not (fp.geq (fp.sub c_currentRoundingMode .cse0 ULTIMATE.start_main_~main__x~0) ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (= c_ULTIMATE.start_main_~main__y~0 (fp.add c_currentRoundingMode .cse0 ((_ to_fp 11 53) c_currentRoundingMode 2.0)))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2021-08-26 01:13:02,239 WARN L838 $PredicateComparison]: unable to prove that (and (fp.geq c_ULTIMATE.start_main_~main__y~0 (_ +zero 11 53)) (exists ((ULTIMATE.start_main_~main__x~0 (_ FloatingPoint 11 53))) (let ((.cse0 (fp.mul c_currentRoundingMode ULTIMATE.start_main_~main__x~0 ULTIMATE.start_main_~main__x~0))) (and (fp.leq ULTIMATE.start_main_~main__x~0 ((_ to_fp 11 53) c_currentRoundingMode 10.0)) (not (fp.geq (fp.sub c_currentRoundingMode .cse0 ULTIMATE.start_main_~main__x~0) ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (= c_ULTIMATE.start_main_~main__y~0 (fp.add c_currentRoundingMode .cse0 ((_ to_fp 11 53) c_currentRoundingMode 2.0)))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2021-08-26 01:13:23,025 WARN L838 $PredicateComparison]: unable to prove that (exists ((ULTIMATE.start_main_~main__x~0 (_ FloatingPoint 11 53))) (let ((.cse0 (fp.mul roundNearestTiesToEven ULTIMATE.start_main_~main__x~0 ULTIMATE.start_main_~main__x~0))) (let ((.cse1 (fp.add roundNearestTiesToEven .cse0 ((_ to_fp 11 53) roundNearestTiesToEven 2.0)))) (and (fp.leq ULTIMATE.start_main_~main__x~0 ((_ to_fp 11 53) roundNearestTiesToEven 10.0)) (not (fp.geq (fp.sub roundNearestTiesToEven .cse0 ULTIMATE.start_main_~main__x~0) ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (not (fp.leq .cse1 ((_ to_fp 11 53) roundNearestTiesToEven 105.0))) (fp.geq .cse1 (_ +zero 11 53)))))) is different from false [2021-08-26 01:13:26,047 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 01:13:26,047 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-26 01:13:37,709 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~main__x~0 c_ULTIMATE.start_main_~main__x~0) ((_ to_fp 11 53) c_currentRoundingMode 2.0)))) (or (not (fp.geq .cse0 (_ +zero 11 53))) (fp.leq .cse0 ((_ to_fp 11 53) c_currentRoundingMode 105.0)) (fp.geq c_ULTIMATE.start_main_~main__y~0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))))) is different from false [2021-08-26 01:13:39,762 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~main__x~0 c_ULTIMATE.start_main_~main__x~0) ((_ to_fp 11 53) c_currentRoundingMode 2.0)))) (or (not (fp.geq .cse0 (_ +zero 11 53))) (fp.leq .cse0 ((_ to_fp 11 53) c_currentRoundingMode 105.0)) (fp.geq c_ULTIMATE.start_main_~main__y~0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))))) is different from true [2021-08-26 01:13:54,347 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~main__x~0 c_ULTIMATE.start_main_~main__x~0))) (let ((.cse0 (fp.add c_currentRoundingMode .cse1 ((_ to_fp 11 53) c_currentRoundingMode 2.0)))) (or (not (fp.geq .cse0 (_ +zero 11 53))) (fp.leq .cse0 ((_ to_fp 11 53) c_currentRoundingMode 105.0)) (fp.geq (fp.sub c_currentRoundingMode .cse1 c_ULTIMATE.start_main_~main__x~0) ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))))) is different from false [2021-08-26 01:13:56,411 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~main__x~0 c_ULTIMATE.start_main_~main__x~0))) (let ((.cse0 (fp.add c_currentRoundingMode .cse1 ((_ to_fp 11 53) c_currentRoundingMode 2.0)))) (or (not (fp.geq .cse0 (_ +zero 11 53))) (fp.leq .cse0 ((_ to_fp 11 53) c_currentRoundingMode 105.0)) (fp.geq (fp.sub c_currentRoundingMode .cse1 c_ULTIMATE.start_main_~main__x~0) ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))))) is different from true [2021-08-26 01:14:00,407 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 01:14:00,407 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-26 01:14:00,407 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [816827022] [2021-08-26 01:14:00,408 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [816827022] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-26 01:14:00,408 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-26 01:14:00,408 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 6] imperfect sequences [] total 13 [2021-08-26 01:14:00,408 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174000597] [2021-08-26 01:14:00,409 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-08-26 01:14:00,409 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-26 01:14:00,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-08-26 01:14:00,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=30, Unknown=9, NotChecked=90, Total=156 [2021-08-26 01:14:00,410 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand has 13 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 13 states have internal predecessors, (23), 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) [2021-08-26 01:14:02,526 WARN L838 $PredicateComparison]: unable to prove that (and (let ((.cse1 (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~main__x~0 c_ULTIMATE.start_main_~main__x~0))) (let ((.cse0 (fp.add c_currentRoundingMode .cse1 ((_ to_fp 11 53) c_currentRoundingMode 2.0)))) (or (not (fp.geq .cse0 (_ +zero 11 53))) (fp.leq .cse0 ((_ to_fp 11 53) c_currentRoundingMode 105.0)) (fp.geq (fp.sub c_currentRoundingMode .cse1 c_ULTIMATE.start_main_~main__x~0) ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))))) (fp.geq c_ULTIMATE.start_main_~main__x~0 (_ +zero 11 53)) (fp.leq c_ULTIMATE.start_main_~main__x~0 ((_ to_fp 11 53) c_currentRoundingMode 10.0)) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2021-08-26 01:14:04,584 WARN L860 $PredicateComparison]: unable to prove that (and (let ((.cse1 (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~main__x~0 c_ULTIMATE.start_main_~main__x~0))) (let ((.cse0 (fp.add c_currentRoundingMode .cse1 ((_ to_fp 11 53) c_currentRoundingMode 2.0)))) (or (not (fp.geq .cse0 (_ +zero 11 53))) (fp.leq .cse0 ((_ to_fp 11 53) c_currentRoundingMode 105.0)) (fp.geq (fp.sub c_currentRoundingMode .cse1 c_ULTIMATE.start_main_~main__x~0) ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))))) (fp.geq c_ULTIMATE.start_main_~main__x~0 (_ +zero 11 53)) (fp.leq c_ULTIMATE.start_main_~main__x~0 ((_ to_fp 11 53) c_currentRoundingMode 10.0)) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2021-08-26 01:14:06,651 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~main__x~0 c_ULTIMATE.start_main_~main__x~0))) (and (let ((.cse0 (fp.add c_currentRoundingMode .cse1 ((_ to_fp 11 53) c_currentRoundingMode 2.0)))) (or (not (fp.geq .cse0 (_ +zero 11 53))) (fp.leq .cse0 ((_ to_fp 11 53) c_currentRoundingMode 105.0)) (fp.geq c_ULTIMATE.start_main_~main__y~0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))))) (fp.geq c_ULTIMATE.start_main_~main__x~0 (_ +zero 11 53)) (fp.leq c_ULTIMATE.start_main_~main__x~0 ((_ to_fp 11 53) c_currentRoundingMode 10.0)) (= (fp.sub c_currentRoundingMode .cse1 c_ULTIMATE.start_main_~main__x~0) c_ULTIMATE.start_main_~main__y~0) (= c_currentRoundingMode roundNearestTiesToEven))) is different from false [2021-08-26 01:14:08,713 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~main__x~0 c_ULTIMATE.start_main_~main__x~0))) (and (let ((.cse0 (fp.add c_currentRoundingMode .cse1 ((_ to_fp 11 53) c_currentRoundingMode 2.0)))) (or (not (fp.geq .cse0 (_ +zero 11 53))) (fp.leq .cse0 ((_ to_fp 11 53) c_currentRoundingMode 105.0)) (fp.geq c_ULTIMATE.start_main_~main__y~0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))))) (fp.geq c_ULTIMATE.start_main_~main__x~0 (_ +zero 11 53)) (fp.leq c_ULTIMATE.start_main_~main__x~0 ((_ to_fp 11 53) c_currentRoundingMode 10.0)) (= (fp.sub c_currentRoundingMode .cse1 c_ULTIMATE.start_main_~main__x~0) c_ULTIMATE.start_main_~main__y~0) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2021-08-26 01:14:10,769 WARN L838 $PredicateComparison]: unable to prove that (and (or (not (fp.geq c_ULTIMATE.start_main_~main__y~0 (_ +zero 11 53))) (fp.leq c_ULTIMATE.start_main_~main__y~0 ((_ to_fp 11 53) c_currentRoundingMode 105.0))) (exists ((ULTIMATE.start_main_~main__x~0 (_ FloatingPoint 11 53))) (let ((.cse0 (fp.mul c_currentRoundingMode ULTIMATE.start_main_~main__x~0 ULTIMATE.start_main_~main__x~0))) (and (fp.geq ULTIMATE.start_main_~main__x~0 (_ +zero 11 53)) (fp.leq ULTIMATE.start_main_~main__x~0 ((_ to_fp 11 53) c_currentRoundingMode 10.0)) (not (fp.geq (fp.sub c_currentRoundingMode .cse0 ULTIMATE.start_main_~main__x~0) ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (= c_ULTIMATE.start_main_~main__y~0 (fp.add c_currentRoundingMode .cse0 ((_ to_fp 11 53) c_currentRoundingMode 2.0)))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2021-08-26 01:14:12,833 WARN L838 $PredicateComparison]: unable to prove that (and (fp.geq c_ULTIMATE.start_main_~main__y~0 (_ +zero 11 53)) (exists ((ULTIMATE.start_main_~main__x~0 (_ FloatingPoint 11 53))) (let ((.cse0 (fp.mul c_currentRoundingMode ULTIMATE.start_main_~main__x~0 ULTIMATE.start_main_~main__x~0))) (and (fp.leq ULTIMATE.start_main_~main__x~0 ((_ to_fp 11 53) c_currentRoundingMode 10.0)) (not (fp.geq (fp.sub c_currentRoundingMode .cse0 ULTIMATE.start_main_~main__x~0) ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (= c_ULTIMATE.start_main_~main__y~0 (fp.add c_currentRoundingMode .cse0 ((_ to_fp 11 53) c_currentRoundingMode 2.0)))))) (fp.leq c_ULTIMATE.start_main_~main__y~0 ((_ to_fp 11 53) c_currentRoundingMode 105.0)) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2021-08-26 01:14:12,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 01:14:12,859 INFO L93 Difference]: Finished difference Result 22 states and 21 transitions. [2021-08-26 01:14:12,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-08-26 01:14:12,859 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 13 states have internal predecessors, (23), 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 13 [2021-08-26 01:14:12,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 01:14:12,860 INFO L225 Difference]: With dead ends: 22 [2021-08-26 01:14:12,860 INFO L226 Difference]: Without dead ends: 14 [2021-08-26 01:14:12,860 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 32218.8ms TimeCoverageRelationStatistics Valid=35, Invalid=32, Unknown=15, NotChecked=190, Total=272 [2021-08-26 01:14:12,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2021-08-26 01:14:12,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2021-08-26 01:14:12,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 1.0) internal successors, (13), 13 states have internal predecessors, (13), 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) [2021-08-26 01:14:12,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 13 transitions. [2021-08-26 01:14:12,862 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 13 transitions. Word has length 13 [2021-08-26 01:14:12,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 01:14:12,862 INFO L470 AbstractCegarLoop]: Abstraction has 14 states and 13 transitions. [2021-08-26 01:14:12,862 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 13 states have internal predecessors, (23), 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) [2021-08-26 01:14:12,862 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 13 transitions. [2021-08-26 01:14:12,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-08-26 01:14:12,863 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 01:14:12,863 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 01:14:12,881 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2021-08-26 01:14:13,073 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-26 01:14:13,073 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 01:14:13,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 01:14:13,073 INFO L82 PathProgramCache]: Analyzing trace with hash -101291445, now seen corresponding path program 1 times [2021-08-26 01:14:13,074 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-26 01:14:13,074 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [103352898] [2021-08-26 01:14:13,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 01:14:13,074 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-26 01:14:13,074 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-26 01:14:13,077 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-26 01:14:13,078 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2021-08-26 01:14:13,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 01:14:13,509 INFO L263 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 5 conjunts are in the unsatisfiable core [2021-08-26 01:14:13,510 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 01:14:24,356 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((ULTIMATE.start_main_~main__x~0 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 10.0))) (and (= (fp.div c_currentRoundingMode ULTIMATE.start_main_~main__x~0 .cse0) c_ULTIMATE.start_main_~main__y~0) (fp.leq ULTIMATE.start_main_~main__x~0 .cse0)))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2021-08-26 01:14:43,143 WARN L838 $PredicateComparison]: unable to prove that (and (fp.geq c_ULTIMATE.start_main_~main__y~0 (_ +zero 11 53)) (exists ((ULTIMATE.start_main_~main__x~0 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 10.0))) (and (= (fp.div c_currentRoundingMode ULTIMATE.start_main_~main__x~0 .cse0) c_ULTIMATE.start_main_~main__y~0) (fp.leq ULTIMATE.start_main_~main__x~0 .cse0)))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2021-08-26 01:14:59,684 WARN L838 $PredicateComparison]: unable to prove that (exists ((ULTIMATE.start_main_~main__x~0 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 10.0))) (let ((.cse1 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~main__x~0 .cse0))) (and (fp.leq ULTIMATE.start_main_~main__x~0 .cse0) (fp.geq .cse1 (_ +zero 11 53)) (not (fp.leq .cse1 ((_ to_fp 11 53) roundNearestTiesToEven 105.0))))))) is different from false [2021-08-26 01:15:01,776 WARN L860 $PredicateComparison]: unable to prove that (exists ((ULTIMATE.start_main_~main__x~0 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 10.0))) (let ((.cse1 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~main__x~0 .cse0))) (and (fp.leq ULTIMATE.start_main_~main__x~0 .cse0) (fp.geq .cse1 (_ +zero 11 53)) (not (fp.leq .cse1 ((_ to_fp 11 53) roundNearestTiesToEven 105.0))))))) is different from true [2021-08-26 01:15:44,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 01:15:44,610 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-26 01:15:55,973 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~main__x~0 ((_ to_fp 11 53) c_currentRoundingMode 10.0)))) (or (fp.leq .cse0 ((_ to_fp 11 53) c_currentRoundingMode 105.0)) (not (fp.geq .cse0 (_ +zero 11 53))))) is different from false [2021-08-26 01:15:58,109 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~main__x~0 ((_ to_fp 11 53) c_currentRoundingMode 10.0)))) (or (fp.leq .cse0 ((_ to_fp 11 53) c_currentRoundingMode 105.0)) (not (fp.geq .cse0 (_ +zero 11 53))))) is different from true [2021-08-26 01:16:20,959 WARN L838 $PredicateComparison]: unable to prove that (forall ((ULTIMATE.start_main_~main__x~0 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 10.0))) (let ((.cse1 (fp.div c_currentRoundingMode ULTIMATE.start_main_~main__x~0 .cse0))) (or (not (fp.leq ULTIMATE.start_main_~main__x~0 .cse0)) (fp.leq .cse1 ((_ to_fp 11 53) c_currentRoundingMode 105.0)) (not (fp.geq .cse1 (_ +zero 11 53))))))) is different from false [2021-08-26 01:16:23,092 WARN L860 $PredicateComparison]: unable to prove that (forall ((ULTIMATE.start_main_~main__x~0 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 10.0))) (let ((.cse1 (fp.div c_currentRoundingMode ULTIMATE.start_main_~main__x~0 .cse0))) (or (not (fp.leq ULTIMATE.start_main_~main__x~0 .cse0)) (fp.leq .cse1 ((_ to_fp 11 53) c_currentRoundingMode 105.0)) (not (fp.geq .cse1 (_ +zero 11 53))))))) is different from true [2021-08-26 01:16:48,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 01:16:48,926 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-26 01:16:48,926 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [103352898] [2021-08-26 01:16:48,926 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [103352898] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-26 01:16:48,926 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-26 01:16:48,926 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 10 [2021-08-26 01:16:48,926 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744318287] [2021-08-26 01:16:48,927 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-08-26 01:16:48,927 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-26 01:16:48,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-08-26 01:16:48,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=8, NotChecked=60, Total=110 [2021-08-26 01:16:48,928 INFO L87 Difference]: Start difference. First operand 14 states and 13 transitions. Second operand has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 10 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 01:16:51,045 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((ULTIMATE.start_main_~main__x~0 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 10.0))) (let ((.cse1 (fp.div c_currentRoundingMode ULTIMATE.start_main_~main__x~0 .cse0))) (or (not (fp.leq ULTIMATE.start_main_~main__x~0 .cse0)) (fp.leq .cse1 ((_ to_fp 11 53) c_currentRoundingMode 105.0)) (not (fp.geq .cse1 (_ +zero 11 53))))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2021-08-26 01:16:53,171 WARN L860 $PredicateComparison]: unable to prove that (and (forall ((ULTIMATE.start_main_~main__x~0 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 10.0))) (let ((.cse1 (fp.div c_currentRoundingMode ULTIMATE.start_main_~main__x~0 .cse0))) (or (not (fp.leq ULTIMATE.start_main_~main__x~0 .cse0)) (fp.leq .cse1 ((_ to_fp 11 53) c_currentRoundingMode 105.0)) (not (fp.geq .cse1 (_ +zero 11 53))))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2021-08-26 01:16:55,296 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 10.0))) (and (fp.leq c_ULTIMATE.start_main_~main__x~0 .cse0) (let ((.cse1 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~main__x~0 .cse0))) (or (fp.leq .cse1 ((_ to_fp 11 53) c_currentRoundingMode 105.0)) (not (fp.geq .cse1 (_ +zero 11 53))))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from false [2021-08-26 01:16:57,427 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 10.0))) (and (fp.leq c_ULTIMATE.start_main_~main__x~0 .cse0) (let ((.cse1 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~main__x~0 .cse0))) (or (fp.leq .cse1 ((_ to_fp 11 53) c_currentRoundingMode 105.0)) (not (fp.geq .cse1 (_ +zero 11 53))))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2021-08-26 01:17:23,485 WARN L207 SmtUtils]: Spent 19.65 s on a formula simplification that was a NOOP. DAG size: 20 [2021-08-26 01:17:31,484 WARN L838 $PredicateComparison]: unable to prove that (and (fp.geq c_ULTIMATE.start_main_~main__y~0 (_ +zero 11 53)) (exists ((ULTIMATE.start_main_~main__x~0 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 10.0))) (and (= (fp.div c_currentRoundingMode ULTIMATE.start_main_~main__x~0 .cse0) c_ULTIMATE.start_main_~main__y~0) (fp.leq ULTIMATE.start_main_~main__x~0 .cse0)))) (fp.leq c_ULTIMATE.start_main_~main__y~0 ((_ to_fp 11 53) c_currentRoundingMode 105.0)) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2021-08-26 01:17:31,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 01:17:31,493 INFO L93 Difference]: Finished difference Result 14 states and 13 transitions. [2021-08-26 01:17:31,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-26 01:17:31,493 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 10 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2021-08-26 01:17:31,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 01:17:31,494 INFO L225 Difference]: With dead ends: 14 [2021-08-26 01:17:31,494 INFO L226 Difference]: Without dead ends: 0 [2021-08-26 01:17:31,494 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 53928.4ms TimeCoverageRelationStatistics Valid=31, Invalid=28, Unknown=15, NotChecked=136, Total=210 [2021-08-26 01:17:31,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-08-26 01:17:31,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-08-26 01:17:31,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 01:17:31,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-08-26 01:17:31,495 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 13 [2021-08-26 01:17:31,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 01:17:31,495 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-08-26 01:17:31,495 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 10 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 01:17:31,495 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-08-26 01:17:31,495 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-08-26 01:17:31,498 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-08-26 01:17:31,515 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2021-08-26 01:17:31,700 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-26 01:17:31,702 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-08-26 01:17:31,705 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 01:17:31,725 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 01:17:31,726 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 01:17:31,727 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 01:19:15,141 WARN L207 SmtUtils]: Spent 1.72 m on a formula simplification. DAG size of input: 44 DAG size of output: 41 [2021-08-26 01:19:15,143 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-08-26 01:19:15,144 INFO L853 garLoopResultBuilder]: At program point L64(lines 32 65) the Hoare annotation is: false [2021-08-26 01:19:15,144 INFO L857 garLoopResultBuilder]: For program point L27(lines 27 71) no Hoare annotation was computed. [2021-08-26 01:19:15,144 INFO L857 garLoopResultBuilder]: For program point L21(lines 21 81) no Hoare annotation was computed. [2021-08-26 01:19:15,144 INFO L860 garLoopResultBuilder]: At program point L85(lines 13 87) the Hoare annotation is: true [2021-08-26 01:19:15,144 INFO L857 garLoopResultBuilder]: For program point L19(lines 19 86) no Hoare annotation was computed. [2021-08-26 01:19:15,144 INFO L857 garLoopResultBuilder]: For program point L34(lines 34 60) no Hoare annotation was computed. [2021-08-26 01:19:15,145 INFO L857 garLoopResultBuilder]: For program point L32(lines 32 65) no Hoare annotation was computed. [2021-08-26 01:19:15,145 INFO L857 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-08-26 01:19:15,145 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-08-26 01:19:15,145 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-08-26 01:19:15,145 INFO L853 garLoopResultBuilder]: At program point L59(lines 34 60) the Hoare annotation is: (= (_ bv1 32) ULTIMATE.start_main_~main____CPAchecker_TMP_1~0) [2021-08-26 01:19:15,145 INFO L857 garLoopResultBuilder]: For program point L24(lines 24 76) no Hoare annotation was computed. [2021-08-26 01:19:15,145 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 45) no Hoare annotation was computed. [2021-08-26 01:19:15,145 INFO L857 garLoopResultBuilder]: For program point L45(line 45) no Hoare annotation was computed. [2021-08-26 01:19:15,145 INFO L857 garLoopResultBuilder]: For program point L43(lines 43 52) no Hoare annotation was computed. [2021-08-26 01:19:15,146 INFO L853 garLoopResultBuilder]: At program point L70(lines 27 71) the Hoare annotation is: (let ((.cse0 (fp.leq ULTIMATE.start_main_~main__y~0 ((_ to_fp 11 53) currentRoundingMode 105.0))) (.cse2 (= currentRoundingMode roundNearestTiesToEven))) (or (and .cse0 (exists ((ULTIMATE.start_main_~main__x~0 (_ FloatingPoint 11 53))) (let ((.cse1 (fp.mul currentRoundingMode ULTIMATE.start_main_~main__x~0 ULTIMATE.start_main_~main__x~0))) (and (fp.geq ULTIMATE.start_main_~main__x~0 (_ +zero 11 53)) (fp.leq ULTIMATE.start_main_~main__x~0 ((_ to_fp 11 53) currentRoundingMode 10.0)) (not (fp.geq (fp.sub currentRoundingMode .cse1 ULTIMATE.start_main_~main__x~0) ((_ to_fp 11 53) currentRoundingMode (_ bv0 32)))) (= ULTIMATE.start_main_~main__y~0 (fp.add currentRoundingMode .cse1 ((_ to_fp 11 53) currentRoundingMode 2.0)))))) .cse2) (and (exists ((ULTIMATE.start_main_~main__x~0 (_ FloatingPoint 11 53))) (let ((.cse3 ((_ to_fp 11 53) currentRoundingMode 10.0))) (and (= (fp.div currentRoundingMode ULTIMATE.start_main_~main__x~0 .cse3) ULTIMATE.start_main_~main__y~0) (fp.leq ULTIMATE.start_main_~main__x~0 .cse3)))) .cse0 (or (exists ((ULTIMATE.start_main_~main__x~0 (_ FloatingPoint 11 53))) (and (= ULTIMATE.start_main_~main__y~0 (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven ULTIMATE.start_main_~main__x~0 ULTIMATE.start_main_~main__x~0) ((_ to_fp 11 53) roundNearestTiesToEven 2.0))) (fp.geq ULTIMATE.start_main_~main__x~0 (_ +zero 11 53)))) (exists ((ULTIMATE.start_main_~main__x~0 (_ FloatingPoint 11 53)) (currentRoundingMode RoundingMode)) (and (= (fp.div currentRoundingMode ULTIMATE.start_main_~main__x~0 ((_ to_fp 11 53) currentRoundingMode 10.0)) ULTIMATE.start_main_~main__y~0) (fp.geq ULTIMATE.start_main_~main__x~0 (_ +zero 11 53))))) .cse2))) [2021-08-26 01:19:15,159 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-08-26 01:19:15,176 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2021-08-26 01:19:15,177 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2021-08-26 01:19:15,177 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2021-08-26 01:19:15,177 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2021-08-26 01:19:15,178 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2021-08-26 01:19:15,178 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2021-08-26 01:19:15,178 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2021-08-26 01:19:15,178 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2021-08-26 01:19:15,178 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2021-08-26 01:19:15,179 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2021-08-26 01:19:15,179 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2021-08-26 01:19:15,179 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2021-08-26 01:19:15,179 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2021-08-26 01:19:15,179 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2021-08-26 01:19:15,179 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2021-08-26 01:19:15,180 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2021-08-26 01:19:15,180 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2021-08-26 01:19:15,180 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2021-08-26 01:19:15,180 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2021-08-26 01:19:15,180 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2021-08-26 01:19:15,180 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2021-08-26 01:19:15,183 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2021-08-26 01:19:15,184 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2021-08-26 01:19:15,184 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2021-08-26 01:19:15,184 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2021-08-26 01:19:15,184 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2021-08-26 01:19:15,185 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2021-08-26 01:19:15,185 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2021-08-26 01:19:15,185 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2021-08-26 01:19:15,185 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2021-08-26 01:19:15,185 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2021-08-26 01:19:15,186 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2021-08-26 01:19:15,186 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2021-08-26 01:19:15,186 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2021-08-26 01:19:15,186 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2021-08-26 01:19:15,187 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2021-08-26 01:19:15,187 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2021-08-26 01:19:15,188 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2021-08-26 01:19:15,188 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2021-08-26 01:19:15,188 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2021-08-26 01:19:15,190 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2021-08-26 01:19:15,190 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2021-08-26 01:19:15,192 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.08 01:19:15 BoogieIcfgContainer [2021-08-26 01:19:15,192 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-08-26 01:19:15,199 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-08-26 01:19:15,199 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-08-26 01:19:15,199 INFO L275 PluginConnector]: Witness Printer initialized [2021-08-26 01:19:15,200 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 01:07:37" (3/4) ... [2021-08-26 01:19:15,202 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-08-26 01:19:15,211 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2021-08-26 01:19:15,211 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2021-08-26 01:19:15,211 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-08-26 01:19:15,211 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-08-26 01:19:15,233 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((~fp.leq~DOUBLE(main__y, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 105.0)) && (\exists ULTIMATE.start_main_~main__x~0 : C_DOUBLE :: ((~fp.geq~DOUBLE(ULTIMATE.start_main_~main__x~0, ~Pluszero~LONGDOUBLE()) && ~fp.leq~DOUBLE(ULTIMATE.start_main_~main__x~0, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 10.0))) && !~fp.geq~DOUBLE(~fp.sub~DOUBLE(unknown-currentRoundingMode-unknown, ~fp.mul~DOUBLE(unknown-currentRoundingMode-unknown, ULTIMATE.start_main_~main__x~0, ULTIMATE.start_main_~main__x~0), ULTIMATE.start_main_~main__x~0), ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 0bv32))) && main__y == ~fp.add~DOUBLE(unknown-currentRoundingMode-unknown, ~fp.mul~DOUBLE(unknown-currentRoundingMode-unknown, ULTIMATE.start_main_~main__x~0, ULTIMATE.start_main_~main__x~0), ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 2.0)))) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven) || ((((\exists ULTIMATE.start_main_~main__x~0 : C_DOUBLE :: ~fp.div~DOUBLE(unknown-currentRoundingMode-unknown, ULTIMATE.start_main_~main__x~0, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 10.0)) == main__y && ~fp.leq~DOUBLE(ULTIMATE.start_main_~main__x~0, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 10.0))) && ~fp.leq~DOUBLE(main__y, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 105.0))) && ((\exists ULTIMATE.start_main_~main__x~0 : C_DOUBLE :: main__y == ~fp.add~DOUBLE(~roundNearestTiesToEven, ~fp.mul~DOUBLE(~roundNearestTiesToEven, ULTIMATE.start_main_~main__x~0, ULTIMATE.start_main_~main__x~0), ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 2.0)) && ~fp.geq~DOUBLE(ULTIMATE.start_main_~main__x~0, ~Pluszero~LONGDOUBLE())) || (\exists ULTIMATE.start_main_~main__x~0 : C_DOUBLE, currentRoundingMode : FloatRoundingMode :: ~fp.div~DOUBLE(currentRoundingMode, ULTIMATE.start_main_~main__x~0, ~to_fp~LONGDOUBLE(currentRoundingMode, 10.0)) == main__y && ~fp.geq~DOUBLE(ULTIMATE.start_main_~main__x~0, ~Pluszero~LONGDOUBLE())))) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven) [2021-08-26 01:19:15,251 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-08-26 01:19:15,251 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-08-26 01:19:15,254 INFO L168 Benchmark]: Toolchain (without parser) took 701576.81 ms. Allocated memory was 52.4 MB in the beginning and 62.9 MB in the end (delta: 10.5 MB). Free memory was 29.0 MB in the beginning and 30.6 MB in the end (delta: -1.6 MB). Peak memory consumption was 7.6 MB. Max. memory is 16.1 GB. [2021-08-26 01:19:15,254 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 52.4 MB. Free memory was 34.2 MB in the beginning and 34.1 MB in the end (delta: 24.9 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-26 01:19:15,255 INFO L168 Benchmark]: CACSL2BoogieTranslator took 185.72 ms. Allocated memory is still 52.4 MB. Free memory was 28.9 MB in the beginning and 32.2 MB in the end (delta: -3.3 MB). Peak memory consumption was 7.1 MB. Max. memory is 16.1 GB. [2021-08-26 01:19:15,255 INFO L168 Benchmark]: Boogie Procedure Inliner took 67.25 ms. Allocated memory was 52.4 MB in the beginning and 62.9 MB in the end (delta: 10.5 MB). Free memory was 32.2 MB in the beginning and 45.9 MB in the end (delta: -13.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-08-26 01:19:15,255 INFO L168 Benchmark]: Boogie Preprocessor took 45.21 ms. Allocated memory is still 62.9 MB. Free memory was 45.9 MB in the beginning and 44.9 MB in the end (delta: 1.1 MB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-26 01:19:15,256 INFO L168 Benchmark]: RCFGBuilder took 3336.39 ms. Allocated memory is still 62.9 MB. Free memory was 44.7 MB in the beginning and 31.3 MB in the end (delta: 13.4 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. [2021-08-26 01:19:15,256 INFO L168 Benchmark]: TraceAbstraction took 697882.96 ms. Allocated memory is still 62.9 MB. Free memory was 30.7 MB in the beginning and 33.2 MB in the end (delta: -2.5 MB). Peak memory consumption was 15.3 MB. Max. memory is 16.1 GB. [2021-08-26 01:19:15,256 INFO L168 Benchmark]: Witness Printer took 52.74 ms. Allocated memory is still 62.9 MB. Free memory was 33.2 MB in the beginning and 30.6 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-08-26 01:19:15,258 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.18 ms. Allocated memory is still 52.4 MB. Free memory was 34.2 MB in the beginning and 34.1 MB in the end (delta: 24.9 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 185.72 ms. Allocated memory is still 52.4 MB. Free memory was 28.9 MB in the beginning and 32.2 MB in the end (delta: -3.3 MB). Peak memory consumption was 7.1 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 67.25 ms. Allocated memory was 52.4 MB in the beginning and 62.9 MB in the end (delta: 10.5 MB). Free memory was 32.2 MB in the beginning and 45.9 MB in the end (delta: -13.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 45.21 ms. Allocated memory is still 62.9 MB. Free memory was 45.9 MB in the beginning and 44.9 MB in the end (delta: 1.1 MB). There was no memory consumed. Max. memory is 16.1 GB. * RCFGBuilder took 3336.39 ms. Allocated memory is still 62.9 MB. Free memory was 44.7 MB in the beginning and 31.3 MB in the end (delta: 13.4 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. * TraceAbstraction took 697882.96 ms. Allocated memory is still 62.9 MB. Free memory was 30.7 MB in the beginning and 33.2 MB in the end (delta: -2.5 MB). Peak memory consumption was 15.3 MB. Max. memory is 16.1 GB. * Witness Printer took 52.74 ms. Allocated memory is still 62.9 MB. Free memory was 33.2 MB in the beginning and 30.6 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 45]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 17 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 697782.5ms, OverallIterations: 5, TraceHistogramMax: 1, EmptinessCheckTime: 8.4ms, AutomataDifference: 92128.7ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 103441.9ms, InitialAbstractionConstructionTime: 6.8ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 50 SDtfs, 21 SDslu, 116 SDs, 0 SdLazy, 35 SolverSat, 2 SolverUnsat, 4 SolverUnknown, 0 SolverNotchecked, 10229.1ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 128 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 29 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 146075.9ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=17occurred in iteration=0, InterpolantAutomatonStates: 30, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 17.9ms AutomataMinimizationTime, 5 MinimizatonAttempts, 2 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0ms HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 9 NumberOfFragments, 102 HoareAnnotationTreeSize, 4 FomulaSimplifications, 10 FormulaSimplificationTreeSizeReduction, 36.5ms HoareSimplificationTime, 4 FomulaSimplificationsInter, 46 FormulaSimplificationTreeSizeReductionInter, 103400.0ms HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 58.9ms SsaConstructionTime, 1634.4ms SatisfiabilityAnalysisTime, 499138.9ms InterpolantComputationTime, 62 NumberOfCodeBlocks, 62 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 114 ConstructedInterpolants, 33 QuantifiedInterpolants, 1041 SizeOfPredicates, 18 NumberOfNonLiveVariables, 198 ConjunctsInSsa, 24 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 34]: Loop Invariant Derived loop invariant: 1bv32 == main____CPAchecker_TMP_1 - InvariantResult [Line: 13]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 32]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 27]: Loop Invariant [2021-08-26 01:19:15,270 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2021-08-26 01:19:15,270 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2021-08-26 01:19:15,270 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2021-08-26 01:19:15,271 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2021-08-26 01:19:15,271 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2021-08-26 01:19:15,273 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2021-08-26 01:19:15,273 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2021-08-26 01:19:15,273 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2021-08-26 01:19:15,274 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2021-08-26 01:19:15,274 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2021-08-26 01:19:15,274 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2021-08-26 01:19:15,274 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2021-08-26 01:19:15,274 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2021-08-26 01:19:15,274 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2021-08-26 01:19:15,275 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2021-08-26 01:19:15,275 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2021-08-26 01:19:15,275 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2021-08-26 01:19:15,275 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2021-08-26 01:19:15,276 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2021-08-26 01:19:15,276 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2021-08-26 01:19:15,276 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2021-08-26 01:19:15,286 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2021-08-26 01:19:15,287 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2021-08-26 01:19:15,287 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2021-08-26 01:19:15,287 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2021-08-26 01:19:15,287 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2021-08-26 01:19:15,287 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2021-08-26 01:19:15,287 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2021-08-26 01:19:15,287 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2021-08-26 01:19:15,288 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2021-08-26 01:19:15,288 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2021-08-26 01:19:15,288 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2021-08-26 01:19:15,288 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2021-08-26 01:19:15,288 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2021-08-26 01:19:15,289 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2021-08-26 01:19:15,289 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2021-08-26 01:19:15,289 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2021-08-26 01:19:15,289 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2021-08-26 01:19:15,289 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2021-08-26 01:19:15,289 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2021-08-26 01:19:15,289 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2021-08-26 01:19:15,290 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: ((~fp.leq~DOUBLE(main__y, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 105.0)) && (\exists ULTIMATE.start_main_~main__x~0 : C_DOUBLE :: ((~fp.geq~DOUBLE(ULTIMATE.start_main_~main__x~0, ~Pluszero~LONGDOUBLE()) && ~fp.leq~DOUBLE(ULTIMATE.start_main_~main__x~0, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 10.0))) && !~fp.geq~DOUBLE(~fp.sub~DOUBLE(unknown-currentRoundingMode-unknown, ~fp.mul~DOUBLE(unknown-currentRoundingMode-unknown, ULTIMATE.start_main_~main__x~0, ULTIMATE.start_main_~main__x~0), ULTIMATE.start_main_~main__x~0), ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 0bv32))) && main__y == ~fp.add~DOUBLE(unknown-currentRoundingMode-unknown, ~fp.mul~DOUBLE(unknown-currentRoundingMode-unknown, ULTIMATE.start_main_~main__x~0, ULTIMATE.start_main_~main__x~0), ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 2.0)))) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven) || ((((\exists ULTIMATE.start_main_~main__x~0 : C_DOUBLE :: ~fp.div~DOUBLE(unknown-currentRoundingMode-unknown, ULTIMATE.start_main_~main__x~0, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 10.0)) == main__y && ~fp.leq~DOUBLE(ULTIMATE.start_main_~main__x~0, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 10.0))) && ~fp.leq~DOUBLE(main__y, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 105.0))) && ((\exists ULTIMATE.start_main_~main__x~0 : C_DOUBLE :: main__y == ~fp.add~DOUBLE(~roundNearestTiesToEven, ~fp.mul~DOUBLE(~roundNearestTiesToEven, ULTIMATE.start_main_~main__x~0, ULTIMATE.start_main_~main__x~0), ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 2.0)) && ~fp.geq~DOUBLE(ULTIMATE.start_main_~main__x~0, ~Pluszero~LONGDOUBLE())) || (\exists ULTIMATE.start_main_~main__x~0 : C_DOUBLE, currentRoundingMode : FloatRoundingMode :: ~fp.div~DOUBLE(currentRoundingMode, ULTIMATE.start_main_~main__x~0, ~to_fp~LONGDOUBLE(currentRoundingMode, 10.0)) == main__y && ~fp.geq~DOUBLE(ULTIMATE.start_main_~main__x~0, ~Pluszero~LONGDOUBLE())))) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven) RESULT: Ultimate proved your program to be correct! [2021-08-26 01:19:15,516 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2021-08-26 01:19:15,597 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 137 Received shutdown request...