./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-benchs/zonotope_loose.c.v+cfa-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version b2eff8ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3e83e20-df52-4023-bcd3-1a56b0072de6/bin/utaipan-SDwSMHVbGG/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3e83e20-df52-4023-bcd3-1a56b0072de6/bin/utaipan-SDwSMHVbGG/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3e83e20-df52-4023-bcd3-1a56b0072de6/bin/utaipan-SDwSMHVbGG/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3e83e20-df52-4023-bcd3-1a56b0072de6/bin/utaipan-SDwSMHVbGG/config/TaipanReach.xml -i ../../sv-benchmarks/c/float-benchs/zonotope_loose.c.v+cfa-reducer.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3e83e20-df52-4023-bcd3-1a56b0072de6/bin/utaipan-SDwSMHVbGG/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3e83e20-df52-4023-bcd3-1a56b0072de6/bin/utaipan-SDwSMHVbGG --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9f4aaad5467edb8ebb713201c5ef1a2ab973a56e3a4674058c8240617473ff22 ................................................................................................................................................................................................................................................................................................................... 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_f3e83e20-df52-4023-bcd3-1a56b0072de6/bin/utaipan-SDwSMHVbGG/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3e83e20-df52-4023-bcd3-1a56b0072de6/bin/utaipan-SDwSMHVbGG/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3e83e20-df52-4023-bcd3-1a56b0072de6/bin/utaipan-SDwSMHVbGG/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3e83e20-df52-4023-bcd3-1a56b0072de6/bin/utaipan-SDwSMHVbGG/config/TaipanReach.xml -i ../../sv-benchmarks/c/float-benchs/zonotope_loose.c.v+cfa-reducer.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3e83e20-df52-4023-bcd3-1a56b0072de6/bin/utaipan-SDwSMHVbGG/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3e83e20-df52-4023-bcd3-1a56b0072de6/bin/utaipan-SDwSMHVbGG --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9f4aaad5467edb8ebb713201c5ef1a2ab973a56e3a4674058c8240617473ff22 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-29 04:50:06,289 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-29 04:50:06,292 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-29 04:50:06,338 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-29 04:50:06,339 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-29 04:50:06,344 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-29 04:50:06,346 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-29 04:50:06,350 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-29 04:50:06,353 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-29 04:50:06,358 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-29 04:50:06,359 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-29 04:50:06,361 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-29 04:50:06,362 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-29 04:50:06,364 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-29 04:50:06,367 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-29 04:50:06,371 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-29 04:50:06,373 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-29 04:50:06,375 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-29 04:50:06,377 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-29 04:50:06,385 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-29 04:50:06,387 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-29 04:50:06,388 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-29 04:50:06,391 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-29 04:50:06,393 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-29 04:50:06,402 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-29 04:50:06,402 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-29 04:50:06,403 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-29 04:50:06,405 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-29 04:50:06,406 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-29 04:50:06,407 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-29 04:50:06,408 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-29 04:50:06,409 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-29 04:50:06,412 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-29 04:50:06,413 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-29 04:50:06,415 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-29 04:50:06,415 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-29 04:50:06,416 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-29 04:50:06,417 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-29 04:50:06,417 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-29 04:50:06,418 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-29 04:50:06,419 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-29 04:50:06,420 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3e83e20-df52-4023-bcd3-1a56b0072de6/bin/utaipan-SDwSMHVbGG/config/svcomp-Reach-32bit-Taipan_Default.epf [2021-10-29 04:50:06,470 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-29 04:50:06,471 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-29 04:50:06,473 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-10-29 04:50:06,473 INFO L138 SettingsManager]: * User list type=DISABLED [2021-10-29 04:50:06,473 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-10-29 04:50:06,474 INFO L138 SettingsManager]: * Explicit value domain=true [2021-10-29 04:50:06,474 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-10-29 04:50:06,474 INFO L138 SettingsManager]: * Octagon Domain=false [2021-10-29 04:50:06,481 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-10-29 04:50:06,482 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-10-29 04:50:06,483 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-10-29 04:50:06,483 INFO L138 SettingsManager]: * Interval Domain=false [2021-10-29 04:50:06,484 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-10-29 04:50:06,484 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-10-29 04:50:06,484 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2021-10-29 04:50:06,485 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-29 04:50:06,485 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-29 04:50:06,486 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-29 04:50:06,486 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-29 04:50:06,486 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-29 04:50:06,487 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-10-29 04:50:06,487 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-29 04:50:06,487 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-10-29 04:50:06,487 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-10-29 04:50:06,488 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-29 04:50:06,488 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-10-29 04:50:06,488 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-29 04:50:06,489 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-10-29 04:50:06,489 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-29 04:50:06,491 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-29 04:50:06,491 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-29 04:50:06,491 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-29 04:50:06,492 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-29 04:50:06,492 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-10-29 04:50:06,493 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-10-29 04:50:06,493 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-10-29 04:50:06,493 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-10-29 04:50:06,493 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-29 04:50:06,494 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-10-29 04:50:06,494 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_f3e83e20-df52-4023-bcd3-1a56b0072de6/bin/utaipan-SDwSMHVbGG/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_f3e83e20-df52-4023-bcd3-1a56b0072de6/bin/utaipan-SDwSMHVbGG 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 -> Taipan 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 -> 9f4aaad5467edb8ebb713201c5ef1a2ab973a56e3a4674058c8240617473ff22 [2021-10-29 04:50:06,814 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-29 04:50:06,835 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-29 04:50:06,838 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-29 04:50:06,839 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-29 04:50:06,840 INFO L275 PluginConnector]: CDTParser initialized [2021-10-29 04:50:06,841 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3e83e20-df52-4023-bcd3-1a56b0072de6/bin/utaipan-SDwSMHVbGG/../../sv-benchmarks/c/float-benchs/zonotope_loose.c.v+cfa-reducer.c [2021-10-29 04:50:06,910 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3e83e20-df52-4023-bcd3-1a56b0072de6/bin/utaipan-SDwSMHVbGG/data/29941d2a9/e1dc3f6bd5eb47c583f7056c19747a75/FLAGbc1fd8c39 [2021-10-29 04:50:07,517 INFO L306 CDTParser]: Found 1 translation units. [2021-10-29 04:50:07,519 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3e83e20-df52-4023-bcd3-1a56b0072de6/sv-benchmarks/c/float-benchs/zonotope_loose.c.v+cfa-reducer.c [2021-10-29 04:50:07,532 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3e83e20-df52-4023-bcd3-1a56b0072de6/bin/utaipan-SDwSMHVbGG/data/29941d2a9/e1dc3f6bd5eb47c583f7056c19747a75/FLAGbc1fd8c39 [2021-10-29 04:50:07,889 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3e83e20-df52-4023-bcd3-1a56b0072de6/bin/utaipan-SDwSMHVbGG/data/29941d2a9/e1dc3f6bd5eb47c583f7056c19747a75 [2021-10-29 04:50:07,906 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-29 04:50:07,909 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-29 04:50:07,913 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-29 04:50:07,914 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-29 04:50:07,918 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-29 04:50:07,920 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.10 04:50:07" (1/1) ... [2021-10-29 04:50:07,922 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@306e4dd4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 04:50:07, skipping insertion in model container [2021-10-29 04:50:07,923 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.10 04:50:07" (1/1) ... [2021-10-29 04:50:07,944 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-29 04:50:07,978 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-29 04:50:08,381 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_f3e83e20-df52-4023-bcd3-1a56b0072de6/sv-benchmarks/c/float-benchs/zonotope_loose.c.v+cfa-reducer.c[1094,1107] [2021-10-29 04:50:08,387 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-29 04:50:08,417 INFO L203 MainTranslator]: Completed pre-run [2021-10-29 04:50:08,460 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_f3e83e20-df52-4023-bcd3-1a56b0072de6/sv-benchmarks/c/float-benchs/zonotope_loose.c.v+cfa-reducer.c[1094,1107] [2021-10-29 04:50:08,478 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-29 04:50:08,496 INFO L208 MainTranslator]: Completed translation [2021-10-29 04:50:08,512 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 04:50:08 WrapperNode [2021-10-29 04:50:08,512 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-29 04:50:08,514 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-29 04:50:08,514 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-29 04:50:08,514 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-29 04:50:08,522 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 04:50:08" (1/1) ... [2021-10-29 04:50:08,536 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 04:50:08" (1/1) ... [2021-10-29 04:50:08,586 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-29 04:50:08,587 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-29 04:50:08,587 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-29 04:50:08,588 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-29 04:50:08,596 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 04:50:08" (1/1) ... [2021-10-29 04:50:08,612 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 04:50:08" (1/1) ... [2021-10-29 04:50:08,623 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 04:50:08" (1/1) ... [2021-10-29 04:50:08,624 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 04:50:08" (1/1) ... [2021-10-29 04:50:08,636 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 04:50:08" (1/1) ... [2021-10-29 04:50:08,643 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 04:50:08" (1/1) ... [2021-10-29 04:50:08,645 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 04:50:08" (1/1) ... [2021-10-29 04:50:08,646 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-29 04:50:08,650 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-29 04:50:08,650 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-29 04:50:08,651 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-29 04:50:08,665 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 04:50:08" (1/1) ... [2021-10-29 04:50:08,673 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-29 04:50:08,697 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3e83e20-df52-4023-bcd3-1a56b0072de6/bin/utaipan-SDwSMHVbGG/z3 [2021-10-29 04:50:08,733 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3e83e20-df52-4023-bcd3-1a56b0072de6/bin/utaipan-SDwSMHVbGG/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-10-29 04:50:08,774 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3e83e20-df52-4023-bcd3-1a56b0072de6/bin/utaipan-SDwSMHVbGG/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-10-29 04:50:08,836 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-29 04:50:08,838 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-29 04:50:08,838 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-29 04:50:08,839 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-29 04:50:09,366 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-29 04:50:09,376 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2021-10-29 04:50:09,379 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.10 04:50:09 BoogieIcfgContainer [2021-10-29 04:50:09,379 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-29 04:50:09,381 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-29 04:50:09,390 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-29 04:50:09,394 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-29 04:50:09,395 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.10 04:50:07" (1/3) ... [2021-10-29 04:50:09,396 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@228d34a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.10 04:50:09, skipping insertion in model container [2021-10-29 04:50:09,408 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 04:50:08" (2/3) ... [2021-10-29 04:50:09,408 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@228d34a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.10 04:50:09, skipping insertion in model container [2021-10-29 04:50:09,409 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.10 04:50:09" (3/3) ... [2021-10-29 04:50:09,410 INFO L111 eAbstractionObserver]: Analyzing ICFG zonotope_loose.c.v+cfa-reducer.c [2021-10-29 04:50:09,425 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-29 04:50:09,426 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-10-29 04:50:09,583 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-10-29 04:50:09,590 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=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-10-29 04:50:09,612 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-10-29 04:50:09,656 INFO L276 IsEmpty]: Start isEmpty. Operand has 13 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 12 states have internal predecessors, (18), 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-29 04:50:09,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-10-29 04:50:09,661 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 04:50:09,672 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 04:50:09,673 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-29 04:50:09,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 04:50:09,680 INFO L85 PathProgramCache]: Analyzing trace with hash 1602314196, now seen corresponding path program 1 times [2021-10-29 04:50:09,709 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 04:50:09,709 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364659598] [2021-10-29 04:50:09,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 04:50:09,711 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:50:10,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:50:10,261 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-29 04:50:10,263 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 04:50:10,263 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364659598] [2021-10-29 04:50:10,266 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [364659598] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 04:50:10,266 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 04:50:10,267 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-29 04:50:10,278 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306330657] [2021-10-29 04:50:10,283 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-29 04:50:10,283 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 04:50:10,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-29 04:50:10,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-29 04:50:10,338 INFO L87 Difference]: Start difference. First operand has 13 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 12 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:50:10,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 04:50:10,430 INFO L93 Difference]: Finished difference Result 23 states and 26 transitions. [2021-10-29 04:50:10,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-29 04:50:10,432 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2021-10-29 04:50:10,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 04:50:10,442 INFO L225 Difference]: With dead ends: 23 [2021-10-29 04:50:10,442 INFO L226 Difference]: Without dead ends: 11 [2021-10-29 04:50:10,447 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-10-29 04:50:10,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2021-10-29 04:50:10,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2021-10-29 04:50:10,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:50:10,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2021-10-29 04:50:10,482 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2021-10-29 04:50:10,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 04:50:10,483 INFO L470 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2021-10-29 04:50:10,483 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:50:10,483 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2021-10-29 04:50:10,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-10-29 04:50:10,484 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 04:50:10,485 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 04:50:10,485 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-10-29 04:50:10,488 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-29 04:50:10,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 04:50:10,495 INFO L85 PathProgramCache]: Analyzing trace with hash 1619324857, now seen corresponding path program 1 times [2021-10-29 04:50:10,495 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 04:50:10,495 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572744429] [2021-10-29 04:50:10,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 04:50:10,497 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:50:10,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-29 04:50:10,526 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-29 04:50:10,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-29 04:50:10,594 INFO L133 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2021-10-29 04:50:10,595 INFO L627 BasicCegarLoop]: Counterexample is feasible [2021-10-29 04:50:10,597 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 04:50:10,599 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-10-29 04:50:10,602 INFO L731 BasicCegarLoop]: Path program histogram: [1, 1] [2021-10-29 04:50:10,605 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-10-29 04:50:10,642 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.10 04:50:10 BoogieIcfgContainer [2021-10-29 04:50:10,643 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-10-29 04:50:10,644 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-29 04:50:10,644 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-29 04:50:10,645 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-29 04:50:10,645 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.10 04:50:09" (3/4) ... [2021-10-29 04:50:10,649 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-10-29 04:50:10,650 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-29 04:50:10,654 INFO L168 Benchmark]: Toolchain (without parser) took 2742.66 ms. Allocated memory was 92.3 MB in the beginning and 111.1 MB in the end (delta: 18.9 MB). Free memory was 70.1 MB in the beginning and 72.1 MB in the end (delta: -1.9 MB). Peak memory consumption was 17.3 MB. Max. memory is 16.1 GB. [2021-10-29 04:50:10,655 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 92.3 MB. Free memory is still 67.1 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-10-29 04:50:10,657 INFO L168 Benchmark]: CACSL2BoogieTranslator took 599.51 ms. Allocated memory is still 92.3 MB. Free memory was 70.1 MB in the beginning and 67.7 MB in the end (delta: 2.4 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2021-10-29 04:50:10,659 INFO L168 Benchmark]: Boogie Procedure Inliner took 72.61 ms. Allocated memory is still 92.3 MB. Free memory was 67.7 MB in the beginning and 66.1 MB in the end (delta: 1.6 MB). There was no memory consumed. Max. memory is 16.1 GB. [2021-10-29 04:50:10,665 INFO L168 Benchmark]: Boogie Preprocessor took 61.84 ms. Allocated memory is still 92.3 MB. Free memory was 66.1 MB in the beginning and 65.2 MB in the end (delta: 879.2 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-10-29 04:50:10,666 INFO L168 Benchmark]: RCFGBuilder took 729.43 ms. Allocated memory is still 92.3 MB. Free memory was 65.1 MB in the beginning and 54.7 MB in the end (delta: 10.5 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. [2021-10-29 04:50:10,667 INFO L168 Benchmark]: TraceAbstraction took 1261.74 ms. Allocated memory was 92.3 MB in the beginning and 111.1 MB in the end (delta: 18.9 MB). Free memory was 54.2 MB in the beginning and 72.7 MB in the end (delta: -18.5 MB). Peak memory consumption was 2.3 MB. Max. memory is 16.1 GB. [2021-10-29 04:50:10,668 INFO L168 Benchmark]: Witness Printer took 6.75 ms. Allocated memory is still 111.1 MB. Free memory is still 72.7 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-10-29 04:50:10,676 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.24 ms. Allocated memory is still 92.3 MB. Free memory is still 67.1 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 599.51 ms. Allocated memory is still 92.3 MB. Free memory was 70.1 MB in the beginning and 67.7 MB in the end (delta: 2.4 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 72.61 ms. Allocated memory is still 92.3 MB. Free memory was 67.7 MB in the beginning and 66.1 MB in the end (delta: 1.6 MB). There was no memory consumed. Max. memory is 16.1 GB. * Boogie Preprocessor took 61.84 ms. Allocated memory is still 92.3 MB. Free memory was 66.1 MB in the beginning and 65.2 MB in the end (delta: 879.2 kB). There was no memory consumed. Max. memory is 16.1 GB. * RCFGBuilder took 729.43 ms. Allocated memory is still 92.3 MB. Free memory was 65.1 MB in the beginning and 54.7 MB in the end (delta: 10.5 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. * TraceAbstraction took 1261.74 ms. Allocated memory was 92.3 MB in the beginning and 111.1 MB in the end (delta: 18.9 MB). Free memory was 54.2 MB in the beginning and 72.7 MB in the end (delta: -18.5 MB). Peak memory consumption was 2.3 MB. Max. memory is 16.1 GB. * Witness Printer took 6.75 ms. Allocated memory is still 111.1 MB. Free memory is still 72.7 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: 45]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 32, overapproximation of someBinaryArithmeticDOUBLEoperation at line 26. Possible FailurePath: [L1] int __return_main; [L12] int __return_76; [L15] double main__x; [L16] double main__y; [L17] main__x = __VERIFIER_nondet_double() [L18] int main____CPAchecker_TMP_0; VAL [__return_76=0, __return_main=0] [L19] COND TRUE main__x >= 0.0 VAL [__return_76=0, __return_main=0] [L21] COND TRUE main__x <= 10.0 [L23] main____CPAchecker_TMP_0 = 1 VAL [__return_76=0, __return_main=0] [L24] COND TRUE main____CPAchecker_TMP_0 != 0 [L26] main__y = (main__x * main__x) - main__x [L27] COND FALSE !(main__y >= 0) [L69] main__y = (main__x * main__x) + 2.0 [L31] int main____CPAchecker_TMP_1; VAL [__return_76=0, __return_main=0] [L32] COND FALSE !(main__y >= 0.0) VAL [__return_76=0, __return_main=0] [L58] main____CPAchecker_TMP_1 = 0 VAL [__return_76=0, __return_main=0] [L39] int __tmp_1; [L40] __tmp_1 = main____CPAchecker_TMP_1 [L41] int __VERIFIER_assert__cond; [L42] __VERIFIER_assert__cond = __tmp_1 VAL [__return_76=0, __return_main=0] [L43] COND TRUE __VERIFIER_assert__cond == 0 VAL [__return_76=0, __return_main=0] [L45] reach_error() VAL [__return_76=0, __return_main=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 13 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.0s, OverallIterations: 2, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 14 SDtfs, 20 SDslu, 27 SDs, 0 SdLazy, 12 SolverSat, 2 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=13occurred in iteration=0, InterpolantAutomatonStates: 6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.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.2s InterpolantComputationTime, 18 NumberOfCodeBlocks, 18 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 8 ConstructedInterpolants, 0 QuantifiedInterpolants, 16 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-29 04:50:10,731 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3e83e20-df52-4023-bcd3-1a56b0072de6/bin/utaipan-SDwSMHVbGG/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-29 04:50:13,234 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-29 04:50:13,236 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-29 04:50:13,268 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-29 04:50:13,269 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-29 04:50:13,270 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-29 04:50:13,272 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-29 04:50:13,275 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-29 04:50:13,278 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-29 04:50:13,279 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-29 04:50:13,280 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-29 04:50:13,282 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-29 04:50:13,282 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-29 04:50:13,284 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-29 04:50:13,286 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-29 04:50:13,288 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-29 04:50:13,289 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-29 04:50:13,291 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-29 04:50:13,293 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-29 04:50:13,296 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-29 04:50:13,298 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-29 04:50:13,300 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-29 04:50:13,302 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-29 04:50:13,303 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-29 04:50:13,307 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-29 04:50:13,307 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-29 04:50:13,308 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-29 04:50:13,309 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-29 04:50:13,310 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-29 04:50:13,311 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-29 04:50:13,312 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-29 04:50:13,313 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-29 04:50:13,314 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-29 04:50:13,315 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-29 04:50:13,316 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-29 04:50:13,317 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-29 04:50:13,318 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-29 04:50:13,319 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-29 04:50:13,319 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-29 04:50:13,320 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-29 04:50:13,321 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-29 04:50:13,322 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3e83e20-df52-4023-bcd3-1a56b0072de6/bin/utaipan-SDwSMHVbGG/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2021-10-29 04:50:13,373 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-29 04:50:13,375 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-29 04:50:13,377 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-10-29 04:50:13,377 INFO L138 SettingsManager]: * User list type=DISABLED [2021-10-29 04:50:13,377 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-10-29 04:50:13,378 INFO L138 SettingsManager]: * Explicit value domain=true [2021-10-29 04:50:13,378 INFO L138 SettingsManager]: * Octagon Domain=false [2021-10-29 04:50:13,378 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-10-29 04:50:13,379 INFO L138 SettingsManager]: * Interval Domain=false [2021-10-29 04:50:13,381 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-29 04:50:13,382 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-29 04:50:13,383 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-29 04:50:13,383 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-29 04:50:13,383 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-10-29 04:50:13,383 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-29 04:50:13,384 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-10-29 04:50:13,384 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-10-29 04:50:13,384 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-10-29 04:50:13,385 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-10-29 04:50:13,385 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-29 04:50:13,385 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-10-29 04:50:13,386 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-29 04:50:13,386 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-10-29 04:50:13,386 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-29 04:50:13,387 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-10-29 04:50:13,387 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-29 04:50:13,387 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-29 04:50:13,388 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-29 04:50:13,388 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-29 04:50:13,388 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-10-29 04:50:13,389 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2021-10-29 04:50:13,389 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-10-29 04:50:13,389 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-10-29 04:50:13,389 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-29 04:50:13,390 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-10-29 04:50:13,390 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_f3e83e20-df52-4023-bcd3-1a56b0072de6/bin/utaipan-SDwSMHVbGG/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_f3e83e20-df52-4023-bcd3-1a56b0072de6/bin/utaipan-SDwSMHVbGG 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 -> Taipan 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 -> 9f4aaad5467edb8ebb713201c5ef1a2ab973a56e3a4674058c8240617473ff22 [2021-10-29 04:50:13,779 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-29 04:50:13,803 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-29 04:50:13,806 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-29 04:50:13,807 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-29 04:50:13,808 INFO L275 PluginConnector]: CDTParser initialized [2021-10-29 04:50:13,809 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3e83e20-df52-4023-bcd3-1a56b0072de6/bin/utaipan-SDwSMHVbGG/../../sv-benchmarks/c/float-benchs/zonotope_loose.c.v+cfa-reducer.c [2021-10-29 04:50:13,888 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3e83e20-df52-4023-bcd3-1a56b0072de6/bin/utaipan-SDwSMHVbGG/data/a7aa7e7ec/ad7da5279fbc44e6af648313c80da6f4/FLAG7a2262f82 [2021-10-29 04:50:14,429 INFO L306 CDTParser]: Found 1 translation units. [2021-10-29 04:50:14,430 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3e83e20-df52-4023-bcd3-1a56b0072de6/sv-benchmarks/c/float-benchs/zonotope_loose.c.v+cfa-reducer.c [2021-10-29 04:50:14,439 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3e83e20-df52-4023-bcd3-1a56b0072de6/bin/utaipan-SDwSMHVbGG/data/a7aa7e7ec/ad7da5279fbc44e6af648313c80da6f4/FLAG7a2262f82 [2021-10-29 04:50:14,896 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3e83e20-df52-4023-bcd3-1a56b0072de6/bin/utaipan-SDwSMHVbGG/data/a7aa7e7ec/ad7da5279fbc44e6af648313c80da6f4 [2021-10-29 04:50:14,899 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-29 04:50:14,903 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-29 04:50:14,905 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-29 04:50:14,905 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-29 04:50:14,909 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-29 04:50:14,910 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.10 04:50:14" (1/1) ... [2021-10-29 04:50:14,911 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5aec2f6f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 04:50:14, skipping insertion in model container [2021-10-29 04:50:14,911 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.10 04:50:14" (1/1) ... [2021-10-29 04:50:14,921 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-29 04:50:14,942 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-29 04:50:15,172 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_f3e83e20-df52-4023-bcd3-1a56b0072de6/sv-benchmarks/c/float-benchs/zonotope_loose.c.v+cfa-reducer.c[1094,1107] [2021-10-29 04:50:15,188 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-29 04:50:15,205 INFO L203 MainTranslator]: Completed pre-run [2021-10-29 04:50:15,237 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_f3e83e20-df52-4023-bcd3-1a56b0072de6/sv-benchmarks/c/float-benchs/zonotope_loose.c.v+cfa-reducer.c[1094,1107] [2021-10-29 04:50:15,252 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-29 04:50:15,280 INFO L208 MainTranslator]: Completed translation [2021-10-29 04:50:15,281 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 04:50:15 WrapperNode [2021-10-29 04:50:15,281 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-29 04:50:15,284 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-29 04:50:15,285 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-29 04:50:15,285 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-29 04:50:15,293 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 04:50:15" (1/1) ... [2021-10-29 04:50:15,304 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 04:50:15" (1/1) ... [2021-10-29 04:50:15,323 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-29 04:50:15,323 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-29 04:50:15,324 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-29 04:50:15,324 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-29 04:50:15,332 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 04:50:15" (1/1) ... [2021-10-29 04:50:15,333 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 04:50:15" (1/1) ... [2021-10-29 04:50:15,336 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 04:50:15" (1/1) ... [2021-10-29 04:50:15,336 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 04:50:15" (1/1) ... [2021-10-29 04:50:15,351 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 04:50:15" (1/1) ... [2021-10-29 04:50:15,362 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 04:50:15" (1/1) ... [2021-10-29 04:50:15,364 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 04:50:15" (1/1) ... [2021-10-29 04:50:15,374 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-29 04:50:15,375 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-29 04:50:15,377 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-29 04:50:15,377 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-29 04:50:15,378 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 04:50:15" (1/1) ... [2021-10-29 04:50:15,387 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-29 04:50:15,402 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3e83e20-df52-4023-bcd3-1a56b0072de6/bin/utaipan-SDwSMHVbGG/z3 [2021-10-29 04:50:15,418 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3e83e20-df52-4023-bcd3-1a56b0072de6/bin/utaipan-SDwSMHVbGG/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-10-29 04:50:15,452 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3e83e20-df52-4023-bcd3-1a56b0072de6/bin/utaipan-SDwSMHVbGG/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-10-29 04:50:15,481 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-10-29 04:50:15,481 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-29 04:50:15,482 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-29 04:50:15,482 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-29 04:50:18,730 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-29 04:50:18,730 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2021-10-29 04:50:18,733 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.10 04:50:18 BoogieIcfgContainer [2021-10-29 04:50:18,733 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-29 04:50:18,735 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-29 04:50:18,736 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-29 04:50:18,742 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-29 04:50:18,742 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.10 04:50:14" (1/3) ... [2021-10-29 04:50:18,743 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cc5c128 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.10 04:50:18, skipping insertion in model container [2021-10-29 04:50:18,744 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 04:50:15" (2/3) ... [2021-10-29 04:50:18,744 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cc5c128 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.10 04:50:18, skipping insertion in model container [2021-10-29 04:50:18,745 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.10 04:50:18" (3/3) ... [2021-10-29 04:50:18,746 INFO L111 eAbstractionObserver]: Analyzing ICFG zonotope_loose.c.v+cfa-reducer.c [2021-10-29 04:50:18,752 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-29 04:50:18,753 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-10-29 04:50:18,824 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-10-29 04:50:18,833 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=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-10-29 04:50:18,833 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-10-29 04:50:18,870 INFO L276 IsEmpty]: Start isEmpty. Operand has 17 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 16 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:50:18,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-10-29 04:50:18,891 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 04:50:18,893 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 04:50:18,894 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-29 04:50:18,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 04:50:18,901 INFO L85 PathProgramCache]: Analyzing trace with hash 570602568, now seen corresponding path program 1 times [2021-10-29 04:50:18,925 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-29 04:50:18,925 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1182250802] [2021-10-29 04:50:18,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 04:50:18,927 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-29 04:50:18,927 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3e83e20-df52-4023-bcd3-1a56b0072de6/bin/utaipan-SDwSMHVbGG/mathsat [2021-10-29 04:50:18,932 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3e83e20-df52-4023-bcd3-1a56b0072de6/bin/utaipan-SDwSMHVbGG/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-29 04:50:18,990 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3e83e20-df52-4023-bcd3-1a56b0072de6/bin/utaipan-SDwSMHVbGG/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-10-29 04:50:19,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:50:19,548 INFO L263 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 4 conjunts are in the unsatisfiable core [2021-10-29 04:50:19,551 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-29 04:50:19,677 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-29 04:50:19,677 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-29 04:50:19,782 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-29 04:50:19,783 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-29 04:50:19,783 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1182250802] [2021-10-29 04:50:19,784 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1182250802] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-29 04:50:19,784 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-29 04:50:19,784 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2021-10-29 04:50:19,786 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767090839] [2021-10-29 04:50:19,791 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-10-29 04:50:19,792 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-29 04:50:19,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-29 04:50:19,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-10-29 04:50:19,807 INFO L87 Difference]: Start difference. First operand has 17 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 16 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:50:19,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 04:50:19,921 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2021-10-29 04:50:19,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-29 04:50:19,923 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2021-10-29 04:50:19,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 04:50:19,930 INFO L225 Difference]: With dead ends: 30 [2021-10-29 04:50:19,930 INFO L226 Difference]: Without dead ends: 14 [2021-10-29 04:50:19,933 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-10-29 04:50:19,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2021-10-29 04:50:19,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2021-10-29 04:50:19,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:50:19,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2021-10-29 04:50:19,962 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 12 [2021-10-29 04:50:19,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 04:50:19,962 INFO L470 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2021-10-29 04:50:19,962 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:50:19,963 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2021-10-29 04:50:19,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-10-29 04:50:19,963 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 04:50:19,964 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 04:50:19,983 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3e83e20-df52-4023-bcd3-1a56b0072de6/bin/utaipan-SDwSMHVbGG/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2021-10-29 04:50:20,182 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3e83e20-df52-4023-bcd3-1a56b0072de6/bin/utaipan-SDwSMHVbGG/mathsat -unsat_core_generation=3 [2021-10-29 04:50:20,182 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-29 04:50:20,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 04:50:20,183 INFO L85 PathProgramCache]: Analyzing trace with hash 587613229, now seen corresponding path program 1 times [2021-10-29 04:50:20,184 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-29 04:50:20,184 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [87494801] [2021-10-29 04:50:20,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 04:50:20,185 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-29 04:50:20,185 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3e83e20-df52-4023-bcd3-1a56b0072de6/bin/utaipan-SDwSMHVbGG/mathsat [2021-10-29 04:50:20,186 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3e83e20-df52-4023-bcd3-1a56b0072de6/bin/utaipan-SDwSMHVbGG/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-29 04:50:20,194 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3e83e20-df52-4023-bcd3-1a56b0072de6/bin/utaipan-SDwSMHVbGG/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-10-29 04:50:20,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:50:20,622 INFO L263 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 4 conjunts are in the unsatisfiable core [2021-10-29 04:50:20,624 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-29 04:50:54,005 WARN L838 $PredicateComparison]: unable to prove that (exists ((ULTIMATE.start_main_~main__x~0 (_ FloatingPoint 11 53))) (and (fp.geq ULTIMATE.start_main_~main__x~0 (_ +zero 11 53)) (not (fp.geq (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven ULTIMATE.start_main_~main__x~0 ULTIMATE.start_main_~main__x~0) ((_ to_fp 11 53) roundNearestTiesToEven 2.0)) (_ +zero 11 53))))) is different from false [2021-10-29 04:50:56,040 WARN L860 $PredicateComparison]: unable to prove that (exists ((ULTIMATE.start_main_~main__x~0 (_ FloatingPoint 11 53))) (and (fp.geq ULTIMATE.start_main_~main__x~0 (_ +zero 11 53)) (not (fp.geq (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven ULTIMATE.start_main_~main__x~0 ULTIMATE.start_main_~main__x~0) ((_ to_fp 11 53) roundNearestTiesToEven 2.0)) (_ +zero 11 53))))) is different from true [2021-10-29 04:51:25,732 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 04:51:25,732 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-29 04:51:34,953 WARN L860 $PredicateComparison]: unable to prove that (fp.geq (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~main__x~0 c_ULTIMATE.start_main_~main__x~0) ((_ to_fp 11 53) c_currentRoundingMode 2.0)) (_ +zero 11 53)) is different from true [2021-10-29 04:51:50,396 WARN L838 $PredicateComparison]: unable to prove that (forall ((ULTIMATE.start_main_~main__x~0 (_ FloatingPoint 11 53))) (or (fp.geq (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ULTIMATE.start_main_~main__x~0 ULTIMATE.start_main_~main__x~0) ((_ to_fp 11 53) c_currentRoundingMode 2.0)) (_ +zero 11 53)) (not (fp.geq ULTIMATE.start_main_~main__x~0 (_ +zero 11 53))))) is different from false [2021-10-29 04:51:52,437 WARN L860 $PredicateComparison]: unable to prove that (forall ((ULTIMATE.start_main_~main__x~0 (_ FloatingPoint 11 53))) (or (fp.geq (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ULTIMATE.start_main_~main__x~0 ULTIMATE.start_main_~main__x~0) ((_ to_fp 11 53) c_currentRoundingMode 2.0)) (_ +zero 11 53)) (not (fp.geq ULTIMATE.start_main_~main__x~0 (_ +zero 11 53))))) is different from true [2021-10-29 04:52:00,752 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-29 04:52:00,753 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-29 04:52:00,753 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [87494801] [2021-10-29 04:52:00,753 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [87494801] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-29 04:52:00,754 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-29 04:52:00,754 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 8 [2021-10-29 04:52:00,754 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931522398] [2021-10-29 04:52:00,757 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-10-29 04:52:00,758 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-29 04:52:00,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-29 04:52:00,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=20, Unknown=6, NotChecked=30, Total=72 [2021-10-29 04:52:00,765 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 8 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:52:02,835 WARN L838 $PredicateComparison]: unable to prove that (and (= c_currentRoundingMode roundNearestTiesToEven) (forall ((ULTIMATE.start_main_~main__x~0 (_ FloatingPoint 11 53))) (or (fp.geq (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ULTIMATE.start_main_~main__x~0 ULTIMATE.start_main_~main__x~0) ((_ to_fp 11 53) c_currentRoundingMode 2.0)) (_ +zero 11 53)) (not (fp.geq ULTIMATE.start_main_~main__x~0 (_ +zero 11 53)))))) is different from false [2021-10-29 04:52:04,886 WARN L860 $PredicateComparison]: unable to prove that (and (= c_currentRoundingMode roundNearestTiesToEven) (forall ((ULTIMATE.start_main_~main__x~0 (_ FloatingPoint 11 53))) (or (fp.geq (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode ULTIMATE.start_main_~main__x~0 ULTIMATE.start_main_~main__x~0) ((_ to_fp 11 53) c_currentRoundingMode 2.0)) (_ +zero 11 53)) (not (fp.geq ULTIMATE.start_main_~main__x~0 (_ +zero 11 53)))))) is different from true [2021-10-29 04:52:06,939 WARN L838 $PredicateComparison]: unable to prove that (and (fp.geq c_ULTIMATE.start_main_~main__x~0 (_ +zero 11 53)) (fp.geq (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~main__x~0 c_ULTIMATE.start_main_~main__x~0) ((_ to_fp 11 53) c_currentRoundingMode 2.0)) (_ +zero 11 53)) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2021-10-29 04:52:08,991 WARN L860 $PredicateComparison]: unable to prove that (and (fp.geq c_ULTIMATE.start_main_~main__x~0 (_ +zero 11 53)) (fp.geq (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~main__x~0 c_ULTIMATE.start_main_~main__x~0) ((_ to_fp 11 53) c_currentRoundingMode 2.0)) (_ +zero 11 53)) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2021-10-29 04:52:16,796 WARN L207 SmtUtils]: Spent 7.20 s on a formula simplification that was a NOOP. DAG size: 14 [2021-10-29 04:52:21,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 04:52:21,078 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2021-10-29 04:52:21,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-29 04:52:21,079 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 8 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2021-10-29 04:52:21,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 04:52:21,080 INFO L225 Difference]: With dead ends: 21 [2021-10-29 04:52:21,080 INFO L226 Difference]: Without dead ends: 16 [2021-10-29 04:52:21,082 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 38.7s TimeCoverageRelationStatistics Valid=24, Invalid=28, Unknown=10, NotChecked=70, Total=132 [2021-10-29 04:52:21,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2021-10-29 04:52:21,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2021-10-29 04:52:21,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 15 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:52:21,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2021-10-29 04:52:21,088 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 12 [2021-10-29 04:52:21,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 04:52:21,089 INFO L470 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2021-10-29 04:52:21,089 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 8 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:52:21,089 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2021-10-29 04:52:21,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-10-29 04:52:21,090 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 04:52:21,090 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 04:52:21,111 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3e83e20-df52-4023-bcd3-1a56b0072de6/bin/utaipan-SDwSMHVbGG/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2021-10-29 04:52:21,292 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3e83e20-df52-4023-bcd3-1a56b0072de6/bin/utaipan-SDwSMHVbGG/mathsat -unsat_core_generation=3 [2021-10-29 04:52:21,292 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-29 04:52:21,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 04:52:21,293 INFO L85 PathProgramCache]: Analyzing trace with hash -125142316, now seen corresponding path program 1 times [2021-10-29 04:52:21,294 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-29 04:52:21,294 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [612498484] [2021-10-29 04:52:21,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 04:52:21,295 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-29 04:52:21,295 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3e83e20-df52-4023-bcd3-1a56b0072de6/bin/utaipan-SDwSMHVbGG/mathsat [2021-10-29 04:52:21,297 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3e83e20-df52-4023-bcd3-1a56b0072de6/bin/utaipan-SDwSMHVbGG/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-29 04:52:21,300 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3e83e20-df52-4023-bcd3-1a56b0072de6/bin/utaipan-SDwSMHVbGG/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-10-29 04:52:21,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:52:21,922 INFO L263 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 3 conjunts are in the unsatisfiable core [2021-10-29 04:52:21,924 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-29 04:52:34,102 WARN L860 $PredicateComparison]: unable to prove that (exists ((ULTIMATE.start_main_~main__x~0 (_ FloatingPoint 11 53)) (currentRoundingMode RoundingMode)) (and (= (fp.div currentRoundingMode ULTIMATE.start_main_~main__x~0 ((_ to_fp 11 53) currentRoundingMode 10.0)) c_ULTIMATE.start_main_~main__y~0) (fp.geq ULTIMATE.start_main_~main__x~0 (_ +zero 11 53)))) is different from true [2021-10-29 04:53:03,706 WARN L838 $PredicateComparison]: unable to prove that (exists ((ULTIMATE.start_main_~main__x~0 (_ FloatingPoint 11 53)) (currentRoundingMode RoundingMode)) (and (fp.geq ULTIMATE.start_main_~main__x~0 (_ +zero 11 53)) (not (fp.geq (fp.div currentRoundingMode ULTIMATE.start_main_~main__x~0 ((_ to_fp 11 53) currentRoundingMode 10.0)) (_ +zero 11 53))))) is different from false [2021-10-29 04:53:05,811 WARN L860 $PredicateComparison]: unable to prove that (exists ((ULTIMATE.start_main_~main__x~0 (_ FloatingPoint 11 53)) (currentRoundingMode RoundingMode)) (and (fp.geq ULTIMATE.start_main_~main__x~0 (_ +zero 11 53)) (not (fp.geq (fp.div currentRoundingMode ULTIMATE.start_main_~main__x~0 ((_ to_fp 11 53) currentRoundingMode 10.0)) (_ +zero 11 53))))) is different from true [2021-10-29 04:53:51,800 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-29 04:53:51,800 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-29 04:53:58,258 WARN L860 $PredicateComparison]: unable to prove that (forall ((currentRoundingMode RoundingMode)) (fp.geq (fp.div currentRoundingMode c_ULTIMATE.start_main_~main__x~0 ((_ to_fp 11 53) currentRoundingMode 10.0)) (_ +zero 11 53))) is different from true [2021-10-29 04:54:19,472 WARN L838 $PredicateComparison]: unable to prove that (forall ((ULTIMATE.start_main_~main__x~0 (_ FloatingPoint 11 53))) (or (not (fp.geq ULTIMATE.start_main_~main__x~0 (_ +zero 11 53))) (forall ((currentRoundingMode RoundingMode)) (fp.geq (fp.div currentRoundingMode ULTIMATE.start_main_~main__x~0 ((_ to_fp 11 53) currentRoundingMode 10.0)) (_ +zero 11 53))))) is different from false [2021-10-29 04:54:21,637 WARN L860 $PredicateComparison]: unable to prove that (forall ((ULTIMATE.start_main_~main__x~0 (_ FloatingPoint 11 53))) (or (not (fp.geq ULTIMATE.start_main_~main__x~0 (_ +zero 11 53))) (forall ((currentRoundingMode RoundingMode)) (fp.geq (fp.div currentRoundingMode ULTIMATE.start_main_~main__x~0 ((_ to_fp 11 53) currentRoundingMode 10.0)) (_ +zero 11 53))))) is different from true [2021-10-29 04:54:32,336 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-29 04:54:32,337 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-29 04:54:32,337 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [612498484] [2021-10-29 04:54:32,337 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [612498484] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-29 04:54:32,337 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-29 04:54:32,338 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 8 [2021-10-29 04:54:32,338 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764949769] [2021-10-29 04:54:32,338 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-10-29 04:54:32,339 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-29 04:54:32,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-29 04:54:32,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=9, Unknown=6, NotChecked=28, Total=56 [2021-10-29 04:54:32,340 INFO L87 Difference]: Start difference. First operand 16 states and 17 transitions. Second operand has 8 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:54:42,754 WARN L207 SmtUtils]: Spent 6.42 s on a formula simplification that was a NOOP. DAG size: 10 [2021-10-29 04:55:02,846 WARN L207 SmtUtils]: Spent 8.99 s on a formula simplification that was a NOOP. DAG size: 13 [2021-10-29 04:55:08,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 04:55:08,018 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2021-10-29 04:55:08,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-29 04:55:08,019 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2021-10-29 04:55:08,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 04:55:08,020 INFO L225 Difference]: With dead ends: 21 [2021-10-29 04:55:08,020 INFO L226 Difference]: Without dead ends: 16 [2021-10-29 04:55:08,022 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 40.1s TimeCoverageRelationStatistics Valid=25, Invalid=23, Unknown=10, NotChecked=52, Total=110 [2021-10-29 04:55:08,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2021-10-29 04:55:08,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 14. [2021-10-29 04:55:08,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:55:08,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2021-10-29 04:55:08,028 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2021-10-29 04:55:08,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 04:55:08,028 INFO L470 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2021-10-29 04:55:08,029 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:55:08,029 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2021-10-29 04:55:08,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-10-29 04:55:08,030 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 04:55:08,030 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 04:55:08,053 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3e83e20-df52-4023-bcd3-1a56b0072de6/bin/utaipan-SDwSMHVbGG/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2021-10-29 04:55:08,236 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3e83e20-df52-4023-bcd3-1a56b0072de6/bin/utaipan-SDwSMHVbGG/mathsat -unsat_core_generation=3 [2021-10-29 04:55:08,237 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-29 04:55:08,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 04:55:08,240 INFO L85 PathProgramCache]: Analyzing trace with hash 519293970, now seen corresponding path program 1 times [2021-10-29 04:55:08,241 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-29 04:55:08,241 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1827061967] [2021-10-29 04:55:08,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 04:55:08,242 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-29 04:55:08,242 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3e83e20-df52-4023-bcd3-1a56b0072de6/bin/utaipan-SDwSMHVbGG/mathsat [2021-10-29 04:55:08,243 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3e83e20-df52-4023-bcd3-1a56b0072de6/bin/utaipan-SDwSMHVbGG/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-29 04:55:08,288 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3e83e20-df52-4023-bcd3-1a56b0072de6/bin/utaipan-SDwSMHVbGG/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-10-29 04:55:08,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:55:08,987 INFO L263 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 8 conjunts are in the unsatisfiable core [2021-10-29 04:55:08,988 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-29 04:55:39,034 WARN L207 SmtUtils]: Spent 11.29 s on a formula simplification that was a NOOP. DAG size: 14 [2021-10-29 04:55:58,089 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((ULTIMATE.start_main_~main__x~0 (_ FloatingPoint 11 53))) (let ((.cse0 (fp.mul c_currentRoundingMode ULTIMATE.start_main_~main__x~0 ULTIMATE.start_main_~main__x~0))) (and (fp.geq ULTIMATE.start_main_~main__x~0 (_ +zero 11 53)) (fp.leq ULTIMATE.start_main_~main__x~0 ((_ to_fp 11 53) c_currentRoundingMode 10.0)) (not (fp.geq (fp.sub c_currentRoundingMode .cse0 ULTIMATE.start_main_~main__x~0) ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (= c_ULTIMATE.start_main_~main__y~0 (fp.add c_currentRoundingMode .cse0 ((_ to_fp 11 53) c_currentRoundingMode 2.0)))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2021-10-29 04:56:32,169 WARN L838 $PredicateComparison]: unable to prove that (and (fp.geq c_ULTIMATE.start_main_~main__y~0 (_ +zero 11 53)) (exists ((ULTIMATE.start_main_~main__x~0 (_ FloatingPoint 11 53))) (let ((.cse0 (fp.mul c_currentRoundingMode ULTIMATE.start_main_~main__x~0 ULTIMATE.start_main_~main__x~0))) (and (fp.geq ULTIMATE.start_main_~main__x~0 (_ +zero 11 53)) (fp.leq ULTIMATE.start_main_~main__x~0 ((_ to_fp 11 53) c_currentRoundingMode 10.0)) (not (fp.geq (fp.sub c_currentRoundingMode .cse0 ULTIMATE.start_main_~main__x~0) ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (= c_ULTIMATE.start_main_~main__y~0 (fp.add c_currentRoundingMode .cse0 ((_ to_fp 11 53) c_currentRoundingMode 2.0)))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2021-10-29 04:56:53,796 WARN L207 SmtUtils]: Spent 6.07 s on a formula simplification. DAG size of input: 8 DAG size of output: 1 [2021-10-29 04:56:53,817 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-29 04:56:53,817 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-29 04:57:11,425 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~main__x~0 c_ULTIMATE.start_main_~main__x~0) ((_ to_fp 11 53) c_currentRoundingMode 2.0)))) (or (not (fp.geq .cse0 (_ +zero 11 53))) (fp.leq .cse0 ((_ to_fp 11 53) c_currentRoundingMode 105.0)) (fp.geq c_ULTIMATE.start_main_~main__y~0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))))) is different from false [2021-10-29 04:57:13,484 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.add c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~main__x~0 c_ULTIMATE.start_main_~main__x~0) ((_ to_fp 11 53) c_currentRoundingMode 2.0)))) (or (not (fp.geq .cse0 (_ +zero 11 53))) (fp.leq .cse0 ((_ to_fp 11 53) c_currentRoundingMode 105.0)) (fp.geq c_ULTIMATE.start_main_~main__y~0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))))) is different from true [2021-10-29 04:57:26,681 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~main__x~0 c_ULTIMATE.start_main_~main__x~0))) (let ((.cse0 (fp.add c_currentRoundingMode .cse1 ((_ to_fp 11 53) c_currentRoundingMode 2.0)))) (or (not (fp.geq .cse0 (_ +zero 11 53))) (fp.leq .cse0 ((_ to_fp 11 53) c_currentRoundingMode 105.0)) (fp.geq (fp.sub c_currentRoundingMode .cse1 c_ULTIMATE.start_main_~main__x~0) ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))))) is different from false [2021-10-29 04:57:28,745 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~main__x~0 c_ULTIMATE.start_main_~main__x~0))) (let ((.cse0 (fp.add c_currentRoundingMode .cse1 ((_ to_fp 11 53) c_currentRoundingMode 2.0)))) (or (not (fp.geq .cse0 (_ +zero 11 53))) (fp.leq .cse0 ((_ to_fp 11 53) c_currentRoundingMode 105.0)) (fp.geq (fp.sub c_currentRoundingMode .cse1 c_ULTIMATE.start_main_~main__x~0) ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))))) is different from true [2021-10-29 04:57:39,045 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-29 04:57:39,046 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-29 04:57:39,046 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1827061967] [2021-10-29 04:57:39,046 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1827061967] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-29 04:57:39,046 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-29 04:57:39,047 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 6] imperfect sequences [] total 12 [2021-10-29 04:57:39,047 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168836262] [2021-10-29 04:57:39,048 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-29 04:57:39,048 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-29 04:57:39,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-29 04:57:39,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=35, Unknown=9, NotChecked=60, Total=132 [2021-10-29 04:57:39,050 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand has 12 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 12 states have internal predecessors, (22), 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-29 04:57:43,270 WARN L838 $PredicateComparison]: unable to prove that (and (let ((.cse1 (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~main__x~0 c_ULTIMATE.start_main_~main__x~0))) (let ((.cse0 (fp.add c_currentRoundingMode .cse1 ((_ to_fp 11 53) c_currentRoundingMode 2.0)))) (or (not (fp.geq .cse0 (_ +zero 11 53))) (fp.leq .cse0 ((_ to_fp 11 53) c_currentRoundingMode 105.0)) (fp.geq (fp.sub c_currentRoundingMode .cse1 c_ULTIMATE.start_main_~main__x~0) ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))))) (fp.geq c_ULTIMATE.start_main_~main__x~0 (_ +zero 11 53)) (fp.leq c_ULTIMATE.start_main_~main__x~0 ((_ to_fp 11 53) c_currentRoundingMode 10.0)) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2021-10-29 04:57:45,327 WARN L860 $PredicateComparison]: unable to prove that (and (let ((.cse1 (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~main__x~0 c_ULTIMATE.start_main_~main__x~0))) (let ((.cse0 (fp.add c_currentRoundingMode .cse1 ((_ to_fp 11 53) c_currentRoundingMode 2.0)))) (or (not (fp.geq .cse0 (_ +zero 11 53))) (fp.leq .cse0 ((_ to_fp 11 53) c_currentRoundingMode 105.0)) (fp.geq (fp.sub c_currentRoundingMode .cse1 c_ULTIMATE.start_main_~main__x~0) ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))))) (fp.geq c_ULTIMATE.start_main_~main__x~0 (_ +zero 11 53)) (fp.leq c_ULTIMATE.start_main_~main__x~0 ((_ to_fp 11 53) c_currentRoundingMode 10.0)) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2021-10-29 04:57:47,395 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~main__x~0 c_ULTIMATE.start_main_~main__x~0))) (and (let ((.cse0 (fp.add c_currentRoundingMode .cse1 ((_ to_fp 11 53) c_currentRoundingMode 2.0)))) (or (not (fp.geq .cse0 (_ +zero 11 53))) (fp.leq .cse0 ((_ to_fp 11 53) c_currentRoundingMode 105.0)) (fp.geq c_ULTIMATE.start_main_~main__y~0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))))) (fp.geq c_ULTIMATE.start_main_~main__x~0 (_ +zero 11 53)) (fp.leq c_ULTIMATE.start_main_~main__x~0 ((_ to_fp 11 53) c_currentRoundingMode 10.0)) (= (fp.sub c_currentRoundingMode .cse1 c_ULTIMATE.start_main_~main__x~0) c_ULTIMATE.start_main_~main__y~0) (= c_currentRoundingMode roundNearestTiesToEven))) is different from false [2021-10-29 04:57:51,011 WARN L838 $PredicateComparison]: unable to prove that (and (or (not (fp.geq c_ULTIMATE.start_main_~main__y~0 (_ +zero 11 53))) (fp.leq c_ULTIMATE.start_main_~main__y~0 ((_ to_fp 11 53) c_currentRoundingMode 105.0))) (exists ((ULTIMATE.start_main_~main__x~0 (_ FloatingPoint 11 53))) (let ((.cse0 (fp.mul c_currentRoundingMode ULTIMATE.start_main_~main__x~0 ULTIMATE.start_main_~main__x~0))) (and (fp.geq ULTIMATE.start_main_~main__x~0 (_ +zero 11 53)) (fp.leq ULTIMATE.start_main_~main__x~0 ((_ to_fp 11 53) c_currentRoundingMode 10.0)) (not (fp.geq (fp.sub c_currentRoundingMode .cse0 ULTIMATE.start_main_~main__x~0) ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (= c_ULTIMATE.start_main_~main__y~0 (fp.add c_currentRoundingMode .cse0 ((_ to_fp 11 53) c_currentRoundingMode 2.0)))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2021-10-29 04:57:53,085 WARN L838 $PredicateComparison]: unable to prove that (and (fp.geq c_ULTIMATE.start_main_~main__y~0 (_ +zero 11 53)) (fp.leq c_ULTIMATE.start_main_~main__y~0 ((_ to_fp 11 53) c_currentRoundingMode 105.0)) (exists ((ULTIMATE.start_main_~main__x~0 (_ FloatingPoint 11 53))) (let ((.cse0 (fp.mul c_currentRoundingMode ULTIMATE.start_main_~main__x~0 ULTIMATE.start_main_~main__x~0))) (and (fp.geq ULTIMATE.start_main_~main__x~0 (_ +zero 11 53)) (fp.leq ULTIMATE.start_main_~main__x~0 ((_ to_fp 11 53) c_currentRoundingMode 10.0)) (not (fp.geq (fp.sub c_currentRoundingMode .cse0 ULTIMATE.start_main_~main__x~0) ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (= c_ULTIMATE.start_main_~main__y~0 (fp.add c_currentRoundingMode .cse0 ((_ to_fp 11 53) c_currentRoundingMode 2.0)))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2021-10-29 04:57:53,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 04:57:53,122 INFO L93 Difference]: Finished difference Result 22 states and 21 transitions. [2021-10-29 04:57:53,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-10-29 04:57:53,123 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 12 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2021-10-29 04:57:53,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 04:57:53,123 INFO L225 Difference]: With dead ends: 22 [2021-10-29 04:57:53,123 INFO L226 Difference]: Without dead ends: 14 [2021-10-29 04:57:53,124 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 42.8s TimeCoverageRelationStatistics Valid=36, Invalid=38, Unknown=14, NotChecked=152, Total=240 [2021-10-29 04:57:53,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2021-10-29 04:57:53,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2021-10-29 04:57:53,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 1.0) internal successors, (13), 13 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:57:53,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 13 transitions. [2021-10-29 04:57:53,131 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 13 transitions. Word has length 13 [2021-10-29 04:57:53,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 04:57:53,131 INFO L470 AbstractCegarLoop]: Abstraction has 14 states and 13 transitions. [2021-10-29 04:57:53,132 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 12 states have internal predecessors, (22), 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-29 04:57:53,132 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 13 transitions. [2021-10-29 04:57:53,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-10-29 04:57:53,133 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 04:57:53,133 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 04:57:53,154 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3e83e20-df52-4023-bcd3-1a56b0072de6/bin/utaipan-SDwSMHVbGG/mathsat -unsat_core_generation=3 (5)] Ended with exit code 0 [2021-10-29 04:57:53,348 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3e83e20-df52-4023-bcd3-1a56b0072de6/bin/utaipan-SDwSMHVbGG/mathsat -unsat_core_generation=3 [2021-10-29 04:57:53,348 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-29 04:57:53,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 04:57:53,349 INFO L85 PathProgramCache]: Analyzing trace with hash -101291445, now seen corresponding path program 1 times [2021-10-29 04:57:53,349 INFO L121 FreeRefinementEngine]: Executing refinement strategy WALRUS [2021-10-29 04:57:53,357 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1266083567] [2021-10-29 04:57:53,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 04:57:53,357 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-10-29 04:57:53,358 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3e83e20-df52-4023-bcd3-1a56b0072de6/bin/utaipan-SDwSMHVbGG/mathsat [2021-10-29 04:57:53,361 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3e83e20-df52-4023-bcd3-1a56b0072de6/bin/utaipan-SDwSMHVbGG/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-10-29 04:57:53,403 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3e83e20-df52-4023-bcd3-1a56b0072de6/bin/utaipan-SDwSMHVbGG/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2021-10-29 04:57:54,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:57:54,226 INFO L263 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 5 conjunts are in the unsatisfiable core [2021-10-29 04:57:54,227 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-29 04:58:05,992 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((ULTIMATE.start_main_~main__x~0 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 10.0))) (and (= (fp.div c_currentRoundingMode ULTIMATE.start_main_~main__x~0 .cse0) c_ULTIMATE.start_main_~main__y~0) (fp.leq ULTIMATE.start_main_~main__x~0 .cse0)))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2021-10-29 04:58:32,891 WARN L207 SmtUtils]: Spent 9.83 s on a formula simplification that was a NOOP. DAG size: 15 [2021-10-29 04:58:50,589 WARN L838 $PredicateComparison]: unable to prove that (exists ((ULTIMATE.start_main_~main__x~0 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 10.0))) (let ((.cse1 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~main__x~0 .cse0))) (and (fp.leq ULTIMATE.start_main_~main__x~0 .cse0) (fp.geq .cse1 (_ +zero 11 53)) (not (fp.leq .cse1 ((_ to_fp 11 53) roundNearestTiesToEven 105.0))))))) is different from false [2021-10-29 04:58:52,689 WARN L860 $PredicateComparison]: unable to prove that (exists ((ULTIMATE.start_main_~main__x~0 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 10.0))) (let ((.cse1 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~main__x~0 .cse0))) (and (fp.leq ULTIMATE.start_main_~main__x~0 .cse0) (fp.geq .cse1 (_ +zero 11 53)) (not (fp.leq .cse1 ((_ to_fp 11 53) roundNearestTiesToEven 105.0))))))) is different from true [2021-10-29 04:59:38,600 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-29 04:59:38,600 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-29 04:59:54,302 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~main__x~0 ((_ to_fp 11 53) c_currentRoundingMode 10.0)))) (or (fp.leq .cse0 ((_ to_fp 11 53) c_currentRoundingMode 105.0)) (not (fp.geq .cse0 (_ +zero 11 53))))) is different from false [2021-10-29 04:59:56,431 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~main__x~0 ((_ to_fp 11 53) c_currentRoundingMode 10.0)))) (or (fp.leq .cse0 ((_ to_fp 11 53) c_currentRoundingMode 105.0)) (not (fp.geq .cse0 (_ +zero 11 53))))) is different from true [2021-10-29 05:00:21,063 WARN L838 $PredicateComparison]: unable to prove that (forall ((ULTIMATE.start_main_~main__x~0 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 10.0))) (let ((.cse1 (fp.div c_currentRoundingMode ULTIMATE.start_main_~main__x~0 .cse0))) (or (not (fp.leq ULTIMATE.start_main_~main__x~0 .cse0)) (fp.leq .cse1 ((_ to_fp 11 53) c_currentRoundingMode 105.0)) (not (fp.geq .cse1 (_ +zero 11 53))))))) is different from false [2021-10-29 05:00:23,224 WARN L860 $PredicateComparison]: unable to prove that (forall ((ULTIMATE.start_main_~main__x~0 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 10.0))) (let ((.cse1 (fp.div c_currentRoundingMode ULTIMATE.start_main_~main__x~0 .cse0))) (or (not (fp.leq ULTIMATE.start_main_~main__x~0 .cse0)) (fp.leq .cse1 ((_ to_fp 11 53) c_currentRoundingMode 105.0)) (not (fp.geq .cse1 (_ +zero 11 53))))))) is different from true [2021-10-29 05:00:51,339 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-29 05:00:51,339 INFO L139 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2021-10-29 05:00:51,340 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1266083567] [2021-10-29 05:00:51,340 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1266083567] provided 2 perfect and 0 imperfect interpolant sequences [2021-10-29 05:00:51,340 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-10-29 05:00:51,340 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 10 [2021-10-29 05:00:51,340 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289295251] [2021-10-29 05:00:51,341 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-29 05:00:51,341 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2021-10-29 05:00:51,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-29 05:00:51,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=26, Unknown=10, NotChecked=52, Total=110 [2021-10-29 05:00:51,342 INFO L87 Difference]: Start difference. First operand 14 states and 13 transitions. Second operand has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 10 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:00:53,500 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((ULTIMATE.start_main_~main__x~0 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 10.0))) (let ((.cse1 (fp.div c_currentRoundingMode ULTIMATE.start_main_~main__x~0 .cse0))) (or (not (fp.leq ULTIMATE.start_main_~main__x~0 .cse0)) (fp.leq .cse1 ((_ to_fp 11 53) c_currentRoundingMode 105.0)) (not (fp.geq .cse1 (_ +zero 11 53))))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2021-10-29 05:00:55,652 WARN L860 $PredicateComparison]: unable to prove that (and (forall ((ULTIMATE.start_main_~main__x~0 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 10.0))) (let ((.cse1 (fp.div c_currentRoundingMode ULTIMATE.start_main_~main__x~0 .cse0))) (or (not (fp.leq ULTIMATE.start_main_~main__x~0 .cse0)) (fp.leq .cse1 ((_ to_fp 11 53) c_currentRoundingMode 105.0)) (not (fp.geq .cse1 (_ +zero 11 53))))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2021-10-29 05:00:57,813 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 10.0))) (and (fp.leq c_ULTIMATE.start_main_~main__x~0 .cse0) (let ((.cse1 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~main__x~0 .cse0))) (or (fp.leq .cse1 ((_ to_fp 11 53) c_currentRoundingMode 105.0)) (not (fp.geq .cse1 (_ +zero 11 53))))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from false [2021-10-29 05:00:59,969 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 10.0))) (and (fp.leq c_ULTIMATE.start_main_~main__x~0 .cse0) (let ((.cse1 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~main__x~0 .cse0))) (or (fp.leq .cse1 ((_ to_fp 11 53) c_currentRoundingMode 105.0)) (not (fp.geq .cse1 (_ +zero 11 53))))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2021-10-29 05:01:02,125 WARN L838 $PredicateComparison]: unable to prove that (and (or (not (fp.geq c_ULTIMATE.start_main_~main__y~0 (_ +zero 11 53))) (fp.leq c_ULTIMATE.start_main_~main__y~0 ((_ to_fp 11 53) c_currentRoundingMode 105.0))) (exists ((ULTIMATE.start_main_~main__x~0 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 10.0))) (and (= (fp.div c_currentRoundingMode ULTIMATE.start_main_~main__x~0 .cse0) c_ULTIMATE.start_main_~main__y~0) (fp.leq ULTIMATE.start_main_~main__x~0 .cse0)))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2021-10-29 05:01:04,298 WARN L838 $PredicateComparison]: unable to prove that (and (fp.geq c_ULTIMATE.start_main_~main__y~0 (_ +zero 11 53)) (exists ((ULTIMATE.start_main_~main__x~0 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 10.0))) (and (= (fp.div c_currentRoundingMode ULTIMATE.start_main_~main__x~0 .cse0) c_ULTIMATE.start_main_~main__y~0) (fp.leq ULTIMATE.start_main_~main__x~0 .cse0)))) (fp.leq c_ULTIMATE.start_main_~main__y~0 ((_ to_fp 11 53) c_currentRoundingMode 105.0)) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2021-10-29 05:01:04,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:01:04,310 INFO L93 Difference]: Finished difference Result 14 states and 13 transitions. [2021-10-29 05:01:04,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-29 05:01:04,311 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 10 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2021-10-29 05:01:04,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:01:04,311 INFO L225 Difference]: With dead ends: 14 [2021-10-29 05:01:04,311 INFO L226 Difference]: Without dead ends: 0 [2021-10-29 05:01:04,312 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 45.5s TimeCoverageRelationStatistics Valid=30, Invalid=28, Unknown=16, NotChecked=136, Total=210 [2021-10-29 05:01:04,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-10-29 05:01:04,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-10-29 05:01:04,312 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-29 05:01:04,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-10-29 05:01:04,313 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 13 [2021-10-29 05:01:04,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:01:04,313 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-10-29 05:01:04,313 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 10 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:01:04,313 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-10-29 05:01:04,314 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-10-29 05:01:04,318 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:01:04,349 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3e83e20-df52-4023-bcd3-1a56b0072de6/bin/utaipan-SDwSMHVbGG/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2021-10-29 05:01:04,528 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3e83e20-df52-4023-bcd3-1a56b0072de6/bin/utaipan-SDwSMHVbGG/mathsat -unsat_core_generation=3 [2021-10-29 05:01:04,530 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-10-29 05:01:04,534 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:01:04,581 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:01:04,582 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:01:04,583 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:02:29,249 WARN L207 SmtUtils]: Spent 1.41 m on a formula simplification that was a NOOP. DAG size: 44 [2021-10-29 05:02:29,252 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-10-29 05:02:29,252 INFO L853 garLoopResultBuilder]: At program point L64(lines 32 65) the Hoare annotation is: false [2021-10-29 05:02:29,252 INFO L857 garLoopResultBuilder]: For program point L27(lines 27 71) no Hoare annotation was computed. [2021-10-29 05:02:29,253 INFO L857 garLoopResultBuilder]: For program point L21(lines 21 81) no Hoare annotation was computed. [2021-10-29 05:02:29,253 INFO L860 garLoopResultBuilder]: At program point L85(lines 13 87) the Hoare annotation is: true [2021-10-29 05:02:29,253 INFO L857 garLoopResultBuilder]: For program point L19(lines 19 86) no Hoare annotation was computed. [2021-10-29 05:02:29,253 INFO L857 garLoopResultBuilder]: For program point L34(lines 34 60) no Hoare annotation was computed. [2021-10-29 05:02:29,253 INFO L857 garLoopResultBuilder]: For program point L32(lines 32 65) no Hoare annotation was computed. [2021-10-29 05:02:29,253 INFO L857 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-10-29 05:02:29,253 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-10-29 05:02:29,253 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-10-29 05:02:29,254 INFO L853 garLoopResultBuilder]: At program point L59(lines 34 60) the Hoare annotation is: (= (_ bv1 32) ULTIMATE.start_main_~main____CPAchecker_TMP_1~0) [2021-10-29 05:02:29,254 INFO L857 garLoopResultBuilder]: For program point L24(lines 24 76) no Hoare annotation was computed. [2021-10-29 05:02:29,254 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 45) no Hoare annotation was computed. [2021-10-29 05:02:29,254 INFO L857 garLoopResultBuilder]: For program point L45(line 45) no Hoare annotation was computed. [2021-10-29 05:02:29,254 INFO L857 garLoopResultBuilder]: For program point L43(lines 43 52) no Hoare annotation was computed. [2021-10-29 05:02:29,255 INFO L853 garLoopResultBuilder]: At program point L70(lines 27 71) the Hoare annotation is: (let ((.cse1 (fp.leq ULTIMATE.start_main_~main__y~0 ((_ to_fp 11 53) currentRoundingMode 105.0))) (.cse2 (let ((.cse5 (fp.geq ULTIMATE.start_main_~main__y~0 (_ +zero 11 53))) (.cse6 (fp.geq ULTIMATE.start_main_~main__x~0 (_ +zero 11 53)))) (or (and .cse5 (exists ((ULTIMATE.start_main_~main__x~0 (_ FloatingPoint 11 53))) (and (= ULTIMATE.start_main_~main__y~0 (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven ULTIMATE.start_main_~main__x~0 ULTIMATE.start_main_~main__x~0) ((_ to_fp 11 53) roundNearestTiesToEven 2.0))) (fp.geq ULTIMATE.start_main_~main__x~0 (_ +zero 11 53)))) .cse6) (and .cse5 .cse6 (exists ((ULTIMATE.start_main_~main__x~0 (_ FloatingPoint 11 53)) (currentRoundingMode RoundingMode)) (and (= (fp.div currentRoundingMode ULTIMATE.start_main_~main__x~0 ((_ to_fp 11 53) currentRoundingMode 10.0)) ULTIMATE.start_main_~main__y~0) (fp.geq ULTIMATE.start_main_~main__x~0 (_ +zero 11 53)))))))) (.cse3 (= currentRoundingMode roundNearestTiesToEven))) (or (and (exists ((ULTIMATE.start_main_~main__x~0 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) currentRoundingMode 10.0))) (and (= (fp.div currentRoundingMode ULTIMATE.start_main_~main__x~0 .cse0) ULTIMATE.start_main_~main__y~0) (fp.leq ULTIMATE.start_main_~main__x~0 .cse0)))) .cse1 .cse2 .cse3) (and .cse1 (exists ((ULTIMATE.start_main_~main__x~0 (_ FloatingPoint 11 53))) (let ((.cse4 (fp.mul currentRoundingMode ULTIMATE.start_main_~main__x~0 ULTIMATE.start_main_~main__x~0))) (and (fp.geq ULTIMATE.start_main_~main__x~0 (_ +zero 11 53)) (fp.leq ULTIMATE.start_main_~main__x~0 ((_ to_fp 11 53) currentRoundingMode 10.0)) (not (fp.geq (fp.sub currentRoundingMode .cse4 ULTIMATE.start_main_~main__x~0) ((_ to_fp 11 53) currentRoundingMode (_ bv0 32)))) (= ULTIMATE.start_main_~main__y~0 (fp.add currentRoundingMode .cse4 ((_ to_fp 11 53) currentRoundingMode 2.0)))))) .cse2 .cse3))) [2021-10-29 05:02:29,262 INFO L731 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2021-10-29 05:02:29,263 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-10-29 05:02:29,285 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2021-10-29 05:02:29,286 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2021-10-29 05:02:29,287 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2021-10-29 05:02:29,287 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2021-10-29 05:02:29,287 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2021-10-29 05:02:29,287 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2021-10-29 05:02:29,288 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2021-10-29 05:02:29,288 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2021-10-29 05:02:29,288 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2021-10-29 05:02:29,288 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2021-10-29 05:02:29,289 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2021-10-29 05:02:29,289 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2021-10-29 05:02:29,289 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2021-10-29 05:02:29,289 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2021-10-29 05:02:29,290 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2021-10-29 05:02:29,290 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2021-10-29 05:02:29,290 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2021-10-29 05:02:29,290 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2021-10-29 05:02:29,291 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2021-10-29 05:02:29,291 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2021-10-29 05:02:29,291 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2021-10-29 05:02:29,291 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2021-10-29 05:02:29,292 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2021-10-29 05:02:29,292 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2021-10-29 05:02:29,292 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2021-10-29 05:02:29,292 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2021-10-29 05:02:29,294 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2021-10-29 05:02:29,294 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2021-10-29 05:02:29,294 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2021-10-29 05:02:29,294 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2021-10-29 05:02:29,295 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2021-10-29 05:02:29,302 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2021-10-29 05:02:29,304 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2021-10-29 05:02:29,304 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2021-10-29 05:02:29,304 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2021-10-29 05:02:29,304 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2021-10-29 05:02:29,305 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2021-10-29 05:02:29,305 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2021-10-29 05:02:29,305 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2021-10-29 05:02:29,308 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2021-10-29 05:02:29,309 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2021-10-29 05:02:29,311 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2021-10-29 05:02:29,312 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2021-10-29 05:02:29,312 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2021-10-29 05:02:29,316 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2021-10-29 05:02:29,317 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2021-10-29 05:02:29,317 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2021-10-29 05:02:29,317 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2021-10-29 05:02:29,317 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2021-10-29 05:02:29,319 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2021-10-29 05:02:29,319 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2021-10-29 05:02:29,319 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2021-10-29 05:02:29,320 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2021-10-29 05:02:29,320 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2021-10-29 05:02:29,320 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2021-10-29 05:02:29,320 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2021-10-29 05:02:29,320 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2021-10-29 05:02:29,321 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2021-10-29 05:02:29,321 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2021-10-29 05:02:29,321 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2021-10-29 05:02:29,321 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2021-10-29 05:02:29,321 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2021-10-29 05:02:29,336 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.10 05:02:29 BoogieIcfgContainer [2021-10-29 05:02:29,337 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-10-29 05:02:29,337 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-29 05:02:29,337 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-29 05:02:29,338 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-29 05:02:29,338 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.10 04:50:18" (3/4) ... [2021-10-29 05:02:29,341 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-10-29 05:02:29,367 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2021-10-29 05:02:29,384 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2021-10-29 05:02:29,384 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-10-29 05:02:29,385 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-10-29 05:02:29,415 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((\exists ULTIMATE.start_main_~main__x~0 : C_DOUBLE :: ~fp.div~DOUBLE(unknown-currentRoundingMode-unknown, ULTIMATE.start_main_~main__x~0, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 10.0)) == main__y && ~fp.leq~DOUBLE(ULTIMATE.start_main_~main__x~0, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 10.0))) && ~fp.leq~DOUBLE(main__y, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 105.0))) && (((~fp.geq~DOUBLE(main__y, ~Pluszero~LONGDOUBLE()) && (\exists ULTIMATE.start_main_~main__x~0 : C_DOUBLE :: main__y == ~fp.add~DOUBLE(~roundNearestTiesToEven, ~fp.mul~DOUBLE(~roundNearestTiesToEven, ULTIMATE.start_main_~main__x~0, ULTIMATE.start_main_~main__x~0), ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 2.0)) && ~fp.geq~DOUBLE(ULTIMATE.start_main_~main__x~0, ~Pluszero~LONGDOUBLE()))) && ~fp.geq~DOUBLE(main__x, ~Pluszero~LONGDOUBLE())) || ((~fp.geq~DOUBLE(main__y, ~Pluszero~LONGDOUBLE()) && ~fp.geq~DOUBLE(main__x, ~Pluszero~LONGDOUBLE())) && (\exists ULTIMATE.start_main_~main__x~0 : C_DOUBLE, currentRoundingMode : FloatRoundingMode :: ~fp.div~DOUBLE(currentRoundingMode, ULTIMATE.start_main_~main__x~0, ~to_fp~LONGDOUBLE(currentRoundingMode, 10.0)) == main__y && ~fp.geq~DOUBLE(ULTIMATE.start_main_~main__x~0, ~Pluszero~LONGDOUBLE()))))) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven) || (((~fp.leq~DOUBLE(main__y, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 105.0)) && (\exists ULTIMATE.start_main_~main__x~0 : C_DOUBLE :: ((~fp.geq~DOUBLE(ULTIMATE.start_main_~main__x~0, ~Pluszero~LONGDOUBLE()) && ~fp.leq~DOUBLE(ULTIMATE.start_main_~main__x~0, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 10.0))) && !~fp.geq~DOUBLE(~fp.sub~DOUBLE(unknown-currentRoundingMode-unknown, ~fp.mul~DOUBLE(unknown-currentRoundingMode-unknown, ULTIMATE.start_main_~main__x~0, ULTIMATE.start_main_~main__x~0), ULTIMATE.start_main_~main__x~0), ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 0bv32))) && main__y == ~fp.add~DOUBLE(unknown-currentRoundingMode-unknown, ~fp.mul~DOUBLE(unknown-currentRoundingMode-unknown, ULTIMATE.start_main_~main__x~0, ULTIMATE.start_main_~main__x~0), ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 2.0)))) && (((~fp.geq~DOUBLE(main__y, ~Pluszero~LONGDOUBLE()) && (\exists ULTIMATE.start_main_~main__x~0 : C_DOUBLE :: main__y == ~fp.add~DOUBLE(~roundNearestTiesToEven, ~fp.mul~DOUBLE(~roundNearestTiesToEven, ULTIMATE.start_main_~main__x~0, ULTIMATE.start_main_~main__x~0), ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 2.0)) && ~fp.geq~DOUBLE(ULTIMATE.start_main_~main__x~0, ~Pluszero~LONGDOUBLE()))) && ~fp.geq~DOUBLE(main__x, ~Pluszero~LONGDOUBLE())) || ((~fp.geq~DOUBLE(main__y, ~Pluszero~LONGDOUBLE()) && ~fp.geq~DOUBLE(main__x, ~Pluszero~LONGDOUBLE())) && (\exists ULTIMATE.start_main_~main__x~0 : C_DOUBLE, currentRoundingMode : FloatRoundingMode :: ~fp.div~DOUBLE(currentRoundingMode, ULTIMATE.start_main_~main__x~0, ~to_fp~LONGDOUBLE(currentRoundingMode, 10.0)) == main__y && ~fp.geq~DOUBLE(ULTIMATE.start_main_~main__x~0, ~Pluszero~LONGDOUBLE()))))) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven) [2021-10-29 05:02:29,472 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3e83e20-df52-4023-bcd3-1a56b0072de6/bin/utaipan-SDwSMHVbGG/witness.graphml [2021-10-29 05:02:29,473 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-29 05:02:29,477 INFO L168 Benchmark]: Toolchain (without parser) took 734571.41 ms. Allocated memory was 52.4 MB in the beginning and 73.4 MB in the end (delta: 21.0 MB). Free memory was 29.0 MB in the beginning and 44.2 MB in the end (delta: -15.2 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. [2021-10-29 05:02:29,478 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 52.4 MB. Free memory was 33.9 MB in the beginning and 33.9 MB in the end (delta: 33.6 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-10-29 05:02:29,481 INFO L168 Benchmark]: CACSL2BoogieTranslator took 375.98 ms. Allocated memory was 52.4 MB in the beginning and 73.4 MB in the end (delta: 21.0 MB). Free memory was 28.8 MB in the beginning and 56.2 MB in the end (delta: -27.4 MB). Peak memory consumption was 7.6 MB. Max. memory is 16.1 GB. [2021-10-29 05:02:29,481 INFO L168 Benchmark]: Boogie Procedure Inliner took 38.64 ms. Allocated memory is still 73.4 MB. Free memory was 56.2 MB in the beginning and 54.8 MB in the end (delta: 1.4 MB). There was no memory consumed. Max. memory is 16.1 GB. [2021-10-29 05:02:29,482 INFO L168 Benchmark]: Boogie Preprocessor took 50.94 ms. Allocated memory is still 73.4 MB. Free memory was 54.8 MB in the beginning and 53.5 MB in the end (delta: 1.3 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-29 05:02:29,482 INFO L168 Benchmark]: RCFGBuilder took 3357.93 ms. Allocated memory is still 73.4 MB. Free memory was 53.5 MB in the beginning and 43.6 MB in the end (delta: 9.8 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2021-10-29 05:02:29,482 INFO L168 Benchmark]: TraceAbstraction took 730601.45 ms. Allocated memory is still 73.4 MB. Free memory was 43.3 MB in the beginning and 46.9 MB in the end (delta: -3.6 MB). Peak memory consumption was 21.5 MB. Max. memory is 16.1 GB. [2021-10-29 05:02:29,483 INFO L168 Benchmark]: Witness Printer took 136.28 ms. Allocated memory is still 73.4 MB. Free memory was 46.9 MB in the beginning and 44.2 MB in the end (delta: 2.7 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-10-29 05:02:29,497 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 52.4 MB. Free memory was 33.9 MB in the beginning and 33.9 MB in the end (delta: 33.6 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 375.98 ms. Allocated memory was 52.4 MB in the beginning and 73.4 MB in the end (delta: 21.0 MB). Free memory was 28.8 MB in the beginning and 56.2 MB in the end (delta: -27.4 MB). Peak memory consumption was 7.6 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 38.64 ms. Allocated memory is still 73.4 MB. Free memory was 56.2 MB in the beginning and 54.8 MB in the end (delta: 1.4 MB). There was no memory consumed. Max. memory is 16.1 GB. * Boogie Preprocessor took 50.94 ms. Allocated memory is still 73.4 MB. Free memory was 54.8 MB in the beginning and 53.5 MB in the end (delta: 1.3 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 3357.93 ms. Allocated memory is still 73.4 MB. Free memory was 53.5 MB in the beginning and 43.6 MB in the end (delta: 9.8 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * TraceAbstraction took 730601.45 ms. Allocated memory is still 73.4 MB. Free memory was 43.3 MB in the beginning and 46.9 MB in the end (delta: -3.6 MB). Peak memory consumption was 21.5 MB. Max. memory is 16.1 GB. * Witness Printer took 136.28 ms. Allocated memory is still 73.4 MB. Free memory was 46.9 MB in the beginning and 44.2 MB in the end (delta: 2.7 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.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: 45]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 17 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 730.4s, OverallIterations: 5, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 83.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 84.7s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 49 SDtfs, 29 SDslu, 107 SDs, 0 SdLazy, 44 SolverSat, 2 SolverUnsat, 6 SolverUnknown, 0 SolverNotchecked, 15.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 129 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 25 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 167.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=17occurred in iteration=0, InterpolantAutomatonStates: 31, 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, 5 MinimizatonAttempts, 2 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 9 NumberOfFragments, 160 HoareAnnotationTreeSize, 4 FomulaSimplifications, 10 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 4 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 84.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 2.7s SatisfiabilityAnalysisTime, 558.0s InterpolantComputationTime, 62 NumberOfCodeBlocks, 62 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 114 ConstructedInterpolants, 32 QuantifiedInterpolants, 1001 SizeOfPredicates, 18 NumberOfNonLiveVariables, 198 ConjunctsInSsa, 24 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 34]: Loop Invariant Derived loop invariant: 1bv32 == main____CPAchecker_TMP_1 - InvariantResult [Line: 13]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 32]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 27]: Loop Invariant [2021-10-29 05:02:29,533 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2021-10-29 05:02:29,533 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2021-10-29 05:02:29,533 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2021-10-29 05:02:29,533 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2021-10-29 05:02:29,534 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2021-10-29 05:02:29,534 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2021-10-29 05:02:29,534 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2021-10-29 05:02:29,534 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2021-10-29 05:02:29,534 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2021-10-29 05:02:29,535 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2021-10-29 05:02:29,535 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2021-10-29 05:02:29,535 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2021-10-29 05:02:29,535 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2021-10-29 05:02:29,535 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2021-10-29 05:02:29,536 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2021-10-29 05:02:29,536 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2021-10-29 05:02:29,537 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2021-10-29 05:02:29,537 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2021-10-29 05:02:29,537 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2021-10-29 05:02:29,537 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2021-10-29 05:02:29,538 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2021-10-29 05:02:29,538 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2021-10-29 05:02:29,538 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2021-10-29 05:02:29,538 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2021-10-29 05:02:29,539 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2021-10-29 05:02:29,539 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2021-10-29 05:02:29,539 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2021-10-29 05:02:29,539 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2021-10-29 05:02:29,539 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2021-10-29 05:02:29,539 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2021-10-29 05:02:29,540 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2021-10-29 05:02:29,542 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2021-10-29 05:02:29,542 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2021-10-29 05:02:29,543 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2021-10-29 05:02:29,543 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2021-10-29 05:02:29,543 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2021-10-29 05:02:29,543 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2021-10-29 05:02:29,543 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2021-10-29 05:02:29,544 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2021-10-29 05:02:29,544 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2021-10-29 05:02:29,544 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2021-10-29 05:02:29,544 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2021-10-29 05:02:29,544 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2021-10-29 05:02:29,545 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2021-10-29 05:02:29,545 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2021-10-29 05:02:29,545 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2021-10-29 05:02:29,545 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2021-10-29 05:02:29,545 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2021-10-29 05:02:29,546 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2021-10-29 05:02:29,546 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2021-10-29 05:02:29,546 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2021-10-29 05:02:29,546 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2021-10-29 05:02:29,546 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2021-10-29 05:02:29,547 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2021-10-29 05:02:29,547 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2021-10-29 05:02:29,548 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2021-10-29 05:02:29,548 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2021-10-29 05:02:29,558 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2021-10-29 05:02:29,558 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2021-10-29 05:02:29,558 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2021-10-29 05:02:29,559 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_main_~main__x~0,QUANTIFIED] [2021-10-29 05:02:29,559 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: ((((\exists ULTIMATE.start_main_~main__x~0 : C_DOUBLE :: ~fp.div~DOUBLE(unknown-currentRoundingMode-unknown, ULTIMATE.start_main_~main__x~0, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 10.0)) == main__y && ~fp.leq~DOUBLE(ULTIMATE.start_main_~main__x~0, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 10.0))) && ~fp.leq~DOUBLE(main__y, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 105.0))) && (((~fp.geq~DOUBLE(main__y, ~Pluszero~LONGDOUBLE()) && (\exists ULTIMATE.start_main_~main__x~0 : C_DOUBLE :: main__y == ~fp.add~DOUBLE(~roundNearestTiesToEven, ~fp.mul~DOUBLE(~roundNearestTiesToEven, ULTIMATE.start_main_~main__x~0, ULTIMATE.start_main_~main__x~0), ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 2.0)) && ~fp.geq~DOUBLE(ULTIMATE.start_main_~main__x~0, ~Pluszero~LONGDOUBLE()))) && ~fp.geq~DOUBLE(main__x, ~Pluszero~LONGDOUBLE())) || ((~fp.geq~DOUBLE(main__y, ~Pluszero~LONGDOUBLE()) && ~fp.geq~DOUBLE(main__x, ~Pluszero~LONGDOUBLE())) && (\exists ULTIMATE.start_main_~main__x~0 : C_DOUBLE, currentRoundingMode : FloatRoundingMode :: ~fp.div~DOUBLE(currentRoundingMode, ULTIMATE.start_main_~main__x~0, ~to_fp~LONGDOUBLE(currentRoundingMode, 10.0)) == main__y && ~fp.geq~DOUBLE(ULTIMATE.start_main_~main__x~0, ~Pluszero~LONGDOUBLE()))))) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven) || (((~fp.leq~DOUBLE(main__y, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 105.0)) && (\exists ULTIMATE.start_main_~main__x~0 : C_DOUBLE :: ((~fp.geq~DOUBLE(ULTIMATE.start_main_~main__x~0, ~Pluszero~LONGDOUBLE()) && ~fp.leq~DOUBLE(ULTIMATE.start_main_~main__x~0, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 10.0))) && !~fp.geq~DOUBLE(~fp.sub~DOUBLE(unknown-currentRoundingMode-unknown, ~fp.mul~DOUBLE(unknown-currentRoundingMode-unknown, ULTIMATE.start_main_~main__x~0, ULTIMATE.start_main_~main__x~0), ULTIMATE.start_main_~main__x~0), ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 0bv32))) && main__y == ~fp.add~DOUBLE(unknown-currentRoundingMode-unknown, ~fp.mul~DOUBLE(unknown-currentRoundingMode-unknown, ULTIMATE.start_main_~main__x~0, ULTIMATE.start_main_~main__x~0), ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 2.0)))) && (((~fp.geq~DOUBLE(main__y, ~Pluszero~LONGDOUBLE()) && (\exists ULTIMATE.start_main_~main__x~0 : C_DOUBLE :: main__y == ~fp.add~DOUBLE(~roundNearestTiesToEven, ~fp.mul~DOUBLE(~roundNearestTiesToEven, ULTIMATE.start_main_~main__x~0, ULTIMATE.start_main_~main__x~0), ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 2.0)) && ~fp.geq~DOUBLE(ULTIMATE.start_main_~main__x~0, ~Pluszero~LONGDOUBLE()))) && ~fp.geq~DOUBLE(main__x, ~Pluszero~LONGDOUBLE())) || ((~fp.geq~DOUBLE(main__y, ~Pluszero~LONGDOUBLE()) && ~fp.geq~DOUBLE(main__x, ~Pluszero~LONGDOUBLE())) && (\exists ULTIMATE.start_main_~main__x~0 : C_DOUBLE, currentRoundingMode : FloatRoundingMode :: ~fp.div~DOUBLE(currentRoundingMode, ULTIMATE.start_main_~main__x~0, ~to_fp~LONGDOUBLE(currentRoundingMode, 10.0)) == main__y && ~fp.geq~DOUBLE(ULTIMATE.start_main_~main__x~0, ~Pluszero~LONGDOUBLE()))))) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven) RESULT: Ultimate proved your program to be correct! [2021-10-29 05:02:29,788 WARN L435 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3e83e20-df52-4023-bcd3-1a56b0072de6/bin/utaipan-SDwSMHVbGG/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2021-10-29 05:02:29,928 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3e83e20-df52-4023-bcd3-1a56b0072de6/bin/utaipan-SDwSMHVbGG/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 137 Received shutdown request...