./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-benchs/sqrt_poly.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version b2eff8ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e692a17-d407-4a58-a3e8-84d338973b1f/bin/uautomizer-GMMbpWq8iD/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e692a17-d407-4a58-a3e8-84d338973b1f/bin/uautomizer-GMMbpWq8iD/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e692a17-d407-4a58-a3e8-84d338973b1f/bin/uautomizer-GMMbpWq8iD/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e692a17-d407-4a58-a3e8-84d338973b1f/bin/uautomizer-GMMbpWq8iD/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-benchs/sqrt_poly.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e692a17-d407-4a58-a3e8-84d338973b1f/bin/uautomizer-GMMbpWq8iD/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e692a17-d407-4a58-a3e8-84d338973b1f/bin/uautomizer-GMMbpWq8iD --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 9ff417092ff6ab1dae16b3d719851bc30771c0c1117076f87d0e779624eadca8 .......................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e692a17-d407-4a58-a3e8-84d338973b1f/bin/uautomizer-GMMbpWq8iD/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e692a17-d407-4a58-a3e8-84d338973b1f/bin/uautomizer-GMMbpWq8iD/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e692a17-d407-4a58-a3e8-84d338973b1f/bin/uautomizer-GMMbpWq8iD/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e692a17-d407-4a58-a3e8-84d338973b1f/bin/uautomizer-GMMbpWq8iD/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-benchs/sqrt_poly.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e692a17-d407-4a58-a3e8-84d338973b1f/bin/uautomizer-GMMbpWq8iD/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e692a17-d407-4a58-a3e8-84d338973b1f/bin/uautomizer-GMMbpWq8iD --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 9ff417092ff6ab1dae16b3d719851bc30771c0c1117076f87d0e779624eadca8 ........................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.1-dev-b2eff8b [2021-10-28 23:01:11,773 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-28 23:01:11,775 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-28 23:01:11,823 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-28 23:01:11,824 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-28 23:01:11,825 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-28 23:01:11,828 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-28 23:01:11,831 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-28 23:01:11,833 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-28 23:01:11,835 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-28 23:01:11,836 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-28 23:01:11,838 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-28 23:01:11,839 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-28 23:01:11,841 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-28 23:01:11,843 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-28 23:01:11,845 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-28 23:01:11,846 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-28 23:01:11,848 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-28 23:01:11,851 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-28 23:01:11,854 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-28 23:01:11,856 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-28 23:01:11,858 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-28 23:01:11,860 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-28 23:01:11,861 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-28 23:01:11,866 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-28 23:01:11,866 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-28 23:01:11,867 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-28 23:01:11,868 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-28 23:01:11,869 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-28 23:01:11,870 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-28 23:01:11,871 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-28 23:01:11,872 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-28 23:01:11,873 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-28 23:01:11,874 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-28 23:01:11,876 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-28 23:01:11,876 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-28 23:01:11,878 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-28 23:01:11,878 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-28 23:01:11,879 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-28 23:01:11,880 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-28 23:01:11,881 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-28 23:01:11,882 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e692a17-d407-4a58-a3e8-84d338973b1f/bin/uautomizer-GMMbpWq8iD/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-10-28 23:01:11,928 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-28 23:01:11,931 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-28 23:01:11,932 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-10-28 23:01:11,933 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-10-28 23:01:11,938 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-10-28 23:01:11,940 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-10-28 23:01:11,940 INFO L138 SettingsManager]: * Use SBE=true [2021-10-28 23:01:11,941 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-28 23:01:11,941 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-28 23:01:11,941 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-28 23:01:11,942 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-28 23:01:11,943 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-28 23:01:11,943 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-10-28 23:01:11,943 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-28 23:01:11,943 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-10-28 23:01:11,944 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-28 23:01:11,944 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-10-28 23:01:11,944 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-28 23:01:11,945 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-10-28 23:01:11,945 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-28 23:01:11,945 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-10-28 23:01:11,945 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-28 23:01:11,946 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-28 23:01:11,946 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-28 23:01:11,946 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-28 23:01:11,947 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-10-28 23:01:11,947 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-10-28 23:01:11,947 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-10-28 23:01:11,947 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-10-28 23:01:11,950 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-10-28 23:01:11,950 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-10-28 23:01:11,950 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-28 23:01:11,951 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:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e692a17-d407-4a58-a3e8-84d338973b1f/bin/uautomizer-GMMbpWq8iD/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e692a17-d407-4a58-a3e8-84d338973b1f/bin/uautomizer-GMMbpWq8iD 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 -> 9ff417092ff6ab1dae16b3d719851bc30771c0c1117076f87d0e779624eadca8 [2021-10-28 23:01:12,262 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-28 23:01:12,294 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-28 23:01:12,298 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-28 23:01:12,300 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-28 23:01:12,301 INFO L275 PluginConnector]: CDTParser initialized [2021-10-28 23:01:12,302 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e692a17-d407-4a58-a3e8-84d338973b1f/bin/uautomizer-GMMbpWq8iD/../../sv-benchmarks/c/float-benchs/sqrt_poly.c [2021-10-28 23:01:12,400 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e692a17-d407-4a58-a3e8-84d338973b1f/bin/uautomizer-GMMbpWq8iD/data/f4f6294b7/887902965e2241a6a8ccff8a04685d5a/FLAGb793a18f7 [2021-10-28 23:01:12,876 INFO L306 CDTParser]: Found 1 translation units. [2021-10-28 23:01:12,877 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e692a17-d407-4a58-a3e8-84d338973b1f/sv-benchmarks/c/float-benchs/sqrt_poly.c [2021-10-28 23:01:12,896 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e692a17-d407-4a58-a3e8-84d338973b1f/bin/uautomizer-GMMbpWq8iD/data/f4f6294b7/887902965e2241a6a8ccff8a04685d5a/FLAGb793a18f7 [2021-10-28 23:01:13,250 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e692a17-d407-4a58-a3e8-84d338973b1f/bin/uautomizer-GMMbpWq8iD/data/f4f6294b7/887902965e2241a6a8ccff8a04685d5a [2021-10-28 23:01:13,253 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-28 23:01:13,255 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-28 23:01:13,258 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-28 23:01:13,261 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-28 23:01:13,264 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-28 23:01:13,265 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.10 11:01:13" (1/1) ... [2021-10-28 23:01:13,266 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b6bbd08 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 11:01:13, skipping insertion in model container [2021-10-28 23:01:13,266 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.10 11:01:13" (1/1) ... [2021-10-28 23:01:13,273 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-28 23:01:13,296 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-28 23:01:13,444 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e692a17-d407-4a58-a3e8-84d338973b1f/sv-benchmarks/c/float-benchs/sqrt_poly.c[671,684] [2021-10-28 23:01:13,463 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-28 23:01:13,473 INFO L203 MainTranslator]: Completed pre-run [2021-10-28 23:01:13,485 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e692a17-d407-4a58-a3e8-84d338973b1f/sv-benchmarks/c/float-benchs/sqrt_poly.c[671,684] [2021-10-28 23:01:13,490 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-28 23:01:13,503 INFO L208 MainTranslator]: Completed translation [2021-10-28 23:01:13,504 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 11:01:13 WrapperNode [2021-10-28 23:01:13,504 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-28 23:01:13,505 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-28 23:01:13,506 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-28 23:01:13,506 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-28 23:01:13,513 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 11:01:13" (1/1) ... [2021-10-28 23:01:13,522 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 11:01:13" (1/1) ... [2021-10-28 23:01:13,547 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-28 23:01:13,548 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-28 23:01:13,549 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-28 23:01:13,549 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-28 23:01:13,556 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 11:01:13" (1/1) ... [2021-10-28 23:01:13,557 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 11:01:13" (1/1) ... [2021-10-28 23:01:13,558 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 11:01:13" (1/1) ... [2021-10-28 23:01:13,559 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 11:01:13" (1/1) ... [2021-10-28 23:01:13,564 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 11:01:13" (1/1) ... [2021-10-28 23:01:13,566 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 11:01:13" (1/1) ... [2021-10-28 23:01:13,567 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 11:01:13" (1/1) ... [2021-10-28 23:01:13,569 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-28 23:01:13,570 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-28 23:01:13,570 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-28 23:01:13,571 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-28 23:01:13,574 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 11:01:13" (1/1) ... [2021-10-28 23:01:13,591 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-28 23:01:13,606 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e692a17-d407-4a58-a3e8-84d338973b1f/bin/uautomizer-GMMbpWq8iD/z3 [2021-10-28 23:01:13,621 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e692a17-d407-4a58-a3e8-84d338973b1f/bin/uautomizer-GMMbpWq8iD/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-10-28 23:01:13,625 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e692a17-d407-4a58-a3e8-84d338973b1f/bin/uautomizer-GMMbpWq8iD/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-10-28 23:01:13,667 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-28 23:01:13,668 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-28 23:01:13,668 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-28 23:01:13,668 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-28 23:01:13,865 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-28 23:01:13,865 INFO L299 CfgBuilder]: Removed 8 assume(true) statements. [2021-10-28 23:01:13,868 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.10 11:01:13 BoogieIcfgContainer [2021-10-28 23:01:13,868 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-28 23:01:13,871 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-28 23:01:13,871 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-28 23:01:13,875 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-28 23:01:13,875 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.10 11:01:13" (1/3) ... [2021-10-28 23:01:13,876 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6903fa0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.10 11:01:13, skipping insertion in model container [2021-10-28 23:01:13,877 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 11:01:13" (2/3) ... [2021-10-28 23:01:13,877 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6903fa0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.10 11:01:13, skipping insertion in model container [2021-10-28 23:01:13,878 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.10 11:01:13" (3/3) ... [2021-10-28 23:01:13,879 INFO L111 eAbstractionObserver]: Analyzing ICFG sqrt_poly.c [2021-10-28 23:01:13,886 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-28 23:01:13,886 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-10-28 23:01:13,945 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-10-28 23:01:13,954 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-10-28 23:01:13,955 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-10-28 23:01:13,973 INFO L276 IsEmpty]: Start isEmpty. Operand has 12 states, 10 states have (on average 1.4) internal successors, (14), 11 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-10-28 23:01:13,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-10-28 23:01:13,980 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 23:01:13,980 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-10-28 23:01:13,981 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 23:01:13,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:01:13,989 INFO L85 PathProgramCache]: Analyzing trace with hash 1805028936, now seen corresponding path program 1 times [2021-10-28 23:01:14,000 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:01:14,001 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628091705] [2021-10-28 23:01:14,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:01:14,003 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:01:14,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:01:14,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 23:01:14,241 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 23:01:14,242 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628091705] [2021-10-28 23:01:14,243 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1628091705] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 23:01:14,243 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 23:01:14,243 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-28 23:01:14,247 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207272343] [2021-10-28 23:01:14,253 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-10-28 23:01:14,253 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 23:01:14,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-10-28 23:01:14,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-10-28 23:01:14,280 INFO L87 Difference]: Start difference. First operand has 12 states, 10 states have (on average 1.4) internal successors, (14), 11 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) Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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-10-28 23:01:14,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 23:01:14,294 INFO L93 Difference]: Finished difference Result 21 states and 24 transitions. [2021-10-28 23:01:14,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-10-28 23:01:14,296 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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 7 [2021-10-28 23:01:14,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 23:01:14,305 INFO L225 Difference]: With dead ends: 21 [2021-10-28 23:01:14,306 INFO L226 Difference]: Without dead ends: 8 [2021-10-28 23:01:14,309 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-10-28 23:01:14,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2021-10-28 23:01:14,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2021-10-28 23:01:14,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 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-10-28 23:01:14,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2021-10-28 23:01:14,340 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 7 [2021-10-28 23:01:14,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 23:01:14,341 INFO L470 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2021-10-28 23:01:14,341 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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-10-28 23:01:14,342 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2021-10-28 23:01:14,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-10-28 23:01:14,342 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 23:01:14,342 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-10-28 23:01:14,343 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-10-28 23:01:14,343 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 23:01:14,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:01:14,345 INFO L85 PathProgramCache]: Analyzing trace with hash 1806875978, now seen corresponding path program 1 times [2021-10-28 23:01:14,345 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 23:01:14,345 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495433632] [2021-10-28 23:01:14,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:01:14,346 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 23:01:14,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-28 23:01:14,386 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-28 23:01:14,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-28 23:01:14,430 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-28 23:01:14,430 INFO L627 BasicCegarLoop]: Counterexample is feasible [2021-10-28 23:01:14,432 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 23:01:14,434 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-10-28 23:01:14,438 INFO L731 BasicCegarLoop]: Path program histogram: [1, 1] [2021-10-28 23:01:14,442 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-10-28 23:01:14,466 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.10 11:01:14 BoogieIcfgContainer [2021-10-28 23:01:14,466 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-10-28 23:01:14,467 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-28 23:01:14,467 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-28 23:01:14,468 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-28 23:01:14,468 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.10 11:01:13" (3/4) ... [2021-10-28 23:01:14,472 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-10-28 23:01:14,472 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-28 23:01:14,475 INFO L168 Benchmark]: Toolchain (without parser) took 1218.77 ms. Allocated memory was 90.2 MB in the beginning and 113.2 MB in the end (delta: 23.1 MB). Free memory was 49.3 MB in the beginning and 77.0 MB in the end (delta: -27.6 MB). There was no memory consumed. Max. memory is 16.1 GB. [2021-10-28 23:01:14,476 INFO L168 Benchmark]: CDTParser took 0.37 ms. Allocated memory is still 90.2 MB. Free memory is still 65.6 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-10-28 23:01:14,477 INFO L168 Benchmark]: CACSL2BoogieTranslator took 246.40 ms. Allocated memory is still 90.2 MB. Free memory was 49.2 MB in the beginning and 65.3 MB in the end (delta: -16.1 MB). Peak memory consumption was 5.9 MB. Max. memory is 16.1 GB. [2021-10-28 23:01:14,477 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.71 ms. Allocated memory is still 90.2 MB. Free memory was 65.1 MB in the beginning and 63.7 MB in the end (delta: 1.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-28 23:01:14,478 INFO L168 Benchmark]: Boogie Preprocessor took 21.05 ms. Allocated memory is still 90.2 MB. Free memory was 63.7 MB in the beginning and 62.6 MB in the end (delta: 1.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-28 23:01:14,479 INFO L168 Benchmark]: RCFGBuilder took 298.06 ms. Allocated memory is still 90.2 MB. Free memory was 62.6 MB in the beginning and 53.8 MB in the end (delta: 8.8 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2021-10-28 23:01:14,480 INFO L168 Benchmark]: TraceAbstraction took 596.01 ms. Allocated memory was 90.2 MB in the beginning and 113.2 MB in the end (delta: 23.1 MB). Free memory was 53.4 MB in the beginning and 77.5 MB in the end (delta: -24.1 MB). Peak memory consumption was 17.5 kB. Max. memory is 16.1 GB. [2021-10-28 23:01:14,481 INFO L168 Benchmark]: Witness Printer took 5.18 ms. Allocated memory is still 113.2 MB. Free memory was 77.5 MB in the beginning and 77.0 MB in the end (delta: 543.5 kB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-28 23:01:14,486 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.37 ms. Allocated memory is still 90.2 MB. Free memory is still 65.6 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 246.40 ms. Allocated memory is still 90.2 MB. Free memory was 49.2 MB in the beginning and 65.3 MB in the end (delta: -16.1 MB). Peak memory consumption was 5.9 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 41.71 ms. Allocated memory is still 90.2 MB. Free memory was 65.1 MB in the beginning and 63.7 MB in the end (delta: 1.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 21.05 ms. Allocated memory is still 90.2 MB. Free memory was 63.7 MB in the beginning and 62.6 MB in the end (delta: 1.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 298.06 ms. Allocated memory is still 90.2 MB. Free memory was 62.6 MB in the beginning and 53.8 MB in the end (delta: 8.8 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * TraceAbstraction took 596.01 ms. Allocated memory was 90.2 MB in the beginning and 113.2 MB in the end (delta: 23.1 MB). Free memory was 53.4 MB in the beginning and 77.5 MB in the end (delta: -24.1 MB). Peak memory consumption was 17.5 kB. Max. memory is 16.1 GB. * Witness Printer took 5.18 ms. Allocated memory is still 113.2 MB. Free memory was 77.5 MB in the beginning and 77.0 MB in the end (delta: 543.5 kB). Peak memory consumption was 2.1 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.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 16]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 30, overapproximation of someBinaryArithmeticDOUBLEoperation at line 27. Possible FailurePath: [L18] double sqrt2 = 1.414213538169860839843750; VAL [sqrt2=11863283/8388608] [L22] double S, I; [L24] I = __VERIFIER_nondet_double() [L14] COND FALSE !(!cond) VAL [sqrt2=11863283/8388608] [L27] COND TRUE I >= 2. [L27] S = sqrt2 * (1.+(I/2.- 1.)*(.5-0.125*(I/2.-1.))) VAL [sqrt2=11863283/8388608] [L16] COND TRUE !(cond) VAL [sqrt2=11863283/8388608] [L16] reach_error() VAL [sqrt2=11863283/8388608] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 12 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.4s, OverallIterations: 2, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 12 SDtfs, 0 SDslu, 0 SDs, 0 SdLazy, 0 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=12occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 14 NumberOfCodeBlocks, 14 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 6 ConstructedInterpolants, 0 QuantifiedInterpolants, 6 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-10-28 23:01:14,547 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e692a17-d407-4a58-a3e8-84d338973b1f/bin/uautomizer-GMMbpWq8iD/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... ### Bit-precise run ### This is Ultimate 0.2.1-dev-b2eff8b [2021-10-28 23:01:17,278 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-28 23:01:17,281 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-28 23:01:17,319 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-28 23:01:17,321 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-28 23:01:17,325 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-28 23:01:17,329 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-28 23:01:17,340 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-28 23:01:17,344 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-28 23:01:17,352 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-28 23:01:17,353 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-28 23:01:17,354 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-28 23:01:17,355 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-28 23:01:17,358 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-28 23:01:17,359 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-28 23:01:17,361 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-28 23:01:17,362 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-28 23:01:17,363 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-28 23:01:17,365 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-28 23:01:17,374 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-28 23:01:17,377 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-28 23:01:17,379 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-28 23:01:17,383 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-28 23:01:17,385 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-28 23:01:17,399 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-28 23:01:17,399 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-28 23:01:17,400 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-28 23:01:17,401 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-28 23:01:17,401 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-28 23:01:17,403 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-28 23:01:17,403 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-28 23:01:17,404 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-28 23:01:17,405 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-28 23:01:17,410 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-28 23:01:17,413 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-28 23:01:17,413 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-28 23:01:17,415 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-28 23:01:17,415 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-28 23:01:17,415 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-28 23:01:17,417 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-28 23:01:17,418 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-28 23:01:17,419 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e692a17-d407-4a58-a3e8-84d338973b1f/bin/uautomizer-GMMbpWq8iD/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2021-10-28 23:01:17,482 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-28 23:01:17,482 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-28 23:01:17,483 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-10-28 23:01:17,483 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-10-28 23:01:17,486 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-10-28 23:01:17,486 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-10-28 23:01:17,486 INFO L138 SettingsManager]: * Use SBE=true [2021-10-28 23:01:17,486 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-28 23:01:17,487 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-28 23:01:17,487 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-28 23:01:17,488 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-28 23:01:17,488 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-10-28 23:01:17,489 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-28 23:01:17,489 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-10-28 23:01:17,489 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-10-28 23:01:17,489 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-10-28 23:01:17,490 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-28 23:01:17,490 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-10-28 23:01:17,490 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-28 23:01:17,490 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-10-28 23:01:17,491 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-28 23:01:17,491 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-10-28 23:01:17,491 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-28 23:01:17,491 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-28 23:01:17,492 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-28 23:01:17,492 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-28 23:01:17,492 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-10-28 23:01:17,493 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-10-28 23:01:17,493 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-10-28 23:01:17,493 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-10-28 23:01:17,493 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-10-28 23:01:17,494 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-10-28 23:01:17,494 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-28 23:01:17,494 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-10-28 23:01:17,494 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:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e692a17-d407-4a58-a3e8-84d338973b1f/bin/uautomizer-GMMbpWq8iD/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e692a17-d407-4a58-a3e8-84d338973b1f/bin/uautomizer-GMMbpWq8iD 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 -> 9ff417092ff6ab1dae16b3d719851bc30771c0c1117076f87d0e779624eadca8 [2021-10-28 23:01:17,973 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-28 23:01:18,009 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-28 23:01:18,013 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-28 23:01:18,015 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-28 23:01:18,015 INFO L275 PluginConnector]: CDTParser initialized [2021-10-28 23:01:18,016 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e692a17-d407-4a58-a3e8-84d338973b1f/bin/uautomizer-GMMbpWq8iD/../../sv-benchmarks/c/float-benchs/sqrt_poly.c [2021-10-28 23:01:18,101 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e692a17-d407-4a58-a3e8-84d338973b1f/bin/uautomizer-GMMbpWq8iD/data/39e949469/83c0013d7da54194a9f936e80c895d2b/FLAG241f2ec0b [2021-10-28 23:01:18,716 INFO L306 CDTParser]: Found 1 translation units. [2021-10-28 23:01:18,717 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e692a17-d407-4a58-a3e8-84d338973b1f/sv-benchmarks/c/float-benchs/sqrt_poly.c [2021-10-28 23:01:18,724 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e692a17-d407-4a58-a3e8-84d338973b1f/bin/uautomizer-GMMbpWq8iD/data/39e949469/83c0013d7da54194a9f936e80c895d2b/FLAG241f2ec0b [2021-10-28 23:01:19,086 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e692a17-d407-4a58-a3e8-84d338973b1f/bin/uautomizer-GMMbpWq8iD/data/39e949469/83c0013d7da54194a9f936e80c895d2b [2021-10-28 23:01:19,089 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-28 23:01:19,090 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-28 23:01:19,092 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-28 23:01:19,092 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-28 23:01:19,097 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-28 23:01:19,097 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.10 11:01:19" (1/1) ... [2021-10-28 23:01:19,099 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6cf324dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 11:01:19, skipping insertion in model container [2021-10-28 23:01:19,099 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.10 11:01:19" (1/1) ... [2021-10-28 23:01:19,107 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-28 23:01:19,122 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-28 23:01:19,274 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e692a17-d407-4a58-a3e8-84d338973b1f/sv-benchmarks/c/float-benchs/sqrt_poly.c[671,684] [2021-10-28 23:01:19,288 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-28 23:01:19,310 INFO L203 MainTranslator]: Completed pre-run [2021-10-28 23:01:19,332 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e692a17-d407-4a58-a3e8-84d338973b1f/sv-benchmarks/c/float-benchs/sqrt_poly.c[671,684] [2021-10-28 23:01:19,357 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-28 23:01:19,380 INFO L208 MainTranslator]: Completed translation [2021-10-28 23:01:19,380 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 11:01:19 WrapperNode [2021-10-28 23:01:19,381 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-28 23:01:19,382 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-28 23:01:19,383 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-28 23:01:19,383 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-28 23:01:19,412 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 11:01:19" (1/1) ... [2021-10-28 23:01:19,473 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 11:01:19" (1/1) ... [2021-10-28 23:01:19,507 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-28 23:01:19,508 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-28 23:01:19,508 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-28 23:01:19,509 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-28 23:01:19,518 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 11:01:19" (1/1) ... [2021-10-28 23:01:19,519 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 11:01:19" (1/1) ... [2021-10-28 23:01:19,526 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 11:01:19" (1/1) ... [2021-10-28 23:01:19,527 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 11:01:19" (1/1) ... [2021-10-28 23:01:19,550 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 11:01:19" (1/1) ... [2021-10-28 23:01:19,553 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 11:01:19" (1/1) ... [2021-10-28 23:01:19,555 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 11:01:19" (1/1) ... [2021-10-28 23:01:19,562 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-28 23:01:19,564 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-28 23:01:19,565 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-28 23:01:19,566 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-28 23:01:19,567 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 11:01:19" (1/1) ... [2021-10-28 23:01:19,576 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-28 23:01:19,588 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e692a17-d407-4a58-a3e8-84d338973b1f/bin/uautomizer-GMMbpWq8iD/z3 [2021-10-28 23:01:19,617 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e692a17-d407-4a58-a3e8-84d338973b1f/bin/uautomizer-GMMbpWq8iD/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-10-28 23:01:19,635 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e692a17-d407-4a58-a3e8-84d338973b1f/bin/uautomizer-GMMbpWq8iD/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-10-28 23:01:19,675 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-10-28 23:01:19,675 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-28 23:01:19,675 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-28 23:01:19,676 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-28 23:01:24,312 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-28 23:01:24,312 INFO L299 CfgBuilder]: Removed 8 assume(true) statements. [2021-10-28 23:01:24,314 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.10 11:01:24 BoogieIcfgContainer [2021-10-28 23:01:24,314 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-28 23:01:24,317 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-28 23:01:24,317 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-28 23:01:24,321 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-28 23:01:24,321 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.10 11:01:19" (1/3) ... [2021-10-28 23:01:24,322 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@454e35da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.10 11:01:24, skipping insertion in model container [2021-10-28 23:01:24,323 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 11:01:19" (2/3) ... [2021-10-28 23:01:24,323 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@454e35da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.10 11:01:24, skipping insertion in model container [2021-10-28 23:01:24,324 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.10 11:01:24" (3/3) ... [2021-10-28 23:01:24,325 INFO L111 eAbstractionObserver]: Analyzing ICFG sqrt_poly.c [2021-10-28 23:01:24,332 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-28 23:01:24,333 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-10-28 23:01:24,388 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-10-28 23:01:24,395 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-10-28 23:01:24,396 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-10-28 23:01:24,410 INFO L276 IsEmpty]: Start isEmpty. Operand has 12 states, 10 states have (on average 1.4) internal successors, (14), 11 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-10-28 23:01:24,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-10-28 23:01:24,416 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 23:01:24,417 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-10-28 23:01:24,417 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 23:01:24,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:01:24,424 INFO L85 PathProgramCache]: Analyzing trace with hash 1805028936, now seen corresponding path program 1 times [2021-10-28 23:01:24,437 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-10-28 23:01:24,438 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1591095632] [2021-10-28 23:01:24,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:01:24,439 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-28 23:01:24,440 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e692a17-d407-4a58-a3e8-84d338973b1f/bin/uautomizer-GMMbpWq8iD/mathsat [2021-10-28 23:01:24,443 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e692a17-d407-4a58-a3e8-84d338973b1f/bin/uautomizer-GMMbpWq8iD/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-28 23:01:24,448 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e692a17-d407-4a58-a3e8-84d338973b1f/bin/uautomizer-GMMbpWq8iD/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-10-28 23:01:25,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:01:25,330 INFO L263 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 1 conjunts are in the unsatisfiable core [2021-10-28 23:01:25,335 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-28 23:01:25,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 23:01:25,411 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-28 23:01:25,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 23:01:25,468 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-10-28 23:01:25,468 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1591095632] [2021-10-28 23:01:25,469 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1591095632] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-28 23:01:25,470 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-28 23:01:25,470 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2021-10-28 23:01:25,481 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27804276] [2021-10-28 23:01:25,487 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-10-28 23:01:25,487 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-10-28 23:01:25,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-10-28 23:01:25,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-10-28 23:01:25,506 INFO L87 Difference]: Start difference. First operand has 12 states, 10 states have (on average 1.4) internal successors, (14), 11 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) Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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-10-28 23:01:25,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 23:01:25,522 INFO L93 Difference]: Finished difference Result 21 states and 24 transitions. [2021-10-28 23:01:25,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-10-28 23:01:25,524 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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 7 [2021-10-28 23:01:25,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 23:01:25,533 INFO L225 Difference]: With dead ends: 21 [2021-10-28 23:01:25,533 INFO L226 Difference]: Without dead ends: 8 [2021-10-28 23:01:25,536 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-10-28 23:01:25,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2021-10-28 23:01:25,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2021-10-28 23:01:25,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 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-10-28 23:01:25,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2021-10-28 23:01:25,569 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 7 [2021-10-28 23:01:25,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 23:01:25,570 INFO L470 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2021-10-28 23:01:25,570 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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-10-28 23:01:25,570 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2021-10-28 23:01:25,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-10-28 23:01:25,571 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 23:01:25,571 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-10-28 23:01:25,606 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e692a17-d407-4a58-a3e8-84d338973b1f/bin/uautomizer-GMMbpWq8iD/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2021-10-28 23:01:25,785 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e692a17-d407-4a58-a3e8-84d338973b1f/bin/uautomizer-GMMbpWq8iD/mathsat -unsat_core_generation=3 [2021-10-28 23:01:25,785 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 23:01:25,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:01:25,786 INFO L85 PathProgramCache]: Analyzing trace with hash 1806875978, now seen corresponding path program 1 times [2021-10-28 23:01:25,787 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-10-28 23:01:25,788 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2104116042] [2021-10-28 23:01:25,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:01:25,788 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-28 23:01:25,788 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e692a17-d407-4a58-a3e8-84d338973b1f/bin/uautomizer-GMMbpWq8iD/mathsat [2021-10-28 23:01:25,790 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e692a17-d407-4a58-a3e8-84d338973b1f/bin/uautomizer-GMMbpWq8iD/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-28 23:01:25,799 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e692a17-d407-4a58-a3e8-84d338973b1f/bin/uautomizer-GMMbpWq8iD/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-10-28 23:01:27,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:01:27,867 INFO L263 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 10 conjunts are in the unsatisfiable core [2021-10-28 23:01:27,869 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-28 23:01:46,177 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((ULTIMATE.start_main_~I~0 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (and (fp.geq ULTIMATE.start_main_~I~0 .cse0) (= (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 11863283.0 8388608.0)) (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (fp.add c_currentRoundingMode .cse1 (let ((.cse2 (fp.sub c_currentRoundingMode (fp.div c_currentRoundingMode ULTIMATE.start_main_~I~0 .cse0) .cse1))) (fp.mul c_currentRoundingMode .cse2 (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0)) .cse2))))))) c_ULTIMATE.start_main_~S~0) (fp.leq ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) c_currentRoundingMode 3.0))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2021-10-28 23:03:33,342 WARN L838 $PredicateComparison]: unable to prove that (exists ((ULTIMATE.start_main_~I~0 (_ FloatingPoint 11 53))) (let ((.cse3 ((_ to_fp 11 53) roundNearestTiesToEven 2.0))) (and (fp.leq ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) roundNearestTiesToEven 3.0)) (let ((.cse4 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse2 (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 11863283.0 8388608.0)) (fp.add roundNearestTiesToEven .cse4 (let ((.cse5 (fp.sub roundNearestTiesToEven (fp.div roundNearestTiesToEven ULTIMATE.start_main_~I~0 .cse3) .cse4))) (fp.mul roundNearestTiesToEven .cse5 (fp.sub roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 8.0)) .cse5)))))))) (let ((.cse0 (fp.geq .cse2 .cse4)) (.cse1 (fp.leq .cse2 .cse3))) (or (and (= c_ULTIMATE.start___VERIFIER_assert_~cond (_ bv1 32)) .cse0 .cse1) (and (= c_ULTIMATE.start___VERIFIER_assert_~cond (_ bv0 32)) (or (not .cse0) (not .cse1))))))) (fp.geq ULTIMATE.start_main_~I~0 .cse3)))) is different from false [2021-10-28 23:03:35,414 WARN L860 $PredicateComparison]: unable to prove that (exists ((ULTIMATE.start_main_~I~0 (_ FloatingPoint 11 53))) (let ((.cse3 ((_ to_fp 11 53) roundNearestTiesToEven 2.0))) (and (fp.leq ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) roundNearestTiesToEven 3.0)) (let ((.cse4 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse2 (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 11863283.0 8388608.0)) (fp.add roundNearestTiesToEven .cse4 (let ((.cse5 (fp.sub roundNearestTiesToEven (fp.div roundNearestTiesToEven ULTIMATE.start_main_~I~0 .cse3) .cse4))) (fp.mul roundNearestTiesToEven .cse5 (fp.sub roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 8.0)) .cse5)))))))) (let ((.cse0 (fp.geq .cse2 .cse4)) (.cse1 (fp.leq .cse2 .cse3))) (or (and (= c_ULTIMATE.start___VERIFIER_assert_~cond (_ bv1 32)) .cse0 .cse1) (and (= c_ULTIMATE.start___VERIFIER_assert_~cond (_ bv0 32)) (or (not .cse0) (not .cse1))))))) (fp.geq ULTIMATE.start_main_~I~0 .cse3)))) is different from true [2021-10-28 23:04:27,654 WARN L838 $PredicateComparison]: unable to prove that (exists ((ULTIMATE.start_main_~I~0 (_ FloatingPoint 11 53))) (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 2.0))) (and (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse0 (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 11863283.0 8388608.0)) (fp.add roundNearestTiesToEven .cse1 (let ((.cse3 (fp.sub roundNearestTiesToEven (fp.div roundNearestTiesToEven ULTIMATE.start_main_~I~0 .cse2) .cse1))) (fp.mul roundNearestTiesToEven .cse3 (fp.sub roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 8.0)) .cse3)))))))) (or (not (fp.geq .cse0 .cse1)) (not (fp.leq .cse0 .cse2))))) (fp.leq ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) roundNearestTiesToEven 3.0)) (fp.geq ULTIMATE.start_main_~I~0 .cse2)))) is different from false [2021-10-28 23:04:29,731 WARN L860 $PredicateComparison]: unable to prove that (exists ((ULTIMATE.start_main_~I~0 (_ FloatingPoint 11 53))) (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 2.0))) (and (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse0 (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 11863283.0 8388608.0)) (fp.add roundNearestTiesToEven .cse1 (let ((.cse3 (fp.sub roundNearestTiesToEven (fp.div roundNearestTiesToEven ULTIMATE.start_main_~I~0 .cse2) .cse1))) (fp.mul roundNearestTiesToEven .cse3 (fp.sub roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 8.0)) .cse3)))))))) (or (not (fp.geq .cse0 .cse1)) (not (fp.leq .cse0 .cse2))))) (fp.leq ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) roundNearestTiesToEven 3.0)) (fp.geq ULTIMATE.start_main_~I~0 .cse2)))) is different from true [2021-10-28 23:04:29,732 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 23:04:29,732 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-28 23:04:45,823 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (or (not (fp.geq c_ULTIMATE.start_main_~I~0 .cse0)) (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse1 (fp.mul c_currentRoundingMode c_~sqrt2~0 (fp.add c_currentRoundingMode .cse2 (let ((.cse3 (fp.sub c_currentRoundingMode (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~I~0 .cse0) .cse2))) (fp.mul c_currentRoundingMode .cse3 (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0)) .cse3)))))))) (and (fp.geq .cse1 .cse2) (fp.leq .cse1 .cse0)))))) is different from false [2021-10-28 23:04:47,982 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (or (not (fp.geq c_ULTIMATE.start_main_~I~0 .cse0)) (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse1 (fp.mul c_currentRoundingMode c_~sqrt2~0 (fp.add c_currentRoundingMode .cse2 (let ((.cse3 (fp.sub c_currentRoundingMode (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~I~0 .cse0) .cse2))) (fp.mul c_currentRoundingMode .cse3 (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0)) .cse3)))))))) (and (fp.geq .cse1 .cse2) (fp.leq .cse1 .cse0)))))) is different from true [2021-10-28 23:05:08,555 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (or (= c_ULTIMATE.start_assume_abort_if_not_~cond (_ bv0 32)) (not (fp.geq c_ULTIMATE.start_main_~I~0 .cse0)) (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse1 (fp.mul c_currentRoundingMode c_~sqrt2~0 (fp.add c_currentRoundingMode .cse2 (let ((.cse3 (fp.sub c_currentRoundingMode (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~I~0 .cse0) .cse2))) (fp.mul c_currentRoundingMode .cse3 (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0)) .cse3)))))))) (and (fp.geq .cse1 .cse2) (fp.leq .cse1 .cse0)))))) is different from false [2021-10-28 23:05:10,710 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (or (= c_ULTIMATE.start_assume_abort_if_not_~cond (_ bv0 32)) (not (fp.geq c_ULTIMATE.start_main_~I~0 .cse0)) (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse1 (fp.mul c_currentRoundingMode c_~sqrt2~0 (fp.add c_currentRoundingMode .cse2 (let ((.cse3 (fp.sub c_currentRoundingMode (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~I~0 .cse0) .cse2))) (fp.mul c_currentRoundingMode .cse3 (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0)) .cse3)))))))) (and (fp.geq .cse1 .cse2) (fp.leq .cse1 .cse0)))))) is different from true [2021-10-28 23:06:05,587 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_main_~I~0_8 (_ FloatingPoint 11 53))) (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (or (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.mul c_currentRoundingMode c_~sqrt2~0 (fp.add c_currentRoundingMode .cse2 (let ((.cse3 (fp.sub c_currentRoundingMode (fp.div c_currentRoundingMode v_ULTIMATE.start_main_~I~0_8 .cse1) .cse2))) (fp.mul c_currentRoundingMode .cse3 (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0)) .cse3)))))))) (and (fp.leq .cse0 .cse1) (fp.geq .cse0 .cse2)))) (not (fp.leq v_ULTIMATE.start_main_~I~0_8 ((_ to_fp 11 53) c_currentRoundingMode 3.0))) (not (fp.geq v_ULTIMATE.start_main_~I~0_8 .cse1))))) is different from false [2021-10-28 23:06:07,751 WARN L860 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_main_~I~0_8 (_ FloatingPoint 11 53))) (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (or (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.mul c_currentRoundingMode c_~sqrt2~0 (fp.add c_currentRoundingMode .cse2 (let ((.cse3 (fp.sub c_currentRoundingMode (fp.div c_currentRoundingMode v_ULTIMATE.start_main_~I~0_8 .cse1) .cse2))) (fp.mul c_currentRoundingMode .cse3 (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0)) .cse3)))))))) (and (fp.leq .cse0 .cse1) (fp.geq .cse0 .cse2)))) (not (fp.leq v_ULTIMATE.start_main_~I~0_8 ((_ to_fp 11 53) c_currentRoundingMode 3.0))) (not (fp.geq v_ULTIMATE.start_main_~I~0_8 .cse1))))) is different from true [2021-10-28 23:06:07,751 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 23:06:07,752 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-10-28 23:06:07,752 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2104116042] [2021-10-28 23:06:07,752 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2104116042] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-28 23:06:07,752 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-28 23:06:07,752 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 12 [2021-10-28 23:06:07,753 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192452220] [2021-10-28 23:06:07,754 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-28 23:06:07,754 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-10-28 23:06:07,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-28 23:06:07,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=30, Unknown=11, NotChecked=90, Total=156 [2021-10-28 23:06:07,757 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand has 13 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 12 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-10-28 23:06:09,874 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ULTIMATE.start_main_~I~0_8 (_ FloatingPoint 11 53))) (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (or (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.mul c_currentRoundingMode c_~sqrt2~0 (fp.add c_currentRoundingMode .cse2 (let ((.cse3 (fp.sub c_currentRoundingMode (fp.div c_currentRoundingMode v_ULTIMATE.start_main_~I~0_8 .cse1) .cse2))) (fp.mul c_currentRoundingMode .cse3 (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0)) .cse3)))))))) (and (fp.leq .cse0 .cse1) (fp.geq .cse0 .cse2)))) (not (fp.leq v_ULTIMATE.start_main_~I~0_8 ((_ to_fp 11 53) c_currentRoundingMode 3.0))) (not (fp.geq v_ULTIMATE.start_main_~I~0_8 .cse1))))) (= c_~sqrt2~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 11863283.0 8388608.0))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2021-10-28 23:06:12,050 WARN L860 $PredicateComparison]: unable to prove that (and (forall ((v_ULTIMATE.start_main_~I~0_8 (_ FloatingPoint 11 53))) (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (or (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.mul c_currentRoundingMode c_~sqrt2~0 (fp.add c_currentRoundingMode .cse2 (let ((.cse3 (fp.sub c_currentRoundingMode (fp.div c_currentRoundingMode v_ULTIMATE.start_main_~I~0_8 .cse1) .cse2))) (fp.mul c_currentRoundingMode .cse3 (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0)) .cse3)))))))) (and (fp.leq .cse0 .cse1) (fp.geq .cse0 .cse2)))) (not (fp.leq v_ULTIMATE.start_main_~I~0_8 ((_ to_fp 11 53) c_currentRoundingMode 3.0))) (not (fp.geq v_ULTIMATE.start_main_~I~0_8 .cse1))))) (= c_~sqrt2~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 11863283.0 8388608.0))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2021-10-28 23:06:14,172 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (= c_ULTIMATE.start_assume_abort_if_not_~cond (_ bv0 32))) (.cse3 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (or .cse0 (not (fp.geq c_ULTIMATE.start_main_~I~0 .cse1)) (let ((.cse2 (fp.mul c_currentRoundingMode c_~sqrt2~0 (fp.add c_currentRoundingMode .cse3 (let ((.cse4 (fp.sub c_currentRoundingMode (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~I~0 .cse1) .cse3))) (fp.mul c_currentRoundingMode .cse4 (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0)) .cse4)))))))) (and (fp.geq .cse2 .cse3) (fp.leq .cse2 .cse1))))) (= c_~sqrt2~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 11863283.0 8388608.0))) (= c_currentRoundingMode roundNearestTiesToEven) (let ((.cse5 (fp.leq c_ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) c_currentRoundingMode 3.0))) (.cse6 (fp.geq c_ULTIMATE.start_main_~I~0 .cse3))) (or (and .cse0 (or (not .cse5) (not .cse6))) (and (= c_ULTIMATE.start_assume_abort_if_not_~cond (_ bv1 32)) .cse5 .cse6))))) is different from false [2021-10-28 23:06:16,314 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (= c_ULTIMATE.start_assume_abort_if_not_~cond (_ bv0 32))) (.cse3 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (or .cse0 (not (fp.geq c_ULTIMATE.start_main_~I~0 .cse1)) (let ((.cse2 (fp.mul c_currentRoundingMode c_~sqrt2~0 (fp.add c_currentRoundingMode .cse3 (let ((.cse4 (fp.sub c_currentRoundingMode (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~I~0 .cse1) .cse3))) (fp.mul c_currentRoundingMode .cse4 (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0)) .cse4)))))))) (and (fp.geq .cse2 .cse3) (fp.leq .cse2 .cse1))))) (= c_~sqrt2~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 11863283.0 8388608.0))) (= c_currentRoundingMode roundNearestTiesToEven) (let ((.cse5 (fp.leq c_ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) c_currentRoundingMode 3.0))) (.cse6 (fp.geq c_ULTIMATE.start_main_~I~0 .cse3))) (or (and .cse0 (or (not .cse5) (not .cse6))) (and (= c_ULTIMATE.start_assume_abort_if_not_~cond (_ bv1 32)) .cse5 .cse6))))) is different from true [2021-10-28 23:06:18,445 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (fp.leq c_ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) c_currentRoundingMode 3.0)) (fp.geq c_ULTIMATE.start_main_~I~0 .cse0) (= c_~sqrt2~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 11863283.0 8388608.0))) (= c_currentRoundingMode roundNearestTiesToEven) (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (or (not (fp.geq c_ULTIMATE.start_main_~I~0 .cse1)) (let ((.cse2 (fp.mul c_currentRoundingMode c_~sqrt2~0 (fp.add c_currentRoundingMode .cse0 (let ((.cse3 (fp.sub c_currentRoundingMode (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~I~0 .cse1) .cse0))) (fp.mul c_currentRoundingMode .cse3 (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0)) .cse3)))))))) (and (fp.geq .cse2 .cse0) (fp.leq .cse2 .cse1))))))) is different from false [2021-10-28 23:06:20,606 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (fp.leq c_ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) c_currentRoundingMode 3.0)) (fp.geq c_ULTIMATE.start_main_~I~0 .cse0) (= c_~sqrt2~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 11863283.0 8388608.0))) (= c_currentRoundingMode roundNearestTiesToEven) (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (or (not (fp.geq c_ULTIMATE.start_main_~I~0 .cse1)) (let ((.cse2 (fp.mul c_currentRoundingMode c_~sqrt2~0 (fp.add c_currentRoundingMode .cse0 (let ((.cse3 (fp.sub c_currentRoundingMode (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~I~0 .cse1) .cse0))) (fp.mul c_currentRoundingMode .cse3 (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0)) .cse3)))))))) (and (fp.geq .cse2 .cse0) (fp.leq .cse2 .cse1))))))) is different from true [2021-10-28 23:06:22,736 WARN L838 $PredicateComparison]: unable to prove that (and (fp.geq c_ULTIMATE.start_main_~S~0 ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (exists ((ULTIMATE.start_main_~I~0 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (and (fp.geq ULTIMATE.start_main_~I~0 .cse0) (= (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 11863283.0 8388608.0)) (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (fp.add c_currentRoundingMode .cse1 (let ((.cse2 (fp.sub c_currentRoundingMode (fp.div c_currentRoundingMode ULTIMATE.start_main_~I~0 .cse0) .cse1))) (fp.mul c_currentRoundingMode .cse2 (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0)) .cse2))))))) c_ULTIMATE.start_main_~S~0) (fp.leq ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) c_currentRoundingMode 3.0))))) (fp.leq c_ULTIMATE.start_main_~S~0 ((_ to_fp 11 53) c_currentRoundingMode 2.0)) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2021-10-28 23:06:24,865 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((ULTIMATE.start_main_~I~0 (_ FloatingPoint 11 53))) (let ((.cse3 ((_ to_fp 11 53) roundNearestTiesToEven 2.0))) (and (fp.leq ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) roundNearestTiesToEven 3.0)) (let ((.cse4 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse2 (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 11863283.0 8388608.0)) (fp.add roundNearestTiesToEven .cse4 (let ((.cse5 (fp.sub roundNearestTiesToEven (fp.div roundNearestTiesToEven ULTIMATE.start_main_~I~0 .cse3) .cse4))) (fp.mul roundNearestTiesToEven .cse5 (fp.sub roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 8.0)) .cse5)))))))) (let ((.cse0 (fp.geq .cse2 .cse4)) (.cse1 (fp.leq .cse2 .cse3))) (or (and (= c_ULTIMATE.start___VERIFIER_assert_~cond (_ bv1 32)) .cse0 .cse1) (and (= c_ULTIMATE.start___VERIFIER_assert_~cond (_ bv0 32)) (or (not .cse0) (not .cse1))))))) (fp.geq ULTIMATE.start_main_~I~0 .cse3)))) (not (= c_ULTIMATE.start___VERIFIER_assert_~cond (_ bv0 32)))) is different from false [2021-10-28 23:06:24,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 23:06:24,926 INFO L93 Difference]: Finished difference Result 12 states and 11 transitions. [2021-10-28 23:06:24,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-28 23:06:24,928 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 12 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2021-10-28 23:06:24,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 23:06:24,928 INFO L225 Difference]: With dead ends: 12 [2021-10-28 23:06:24,929 INFO L226 Difference]: Without dead ends: 8 [2021-10-28 23:06:24,930 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 11 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 41.0s TimeCoverageRelationStatistics Valid=35, Invalid=32, Unknown=19, NotChecked=220, Total=306 [2021-10-28 23:06:24,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2021-10-28 23:06:24,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2021-10-28 23:06:24,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.0) internal successors, (7), 7 states have internal predecessors, (7), 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-10-28 23:06:24,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 7 transitions. [2021-10-28 23:06:24,933 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 7 transitions. Word has length 7 [2021-10-28 23:06:24,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 23:06:24,933 INFO L470 AbstractCegarLoop]: Abstraction has 8 states and 7 transitions. [2021-10-28 23:06:24,934 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 12 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-10-28 23:06:24,934 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 7 transitions. [2021-10-28 23:06:24,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-10-28 23:06:24,935 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 23:06:24,935 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-10-28 23:06:24,961 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e692a17-d407-4a58-a3e8-84d338973b1f/bin/uautomizer-GMMbpWq8iD/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2021-10-28 23:06:25,139 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e692a17-d407-4a58-a3e8-84d338973b1f/bin/uautomizer-GMMbpWq8iD/mathsat -unsat_core_generation=3 [2021-10-28 23:06:25,140 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 23:06:25,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 23:06:25,141 INFO L85 PathProgramCache]: Analyzing trace with hash 1806935560, now seen corresponding path program 1 times [2021-10-28 23:06:25,141 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-10-28 23:06:25,141 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1831848150] [2021-10-28 23:06:25,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 23:06:25,142 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-28 23:06:25,142 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e692a17-d407-4a58-a3e8-84d338973b1f/bin/uautomizer-GMMbpWq8iD/mathsat [2021-10-28 23:06:25,143 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e692a17-d407-4a58-a3e8-84d338973b1f/bin/uautomizer-GMMbpWq8iD/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-28 23:06:25,147 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e692a17-d407-4a58-a3e8-84d338973b1f/bin/uautomizer-GMMbpWq8iD/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-10-28 23:06:37,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 23:06:37,731 INFO L263 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 9 conjunts are in the unsatisfiable core [2021-10-28 23:06:37,732 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-28 23:06:54,112 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((ULTIMATE.start_main_~I~0 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (fp.geq ULTIMATE.start_main_~I~0 .cse0) (= c_ULTIMATE.start_main_~S~0 (fp.add c_currentRoundingMode .cse0 (let ((.cse1 (fp.sub c_currentRoundingMode ULTIMATE.start_main_~I~0 .cse0))) (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0))) (fp.mul c_currentRoundingMode .cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 16.0)))))))))) (not (fp.geq ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) c_currentRoundingMode 2.0)))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2021-10-28 23:08:41,656 WARN L838 $PredicateComparison]: unable to prove that (exists ((ULTIMATE.start_main_~I~0 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 2.0)) (.cse4 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (not (fp.geq ULTIMATE.start_main_~I~0 .cse0)) (let ((.cse3 (fp.add roundNearestTiesToEven .cse4 (let ((.cse5 (fp.sub roundNearestTiesToEven ULTIMATE.start_main_~I~0 .cse4))) (fp.mul roundNearestTiesToEven .cse5 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) (fp.mul roundNearestTiesToEven .cse5 (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 8.0))) (fp.mul roundNearestTiesToEven .cse5 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 16.0))))))))))) (let ((.cse1 (fp.leq .cse3 .cse0)) (.cse2 (fp.geq .cse3 .cse4))) (or (and .cse1 (= c_ULTIMATE.start___VERIFIER_assert_~cond (_ bv1 32)) .cse2) (and (= c_ULTIMATE.start___VERIFIER_assert_~cond (_ bv0 32)) (or (not .cse1) (not .cse2)))))) (fp.geq ULTIMATE.start_main_~I~0 .cse4)))) is different from false [2021-10-28 23:08:43,743 WARN L860 $PredicateComparison]: unable to prove that (exists ((ULTIMATE.start_main_~I~0 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 2.0)) (.cse4 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (not (fp.geq ULTIMATE.start_main_~I~0 .cse0)) (let ((.cse3 (fp.add roundNearestTiesToEven .cse4 (let ((.cse5 (fp.sub roundNearestTiesToEven ULTIMATE.start_main_~I~0 .cse4))) (fp.mul roundNearestTiesToEven .cse5 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) (fp.mul roundNearestTiesToEven .cse5 (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 8.0))) (fp.mul roundNearestTiesToEven .cse5 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 16.0))))))))))) (let ((.cse1 (fp.leq .cse3 .cse0)) (.cse2 (fp.geq .cse3 .cse4))) (or (and .cse1 (= c_ULTIMATE.start___VERIFIER_assert_~cond (_ bv1 32)) .cse2) (and (= c_ULTIMATE.start___VERIFIER_assert_~cond (_ bv0 32)) (or (not .cse1) (not .cse2)))))) (fp.geq ULTIMATE.start_main_~I~0 .cse4)))) is different from true [2021-10-28 23:09:35,867 WARN L838 $PredicateComparison]: unable to prove that (exists ((ULTIMATE.start_main_~I~0 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 2.0)) (.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (not (fp.geq ULTIMATE.start_main_~I~0 .cse0)) (let ((.cse1 (fp.add roundNearestTiesToEven .cse2 (let ((.cse3 (fp.sub roundNearestTiesToEven ULTIMATE.start_main_~I~0 .cse2))) (fp.mul roundNearestTiesToEven .cse3 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) (fp.mul roundNearestTiesToEven .cse3 (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 8.0))) (fp.mul roundNearestTiesToEven .cse3 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 16.0))))))))))) (or (not (fp.leq .cse1 .cse0)) (not (fp.geq .cse1 .cse2)))) (fp.geq ULTIMATE.start_main_~I~0 .cse2)))) is different from false [2021-10-28 23:09:37,945 WARN L860 $PredicateComparison]: unable to prove that (exists ((ULTIMATE.start_main_~I~0 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 2.0)) (.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (not (fp.geq ULTIMATE.start_main_~I~0 .cse0)) (let ((.cse1 (fp.add roundNearestTiesToEven .cse2 (let ((.cse3 (fp.sub roundNearestTiesToEven ULTIMATE.start_main_~I~0 .cse2))) (fp.mul roundNearestTiesToEven .cse3 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) (fp.mul roundNearestTiesToEven .cse3 (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 8.0))) (fp.mul roundNearestTiesToEven .cse3 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 16.0))))))))))) (or (not (fp.leq .cse1 .cse0)) (not (fp.geq .cse1 .cse2)))) (fp.geq ULTIMATE.start_main_~I~0 .cse2)))) is different from true [2021-10-28 23:09:37,945 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 23:09:37,945 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-28 23:09:53,414 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (or (fp.geq c_ULTIMATE.start_main_~I~0 .cse0) (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse1 (fp.add c_currentRoundingMode .cse2 (let ((.cse3 (fp.sub c_currentRoundingMode c_ULTIMATE.start_main_~I~0 .cse2))) (fp.mul c_currentRoundingMode .cse3 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode .cse3 (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0))) (fp.mul c_currentRoundingMode .cse3 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 16.0))))))))))) (and (fp.geq .cse1 .cse2) (fp.leq .cse1 .cse0)))))) is different from false [2021-10-28 23:09:55,528 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (or (fp.geq c_ULTIMATE.start_main_~I~0 .cse0) (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse1 (fp.add c_currentRoundingMode .cse2 (let ((.cse3 (fp.sub c_currentRoundingMode c_ULTIMATE.start_main_~I~0 .cse2))) (fp.mul c_currentRoundingMode .cse3 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode .cse3 (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0))) (fp.mul c_currentRoundingMode .cse3 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 16.0))))))))))) (and (fp.geq .cse1 .cse2) (fp.leq .cse1 .cse0)))))) is different from true [2021-10-28 23:10:15,156 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (or (fp.geq c_ULTIMATE.start_main_~I~0 .cse0) (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse1 (fp.add c_currentRoundingMode .cse2 (let ((.cse3 (fp.sub c_currentRoundingMode c_ULTIMATE.start_main_~I~0 .cse2))) (fp.mul c_currentRoundingMode .cse3 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode .cse3 (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0))) (fp.mul c_currentRoundingMode .cse3 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 16.0))))))))))) (and (fp.geq .cse1 .cse2) (fp.leq .cse1 .cse0)))) (= c_ULTIMATE.start_assume_abort_if_not_~cond (_ bv0 32)))) is different from false [2021-10-28 23:10:17,269 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (or (fp.geq c_ULTIMATE.start_main_~I~0 .cse0) (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse1 (fp.add c_currentRoundingMode .cse2 (let ((.cse3 (fp.sub c_currentRoundingMode c_ULTIMATE.start_main_~I~0 .cse2))) (fp.mul c_currentRoundingMode .cse3 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode .cse3 (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0))) (fp.mul c_currentRoundingMode .cse3 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 16.0))))))))))) (and (fp.geq .cse1 .cse2) (fp.leq .cse1 .cse0)))) (= c_ULTIMATE.start_assume_abort_if_not_~cond (_ bv0 32)))) is different from true [2021-10-28 23:11:10,575 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_main_~I~0_9 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 2.0)) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (fp.geq v_ULTIMATE.start_main_~I~0_9 .cse0) (let ((.cse1 (fp.add c_currentRoundingMode .cse2 (let ((.cse3 (fp.sub c_currentRoundingMode v_ULTIMATE.start_main_~I~0_9 .cse2))) (fp.mul c_currentRoundingMode .cse3 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode .cse3 (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0))) (fp.mul c_currentRoundingMode .cse3 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 16.0))))))))))) (and (fp.geq .cse1 .cse2) (fp.leq .cse1 .cse0))) (not (fp.geq v_ULTIMATE.start_main_~I~0_9 .cse2))))) is different from false [2021-10-28 23:11:12,722 WARN L860 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_main_~I~0_9 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 2.0)) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (fp.geq v_ULTIMATE.start_main_~I~0_9 .cse0) (let ((.cse1 (fp.add c_currentRoundingMode .cse2 (let ((.cse3 (fp.sub c_currentRoundingMode v_ULTIMATE.start_main_~I~0_9 .cse2))) (fp.mul c_currentRoundingMode .cse3 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode .cse3 (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0))) (fp.mul c_currentRoundingMode .cse3 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 16.0))))))))))) (and (fp.geq .cse1 .cse2) (fp.leq .cse1 .cse0))) (not (fp.geq v_ULTIMATE.start_main_~I~0_9 .cse2))))) is different from true [2021-10-28 23:11:12,722 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-28 23:11:12,723 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-10-28 23:11:12,723 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1831848150] [2021-10-28 23:11:12,723 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1831848150] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-28 23:11:12,724 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-28 23:11:12,724 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 12 [2021-10-28 23:11:12,724 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000747765] [2021-10-28 23:11:12,724 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-28 23:11:12,725 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-10-28 23:11:12,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-28 23:11:12,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=30, Unknown=11, NotChecked=90, Total=156 [2021-10-28 23:11:12,726 INFO L87 Difference]: Start difference. First operand 8 states and 7 transitions. Second operand has 13 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 12 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-10-28 23:11:14,847 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ULTIMATE.start_main_~I~0_9 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 2.0)) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (fp.geq v_ULTIMATE.start_main_~I~0_9 .cse0) (let ((.cse1 (fp.add c_currentRoundingMode .cse2 (let ((.cse3 (fp.sub c_currentRoundingMode v_ULTIMATE.start_main_~I~0_9 .cse2))) (fp.mul c_currentRoundingMode .cse3 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode .cse3 (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0))) (fp.mul c_currentRoundingMode .cse3 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 16.0))))))))))) (and (fp.geq .cse1 .cse2) (fp.leq .cse1 .cse0))) (not (fp.geq v_ULTIMATE.start_main_~I~0_9 .cse2))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2021-10-28 23:11:16,994 WARN L860 $PredicateComparison]: unable to prove that (and (forall ((v_ULTIMATE.start_main_~I~0_9 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 2.0)) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (fp.geq v_ULTIMATE.start_main_~I~0_9 .cse0) (let ((.cse1 (fp.add c_currentRoundingMode .cse2 (let ((.cse3 (fp.sub c_currentRoundingMode v_ULTIMATE.start_main_~I~0_9 .cse2))) (fp.mul c_currentRoundingMode .cse3 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode .cse3 (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0))) (fp.mul c_currentRoundingMode .cse3 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 16.0))))))))))) (and (fp.geq .cse1 .cse2) (fp.leq .cse1 .cse0))) (not (fp.geq v_ULTIMATE.start_main_~I~0_9 .cse2))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2021-10-28 23:11:19,163 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (= c_ULTIMATE.start_assume_abort_if_not_~cond (_ bv0 32))) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (or (fp.geq c_ULTIMATE.start_main_~I~0 .cse0) (let ((.cse1 (fp.add c_currentRoundingMode .cse2 (let ((.cse3 (fp.sub c_currentRoundingMode c_ULTIMATE.start_main_~I~0 .cse2))) (fp.mul c_currentRoundingMode .cse3 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode .cse3 (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0))) (fp.mul c_currentRoundingMode .cse3 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 16.0))))))))))) (and (fp.geq .cse1 .cse2) (fp.leq .cse1 .cse0))) .cse4)) (= c_currentRoundingMode roundNearestTiesToEven) (let ((.cse5 (fp.leq c_ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) c_currentRoundingMode 3.0))) (.cse6 (fp.geq c_ULTIMATE.start_main_~I~0 .cse2))) (or (and .cse4 (or (not .cse5) (not .cse6))) (and (= c_ULTIMATE.start_assume_abort_if_not_~cond (_ bv1 32)) .cse5 .cse6))))) is different from false [2021-10-28 23:11:21,318 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse4 (= c_ULTIMATE.start_assume_abort_if_not_~cond (_ bv0 32))) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (or (fp.geq c_ULTIMATE.start_main_~I~0 .cse0) (let ((.cse1 (fp.add c_currentRoundingMode .cse2 (let ((.cse3 (fp.sub c_currentRoundingMode c_ULTIMATE.start_main_~I~0 .cse2))) (fp.mul c_currentRoundingMode .cse3 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode .cse3 (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0))) (fp.mul c_currentRoundingMode .cse3 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 16.0))))))))))) (and (fp.geq .cse1 .cse2) (fp.leq .cse1 .cse0))) .cse4)) (= c_currentRoundingMode roundNearestTiesToEven) (let ((.cse5 (fp.leq c_ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) c_currentRoundingMode 3.0))) (.cse6 (fp.geq c_ULTIMATE.start_main_~I~0 .cse2))) (or (and .cse4 (or (not .cse5) (not .cse6))) (and (= c_ULTIMATE.start_assume_abort_if_not_~cond (_ bv1 32)) .cse5 .cse6))))) is different from true [2021-10-28 23:11:23,469 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (or (fp.geq c_ULTIMATE.start_main_~I~0 .cse0) (let ((.cse1 (fp.add c_currentRoundingMode .cse2 (let ((.cse3 (fp.sub c_currentRoundingMode c_ULTIMATE.start_main_~I~0 .cse2))) (fp.mul c_currentRoundingMode .cse3 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode .cse3 (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0))) (fp.mul c_currentRoundingMode .cse3 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 16.0))))))))))) (and (fp.geq .cse1 .cse2) (fp.leq .cse1 .cse0))))) (fp.leq c_ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) c_currentRoundingMode 3.0)) (fp.geq c_ULTIMATE.start_main_~I~0 .cse2) (= c_currentRoundingMode roundNearestTiesToEven))) is different from false [2021-10-28 23:11:25,611 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (or (fp.geq c_ULTIMATE.start_main_~I~0 .cse0) (let ((.cse1 (fp.add c_currentRoundingMode .cse2 (let ((.cse3 (fp.sub c_currentRoundingMode c_ULTIMATE.start_main_~I~0 .cse2))) (fp.mul c_currentRoundingMode .cse3 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode .cse3 (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0))) (fp.mul c_currentRoundingMode .cse3 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 16.0))))))))))) (and (fp.geq .cse1 .cse2) (fp.leq .cse1 .cse0))))) (fp.leq c_ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) c_currentRoundingMode 3.0)) (fp.geq c_ULTIMATE.start_main_~I~0 .cse2) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2021-10-28 23:11:27,787 WARN L838 $PredicateComparison]: unable to prove that (and (fp.geq c_ULTIMATE.start_main_~S~0 ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (exists ((ULTIMATE.start_main_~I~0 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (fp.geq ULTIMATE.start_main_~I~0 .cse0) (= c_ULTIMATE.start_main_~S~0 (fp.add c_currentRoundingMode .cse0 (let ((.cse1 (fp.sub c_currentRoundingMode ULTIMATE.start_main_~I~0 .cse0))) (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0))) (fp.mul c_currentRoundingMode .cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 16.0)))))))))) (not (fp.geq ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) c_currentRoundingMode 2.0)))))) (fp.leq c_ULTIMATE.start_main_~S~0 ((_ to_fp 11 53) c_currentRoundingMode 2.0)) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2021-10-28 23:11:29,948 WARN L838 $PredicateComparison]: unable to prove that (and (not (= c_ULTIMATE.start___VERIFIER_assert_~cond (_ bv0 32))) (exists ((ULTIMATE.start_main_~I~0 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 2.0)) (.cse4 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (not (fp.geq ULTIMATE.start_main_~I~0 .cse0)) (let ((.cse3 (fp.add roundNearestTiesToEven .cse4 (let ((.cse5 (fp.sub roundNearestTiesToEven ULTIMATE.start_main_~I~0 .cse4))) (fp.mul roundNearestTiesToEven .cse5 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) (fp.mul roundNearestTiesToEven .cse5 (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 8.0))) (fp.mul roundNearestTiesToEven .cse5 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 16.0))))))))))) (let ((.cse1 (fp.leq .cse3 .cse0)) (.cse2 (fp.geq .cse3 .cse4))) (or (and .cse1 (= c_ULTIMATE.start___VERIFIER_assert_~cond (_ bv1 32)) .cse2) (and (= c_ULTIMATE.start___VERIFIER_assert_~cond (_ bv0 32)) (or (not .cse1) (not .cse2)))))) (fp.geq ULTIMATE.start_main_~I~0 .cse4))))) is different from false [2021-10-28 23:11:29,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 23:11:29,961 INFO L93 Difference]: Finished difference Result 8 states and 7 transitions. [2021-10-28 23:11:29,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-28 23:11:29,961 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 12 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2021-10-28 23:11:29,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 23:11:29,962 INFO L225 Difference]: With dead ends: 8 [2021-10-28 23:11:29,962 INFO L226 Difference]: Without dead ends: 0 [2021-10-28 23:11:29,962 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 11 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 40.9s TimeCoverageRelationStatistics Valid=35, Invalid=32, Unknown=19, NotChecked=220, Total=306 [2021-10-28 23:11:29,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-10-28 23:11:29,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-10-28 23:11:29,963 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-10-28 23:11:29,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-10-28 23:11:29,963 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 7 [2021-10-28 23:11:29,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 23:11:29,963 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-10-28 23:11:29,964 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 12 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-10-28 23:11:29,964 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-10-28 23:11:29,964 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-10-28 23:11:29,966 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 23:11:29,991 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e692a17-d407-4a58-a3e8-84d338973b1f/bin/uautomizer-GMMbpWq8iD/mathsat -unsat_core_generation=3 (4)] Ended with exit code 0 [2021-10-28 23:11:30,167 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e692a17-d407-4a58-a3e8-84d338973b1f/bin/uautomizer-GMMbpWq8iD/mathsat -unsat_core_generation=3 [2021-10-28 23:11:30,170 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-10-28 23:11:30,175 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 23:11:30,211 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 23:11:30,223 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-10-28 23:11:30,224 INFO L860 garLoopResultBuilder]: At program point L31(lines 20 32) the Hoare annotation is: true [2021-10-28 23:11:30,224 INFO L857 garLoopResultBuilder]: For program point L27-1(lines 27 28) no Hoare annotation was computed. [2021-10-28 23:11:30,224 INFO L857 garLoopResultBuilder]: For program point L13(lines 27 28) no Hoare annotation was computed. [2021-10-28 23:11:30,224 INFO L857 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-10-28 23:11:30,224 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-10-28 23:11:30,225 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-10-28 23:11:30,225 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 16) no Hoare annotation was computed. [2021-10-28 23:11:30,225 INFO L857 garLoopResultBuilder]: For program point L16(line 16) no Hoare annotation was computed. [2021-10-28 23:11:30,226 INFO L857 garLoopResultBuilder]: For program point L16-1(line 16) no Hoare annotation was computed. [2021-10-28 23:11:30,226 INFO L857 garLoopResultBuilder]: For program point L14(line 14) no Hoare annotation was computed. [2021-10-28 23:11:30,226 INFO L860 garLoopResultBuilder]: At program point L16-3(line 16) the Hoare annotation is: true [2021-10-28 23:11:30,230 INFO L731 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2021-10-28 23:11:30,232 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-10-28 23:11:30,239 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.10 11:11:30 BoogieIcfgContainer [2021-10-28 23:11:30,240 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-10-28 23:11:30,240 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-28 23:11:30,241 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-28 23:11:30,241 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-28 23:11:30,242 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.10 11:01:24" (3/4) ... [2021-10-28 23:11:30,246 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-10-28 23:11:30,264 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2021-10-28 23:11:30,265 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2021-10-28 23:11:30,265 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-10-28 23:11:30,266 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-10-28 23:11:30,321 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e692a17-d407-4a58-a3e8-84d338973b1f/bin/uautomizer-GMMbpWq8iD/witness.graphml [2021-10-28 23:11:30,323 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-28 23:11:30,326 INFO L168 Benchmark]: Toolchain (without parser) took 611233.68 ms. Allocated memory was 54.5 MB in the beginning and 79.7 MB in the end (delta: 25.2 MB). Free memory was 33.0 MB in the beginning and 48.0 MB in the end (delta: -15.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 16.1 GB. [2021-10-28 23:11:30,326 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 54.5 MB. Free memory was 35.9 MB in the beginning and 35.8 MB in the end (delta: 38.6 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-10-28 23:11:30,333 INFO L168 Benchmark]: CACSL2BoogieTranslator took 288.96 ms. Allocated memory is still 54.5 MB. Free memory was 32.9 MB in the beginning and 36.1 MB in the end (delta: -3.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 16.1 GB. [2021-10-28 23:11:30,335 INFO L168 Benchmark]: Boogie Procedure Inliner took 124.64 ms. Allocated memory was 54.5 MB in the beginning and 79.7 MB in the end (delta: 25.2 MB). Free memory was 36.1 MB in the beginning and 62.5 MB in the end (delta: -26.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-28 23:11:30,336 INFO L168 Benchmark]: Boogie Preprocessor took 55.45 ms. Allocated memory is still 79.7 MB. Free memory was 62.5 MB in the beginning and 61.4 MB in the end (delta: 1.2 MB). There was no memory consumed. Max. memory is 16.1 GB. [2021-10-28 23:11:30,342 INFO L168 Benchmark]: RCFGBuilder took 4750.04 ms. Allocated memory is still 79.7 MB. Free memory was 61.4 MB in the beginning and 51.7 MB in the end (delta: 9.7 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2021-10-28 23:11:30,343 INFO L168 Benchmark]: TraceAbstraction took 605922.98 ms. Allocated memory is still 79.7 MB. Free memory was 51.2 MB in the beginning and 50.7 MB in the end (delta: 478.4 kB). Peak memory consumption was 2.5 MB. Max. memory is 16.1 GB. [2021-10-28 23:11:30,344 INFO L168 Benchmark]: Witness Printer took 82.93 ms. Allocated memory is still 79.7 MB. Free memory was 50.7 MB in the beginning and 48.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-28 23:11:30,347 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.21 ms. Allocated memory is still 54.5 MB. Free memory was 35.9 MB in the beginning and 35.8 MB in the end (delta: 38.6 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 288.96 ms. Allocated memory is still 54.5 MB. Free memory was 32.9 MB in the beginning and 36.1 MB in the end (delta: -3.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 124.64 ms. Allocated memory was 54.5 MB in the beginning and 79.7 MB in the end (delta: 25.2 MB). Free memory was 36.1 MB in the beginning and 62.5 MB in the end (delta: -26.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 55.45 ms. Allocated memory is still 79.7 MB. Free memory was 62.5 MB in the beginning and 61.4 MB in the end (delta: 1.2 MB). There was no memory consumed. Max. memory is 16.1 GB. * RCFGBuilder took 4750.04 ms. Allocated memory is still 79.7 MB. Free memory was 61.4 MB in the beginning and 51.7 MB in the end (delta: 9.7 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * TraceAbstraction took 605922.98 ms. Allocated memory is still 79.7 MB. Free memory was 51.2 MB in the beginning and 50.7 MB in the end (delta: 478.4 kB). Peak memory consumption was 2.5 MB. Max. memory is 16.1 GB. * Witness Printer took 82.93 ms. Allocated memory is still 79.7 MB. Free memory was 50.7 MB in the beginning and 48.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.1 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.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 16]: 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, 12 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 605.8s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 34.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 17 SDtfs, 0 SDslu, 11 SDs, 0 SdLazy, 11 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 46 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 22 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 82.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=12occurred in iteration=0, InterpolantAutomatonStates: 16, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 2 LocationsWithAnnotation, 2 PreInvPairs, 4 NumberOfFragments, 2 HoareAnnotationTreeSize, 2 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 2 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 15.2s SatisfiabilityAnalysisTime, 555.1s InterpolantComputationTime, 21 NumberOfCodeBlocks, 21 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 36 ConstructedInterpolants, 8 QuantifiedInterpolants, 1563 SizeOfPredicates, 15 NumberOfNonLiveVariables, 99 ConjunctsInSsa, 20 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 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: 16]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 20]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2021-10-28 23:11:30,579 WARN L435 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e692a17-d407-4a58-a3e8-84d338973b1f/bin/uautomizer-GMMbpWq8iD/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2021-10-28 23:11:30,638 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e692a17-d407-4a58-a3e8-84d338973b1f/bin/uautomizer-GMMbpWq8iD/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 137 Received shutdown request...