./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_9b8ef09d-eda7-4cec-9388-280f043adbcd/bin/uautomizer-UnR33cPsHg/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b8ef09d-eda7-4cec-9388-280f043adbcd/bin/uautomizer-UnR33cPsHg/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b8ef09d-eda7-4cec-9388-280f043adbcd/bin/uautomizer-UnR33cPsHg/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b8ef09d-eda7-4cec-9388-280f043adbcd/bin/uautomizer-UnR33cPsHg/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-benchs/sqrt_poly.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b8ef09d-eda7-4cec-9388-280f043adbcd/bin/uautomizer-UnR33cPsHg/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b8ef09d-eda7-4cec-9388-280f043adbcd/bin/uautomizer-UnR33cPsHg --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_9b8ef09d-eda7-4cec-9388-280f043adbcd/bin/uautomizer-UnR33cPsHg/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b8ef09d-eda7-4cec-9388-280f043adbcd/bin/uautomizer-UnR33cPsHg/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b8ef09d-eda7-4cec-9388-280f043adbcd/bin/uautomizer-UnR33cPsHg/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b8ef09d-eda7-4cec-9388-280f043adbcd/bin/uautomizer-UnR33cPsHg/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-benchs/sqrt_poly.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b8ef09d-eda7-4cec-9388-280f043adbcd/bin/uautomizer-UnR33cPsHg/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b8ef09d-eda7-4cec-9388-280f043adbcd/bin/uautomizer-UnR33cPsHg --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 08:36:27,341 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-28 08:36:27,343 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-28 08:36:27,377 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-28 08:36:27,377 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-28 08:36:27,382 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-28 08:36:27,385 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-28 08:36:27,387 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-28 08:36:27,389 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-28 08:36:27,390 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-28 08:36:27,391 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-28 08:36:27,393 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-28 08:36:27,393 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-28 08:36:27,395 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-28 08:36:27,396 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-28 08:36:27,398 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-28 08:36:27,399 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-28 08:36:27,400 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-28 08:36:27,402 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-28 08:36:27,404 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-28 08:36:27,405 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-28 08:36:27,407 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-28 08:36:27,408 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-28 08:36:27,409 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-28 08:36:27,413 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-28 08:36:27,413 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-28 08:36:27,414 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-28 08:36:27,415 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-28 08:36:27,416 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-28 08:36:27,417 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-28 08:36:27,417 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-28 08:36:27,418 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-28 08:36:27,419 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-28 08:36:27,420 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-28 08:36:27,422 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-28 08:36:27,422 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-28 08:36:27,423 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-28 08:36:27,423 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-28 08:36:27,424 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-28 08:36:27,425 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-28 08:36:27,426 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-28 08:36:27,427 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b8ef09d-eda7-4cec-9388-280f043adbcd/bin/uautomizer-UnR33cPsHg/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-10-28 08:36:27,451 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-28 08:36:27,452 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-28 08:36:27,452 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-10-28 08:36:27,453 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-10-28 08:36:27,454 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-10-28 08:36:27,454 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-10-28 08:36:27,454 INFO L138 SettingsManager]: * Use SBE=true [2021-10-28 08:36:27,455 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-28 08:36:27,455 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-28 08:36:27,455 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-28 08:36:27,456 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-28 08:36:27,456 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-28 08:36:27,456 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-10-28 08:36:27,456 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-28 08:36:27,457 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-10-28 08:36:27,457 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-28 08:36:27,457 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-10-28 08:36:27,458 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-28 08:36:27,458 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-10-28 08:36:27,458 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-28 08:36:27,459 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-10-28 08:36:27,459 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-28 08:36:27,459 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-28 08:36:27,459 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-28 08:36:27,460 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-28 08:36:27,460 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-10-28 08:36:27,460 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-10-28 08:36:27,460 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-10-28 08:36:27,461 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-10-28 08:36:27,461 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-10-28 08:36:27,461 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-10-28 08:36:27,461 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-28 08:36:27,462 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_9b8ef09d-eda7-4cec-9388-280f043adbcd/bin/uautomizer-UnR33cPsHg/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_9b8ef09d-eda7-4cec-9388-280f043adbcd/bin/uautomizer-UnR33cPsHg 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 08:36:27,775 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-28 08:36:27,801 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-28 08:36:27,804 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-28 08:36:27,805 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-28 08:36:27,806 INFO L275 PluginConnector]: CDTParser initialized [2021-10-28 08:36:27,807 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b8ef09d-eda7-4cec-9388-280f043adbcd/bin/uautomizer-UnR33cPsHg/../../sv-benchmarks/c/float-benchs/sqrt_poly.c [2021-10-28 08:36:27,886 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b8ef09d-eda7-4cec-9388-280f043adbcd/bin/uautomizer-UnR33cPsHg/data/a8598bb81/1ab1c6bd5d72463794696af2194b7bca/FLAG736f01493 [2021-10-28 08:36:28,434 INFO L306 CDTParser]: Found 1 translation units. [2021-10-28 08:36:28,435 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b8ef09d-eda7-4cec-9388-280f043adbcd/sv-benchmarks/c/float-benchs/sqrt_poly.c [2021-10-28 08:36:28,441 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b8ef09d-eda7-4cec-9388-280f043adbcd/bin/uautomizer-UnR33cPsHg/data/a8598bb81/1ab1c6bd5d72463794696af2194b7bca/FLAG736f01493 [2021-10-28 08:36:28,807 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b8ef09d-eda7-4cec-9388-280f043adbcd/bin/uautomizer-UnR33cPsHg/data/a8598bb81/1ab1c6bd5d72463794696af2194b7bca [2021-10-28 08:36:28,809 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-28 08:36:28,811 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-28 08:36:28,813 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-28 08:36:28,813 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-28 08:36:28,816 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-28 08:36:28,817 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.10 08:36:28" (1/1) ... [2021-10-28 08:36:28,818 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d1f3bcc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 08:36:28, skipping insertion in model container [2021-10-28 08:36:28,818 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.10 08:36:28" (1/1) ... [2021-10-28 08:36:28,826 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-28 08:36:28,839 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-28 08:36:29,056 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_9b8ef09d-eda7-4cec-9388-280f043adbcd/sv-benchmarks/c/float-benchs/sqrt_poly.c[671,684] [2021-10-28 08:36:29,078 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-28 08:36:29,088 INFO L203 MainTranslator]: Completed pre-run [2021-10-28 08:36:29,104 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_9b8ef09d-eda7-4cec-9388-280f043adbcd/sv-benchmarks/c/float-benchs/sqrt_poly.c[671,684] [2021-10-28 08:36:29,112 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-28 08:36:29,126 INFO L208 MainTranslator]: Completed translation [2021-10-28 08:36:29,126 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 08:36:29 WrapperNode [2021-10-28 08:36:29,127 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-28 08:36:29,130 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-28 08:36:29,130 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-28 08:36:29,131 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-28 08:36:29,138 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 08:36:29" (1/1) ... [2021-10-28 08:36:29,147 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 08:36:29" (1/1) ... [2021-10-28 08:36:29,167 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-28 08:36:29,168 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-28 08:36:29,168 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-28 08:36:29,168 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-28 08:36:29,176 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 08:36:29" (1/1) ... [2021-10-28 08:36:29,177 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 08:36:29" (1/1) ... [2021-10-28 08:36:29,187 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 08:36:29" (1/1) ... [2021-10-28 08:36:29,188 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 08:36:29" (1/1) ... [2021-10-28 08:36:29,193 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 08:36:29" (1/1) ... [2021-10-28 08:36:29,195 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 08:36:29" (1/1) ... [2021-10-28 08:36:29,196 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 08:36:29" (1/1) ... [2021-10-28 08:36:29,198 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-28 08:36:29,199 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-28 08:36:29,199 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-28 08:36:29,199 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-28 08:36:29,203 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 08:36:29" (1/1) ... [2021-10-28 08:36:29,211 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-28 08:36:29,225 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b8ef09d-eda7-4cec-9388-280f043adbcd/bin/uautomizer-UnR33cPsHg/z3 [2021-10-28 08:36:29,243 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b8ef09d-eda7-4cec-9388-280f043adbcd/bin/uautomizer-UnR33cPsHg/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-10-28 08:36:29,260 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b8ef09d-eda7-4cec-9388-280f043adbcd/bin/uautomizer-UnR33cPsHg/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-10-28 08:36:29,292 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-28 08:36:29,292 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-28 08:36:29,293 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-28 08:36:29,293 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-28 08:36:29,529 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-28 08:36:29,541 INFO L299 CfgBuilder]: Removed 8 assume(true) statements. [2021-10-28 08:36:29,543 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.10 08:36:29 BoogieIcfgContainer [2021-10-28 08:36:29,544 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-28 08:36:29,546 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-28 08:36:29,546 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-28 08:36:29,550 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-28 08:36:29,550 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.10 08:36:28" (1/3) ... [2021-10-28 08:36:29,551 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d3363b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.10 08:36:29, skipping insertion in model container [2021-10-28 08:36:29,551 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 08:36:29" (2/3) ... [2021-10-28 08:36:29,552 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d3363b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.10 08:36:29, skipping insertion in model container [2021-10-28 08:36:29,552 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.10 08:36:29" (3/3) ... [2021-10-28 08:36:29,553 INFO L111 eAbstractionObserver]: Analyzing ICFG sqrt_poly.c [2021-10-28 08:36:29,559 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-28 08:36:29,559 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-10-28 08:36:29,608 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-10-28 08:36:29,615 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 08:36:29,616 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-10-28 08:36:29,630 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 08:36:29,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-10-28 08:36:29,635 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 08:36:29,636 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-10-28 08:36:29,636 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 08:36:29,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 08:36:29,642 INFO L85 PathProgramCache]: Analyzing trace with hash 1805028936, now seen corresponding path program 1 times [2021-10-28 08:36:29,651 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 08:36:29,652 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246754885] [2021-10-28 08:36:29,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 08:36:29,653 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 08:36:29,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 08:36:29,824 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 08:36:29,824 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 08:36:29,826 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246754885] [2021-10-28 08:36:29,828 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [246754885] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 08:36:29,828 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 08:36:29,828 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-28 08:36:29,831 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760826149] [2021-10-28 08:36:29,838 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-10-28 08:36:29,839 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 08:36:29,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-10-28 08:36:29,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-10-28 08:36:29,867 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 08:36:29,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 08:36:29,882 INFO L93 Difference]: Finished difference Result 21 states and 24 transitions. [2021-10-28 08:36:29,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-10-28 08:36:29,884 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 08:36:29,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 08:36:29,892 INFO L225 Difference]: With dead ends: 21 [2021-10-28 08:36:29,892 INFO L226 Difference]: Without dead ends: 8 [2021-10-28 08:36:29,896 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 08:36:29,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2021-10-28 08:36:29,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2021-10-28 08:36:29,924 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 08:36:29,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2021-10-28 08:36:29,928 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 7 [2021-10-28 08:36:29,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 08:36:29,929 INFO L470 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2021-10-28 08:36:29,929 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 08:36:29,929 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2021-10-28 08:36:29,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-10-28 08:36:29,930 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 08:36:29,931 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-10-28 08:36:29,931 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-10-28 08:36:29,932 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 08:36:29,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 08:36:29,937 INFO L85 PathProgramCache]: Analyzing trace with hash 1806875978, now seen corresponding path program 1 times [2021-10-28 08:36:29,937 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 08:36:29,938 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124548860] [2021-10-28 08:36:29,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 08:36:29,939 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 08:36:29,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-28 08:36:29,992 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-28 08:36:30,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-28 08:36:30,059 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-28 08:36:30,059 INFO L627 BasicCegarLoop]: Counterexample is feasible [2021-10-28 08:36:30,061 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 08:36:30,063 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-10-28 08:36:30,067 INFO L731 BasicCegarLoop]: Path program histogram: [1, 1] [2021-10-28 08:36:30,070 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-10-28 08:36:30,101 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.10 08:36:30 BoogieIcfgContainer [2021-10-28 08:36:30,101 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-10-28 08:36:30,102 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-28 08:36:30,102 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-28 08:36:30,102 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-28 08:36:30,103 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.10 08:36:29" (3/4) ... [2021-10-28 08:36:30,106 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-10-28 08:36:30,106 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-28 08:36:30,108 INFO L168 Benchmark]: Toolchain (without parser) took 1296.48 ms. Allocated memory was 88.1 MB in the beginning and 121.6 MB in the end (delta: 33.6 MB). Free memory was 51.4 MB in the beginning and 63.4 MB in the end (delta: -12.0 MB). Peak memory consumption was 20.4 MB. Max. memory is 16.1 GB. [2021-10-28 08:36:30,109 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 88.1 MB. Free memory is still 67.4 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-10-28 08:36:30,110 INFO L168 Benchmark]: CACSL2BoogieTranslator took 314.91 ms. Allocated memory was 88.1 MB in the beginning and 121.6 MB in the end (delta: 33.6 MB). Free memory was 51.2 MB in the beginning and 97.5 MB in the end (delta: -46.3 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2021-10-28 08:36:30,111 INFO L168 Benchmark]: Boogie Procedure Inliner took 37.23 ms. Allocated memory is still 121.6 MB. Free memory was 97.5 MB in the beginning and 96.4 MB in the end (delta: 1.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-28 08:36:30,111 INFO L168 Benchmark]: Boogie Preprocessor took 30.47 ms. Allocated memory is still 121.6 MB. Free memory was 96.4 MB in the beginning and 95.4 MB in the end (delta: 981.5 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-10-28 08:36:30,112 INFO L168 Benchmark]: RCFGBuilder took 344.76 ms. Allocated memory is still 121.6 MB. Free memory was 94.8 MB in the beginning and 85.9 MB in the end (delta: 9.0 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2021-10-28 08:36:30,113 INFO L168 Benchmark]: TraceAbstraction took 555.31 ms. Allocated memory is still 121.6 MB. Free memory was 85.3 MB in the beginning and 63.4 MB in the end (delta: 21.9 MB). Peak memory consumption was 23.1 MB. Max. memory is 16.1 GB. [2021-10-28 08:36:30,113 INFO L168 Benchmark]: Witness Printer took 4.86 ms. Allocated memory is still 121.6 MB. Free memory is still 63.4 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-10-28 08:36:30,117 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.22 ms. Allocated memory is still 88.1 MB. Free memory is still 67.4 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 314.91 ms. Allocated memory was 88.1 MB in the beginning and 121.6 MB in the end (delta: 33.6 MB). Free memory was 51.2 MB in the beginning and 97.5 MB in the end (delta: -46.3 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 37.23 ms. Allocated memory is still 121.6 MB. Free memory was 97.5 MB in the beginning and 96.4 MB in the end (delta: 1.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 30.47 ms. Allocated memory is still 121.6 MB. Free memory was 96.4 MB in the beginning and 95.4 MB in the end (delta: 981.5 kB). There was no memory consumed. Max. memory is 16.1 GB. * RCFGBuilder took 344.76 ms. Allocated memory is still 121.6 MB. Free memory was 94.8 MB in the beginning and 85.9 MB in the end (delta: 9.0 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * TraceAbstraction took 555.31 ms. Allocated memory is still 121.6 MB. Free memory was 85.3 MB in the beginning and 63.4 MB in the end (delta: 21.9 MB). Peak memory consumption was 23.1 MB. Max. memory is 16.1 GB. * Witness Printer took 4.86 ms. Allocated memory is still 121.6 MB. Free memory is still 63.4 MB. There was no memory consumed. 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 08:36:30,167 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b8ef09d-eda7-4cec-9388-280f043adbcd/bin/uautomizer-UnR33cPsHg/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 08:36:32,657 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-28 08:36:32,661 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-28 08:36:32,714 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-28 08:36:32,715 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-28 08:36:32,717 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-28 08:36:32,719 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-28 08:36:32,721 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-28 08:36:32,724 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-28 08:36:32,725 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-28 08:36:32,727 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-28 08:36:32,729 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-28 08:36:32,730 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-28 08:36:32,731 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-28 08:36:32,733 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-28 08:36:32,735 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-28 08:36:32,736 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-28 08:36:32,738 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-28 08:36:32,740 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-28 08:36:32,744 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-28 08:36:32,746 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-28 08:36:32,748 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-28 08:36:32,750 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-28 08:36:32,751 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-28 08:36:32,755 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-28 08:36:32,756 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-28 08:36:32,756 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-28 08:36:32,758 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-28 08:36:32,758 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-28 08:36:32,760 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-28 08:36:32,760 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-28 08:36:32,761 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-28 08:36:32,763 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-28 08:36:32,764 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-28 08:36:32,765 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-28 08:36:32,766 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-28 08:36:32,767 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-28 08:36:32,768 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-28 08:36:32,773 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-28 08:36:32,778 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-28 08:36:32,780 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-28 08:36:32,781 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b8ef09d-eda7-4cec-9388-280f043adbcd/bin/uautomizer-UnR33cPsHg/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2021-10-28 08:36:32,818 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-28 08:36:32,818 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-28 08:36:32,819 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-10-28 08:36:32,819 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-10-28 08:36:32,822 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-10-28 08:36:32,822 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-10-28 08:36:32,822 INFO L138 SettingsManager]: * Use SBE=true [2021-10-28 08:36:32,823 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-28 08:36:32,823 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-28 08:36:32,824 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-28 08:36:32,825 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-28 08:36:32,825 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-10-28 08:36:32,826 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-28 08:36:32,826 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-10-28 08:36:32,826 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-10-28 08:36:32,827 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-10-28 08:36:32,827 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-28 08:36:32,827 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-10-28 08:36:32,827 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-28 08:36:32,828 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-10-28 08:36:32,828 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-28 08:36:32,828 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-10-28 08:36:32,828 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-28 08:36:32,829 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-28 08:36:32,829 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-28 08:36:32,829 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-28 08:36:32,830 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-10-28 08:36:32,830 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-10-28 08:36:32,830 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-10-28 08:36:32,830 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-10-28 08:36:32,830 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-10-28 08:36:32,831 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-10-28 08:36:32,831 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-28 08:36:32,831 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-10-28 08:36:32,832 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_9b8ef09d-eda7-4cec-9388-280f043adbcd/bin/uautomizer-UnR33cPsHg/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_9b8ef09d-eda7-4cec-9388-280f043adbcd/bin/uautomizer-UnR33cPsHg 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 08:36:33,204 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-28 08:36:33,232 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-28 08:36:33,237 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-28 08:36:33,238 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-28 08:36:33,239 INFO L275 PluginConnector]: CDTParser initialized [2021-10-28 08:36:33,240 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b8ef09d-eda7-4cec-9388-280f043adbcd/bin/uautomizer-UnR33cPsHg/../../sv-benchmarks/c/float-benchs/sqrt_poly.c [2021-10-28 08:36:33,329 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b8ef09d-eda7-4cec-9388-280f043adbcd/bin/uautomizer-UnR33cPsHg/data/010313b51/657ec6a9e3984448a63fe1af626870e8/FLAG32f67152e [2021-10-28 08:36:33,884 INFO L306 CDTParser]: Found 1 translation units. [2021-10-28 08:36:33,884 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b8ef09d-eda7-4cec-9388-280f043adbcd/sv-benchmarks/c/float-benchs/sqrt_poly.c [2021-10-28 08:36:33,892 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b8ef09d-eda7-4cec-9388-280f043adbcd/bin/uautomizer-UnR33cPsHg/data/010313b51/657ec6a9e3984448a63fe1af626870e8/FLAG32f67152e [2021-10-28 08:36:34,258 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b8ef09d-eda7-4cec-9388-280f043adbcd/bin/uautomizer-UnR33cPsHg/data/010313b51/657ec6a9e3984448a63fe1af626870e8 [2021-10-28 08:36:34,261 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-28 08:36:34,262 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-28 08:36:34,264 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-28 08:36:34,264 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-28 08:36:34,277 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-28 08:36:34,279 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.10 08:36:34" (1/1) ... [2021-10-28 08:36:34,281 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6dc247bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 08:36:34, skipping insertion in model container [2021-10-28 08:36:34,282 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.10 08:36:34" (1/1) ... [2021-10-28 08:36:34,289 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-28 08:36:34,307 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-28 08:36:34,479 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_9b8ef09d-eda7-4cec-9388-280f043adbcd/sv-benchmarks/c/float-benchs/sqrt_poly.c[671,684] [2021-10-28 08:36:34,492 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-28 08:36:34,507 INFO L203 MainTranslator]: Completed pre-run [2021-10-28 08:36:34,526 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_9b8ef09d-eda7-4cec-9388-280f043adbcd/sv-benchmarks/c/float-benchs/sqrt_poly.c[671,684] [2021-10-28 08:36:34,547 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-28 08:36:34,596 INFO L208 MainTranslator]: Completed translation [2021-10-28 08:36:34,603 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 08:36:34 WrapperNode [2021-10-28 08:36:34,603 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-28 08:36:34,605 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-28 08:36:34,607 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-28 08:36:34,607 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-28 08:36:34,615 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 08:36:34" (1/1) ... [2021-10-28 08:36:34,634 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 08:36:34" (1/1) ... [2021-10-28 08:36:34,653 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-28 08:36:34,654 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-28 08:36:34,654 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-28 08:36:34,654 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-28 08:36:34,662 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 08:36:34" (1/1) ... [2021-10-28 08:36:34,663 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 08:36:34" (1/1) ... [2021-10-28 08:36:34,666 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 08:36:34" (1/1) ... [2021-10-28 08:36:34,666 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 08:36:34" (1/1) ... [2021-10-28 08:36:34,672 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 08:36:34" (1/1) ... [2021-10-28 08:36:34,674 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 08:36:34" (1/1) ... [2021-10-28 08:36:34,676 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 08:36:34" (1/1) ... [2021-10-28 08:36:34,679 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-28 08:36:34,679 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-28 08:36:34,680 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-28 08:36:34,680 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-28 08:36:34,680 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 08:36:34" (1/1) ... [2021-10-28 08:36:34,687 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-28 08:36:34,698 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b8ef09d-eda7-4cec-9388-280f043adbcd/bin/uautomizer-UnR33cPsHg/z3 [2021-10-28 08:36:34,709 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b8ef09d-eda7-4cec-9388-280f043adbcd/bin/uautomizer-UnR33cPsHg/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-10-28 08:36:34,711 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b8ef09d-eda7-4cec-9388-280f043adbcd/bin/uautomizer-UnR33cPsHg/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-10-28 08:36:34,747 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-10-28 08:36:34,747 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-28 08:36:34,747 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-28 08:36:34,747 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-28 08:36:39,213 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-28 08:36:39,214 INFO L299 CfgBuilder]: Removed 8 assume(true) statements. [2021-10-28 08:36:39,216 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.10 08:36:39 BoogieIcfgContainer [2021-10-28 08:36:39,216 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-28 08:36:39,218 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-28 08:36:39,218 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-28 08:36:39,221 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-28 08:36:39,222 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.10 08:36:34" (1/3) ... [2021-10-28 08:36:39,222 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b2f4340 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.10 08:36:39, skipping insertion in model container [2021-10-28 08:36:39,223 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 08:36:34" (2/3) ... [2021-10-28 08:36:39,223 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b2f4340 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.10 08:36:39, skipping insertion in model container [2021-10-28 08:36:39,223 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.10 08:36:39" (3/3) ... [2021-10-28 08:36:39,225 INFO L111 eAbstractionObserver]: Analyzing ICFG sqrt_poly.c [2021-10-28 08:36:39,231 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-28 08:36:39,231 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-10-28 08:36:39,278 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-10-28 08:36:39,285 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 08:36:39,314 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-10-28 08:36:39,348 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 08:36:39,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-10-28 08:36:39,365 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 08:36:39,366 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-10-28 08:36:39,367 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 08:36:39,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 08:36:39,388 INFO L85 PathProgramCache]: Analyzing trace with hash 1805028936, now seen corresponding path program 1 times [2021-10-28 08:36:39,400 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-10-28 08:36:39,414 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1618463829] [2021-10-28 08:36:39,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 08:36:39,415 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-28 08:36:39,415 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b8ef09d-eda7-4cec-9388-280f043adbcd/bin/uautomizer-UnR33cPsHg/mathsat [2021-10-28 08:36:39,442 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b8ef09d-eda7-4cec-9388-280f043adbcd/bin/uautomizer-UnR33cPsHg/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-28 08:36:39,473 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b8ef09d-eda7-4cec-9388-280f043adbcd/bin/uautomizer-UnR33cPsHg/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-10-28 08:36:40,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 08:36:40,416 INFO L263 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 1 conjunts are in the unsatisfiable core [2021-10-28 08:36:40,420 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-28 08:36:40,499 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 08:36:40,500 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-28 08:36:40,561 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 08:36:40,562 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-10-28 08:36:40,562 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1618463829] [2021-10-28 08:36:40,563 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1618463829] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-28 08:36:40,563 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-28 08:36:40,564 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2021-10-28 08:36:40,566 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484958565] [2021-10-28 08:36:40,571 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-10-28 08:36:40,571 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-10-28 08:36:40,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-10-28 08:36:40,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-10-28 08:36:40,587 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 08:36:40,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 08:36:40,600 INFO L93 Difference]: Finished difference Result 21 states and 24 transitions. [2021-10-28 08:36:40,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-10-28 08:36:40,602 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 08:36:40,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 08:36:40,610 INFO L225 Difference]: With dead ends: 21 [2021-10-28 08:36:40,610 INFO L226 Difference]: Without dead ends: 8 [2021-10-28 08:36:40,613 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 08:36:40,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2021-10-28 08:36:40,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2021-10-28 08:36:40,639 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 08:36:40,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2021-10-28 08:36:40,640 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 7 [2021-10-28 08:36:40,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 08:36:40,641 INFO L470 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2021-10-28 08:36:40,641 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 08:36:40,642 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2021-10-28 08:36:40,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-10-28 08:36:40,642 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 08:36:40,642 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-10-28 08:36:40,671 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b8ef09d-eda7-4cec-9388-280f043adbcd/bin/uautomizer-UnR33cPsHg/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2021-10-28 08:36:40,866 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b8ef09d-eda7-4cec-9388-280f043adbcd/bin/uautomizer-UnR33cPsHg/mathsat -unsat_core_generation=3 [2021-10-28 08:36:40,867 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 08:36:40,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 08:36:40,868 INFO L85 PathProgramCache]: Analyzing trace with hash 1806875978, now seen corresponding path program 1 times [2021-10-28 08:36:40,869 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-10-28 08:36:40,869 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [935146313] [2021-10-28 08:36:40,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 08:36:40,869 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-28 08:36:40,870 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b8ef09d-eda7-4cec-9388-280f043adbcd/bin/uautomizer-UnR33cPsHg/mathsat [2021-10-28 08:36:40,871 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b8ef09d-eda7-4cec-9388-280f043adbcd/bin/uautomizer-UnR33cPsHg/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-28 08:36:40,888 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b8ef09d-eda7-4cec-9388-280f043adbcd/bin/uautomizer-UnR33cPsHg/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-10-28 08:36:42,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 08:36:42,605 INFO L263 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 10 conjunts are in the unsatisfiable core [2021-10-28 08:36:42,607 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-28 08:36:59,916 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 08:38:46,609 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 08:38:48,685 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 08:39:40,913 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 08:39:42,985 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 08:39:42,986 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 08:39:42,986 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-28 08:39:59,042 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 08:40:01,189 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 08:40:21,602 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 08:40:23,755 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 08:41:18,302 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 08:41:20,434 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 08:41:20,434 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 08:41:20,435 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-10-28 08:41:20,435 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [935146313] [2021-10-28 08:41:20,435 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [935146313] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-28 08:41:20,435 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-28 08:41:20,435 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 12 [2021-10-28 08:41:20,436 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654226693] [2021-10-28 08:41:20,437 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-28 08:41:20,437 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-10-28 08:41:20,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-28 08:41:20,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=30, Unknown=11, NotChecked=90, Total=156 [2021-10-28 08:41:20,438 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 08:41:22,555 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 08:41:24,686 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 08:41:26,797 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 08:41:28,924 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 08:41:31,037 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 08:41:33,176 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 08:41:35,282 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 08:41:37,391 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 08:41:37,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 08:41:37,456 INFO L93 Difference]: Finished difference Result 12 states and 11 transitions. [2021-10-28 08:41:37,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-28 08:41:37,457 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 08:41:37,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 08:41:37,458 INFO L225 Difference]: With dead ends: 12 [2021-10-28 08:41:37,458 INFO L226 Difference]: Without dead ends: 8 [2021-10-28 08:41:37,459 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 11 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 40.8s TimeCoverageRelationStatistics Valid=35, Invalid=32, Unknown=19, NotChecked=220, Total=306 [2021-10-28 08:41:37,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2021-10-28 08:41:37,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2021-10-28 08:41:37,460 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 08:41:37,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 7 transitions. [2021-10-28 08:41:37,461 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 7 transitions. Word has length 7 [2021-10-28 08:41:37,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 08:41:37,461 INFO L470 AbstractCegarLoop]: Abstraction has 8 states and 7 transitions. [2021-10-28 08:41:37,462 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 08:41:37,462 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 7 transitions. [2021-10-28 08:41:37,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-10-28 08:41:37,462 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 08:41:37,462 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-10-28 08:41:37,493 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b8ef09d-eda7-4cec-9388-280f043adbcd/bin/uautomizer-UnR33cPsHg/mathsat -unsat_core_generation=3 (3)] Ended with exit code 0 [2021-10-28 08:41:37,670 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b8ef09d-eda7-4cec-9388-280f043adbcd/bin/uautomizer-UnR33cPsHg/mathsat -unsat_core_generation=3 [2021-10-28 08:41:37,670 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 08:41:37,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 08:41:37,671 INFO L85 PathProgramCache]: Analyzing trace with hash 1806935560, now seen corresponding path program 1 times [2021-10-28 08:41:37,672 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-10-28 08:41:37,672 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2096958504] [2021-10-28 08:41:37,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 08:41:37,672 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-28 08:41:37,672 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b8ef09d-eda7-4cec-9388-280f043adbcd/bin/uautomizer-UnR33cPsHg/mathsat [2021-10-28 08:41:37,673 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b8ef09d-eda7-4cec-9388-280f043adbcd/bin/uautomizer-UnR33cPsHg/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-28 08:41:37,677 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b8ef09d-eda7-4cec-9388-280f043adbcd/bin/uautomizer-UnR33cPsHg/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-10-28 08:41:49,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 08:41:49,241 INFO L263 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 9 conjunts are in the unsatisfiable core [2021-10-28 08:41:49,242 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-28 08:42:05,519 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 08:42:07,596 WARN L860 $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 true [2021-10-28 08:43:36,369 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 08:43:38,444 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 08:44:30,787 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 08:44:32,863 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 08:44:32,863 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 08:44:32,864 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-28 08:44:48,463 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 08:44:50,598 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 08:45:10,376 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 08:45:12,520 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 08:46:06,045 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 08:46:08,173 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 08:46:08,174 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 08:46:08,174 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-10-28 08:46:08,174 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2096958504] [2021-10-28 08:46:08,174 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2096958504] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-28 08:46:08,175 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-28 08:46:08,175 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 12 [2021-10-28 08:46:08,175 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551850989] [2021-10-28 08:46:08,175 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-28 08:46:08,176 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-10-28 08:46:08,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-28 08:46:08,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=29, Unknown=12, NotChecked=90, Total=156 [2021-10-28 08:46:08,177 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 08:46:10,288 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 08:46:12,405 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 08:46:14,531 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 08:46:16,659 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 08:46:18,777 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 08:46:20,910 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 08:46:23,050 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 08:46:25,182 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 08:46:25,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 08:46:25,194 INFO L93 Difference]: Finished difference Result 8 states and 7 transitions. [2021-10-28 08:46:25,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-28 08:46:25,194 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 08:46:25,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 08:46:25,195 INFO L225 Difference]: With dead ends: 8 [2021-10-28 08:46:25,195 INFO L226 Difference]: Without dead ends: 0 [2021-10-28 08:46:25,195 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 11 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 42.8s TimeCoverageRelationStatistics Valid=35, Invalid=31, Unknown=20, NotChecked=220, Total=306 [2021-10-28 08:46:25,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-10-28 08:46:25,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-10-28 08:46:25,196 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 08:46:25,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-10-28 08:46:25,196 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 7 [2021-10-28 08:46:25,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 08:46:25,196 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-10-28 08:46:25,196 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 08:46:25,196 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-10-28 08:46:25,196 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-10-28 08:46:25,199 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 08:46:25,226 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b8ef09d-eda7-4cec-9388-280f043adbcd/bin/uautomizer-UnR33cPsHg/mathsat -unsat_core_generation=3 (4)] Ended with exit code 0 [2021-10-28 08:46:25,413 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b8ef09d-eda7-4cec-9388-280f043adbcd/bin/uautomizer-UnR33cPsHg/mathsat -unsat_core_generation=3 [2021-10-28 08:46:25,415 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-10-28 08:46:25,418 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 08:46:25,450 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-28 08:46:25,456 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-10-28 08:46:25,457 INFO L860 garLoopResultBuilder]: At program point L31(lines 20 32) the Hoare annotation is: true [2021-10-28 08:46:25,458 INFO L857 garLoopResultBuilder]: For program point L27-1(lines 27 28) no Hoare annotation was computed. [2021-10-28 08:46:25,458 INFO L857 garLoopResultBuilder]: For program point L13(lines 27 28) no Hoare annotation was computed. [2021-10-28 08:46:25,458 INFO L857 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-10-28 08:46:25,458 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-10-28 08:46:25,458 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-10-28 08:46:25,459 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 16) no Hoare annotation was computed. [2021-10-28 08:46:25,460 INFO L857 garLoopResultBuilder]: For program point L16(line 16) no Hoare annotation was computed. [2021-10-28 08:46:25,460 INFO L857 garLoopResultBuilder]: For program point L16-1(line 16) no Hoare annotation was computed. [2021-10-28 08:46:25,460 INFO L857 garLoopResultBuilder]: For program point L14(line 14) no Hoare annotation was computed. [2021-10-28 08:46:25,460 INFO L860 garLoopResultBuilder]: At program point L16-3(line 16) the Hoare annotation is: true [2021-10-28 08:46:25,464 INFO L731 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2021-10-28 08:46:25,466 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-10-28 08:46:25,473 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.10 08:46:25 BoogieIcfgContainer [2021-10-28 08:46:25,473 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-10-28 08:46:25,474 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-28 08:46:25,474 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-28 08:46:25,474 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-28 08:46:25,475 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.10 08:36:39" (3/4) ... [2021-10-28 08:46:25,480 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-10-28 08:46:25,492 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2021-10-28 08:46:25,492 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2021-10-28 08:46:25,492 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-10-28 08:46:25,492 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-10-28 08:46:25,534 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b8ef09d-eda7-4cec-9388-280f043adbcd/bin/uautomizer-UnR33cPsHg/witness.graphml [2021-10-28 08:46:25,535 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-28 08:46:25,536 INFO L168 Benchmark]: Toolchain (without parser) took 591272.97 ms. Allocated memory was 60.8 MB in the beginning and 75.5 MB in the end (delta: 14.7 MB). Free memory was 39.3 MB in the beginning and 53.6 MB in the end (delta: -14.3 MB). Peak memory consumption was 1.1 MB. Max. memory is 16.1 GB. [2021-10-28 08:46:25,537 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 60.8 MB. Free memory is still 41.6 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-10-28 08:46:25,542 INFO L168 Benchmark]: CACSL2BoogieTranslator took 340.44 ms. Allocated memory is still 60.8 MB. Free memory was 39.1 MB in the beginning and 45.0 MB in the end (delta: -5.9 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. [2021-10-28 08:46:25,542 INFO L168 Benchmark]: Boogie Procedure Inliner took 48.15 ms. Allocated memory is still 60.8 MB. Free memory was 45.0 MB in the beginning and 43.4 MB in the end (delta: 1.7 MB). There was no memory consumed. Max. memory is 16.1 GB. [2021-10-28 08:46:25,547 INFO L168 Benchmark]: Boogie Preprocessor took 24.89 ms. Allocated memory is still 60.8 MB. Free memory was 43.4 MB in the beginning and 42.2 MB in the end (delta: 1.1 MB). There was no memory consumed. Max. memory is 16.1 GB. [2021-10-28 08:46:25,548 INFO L168 Benchmark]: RCFGBuilder took 4536.69 ms. Allocated memory is still 60.8 MB. Free memory was 42.2 MB in the beginning and 32.7 MB in the end (delta: 9.6 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2021-10-28 08:46:25,548 INFO L168 Benchmark]: TraceAbstraction took 586255.17 ms. Allocated memory was 60.8 MB in the beginning and 75.5 MB in the end (delta: 14.7 MB). Free memory was 32.3 MB in the beginning and 55.7 MB in the end (delta: -23.4 MB). Peak memory consumption was 19.0 MB. Max. memory is 16.1 GB. [2021-10-28 08:46:25,548 INFO L168 Benchmark]: Witness Printer took 60.64 ms. Allocated memory is still 75.5 MB. Free memory was 55.7 MB in the beginning and 53.6 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-28 08:46:25,551 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.26 ms. Allocated memory is still 60.8 MB. Free memory is still 41.6 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 340.44 ms. Allocated memory is still 60.8 MB. Free memory was 39.1 MB in the beginning and 45.0 MB in the end (delta: -5.9 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 48.15 ms. Allocated memory is still 60.8 MB. Free memory was 45.0 MB in the beginning and 43.4 MB in the end (delta: 1.7 MB). There was no memory consumed. Max. memory is 16.1 GB. * Boogie Preprocessor took 24.89 ms. Allocated memory is still 60.8 MB. Free memory was 43.4 MB in the beginning and 42.2 MB in the end (delta: 1.1 MB). There was no memory consumed. Max. memory is 16.1 GB. * RCFGBuilder took 4536.69 ms. Allocated memory is still 60.8 MB. Free memory was 42.2 MB in the beginning and 32.7 MB in the end (delta: 9.6 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * TraceAbstraction took 586255.17 ms. Allocated memory was 60.8 MB in the beginning and 75.5 MB in the end (delta: 14.7 MB). Free memory was 32.3 MB in the beginning and 55.7 MB in the end (delta: -23.4 MB). Peak memory consumption was 19.0 MB. Max. memory is 16.1 GB. * Witness Printer took 60.64 ms. Allocated memory is still 75.5 MB. Free memory was 55.7 MB in the beginning and 53.6 MB in the end (delta: 2.1 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: 586.1s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 34.0s, 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, 83.7s 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, 13.9s SatisfiabilityAnalysisTime, 537.0s 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 08:46:25,788 WARN L435 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b8ef09d-eda7-4cec-9388-280f043adbcd/bin/uautomizer-UnR33cPsHg/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2021-10-28 08:46:25,835 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9b8ef09d-eda7-4cec-9388-280f043adbcd/bin/uautomizer-UnR33cPsHg/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 137 Received shutdown request...