./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/loop-floats-scientific-comp/loop2-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 839c364b Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_560291ce-a43e-4e7f-94cd-00ac058d4485/bin/uautomizer-DrprNOufMa/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_560291ce-a43e-4e7f-94cd-00ac058d4485/bin/uautomizer-DrprNOufMa/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_560291ce-a43e-4e7f-94cd-00ac058d4485/bin/uautomizer-DrprNOufMa/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_560291ce-a43e-4e7f-94cd-00ac058d4485/bin/uautomizer-DrprNOufMa/config/AutomizerReach.xml -i ../../sv-benchmarks/c/loop-floats-scientific-comp/loop2-2.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_560291ce-a43e-4e7f-94cd-00ac058d4485/bin/uautomizer-DrprNOufMa/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_560291ce-a43e-4e7f-94cd-00ac058d4485/bin/uautomizer-DrprNOufMa --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2214d54defcd10650ad85b05551b84060b114c89dc0a9f14233f38f030bbd558 --- Real Ultimate output --- This is Ultimate 0.2.2-hotfix-svcomp22-839c364 [2021-12-07 01:22:44,421 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-07 01:22:44,423 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-07 01:22:44,445 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-07 01:22:44,445 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-07 01:22:44,446 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-07 01:22:44,447 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-07 01:22:44,449 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-07 01:22:44,450 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-07 01:22:44,451 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-07 01:22:44,452 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-07 01:22:44,453 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-07 01:22:44,453 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-07 01:22:44,454 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-07 01:22:44,456 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-07 01:22:44,457 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-07 01:22:44,457 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-07 01:22:44,458 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-07 01:22:44,460 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-07 01:22:44,462 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-07 01:22:44,463 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-07 01:22:44,465 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-07 01:22:44,467 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-07 01:22:44,468 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-07 01:22:44,472 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-07 01:22:44,472 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-07 01:22:44,473 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-07 01:22:44,474 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-07 01:22:44,475 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-07 01:22:44,476 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-07 01:22:44,476 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-07 01:22:44,477 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-07 01:22:44,478 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-07 01:22:44,479 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-07 01:22:44,480 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-07 01:22:44,480 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-07 01:22:44,481 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-07 01:22:44,481 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-07 01:22:44,481 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-07 01:22:44,482 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-07 01:22:44,483 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-07 01:22:44,484 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_560291ce-a43e-4e7f-94cd-00ac058d4485/bin/uautomizer-DrprNOufMa/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-07 01:22:44,507 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-07 01:22:44,507 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-07 01:22:44,508 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-07 01:22:44,508 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-07 01:22:44,509 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-07 01:22:44,509 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-07 01:22:44,509 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-07 01:22:44,510 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-07 01:22:44,510 INFO L138 SettingsManager]: * Use SBE=true [2021-12-07 01:22:44,510 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-07 01:22:44,510 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-07 01:22:44,510 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-07 01:22:44,511 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-07 01:22:44,511 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-07 01:22:44,511 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-07 01:22:44,511 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-07 01:22:44,511 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-07 01:22:44,511 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-07 01:22:44,512 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-07 01:22:44,512 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-07 01:22:44,512 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-07 01:22:44,512 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-07 01:22:44,512 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-07 01:22:44,512 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-07 01:22:44,513 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-07 01:22:44,513 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-07 01:22:44,513 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-07 01:22:44,513 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-07 01:22:44,513 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-07 01:22:44,513 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-07 01:22:44,514 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-07 01:22:44,514 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-07 01:22:44,514 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-07 01:22:44,514 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-07 01:22:44,514 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_560291ce-a43e-4e7f-94cd-00ac058d4485/bin/uautomizer-DrprNOufMa/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_560291ce-a43e-4e7f-94cd-00ac058d4485/bin/uautomizer-DrprNOufMa Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2214d54defcd10650ad85b05551b84060b114c89dc0a9f14233f38f030bbd558 [2021-12-07 01:22:44,694 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-07 01:22:44,712 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-07 01:22:44,715 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-07 01:22:44,716 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-07 01:22:44,717 INFO L275 PluginConnector]: CDTParser initialized [2021-12-07 01:22:44,718 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_560291ce-a43e-4e7f-94cd-00ac058d4485/bin/uautomizer-DrprNOufMa/../../sv-benchmarks/c/loop-floats-scientific-comp/loop2-2.c [2021-12-07 01:22:44,762 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_560291ce-a43e-4e7f-94cd-00ac058d4485/bin/uautomizer-DrprNOufMa/data/b6cb4dbdc/bbce46b41639437f9b79213d0425c16e/FLAG52df93b03 [2021-12-07 01:22:45,152 INFO L306 CDTParser]: Found 1 translation units. [2021-12-07 01:22:45,153 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_560291ce-a43e-4e7f-94cd-00ac058d4485/sv-benchmarks/c/loop-floats-scientific-comp/loop2-2.c [2021-12-07 01:22:45,157 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_560291ce-a43e-4e7f-94cd-00ac058d4485/bin/uautomizer-DrprNOufMa/data/b6cb4dbdc/bbce46b41639437f9b79213d0425c16e/FLAG52df93b03 [2021-12-07 01:22:45,167 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_560291ce-a43e-4e7f-94cd-00ac058d4485/bin/uautomizer-DrprNOufMa/data/b6cb4dbdc/bbce46b41639437f9b79213d0425c16e [2021-12-07 01:22:45,169 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-07 01:22:45,170 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-07 01:22:45,171 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-07 01:22:45,171 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-07 01:22:45,174 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-07 01:22:45,174 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 01:22:45" (1/1) ... [2021-12-07 01:22:45,176 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e686b68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:22:45, skipping insertion in model container [2021-12-07 01:22:45,176 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 01:22:45" (1/1) ... [2021-12-07 01:22:45,182 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-07 01:22:45,195 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-07 01:22:45,327 WARN L230 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_560291ce-a43e-4e7f-94cd-00ac058d4485/sv-benchmarks/c/loop-floats-scientific-comp/loop2-2.c[474,487] [2021-12-07 01:22:45,341 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-07 01:22:45,348 INFO L203 MainTranslator]: Completed pre-run [2021-12-07 01:22:45,358 WARN L230 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_560291ce-a43e-4e7f-94cd-00ac058d4485/sv-benchmarks/c/loop-floats-scientific-comp/loop2-2.c[474,487] [2021-12-07 01:22:45,363 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-07 01:22:45,372 INFO L208 MainTranslator]: Completed translation [2021-12-07 01:22:45,372 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:22:45 WrapperNode [2021-12-07 01:22:45,372 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-07 01:22:45,373 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-07 01:22:45,373 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-07 01:22:45,373 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-07 01:22:45,379 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:22:45" (1/1) ... [2021-12-07 01:22:45,386 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:22:45" (1/1) ... [2021-12-07 01:22:45,404 INFO L137 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 56 [2021-12-07 01:22:45,405 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-07 01:22:45,405 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-07 01:22:45,406 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-07 01:22:45,406 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-07 01:22:45,414 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:22:45" (1/1) ... [2021-12-07 01:22:45,414 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:22:45" (1/1) ... [2021-12-07 01:22:45,415 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:22:45" (1/1) ... [2021-12-07 01:22:45,416 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:22:45" (1/1) ... [2021-12-07 01:22:45,419 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:22:45" (1/1) ... [2021-12-07 01:22:45,422 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:22:45" (1/1) ... [2021-12-07 01:22:45,423 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:22:45" (1/1) ... [2021-12-07 01:22:45,424 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-07 01:22:45,425 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-07 01:22:45,425 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-07 01:22:45,425 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-07 01:22:45,426 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:22:45" (1/1) ... [2021-12-07 01:22:45,433 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-07 01:22:45,441 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_560291ce-a43e-4e7f-94cd-00ac058d4485/bin/uautomizer-DrprNOufMa/z3 [2021-12-07 01:22:45,451 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_560291ce-a43e-4e7f-94cd-00ac058d4485/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-07 01:22:45,454 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_560291ce-a43e-4e7f-94cd-00ac058d4485/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-07 01:22:45,488 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-07 01:22:45,488 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-07 01:22:45,488 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-07 01:22:45,488 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-07 01:22:45,545 INFO L236 CfgBuilder]: Building ICFG [2021-12-07 01:22:45,547 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-07 01:22:45,616 INFO L277 CfgBuilder]: Performing block encoding [2021-12-07 01:22:45,621 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-07 01:22:45,621 INFO L301 CfgBuilder]: Removed 1 assume(true) statements. [2021-12-07 01:22:45,622 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 01:22:45 BoogieIcfgContainer [2021-12-07 01:22:45,622 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-07 01:22:45,623 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-07 01:22:45,623 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-07 01:22:45,626 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-07 01:22:45,626 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 01:22:45" (1/3) ... [2021-12-07 01:22:45,627 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3968ef45 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 01:22:45, skipping insertion in model container [2021-12-07 01:22:45,627 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:22:45" (2/3) ... [2021-12-07 01:22:45,627 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3968ef45 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 01:22:45, skipping insertion in model container [2021-12-07 01:22:45,628 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 01:22:45" (3/3) ... [2021-12-07 01:22:45,629 INFO L111 eAbstractionObserver]: Analyzing ICFG loop2-2.c [2021-12-07 01:22:45,633 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-07 01:22:45,634 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-07 01:22:45,667 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-07 01:22:45,673 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-12-07 01:22:45,673 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-07 01:22:45,683 INFO L276 IsEmpty]: Start isEmpty. Operand has 16 states, 14 states have (on average 1.5) internal successors, (21), 15 states have internal predecessors, (21), 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-12-07 01:22:45,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-12-07 01:22:45,687 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:22:45,687 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 01:22:45,688 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 01:22:45,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:22:45,692 INFO L85 PathProgramCache]: Analyzing trace with hash 119997515, now seen corresponding path program 1 times [2021-12-07 01:22:45,698 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:22:45,698 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140379597] [2021-12-07 01:22:45,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:22:45,699 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:22:45,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:22:45,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-07 01:22:45,802 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:22:45,803 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140379597] [2021-12-07 01:22:45,803 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2140379597] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 01:22:45,803 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 01:22:45,803 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-07 01:22:45,805 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534875632] [2021-12-07 01:22:45,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 01:22:45,808 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-12-07 01:22:45,808 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:22:45,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-12-07 01:22:45,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-07 01:22:45,830 INFO L87 Difference]: Start difference. First operand has 16 states, 14 states have (on average 1.5) internal successors, (21), 15 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 01:22:45,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:22:45,840 INFO L93 Difference]: Finished difference Result 29 states and 38 transitions. [2021-12-07 01:22:45,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-07 01:22:45,842 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2021-12-07 01:22:45,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:22:45,850 INFO L225 Difference]: With dead ends: 29 [2021-12-07 01:22:45,850 INFO L226 Difference]: Without dead ends: 12 [2021-12-07 01:22:45,853 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-07 01:22:45,857 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-07 01:22:45,858 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-07 01:22:45,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2021-12-07 01:22:45,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2021-12-07 01:22:45,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 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-12-07 01:22:45,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 13 transitions. [2021-12-07 01:22:45,887 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 13 transitions. Word has length 8 [2021-12-07 01:22:45,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:22:45,888 INFO L470 AbstractCegarLoop]: Abstraction has 12 states and 13 transitions. [2021-12-07 01:22:45,888 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 01:22:45,888 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 13 transitions. [2021-12-07 01:22:45,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-12-07 01:22:45,889 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:22:45,889 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 01:22:45,889 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-07 01:22:45,889 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 01:22:45,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:22:45,890 INFO L85 PathProgramCache]: Analyzing trace with hash -2105434535, now seen corresponding path program 1 times [2021-12-07 01:22:45,890 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:22:45,891 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195246611] [2021-12-07 01:22:45,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:22:45,891 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:22:45,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:22:45,989 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-07 01:22:45,989 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 01:22:45,989 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195246611] [2021-12-07 01:22:45,989 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [195246611] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 01:22:45,990 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 01:22:45,990 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-07 01:22:45,990 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261889354] [2021-12-07 01:22:45,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 01:22:45,995 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-07 01:22:45,996 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 01:22:45,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-07 01:22:45,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-07 01:22:45,996 INFO L87 Difference]: Start difference. First operand 12 states and 13 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 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-12-07 01:22:46,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:22:46,008 INFO L93 Difference]: Finished difference Result 23 states and 26 transitions. [2021-12-07 01:22:46,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-07 01:22:46,009 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 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) Word has length 11 [2021-12-07 01:22:46,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:22:46,009 INFO L225 Difference]: With dead ends: 23 [2021-12-07 01:22:46,009 INFO L226 Difference]: Without dead ends: 15 [2021-12-07 01:22:46,010 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-07 01:22:46,011 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 1 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-07 01:22:46,011 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 19 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-07 01:22:46,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2021-12-07 01:22:46,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2021-12-07 01:22:46,014 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-12-07 01:22:46,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2021-12-07 01:22:46,014 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 11 [2021-12-07 01:22:46,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:22:46,015 INFO L470 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2021-12-07 01:22:46,015 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 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-12-07 01:22:46,015 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2021-12-07 01:22:46,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-12-07 01:22:46,015 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:22:46,016 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 01:22:46,016 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-07 01:22:46,016 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 01:22:46,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:22:46,016 INFO L85 PathProgramCache]: Analyzing trace with hash -2048176233, now seen corresponding path program 1 times [2021-12-07 01:22:46,017 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 01:22:46,017 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444482741] [2021-12-07 01:22:46,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:22:46,017 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 01:22:46,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-07 01:22:46,034 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-07 01:22:46,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-07 01:22:46,060 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-07 01:22:46,060 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-12-07 01:22:46,061 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-12-07 01:22:46,062 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-07 01:22:46,065 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2021-12-07 01:22:46,067 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-07 01:22:46,086 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 01:22:46 BoogieIcfgContainer [2021-12-07 01:22:46,086 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-07 01:22:46,086 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-07 01:22:46,086 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-07 01:22:46,087 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-07 01:22:46,087 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 01:22:45" (3/4) ... [2021-12-07 01:22:46,089 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-12-07 01:22:46,089 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-07 01:22:46,090 INFO L158 Benchmark]: Toolchain (without parser) took 919.54ms. Allocated memory is still 94.4MB. Free memory was 64.0MB in the beginning and 65.2MB in the end (delta: -1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-07 01:22:46,090 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 77.6MB. Free memory is still 34.0MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-07 01:22:46,090 INFO L158 Benchmark]: CACSL2BoogieTranslator took 201.39ms. Allocated memory is still 94.4MB. Free memory was 63.7MB in the beginning and 70.0MB in the end (delta: -6.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-12-07 01:22:46,091 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.71ms. Allocated memory is still 94.4MB. Free memory was 70.0MB in the beginning and 68.6MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-07 01:22:46,091 INFO L158 Benchmark]: Boogie Preprocessor took 18.64ms. Allocated memory is still 94.4MB. Free memory was 68.6MB in the beginning and 67.5MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-07 01:22:46,092 INFO L158 Benchmark]: RCFGBuilder took 197.70ms. Allocated memory is still 94.4MB. Free memory was 67.1MB in the beginning and 58.0MB in the end (delta: 9.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-12-07 01:22:46,092 INFO L158 Benchmark]: TraceAbstraction took 462.55ms. Allocated memory is still 94.4MB. Free memory was 57.5MB in the beginning and 65.2MB in the end (delta: -7.7MB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-07 01:22:46,093 INFO L158 Benchmark]: Witness Printer took 2.84ms. Allocated memory is still 94.4MB. Free memory is still 65.2MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-07 01:22:46,095 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.21ms. Allocated memory is still 77.6MB. Free memory is still 34.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 201.39ms. Allocated memory is still 94.4MB. Free memory was 63.7MB in the beginning and 70.0MB in the end (delta: -6.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 31.71ms. Allocated memory is still 94.4MB. Free memory was 70.0MB in the beginning and 68.6MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 18.64ms. Allocated memory is still 94.4MB. Free memory was 68.6MB in the beginning and 67.5MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 197.70ms. Allocated memory is still 94.4MB. Free memory was 67.1MB in the beginning and 58.0MB in the end (delta: 9.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 462.55ms. Allocated memory is still 94.4MB. Free memory was 57.5MB in the beginning and 65.2MB in the end (delta: -7.7MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 2.84ms. Allocated memory is still 94.4MB. Free memory is still 65.2MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 12]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 49, overapproximation of someBinaryArithmeticFLOAToperation at line 35. Possible FailurePath: [L14] float pi = 3.14159 ; VAL [pi=314159/100000] [L20] float x = __VERIFIER_nondet_float() ; [L21] float octant = pi/3 ; [L22] CALL assume_abort_if_not(x > octant && x < pi) [L10] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, pi=314159/100000] [L22] RET assume_abort_if_not(x > octant && x < pi) [L23] float oddExp = x ; [L24] float evenExp = 1.0 ; [L25] float term = x ; [L26] unsigned int count = 2 ; [L27] int multFactor = 0 ; [L28] int temp ; VAL [count=2, evenExp=1, multFactor=0, oddExp=49, pi=314159/100000, term=49, x=49] [L30] COND TRUE 1 [L32] term = term * (x/count) VAL [count=2, evenExp=1, multFactor=0, oddExp=49, pi=314159/100000, x=49] [L33] EXPR (count>>1 % 2 == 0) ? 1 : -1 VAL [(count>>1 % 2 == 0) ? 1 : -1=-1, count=2, evenExp=1, multFactor=0, oddExp=49, pi=314159/100000, x=49] [L33] multFactor = (count>>1 % 2 == 0) ? 1 : -1 [L35] evenExp = evenExp + multFactor*term [L37] count++ [L39] term = term * (x/count) [L41] oddExp = oddExp + multFactor*term [L43] count++ [L45] temp = __VERIFIER_nondet_int() [L46] COND TRUE temp == 0 VAL [count=4, multFactor=-1, pi=314159/100000, temp=0, x=49] [L49] CALL __VERIFIER_assert( oddExp >= evenExp ) [L12] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, pi=314159/100000] [L12] reach_error() VAL [\old(cond)=0, cond=0, pi=314159/100000] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 16 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.4s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1 mSDsluCounter, 36 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 8 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6 IncrementalHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 28 mSDtfsCounter, 6 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=16occurred in iteration=0, InterpolantAutomatonStates: 5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 30 NumberOfCodeBlocks, 30 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 17 ConstructedInterpolants, 0 QuantifiedInterpolants, 21 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2021-12-07 01:22:46,140 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_560291ce-a43e-4e7f-94cd-00ac058d4485/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_560291ce-a43e-4e7f-94cd-00ac058d4485/bin/uautomizer-DrprNOufMa/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_560291ce-a43e-4e7f-94cd-00ac058d4485/bin/uautomizer-DrprNOufMa/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_560291ce-a43e-4e7f-94cd-00ac058d4485/bin/uautomizer-DrprNOufMa/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_560291ce-a43e-4e7f-94cd-00ac058d4485/bin/uautomizer-DrprNOufMa/config/AutomizerReach.xml -i ../../sv-benchmarks/c/loop-floats-scientific-comp/loop2-2.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_560291ce-a43e-4e7f-94cd-00ac058d4485/bin/uautomizer-DrprNOufMa/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_560291ce-a43e-4e7f-94cd-00ac058d4485/bin/uautomizer-DrprNOufMa --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2214d54defcd10650ad85b05551b84060b114c89dc0a9f14233f38f030bbd558 --- Real Ultimate output --- This is Ultimate 0.2.2-hotfix-svcomp22-839c364 [2021-12-07 01:22:47,789 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-07 01:22:47,791 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-07 01:22:47,821 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-07 01:22:47,822 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-07 01:22:47,823 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-07 01:22:47,825 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-07 01:22:47,827 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-07 01:22:47,829 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-07 01:22:47,830 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-07 01:22:47,831 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-07 01:22:47,833 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-07 01:22:47,833 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-07 01:22:47,834 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-07 01:22:47,836 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-07 01:22:47,837 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-07 01:22:47,838 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-07 01:22:47,839 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-07 01:22:47,852 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-07 01:22:47,854 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-07 01:22:47,856 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-07 01:22:47,858 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-07 01:22:47,859 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-07 01:22:47,860 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-07 01:22:47,864 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-07 01:22:47,864 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-07 01:22:47,864 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-07 01:22:47,865 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-07 01:22:47,866 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-07 01:22:47,867 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-07 01:22:47,868 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-07 01:22:47,868 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-07 01:22:47,869 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-07 01:22:47,870 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-07 01:22:47,871 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-07 01:22:47,871 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-07 01:22:47,872 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-07 01:22:47,872 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-07 01:22:47,872 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-07 01:22:47,873 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-07 01:22:47,874 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-07 01:22:47,874 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_560291ce-a43e-4e7f-94cd-00ac058d4485/bin/uautomizer-DrprNOufMa/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2021-12-07 01:22:47,898 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-07 01:22:47,898 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-07 01:22:47,898 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-07 01:22:47,899 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-07 01:22:47,899 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-07 01:22:47,899 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-07 01:22:47,900 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-07 01:22:47,900 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-07 01:22:47,900 INFO L138 SettingsManager]: * Use SBE=true [2021-12-07 01:22:47,900 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-07 01:22:47,901 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-07 01:22:47,901 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-07 01:22:47,901 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-07 01:22:47,901 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-07 01:22:47,901 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-07 01:22:47,902 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-07 01:22:47,902 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-07 01:22:47,902 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-12-07 01:22:47,902 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-12-07 01:22:47,902 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-07 01:22:47,902 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-07 01:22:47,902 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-07 01:22:47,902 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-07 01:22:47,903 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-07 01:22:47,903 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-07 01:22:47,903 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-07 01:22:47,903 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-07 01:22:47,903 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-07 01:22:47,903 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-07 01:22:47,903 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-07 01:22:47,904 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-12-07 01:22:47,904 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-12-07 01:22:47,904 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-07 01:22:47,904 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-07 01:22:47,904 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-07 01:22:47,904 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-07 01:22:47,904 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-12-07 01:22:47,904 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_560291ce-a43e-4e7f-94cd-00ac058d4485/bin/uautomizer-DrprNOufMa/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_560291ce-a43e-4e7f-94cd-00ac058d4485/bin/uautomizer-DrprNOufMa Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2214d54defcd10650ad85b05551b84060b114c89dc0a9f14233f38f030bbd558 [2021-12-07 01:22:48,158 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-07 01:22:48,172 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-07 01:22:48,174 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-07 01:22:48,175 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-07 01:22:48,175 INFO L275 PluginConnector]: CDTParser initialized [2021-12-07 01:22:48,176 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_560291ce-a43e-4e7f-94cd-00ac058d4485/bin/uautomizer-DrprNOufMa/../../sv-benchmarks/c/loop-floats-scientific-comp/loop2-2.c [2021-12-07 01:22:48,219 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_560291ce-a43e-4e7f-94cd-00ac058d4485/bin/uautomizer-DrprNOufMa/data/5210073f8/1939a0130d15408796b7cf31cf69c340/FLAG4c1f64bea [2021-12-07 01:22:48,602 INFO L306 CDTParser]: Found 1 translation units. [2021-12-07 01:22:48,602 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_560291ce-a43e-4e7f-94cd-00ac058d4485/sv-benchmarks/c/loop-floats-scientific-comp/loop2-2.c [2021-12-07 01:22:48,607 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_560291ce-a43e-4e7f-94cd-00ac058d4485/bin/uautomizer-DrprNOufMa/data/5210073f8/1939a0130d15408796b7cf31cf69c340/FLAG4c1f64bea [2021-12-07 01:22:48,617 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_560291ce-a43e-4e7f-94cd-00ac058d4485/bin/uautomizer-DrprNOufMa/data/5210073f8/1939a0130d15408796b7cf31cf69c340 [2021-12-07 01:22:48,619 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-07 01:22:48,620 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-07 01:22:48,621 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-07 01:22:48,621 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-07 01:22:48,624 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-07 01:22:48,624 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 01:22:48" (1/1) ... [2021-12-07 01:22:48,625 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@15a94c54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:22:48, skipping insertion in model container [2021-12-07 01:22:48,625 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 01:22:48" (1/1) ... [2021-12-07 01:22:48,630 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-07 01:22:48,647 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-07 01:22:48,742 WARN L230 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_560291ce-a43e-4e7f-94cd-00ac058d4485/sv-benchmarks/c/loop-floats-scientific-comp/loop2-2.c[474,487] [2021-12-07 01:22:48,756 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-07 01:22:48,764 INFO L203 MainTranslator]: Completed pre-run [2021-12-07 01:22:48,778 WARN L230 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_560291ce-a43e-4e7f-94cd-00ac058d4485/sv-benchmarks/c/loop-floats-scientific-comp/loop2-2.c[474,487] [2021-12-07 01:22:48,790 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-07 01:22:48,801 INFO L208 MainTranslator]: Completed translation [2021-12-07 01:22:48,802 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:22:48 WrapperNode [2021-12-07 01:22:48,802 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-07 01:22:48,803 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-07 01:22:48,803 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-07 01:22:48,803 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-07 01:22:48,808 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:22:48" (1/1) ... [2021-12-07 01:22:48,815 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:22:48" (1/1) ... [2021-12-07 01:22:48,829 INFO L137 Inliner]: procedures = 16, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 56 [2021-12-07 01:22:48,829 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-07 01:22:48,829 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-07 01:22:48,830 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-07 01:22:48,830 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-07 01:22:48,835 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:22:48" (1/1) ... [2021-12-07 01:22:48,836 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:22:48" (1/1) ... [2021-12-07 01:22:48,838 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:22:48" (1/1) ... [2021-12-07 01:22:48,838 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:22:48" (1/1) ... [2021-12-07 01:22:48,843 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:22:48" (1/1) ... [2021-12-07 01:22:48,846 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:22:48" (1/1) ... [2021-12-07 01:22:48,847 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:22:48" (1/1) ... [2021-12-07 01:22:48,849 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-07 01:22:48,850 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-07 01:22:48,850 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-07 01:22:48,850 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-07 01:22:48,851 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:22:48" (1/1) ... [2021-12-07 01:22:48,856 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-07 01:22:48,864 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_560291ce-a43e-4e7f-94cd-00ac058d4485/bin/uautomizer-DrprNOufMa/z3 [2021-12-07 01:22:48,874 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_560291ce-a43e-4e7f-94cd-00ac058d4485/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-07 01:22:48,876 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_560291ce-a43e-4e7f-94cd-00ac058d4485/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-07 01:22:48,903 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-07 01:22:48,903 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-12-07 01:22:48,903 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-07 01:22:48,903 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-07 01:22:48,956 INFO L236 CfgBuilder]: Building ICFG [2021-12-07 01:22:48,957 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-07 01:22:53,982 INFO L277 CfgBuilder]: Performing block encoding [2021-12-07 01:22:53,987 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-07 01:22:53,987 INFO L301 CfgBuilder]: Removed 1 assume(true) statements. [2021-12-07 01:22:53,989 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 01:22:53 BoogieIcfgContainer [2021-12-07 01:22:53,989 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-07 01:22:53,991 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-07 01:22:53,992 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-07 01:22:53,995 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-07 01:22:53,995 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 01:22:48" (1/3) ... [2021-12-07 01:22:53,996 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4449bd25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 01:22:53, skipping insertion in model container [2021-12-07 01:22:53,996 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:22:48" (2/3) ... [2021-12-07 01:22:53,997 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4449bd25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 01:22:53, skipping insertion in model container [2021-12-07 01:22:53,997 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 01:22:53" (3/3) ... [2021-12-07 01:22:53,998 INFO L111 eAbstractionObserver]: Analyzing ICFG loop2-2.c [2021-12-07 01:22:54,004 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-07 01:22:54,004 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-07 01:22:54,044 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-07 01:22:54,051 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-12-07 01:22:54,051 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-07 01:22:54,064 INFO L276 IsEmpty]: Start isEmpty. Operand has 16 states, 14 states have (on average 1.5) internal successors, (21), 15 states have internal predecessors, (21), 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-12-07 01:22:54,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-12-07 01:22:54,069 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:22:54,070 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 01:22:54,070 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 01:22:54,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:22:54,075 INFO L85 PathProgramCache]: Analyzing trace with hash 119997515, now seen corresponding path program 1 times [2021-12-07 01:22:54,083 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-07 01:22:54,083 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [800795779] [2021-12-07 01:22:54,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:22:54,084 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-07 01:22:54,084 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_560291ce-a43e-4e7f-94cd-00ac058d4485/bin/uautomizer-DrprNOufMa/mathsat [2021-12-07 01:22:54,085 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_560291ce-a43e-4e7f-94cd-00ac058d4485/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-07 01:22:54,086 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_560291ce-a43e-4e7f-94cd-00ac058d4485/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-12-07 01:22:54,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:22:54,202 INFO L263 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 1 conjunts are in the unsatisfiable core [2021-12-07 01:22:54,206 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-07 01:22:54,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-07 01:22:54,251 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-07 01:22:54,252 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-07 01:22:54,252 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [800795779] [2021-12-07 01:22:54,253 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [800795779] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 01:22:54,253 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 01:22:54,253 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-07 01:22:54,254 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597915672] [2021-12-07 01:22:54,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 01:22:54,257 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-12-07 01:22:54,258 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-07 01:22:54,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-12-07 01:22:54,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-07 01:22:54,280 INFO L87 Difference]: Start difference. First operand has 16 states, 14 states have (on average 1.5) internal successors, (21), 15 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 01:22:54,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:22:54,289 INFO L93 Difference]: Finished difference Result 29 states and 38 transitions. [2021-12-07 01:22:54,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-07 01:22:54,291 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2021-12-07 01:22:54,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:22:54,303 INFO L225 Difference]: With dead ends: 29 [2021-12-07 01:22:54,303 INFO L226 Difference]: Without dead ends: 12 [2021-12-07 01:22:54,305 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-07 01:22:54,308 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-07 01:22:54,308 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-07 01:22:54,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2021-12-07 01:22:54,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2021-12-07 01:22:54,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 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-12-07 01:22:54,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 13 transitions. [2021-12-07 01:22:54,331 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 13 transitions. Word has length 8 [2021-12-07 01:22:54,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:22:54,331 INFO L470 AbstractCegarLoop]: Abstraction has 12 states and 13 transitions. [2021-12-07 01:22:54,331 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-07 01:22:54,332 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 13 transitions. [2021-12-07 01:22:54,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-12-07 01:22:54,332 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:22:54,332 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 01:22:54,342 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_560291ce-a43e-4e7f-94cd-00ac058d4485/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2021-12-07 01:22:54,533 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_560291ce-a43e-4e7f-94cd-00ac058d4485/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-07 01:22:54,533 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 01:22:54,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:22:54,534 INFO L85 PathProgramCache]: Analyzing trace with hash -2105434535, now seen corresponding path program 1 times [2021-12-07 01:22:54,534 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-07 01:22:54,535 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1784054359] [2021-12-07 01:22:54,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:22:54,535 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-07 01:22:54,535 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_560291ce-a43e-4e7f-94cd-00ac058d4485/bin/uautomizer-DrprNOufMa/mathsat [2021-12-07 01:22:54,536 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_560291ce-a43e-4e7f-94cd-00ac058d4485/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-07 01:22:54,537 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_560291ce-a43e-4e7f-94cd-00ac058d4485/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-12-07 01:22:55,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:22:55,169 INFO L263 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-07 01:22:55,170 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-07 01:22:55,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-07 01:22:55,230 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-07 01:22:55,230 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-07 01:22:55,230 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1784054359] [2021-12-07 01:22:55,231 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1784054359] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 01:22:55,231 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 01:22:55,231 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-07 01:22:55,231 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865984040] [2021-12-07 01:22:55,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 01:22:55,232 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-07 01:22:55,232 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-07 01:22:55,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-07 01:22:55,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-07 01:22:55,233 INFO L87 Difference]: Start difference. First operand 12 states and 13 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 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-12-07 01:22:57,955 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.73s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-07 01:23:00,180 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.17s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-07 01:23:02,365 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.18s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-07 01:23:02,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:23:02,420 INFO L93 Difference]: Finished difference Result 23 states and 26 transitions. [2021-12-07 01:23:02,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-07 01:23:02,421 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 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) Word has length 11 [2021-12-07 01:23:02,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:23:02,422 INFO L225 Difference]: With dead ends: 23 [2021-12-07 01:23:02,422 INFO L226 Difference]: Without dead ends: 15 [2021-12-07 01:23:02,422 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-07 01:23:02,424 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 1 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.2s IncrementalHoareTripleChecker+Time [2021-12-07 01:23:02,424 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 17 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 2 Unknown, 0 Unchecked, 7.2s Time] [2021-12-07 01:23:02,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2021-12-07 01:23:02,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2021-12-07 01:23:02,428 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-12-07 01:23:02,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2021-12-07 01:23:02,428 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 11 [2021-12-07 01:23:02,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:23:02,429 INFO L470 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2021-12-07 01:23:02,429 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 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-12-07 01:23:02,429 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2021-12-07 01:23:02,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-12-07 01:23:02,430 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:23:02,430 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 01:23:02,449 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_560291ce-a43e-4e7f-94cd-00ac058d4485/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2021-12-07 01:23:02,631 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_560291ce-a43e-4e7f-94cd-00ac058d4485/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-07 01:23:02,632 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 01:23:02,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:23:02,635 INFO L85 PathProgramCache]: Analyzing trace with hash -2048176233, now seen corresponding path program 1 times [2021-12-07 01:23:02,636 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-07 01:23:02,637 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [833192345] [2021-12-07 01:23:02,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:23:02,638 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-07 01:23:02,638 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_560291ce-a43e-4e7f-94cd-00ac058d4485/bin/uautomizer-DrprNOufMa/mathsat [2021-12-07 01:23:02,641 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_560291ce-a43e-4e7f-94cd-00ac058d4485/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-07 01:23:02,644 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_560291ce-a43e-4e7f-94cd-00ac058d4485/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-12-07 01:23:04,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:23:04,879 WARN L261 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 20 conjunts are in the unsatisfiable core [2021-12-07 01:23:04,880 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-07 01:23:58,426 WARN L227 SmtUtils]: Spent 14.14s on a formula simplification that was a NOOP. DAG size: 28 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-07 01:24:37,231 WARN L227 SmtUtils]: Spent 14.43s on a formula simplification that was a NOOP. DAG size: 33 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-07 01:24:56,899 WARN L838 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~x~0#1| (_ FloatingPoint 8 24))) (let ((.cse2 ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0)))) (.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse1 (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (and (= |c_ULTIMATE.start_main_~oddExp~0#1| (fp.add roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32))))))) (fp.gt |ULTIMATE.start_main_~x~0#1| (fp.div roundNearestTiesToEven .cse2 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv3 32)))) (fp.lt |ULTIMATE.start_main_~x~0#1| .cse2) (= |c_ULTIMATE.start_main_~evenExp~0#1| (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse0 .cse1)))))) is different from false [2021-12-07 01:24:58,965 WARN L860 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~x~0#1| (_ FloatingPoint 8 24))) (let ((.cse2 ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0)))) (.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse1 (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (and (= |c_ULTIMATE.start_main_~oddExp~0#1| (fp.add roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32))))))) (fp.gt |ULTIMATE.start_main_~x~0#1| (fp.div roundNearestTiesToEven .cse2 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv3 32)))) (fp.lt |ULTIMATE.start_main_~x~0#1| .cse2) (= |c_ULTIMATE.start_main_~evenExp~0#1| (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse0 .cse1)))))) is different from true [2021-12-07 01:26:15,027 WARN L838 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~x~0#1| (_ FloatingPoint 8 24))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))))) (and (fp.gt |ULTIMATE.start_main_~x~0#1| (fp.div roundNearestTiesToEven .cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv3 32)))) (let ((.cse1 (let ((.cse2 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse3 (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (fp.geq (fp.add roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| (fp.mul roundNearestTiesToEven .cse2 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse2 .cse3)))))) (or (and .cse1 (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv1 32))) (and (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv0 32)) (not .cse1)))) (fp.lt |ULTIMATE.start_main_~x~0#1| .cse0)))) is different from false [2021-12-07 01:26:17,094 WARN L860 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~x~0#1| (_ FloatingPoint 8 24))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))))) (and (fp.gt |ULTIMATE.start_main_~x~0#1| (fp.div roundNearestTiesToEven .cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv3 32)))) (let ((.cse1 (let ((.cse2 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse3 (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (fp.geq (fp.add roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| (fp.mul roundNearestTiesToEven .cse2 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse2 .cse3)))))) (or (and .cse1 (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv1 32))) (and (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv0 32)) (not .cse1)))) (fp.lt |ULTIMATE.start_main_~x~0#1| .cse0)))) is different from true [2021-12-07 01:26:33,817 WARN L838 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~x~0#1| (_ FloatingPoint 8 24))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))))) (and (fp.gt |ULTIMATE.start_main_~x~0#1| (fp.div roundNearestTiesToEven .cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv3 32)))) (not (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse2 (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (fp.geq (fp.add roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| (fp.mul roundNearestTiesToEven .cse1 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse1 .cse2))))) (fp.lt |ULTIMATE.start_main_~x~0#1| .cse0)))) is different from false [2021-12-07 01:26:35,880 WARN L860 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~x~0#1| (_ FloatingPoint 8 24))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))))) (and (fp.gt |ULTIMATE.start_main_~x~0#1| (fp.div roundNearestTiesToEven .cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv3 32)))) (not (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse2 (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (fp.geq (fp.add roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| (fp.mul roundNearestTiesToEven .cse1 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse1 .cse2))))) (fp.lt |ULTIMATE.start_main_~x~0#1| .cse0)))) is different from true [2021-12-07 01:26:35,881 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-07 01:26:35,881 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-07 01:26:35,881 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-07 01:26:35,881 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [833192345] [2021-12-07 01:26:35,881 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [833192345] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 01:26:35,881 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 01:26:35,881 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-07 01:26:35,882 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738509352] [2021-12-07 01:26:35,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 01:26:35,882 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-07 01:26:35,882 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-07 01:26:35,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-07 01:26:35,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=39, Unknown=6, NotChecked=42, Total=110 [2021-12-07 01:26:35,883 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second 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-12-07 01:26:53,058 WARN L227 SmtUtils]: Spent 5.66s on a formula simplification. DAG size of input: 38 DAG size of output: 30 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-07 01:26:54,699 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.64s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-07 01:26:56,011 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-07 01:27:32,251 WARN L227 SmtUtils]: Spent 33.75s on a formula simplification. DAG size of input: 41 DAG size of output: 33 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-07 01:28:14,975 WARN L227 SmtUtils]: Spent 39.68s on a formula simplification. DAG size of input: 44 DAG size of output: 37 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-07 01:28:17,199 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.22s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-07 01:28:19,410 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.21s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-07 01:28:21,484 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-07 01:28:23,488 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-07 01:28:23,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:28:23,953 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2021-12-07 01:28:24,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-07 01:28:24,022 INFO L78 Accepts]: Start accepts. Automaton has 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) Word has length 11 [2021-12-07 01:28:24,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:28:24,023 INFO L225 Difference]: With dead ends: 20 [2021-12-07 01:28:24,023 INFO L226 Difference]: Without dead ends: 16 [2021-12-07 01:28:24,023 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 164.7s TimeCoverageRelationStatistics Valid=59, Invalid=103, Unknown=6, NotChecked=72, Total=240 [2021-12-07 01:28:24,024 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 10 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 3 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 34 IncrementalHoareTripleChecker+Unchecked, 14.3s IncrementalHoareTripleChecker+Time [2021-12-07 01:28:24,025 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 13 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 17 Invalid, 4 Unknown, 34 Unchecked, 14.3s Time] [2021-12-07 01:28:24,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2021-12-07 01:28:24,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2021-12-07 01:28:24,027 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-12-07 01:28:24,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2021-12-07 01:28:24,028 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 11 [2021-12-07 01:28:24,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:28:24,028 INFO L470 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2021-12-07 01:28:24,028 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has 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-12-07 01:28:24,028 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2021-12-07 01:28:24,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-12-07 01:28:24,029 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:28:24,029 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 01:28:24,046 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_560291ce-a43e-4e7f-94cd-00ac058d4485/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (4)] Ended with exit code 0 [2021-12-07 01:28:24,230 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_560291ce-a43e-4e7f-94cd-00ac058d4485/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-07 01:28:24,231 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 01:28:24,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:28:24,233 INFO L85 PathProgramCache]: Analyzing trace with hash 1599389039, now seen corresponding path program 1 times [2021-12-07 01:28:24,234 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-07 01:28:24,234 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [978347511] [2021-12-07 01:28:24,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:28:24,235 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-07 01:28:24,235 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_560291ce-a43e-4e7f-94cd-00ac058d4485/bin/uautomizer-DrprNOufMa/mathsat [2021-12-07 01:28:24,238 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_560291ce-a43e-4e7f-94cd-00ac058d4485/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-07 01:28:24,240 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_560291ce-a43e-4e7f-94cd-00ac058d4485/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-12-07 01:28:25,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:28:25,490 INFO L263 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-07 01:28:25,491 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-07 01:28:25,609 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-07 01:28:25,609 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-07 01:28:25,762 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-07 01:28:25,762 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-07 01:28:25,762 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [978347511] [2021-12-07 01:28:25,763 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [978347511] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-07 01:28:25,763 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-07 01:28:25,763 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2021-12-07 01:28:25,763 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604000041] [2021-12-07 01:28:25,763 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-07 01:28:25,763 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-07 01:28:25,764 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-07 01:28:25,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-07 01:28:25,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-12-07 01:28:25,764 INFO L87 Difference]: Start difference. First operand 16 states and 17 transitions. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 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-12-07 01:28:28,913 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-07 01:28:31,159 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.18s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-07 01:28:33,363 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.20s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-07 01:28:35,613 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.19s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-07 01:28:35,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 01:28:35,715 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2021-12-07 01:28:35,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-07 01:28:35,715 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 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 15 [2021-12-07 01:28:35,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 01:28:35,716 INFO L225 Difference]: With dead ends: 35 [2021-12-07 01:28:35,716 INFO L226 Difference]: Without dead ends: 27 [2021-12-07 01:28:35,716 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-12-07 01:28:35,717 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 8 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 3 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.9s IncrementalHoareTripleChecker+Time [2021-12-07 01:28:35,718 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 38 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 13 Invalid, 4 Unknown, 0 Unchecked, 9.9s Time] [2021-12-07 01:28:35,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2021-12-07 01:28:35,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 22. [2021-12-07 01:28:35,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 21 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-12-07 01:28:35,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2021-12-07 01:28:35,722 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 15 [2021-12-07 01:28:35,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 01:28:35,723 INFO L470 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2021-12-07 01:28:35,723 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 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-12-07 01:28:35,723 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2021-12-07 01:28:35,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-12-07 01:28:35,723 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 01:28:35,723 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-07 01:28:35,751 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_560291ce-a43e-4e7f-94cd-00ac058d4485/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (5)] Ended with exit code 0 [2021-12-07 01:28:35,924 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_560291ce-a43e-4e7f-94cd-00ac058d4485/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-07 01:28:35,925 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 01:28:35,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 01:28:35,927 INFO L85 PathProgramCache]: Analyzing trace with hash 1656647341, now seen corresponding path program 1 times [2021-12-07 01:28:35,928 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-07 01:28:35,928 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [46060591] [2021-12-07 01:28:35,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 01:28:35,929 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-07 01:28:35,930 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_560291ce-a43e-4e7f-94cd-00ac058d4485/bin/uautomizer-DrprNOufMa/mathsat [2021-12-07 01:28:35,932 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_560291ce-a43e-4e7f-94cd-00ac058d4485/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-07 01:28:35,934 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_560291ce-a43e-4e7f-94cd-00ac058d4485/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2021-12-07 01:30:12,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 01:30:12,478 WARN L261 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 27 conjunts are in the unsatisfiable core [2021-12-07 01:30:12,479 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-07 01:31:08,793 WARN L227 SmtUtils]: Spent 14.68s on a formula simplification that was a NOOP. DAG size: 28 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-07 01:31:47,618 WARN L227 SmtUtils]: Spent 12.92s on a formula simplification that was a NOOP. DAG size: 33 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-07 01:32:22,529 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd (_ bv4294967294 32) |c_ULTIMATE.start_main_~count~0#1|))))) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32))) (.cse1 ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 314159.0 100000.0))))) (and (= (fp.mul c_currentRoundingMode .cse0 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd (_ bv4294967295 32) |c_ULTIMATE.start_main_~count~0#1|)))) |c_ULTIMATE.start_main_~term~0#1|) (fp.lt |c_ULTIMATE.start_main_~x~0#1| .cse1) (= |c_ULTIMATE.start_main_~evenExp~0#1| (fp.add c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (fp.mul c_currentRoundingMode .cse2 .cse0))) (= (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| (fp.mul c_currentRoundingMode .cse2 |c_ULTIMATE.start_main_~term~0#1|)) |c_ULTIMATE.start_main_~oddExp~0#1|) (= c_currentRoundingMode roundNearestTiesToEven) (fp.gt |c_ULTIMATE.start_main_~x~0#1| (fp.div c_currentRoundingMode .cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv3 32)))) (= (_ bv4 32) |c_ULTIMATE.start_main_~count~0#1|))) is different from false [2021-12-07 01:33:31,630 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd (_ bv4294967294 32) |c_ULTIMATE.start_main_~count~0#1|)))))) (let ((.cse1 (fp.mul c_currentRoundingMode .cse3 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd (_ bv4294967295 32) |c_ULTIMATE.start_main_~count~0#1|))))) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32))) (.cse0 ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 314159.0 100000.0))))) (and (fp.lt |c_ULTIMATE.start_main_~x~0#1| .cse0) (= (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode |c_ULTIMATE.start_main_~count~0#1|))) |c_ULTIMATE.start_main_~term~0#1|) (= |c_ULTIMATE.start_main_~oddExp~0#1| (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| (fp.mul c_currentRoundingMode .cse2 .cse1))) (= |c_ULTIMATE.start_main_~evenExp~0#1| (fp.add c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (fp.mul c_currentRoundingMode .cse2 .cse3))) (= c_currentRoundingMode roundNearestTiesToEven) (fp.gt |c_ULTIMATE.start_main_~x~0#1| (fp.div c_currentRoundingMode .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv3 32)))) (= (_ bv4 32) |c_ULTIMATE.start_main_~count~0#1|)))) is different from false [2021-12-07 01:34:13,116 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd (_ bv4294967294 32) |c_ULTIMATE.start_main_~count~0#1|)))))) (let ((.cse1 (fp.mul c_currentRoundingMode .cse3 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd (_ bv4294967295 32) |c_ULTIMATE.start_main_~count~0#1|))))) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32))) (.cse0 ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 314159.0 100000.0))))) (and (fp.lt |c_ULTIMATE.start_main_~x~0#1| .cse0) (= (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode |c_ULTIMATE.start_main_~count~0#1|))) |c_ULTIMATE.start_main_~term~0#1|) (= |c_ULTIMATE.start_main_~oddExp~0#1| (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| (fp.mul c_currentRoundingMode .cse2 .cse1))) (= |c_ULTIMATE.start_main_~evenExp~0#1| (fp.add c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (fp.mul c_currentRoundingMode .cse2 .cse3))) (= c_currentRoundingMode roundNearestTiesToEven) (fp.gt |c_ULTIMATE.start_main_~x~0#1| (fp.div c_currentRoundingMode .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv3 32)))) (= (bvadd (_ bv1 32) |c_ULTIMATE.start_main_#t~ite5#1|) (_ bv0 32)) (= (_ bv4 32) |c_ULTIMATE.start_main_~count~0#1|)))) is different from false [2021-12-07 01:34:15,302 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse3 (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd (_ bv4294967294 32) |c_ULTIMATE.start_main_~count~0#1|)))))) (let ((.cse1 (fp.mul c_currentRoundingMode .cse3 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd (_ bv4294967295 32) |c_ULTIMATE.start_main_~count~0#1|))))) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32))) (.cse0 ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 314159.0 100000.0))))) (and (fp.lt |c_ULTIMATE.start_main_~x~0#1| .cse0) (= (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode |c_ULTIMATE.start_main_~count~0#1|))) |c_ULTIMATE.start_main_~term~0#1|) (= |c_ULTIMATE.start_main_~oddExp~0#1| (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| (fp.mul c_currentRoundingMode .cse2 .cse1))) (= |c_ULTIMATE.start_main_~evenExp~0#1| (fp.add c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (fp.mul c_currentRoundingMode .cse2 .cse3))) (= c_currentRoundingMode roundNearestTiesToEven) (fp.gt |c_ULTIMATE.start_main_~x~0#1| (fp.div c_currentRoundingMode .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv3 32)))) (= (bvadd (_ bv1 32) |c_ULTIMATE.start_main_#t~ite5#1|) (_ bv0 32)) (= (_ bv4 32) |c_ULTIMATE.start_main_~count~0#1|)))) is different from true [2021-12-07 01:34:36,080 WARN L838 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~x~0#1| (_ FloatingPoint 8 24))) (let ((.cse4 (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse1 (fp.mul roundNearestTiesToEven .cse4 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse2 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv4 32))))) (.cse3 ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))))) (and (= |c_ULTIMATE.start_main_~oddExp~0#1| (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv5 32))))))) (fp.gt |ULTIMATE.start_main_~x~0#1| (fp.div roundNearestTiesToEven .cse3 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv3 32)))) (= (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse0 .cse4)) (fp.mul roundNearestTiesToEven .cse0 .cse2)) |c_ULTIMATE.start_main_~evenExp~0#1|) (fp.lt |ULTIMATE.start_main_~x~0#1| .cse3)))))) is different from false [2021-12-07 01:34:38,195 WARN L860 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~x~0#1| (_ FloatingPoint 8 24))) (let ((.cse4 (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse1 (fp.mul roundNearestTiesToEven .cse4 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse2 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv4 32))))) (.cse3 ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))))) (and (= |c_ULTIMATE.start_main_~oddExp~0#1| (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv5 32))))))) (fp.gt |ULTIMATE.start_main_~x~0#1| (fp.div roundNearestTiesToEven .cse3 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv3 32)))) (= (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse0 .cse4)) (fp.mul roundNearestTiesToEven .cse0 .cse2)) |c_ULTIMATE.start_main_~evenExp~0#1|) (fp.lt |ULTIMATE.start_main_~x~0#1| .cse3)))))) is different from true [2021-12-07 01:35:57,501 WARN L838 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~x~0#1| (_ FloatingPoint 8 24))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))))) (and (fp.gt |ULTIMATE.start_main_~x~0#1| (fp.div roundNearestTiesToEven .cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv3 32)))) (let ((.cse1 (let ((.cse5 (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse3 (fp.mul roundNearestTiesToEven .cse5 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (let ((.cse2 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse4 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv4 32)))))) (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| (fp.mul roundNearestTiesToEven .cse2 .cse3)) (fp.mul roundNearestTiesToEven .cse2 (fp.mul roundNearestTiesToEven .cse4 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv5 32)))))) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse2 .cse5)) (fp.mul roundNearestTiesToEven .cse2 .cse4)))))))) (or (and (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv0 32)) (not .cse1)) (and (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv1 32)) .cse1))) (fp.lt |ULTIMATE.start_main_~x~0#1| .cse0)))) is different from false [2021-12-07 01:35:59,611 WARN L860 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~x~0#1| (_ FloatingPoint 8 24))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))))) (and (fp.gt |ULTIMATE.start_main_~x~0#1| (fp.div roundNearestTiesToEven .cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv3 32)))) (let ((.cse1 (let ((.cse5 (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse3 (fp.mul roundNearestTiesToEven .cse5 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (let ((.cse2 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse4 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv4 32)))))) (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| (fp.mul roundNearestTiesToEven .cse2 .cse3)) (fp.mul roundNearestTiesToEven .cse2 (fp.mul roundNearestTiesToEven .cse4 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv5 32)))))) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse2 .cse5)) (fp.mul roundNearestTiesToEven .cse2 .cse4)))))))) (or (and (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv0 32)) (not .cse1)) (and (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv1 32)) .cse1))) (fp.lt |ULTIMATE.start_main_~x~0#1| .cse0)))) is different from true [2021-12-07 01:36:17,474 WARN L838 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~x~0#1| (_ FloatingPoint 8 24))) (let ((.cse4 ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))))) (and (not (let ((.cse3 (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse1 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse2 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv4 32)))))) (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv5 32)))))) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse0 .cse3)) (fp.mul roundNearestTiesToEven .cse0 .cse2))))))) (fp.gt |ULTIMATE.start_main_~x~0#1| (fp.div roundNearestTiesToEven .cse4 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv3 32)))) (fp.lt |ULTIMATE.start_main_~x~0#1| .cse4)))) is different from false [2021-12-07 01:36:19,577 WARN L860 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~x~0#1| (_ FloatingPoint 8 24))) (let ((.cse4 ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))))) (and (not (let ((.cse3 (fp.mul roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse1 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse2 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv4 32)))))) (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv5 32)))))) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse0 .cse3)) (fp.mul roundNearestTiesToEven .cse0 .cse2))))))) (fp.gt |ULTIMATE.start_main_~x~0#1| (fp.div roundNearestTiesToEven .cse4 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv3 32)))) (fp.lt |ULTIMATE.start_main_~x~0#1| .cse4)))) is different from true [2021-12-07 01:36:19,578 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2021-12-07 01:36:19,578 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-07 01:36:34,725 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode |c_ULTIMATE.start_main_#t~ite5#1|))) (fp.geq (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~oddExp~0#1| (fp.mul c_currentRoundingMode .cse0 (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~term~0#1| (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd (_ bv1 32) |c_ULTIMATE.start_main_~count~0#1|)))))) (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~evenExp~0#1| (fp.mul c_currentRoundingMode .cse0 |c_ULTIMATE.start_main_~term~0#1|)))) is different from false [2021-12-07 01:36:36,811 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode |c_ULTIMATE.start_main_#t~ite5#1|))) (fp.geq (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~oddExp~0#1| (fp.mul c_currentRoundingMode .cse0 (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~term~0#1| (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd (_ bv1 32) |c_ULTIMATE.start_main_~count~0#1|)))))) (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~evenExp~0#1| (fp.mul c_currentRoundingMode .cse0 |c_ULTIMATE.start_main_~term~0#1|)))) is different from true [2021-12-07 01:36:43,012 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32)))) (fp.geq (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~oddExp~0#1| (fp.mul c_currentRoundingMode .cse0 (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~term~0#1| (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd (_ bv1 32) |c_ULTIMATE.start_main_~count~0#1|)))))) (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~evenExp~0#1| (fp.mul c_currentRoundingMode .cse0 |c_ULTIMATE.start_main_~term~0#1|)))) is different from false [2021-12-07 01:36:45,081 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32)))) (fp.geq (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~oddExp~0#1| (fp.mul c_currentRoundingMode .cse0 (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~term~0#1| (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd (_ bv1 32) |c_ULTIMATE.start_main_~count~0#1|)))))) (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~evenExp~0#1| (fp.mul c_currentRoundingMode .cse0 |c_ULTIMATE.start_main_~term~0#1|)))) is different from true [2021-12-07 01:36:51,421 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32))) (.cse1 (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~term~0#1| (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode |c_ULTIMATE.start_main_~count~0#1|))))) (fp.geq (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~oddExp~0#1| (fp.mul c_currentRoundingMode .cse0 (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd (_ bv1 32) |c_ULTIMATE.start_main_~count~0#1|)))))) (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~evenExp~0#1| (fp.mul c_currentRoundingMode .cse0 .cse1)))) is different from false [2021-12-07 01:36:53,536 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32))) (.cse1 (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~term~0#1| (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode |c_ULTIMATE.start_main_~count~0#1|))))) (fp.geq (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~oddExp~0#1| (fp.mul c_currentRoundingMode .cse0 (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd (_ bv1 32) |c_ULTIMATE.start_main_~count~0#1|)))))) (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~evenExp~0#1| (fp.mul c_currentRoundingMode .cse0 .cse1)))) is different from true [2021-12-07 01:37:04,342 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~term~0#1| (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd (_ bv1 32) |c_ULTIMATE.start_main_~count~0#1|)))))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode |c_ULTIMATE.start_main_#t~ite5#1|)) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32))) (.cse3 (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd (_ bv2 32) |c_ULTIMATE.start_main_~count~0#1|)))))) (fp.geq (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~oddExp~0#1| (fp.mul c_currentRoundingMode .cse0 .cse1)) (fp.mul c_currentRoundingMode .cse2 (fp.mul c_currentRoundingMode .cse3 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd (_ bv3 32) |c_ULTIMATE.start_main_~count~0#1|)))))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~evenExp~0#1| (fp.mul c_currentRoundingMode .cse0 |c_ULTIMATE.start_main_~term~0#1|)) (fp.mul c_currentRoundingMode .cse2 .cse3))))) is different from false [2021-12-07 01:37:06,545 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~term~0#1| (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd (_ bv1 32) |c_ULTIMATE.start_main_~count~0#1|)))))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode |c_ULTIMATE.start_main_#t~ite5#1|)) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32))) (.cse3 (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd (_ bv2 32) |c_ULTIMATE.start_main_~count~0#1|)))))) (fp.geq (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~oddExp~0#1| (fp.mul c_currentRoundingMode .cse0 .cse1)) (fp.mul c_currentRoundingMode .cse2 (fp.mul c_currentRoundingMode .cse3 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd (_ bv3 32) |c_ULTIMATE.start_main_~count~0#1|)))))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~evenExp~0#1| (fp.mul c_currentRoundingMode .cse0 |c_ULTIMATE.start_main_~term~0#1|)) (fp.mul c_currentRoundingMode .cse2 .cse3))))) is different from true [2021-12-07 01:37:13,091 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~term~0#1| (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd (_ bv1 32) |c_ULTIMATE.start_main_~count~0#1|)))))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32))) (.cse2 (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd (_ bv2 32) |c_ULTIMATE.start_main_~count~0#1|)))))) (fp.geq (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~oddExp~0#1| (fp.mul c_currentRoundingMode .cse0 .cse1)) (fp.mul c_currentRoundingMode .cse0 (fp.mul c_currentRoundingMode .cse2 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd (_ bv3 32) |c_ULTIMATE.start_main_~count~0#1|)))))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~evenExp~0#1| (fp.mul c_currentRoundingMode .cse0 |c_ULTIMATE.start_main_~term~0#1|)) (fp.mul c_currentRoundingMode .cse0 .cse2))))) is different from false [2021-12-07 01:37:15,274 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~term~0#1| (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd (_ bv1 32) |c_ULTIMATE.start_main_~count~0#1|)))))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32))) (.cse2 (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd (_ bv2 32) |c_ULTIMATE.start_main_~count~0#1|)))))) (fp.geq (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~oddExp~0#1| (fp.mul c_currentRoundingMode .cse0 .cse1)) (fp.mul c_currentRoundingMode .cse0 (fp.mul c_currentRoundingMode .cse2 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd (_ bv3 32) |c_ULTIMATE.start_main_~count~0#1|)))))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~evenExp~0#1| (fp.mul c_currentRoundingMode .cse0 |c_ULTIMATE.start_main_~term~0#1|)) (fp.mul c_currentRoundingMode .cse0 .cse2))))) is different from true [2021-12-07 01:37:21,957 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~term~0#1| (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode |c_ULTIMATE.start_main_~count~0#1|))))) (let ((.cse1 (fp.mul c_currentRoundingMode .cse3 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd (_ bv1 32) |c_ULTIMATE.start_main_~count~0#1|)))))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32))) (.cse2 (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd (_ bv2 32) |c_ULTIMATE.start_main_~count~0#1|)))))) (fp.geq (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~oddExp~0#1| (fp.mul c_currentRoundingMode .cse0 .cse1)) (fp.mul c_currentRoundingMode .cse0 (fp.mul c_currentRoundingMode .cse2 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd (_ bv3 32) |c_ULTIMATE.start_main_~count~0#1|)))))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~evenExp~0#1| (fp.mul c_currentRoundingMode .cse0 .cse3)) (fp.mul c_currentRoundingMode .cse0 .cse2)))))) is different from false [2021-12-07 01:37:24,189 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse3 (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~term~0#1| (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode |c_ULTIMATE.start_main_~count~0#1|))))) (let ((.cse1 (fp.mul c_currentRoundingMode .cse3 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd (_ bv1 32) |c_ULTIMATE.start_main_~count~0#1|)))))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32))) (.cse2 (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd (_ bv2 32) |c_ULTIMATE.start_main_~count~0#1|)))))) (fp.geq (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~oddExp~0#1| (fp.mul c_currentRoundingMode .cse0 .cse1)) (fp.mul c_currentRoundingMode .cse0 (fp.mul c_currentRoundingMode .cse2 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd (_ bv3 32) |c_ULTIMATE.start_main_~count~0#1|)))))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~evenExp~0#1| (fp.mul c_currentRoundingMode .cse0 .cse3)) (fp.mul c_currentRoundingMode .cse0 .cse2)))))) is different from true [2021-12-07 01:37:30,676 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv2 32)))))) (let ((.cse1 (fp.mul c_currentRoundingMode .cse3 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv3 32)))))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32))) (.cse2 (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv4 32)))))) (fp.geq (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| (fp.mul c_currentRoundingMode .cse0 .cse1)) (fp.mul c_currentRoundingMode .cse0 (fp.mul c_currentRoundingMode .cse2 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv5 32)))))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (fp.mul c_currentRoundingMode .cse0 .cse3)) (fp.mul c_currentRoundingMode .cse0 .cse2)))))) is different from false [2021-12-07 01:37:32,841 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse3 (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv2 32)))))) (let ((.cse1 (fp.mul c_currentRoundingMode .cse3 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv3 32)))))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32))) (.cse2 (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv4 32)))))) (fp.geq (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| (fp.mul c_currentRoundingMode .cse0 .cse1)) (fp.mul c_currentRoundingMode .cse0 (fp.mul c_currentRoundingMode .cse2 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv5 32)))))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (fp.mul c_currentRoundingMode .cse0 .cse3)) (fp.mul c_currentRoundingMode .cse0 .cse2)))))) is different from true [2021-12-07 01:37:43,953 WARN L838 $PredicateComparison]: unable to prove that (or (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv0 32)) (let ((.cse3 (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv2 32)))))) (let ((.cse1 (fp.mul c_currentRoundingMode .cse3 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv3 32)))))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32))) (.cse2 (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv4 32)))))) (fp.geq (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| (fp.mul c_currentRoundingMode .cse0 .cse1)) (fp.mul c_currentRoundingMode .cse0 (fp.mul c_currentRoundingMode .cse2 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv5 32)))))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (fp.mul c_currentRoundingMode .cse0 .cse3)) (fp.mul c_currentRoundingMode .cse0 .cse2))))))) is different from false [2021-12-07 01:37:46,123 WARN L860 $PredicateComparison]: unable to prove that (or (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv0 32)) (let ((.cse3 (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv2 32)))))) (let ((.cse1 (fp.mul c_currentRoundingMode .cse3 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv3 32)))))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32))) (.cse2 (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv4 32)))))) (fp.geq (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| (fp.mul c_currentRoundingMode .cse0 .cse1)) (fp.mul c_currentRoundingMode .cse0 (fp.mul c_currentRoundingMode .cse2 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv5 32)))))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (fp.mul c_currentRoundingMode .cse0 .cse3)) (fp.mul c_currentRoundingMode .cse0 .cse2))))))) is different from true [2021-12-07 01:38:03,239 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~x~0#1_6| (_ FloatingPoint 8 24))) (or (not (fp.gt |v_ULTIMATE.start_main_~x~0#1_6| (fp.div c_currentRoundingMode c_~pi~0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv3 32))))) (not (fp.lt |v_ULTIMATE.start_main_~x~0#1_6| c_~pi~0)) (let ((.cse3 (fp.mul c_currentRoundingMode |v_ULTIMATE.start_main_~x~0#1_6| (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~x~0#1_6| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv2 32)))))) (let ((.cse1 (fp.mul c_currentRoundingMode .cse3 (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~x~0#1_6| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv3 32)))))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32))) (.cse2 (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~x~0#1_6| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv4 32)))))) (fp.geq (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |v_ULTIMATE.start_main_~x~0#1_6| (fp.mul c_currentRoundingMode .cse0 .cse1)) (fp.mul c_currentRoundingMode .cse0 (fp.mul c_currentRoundingMode .cse2 (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~x~0#1_6| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv5 32)))))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (fp.mul c_currentRoundingMode .cse0 .cse3)) (fp.mul c_currentRoundingMode .cse0 .cse2)))))))) is different from true [2021-12-07 01:38:03,240 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2021-12-07 01:38:03,240 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-07 01:38:03,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [46060591] [2021-12-07 01:38:03,240 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [46060591] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-07 01:38:03,240 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-07 01:38:03,240 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 24 [2021-12-07 01:38:03,240 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784222886] [2021-12-07 01:38:03,240 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-07 01:38:03,241 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2021-12-07 01:38:03,241 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-07 01:38:03,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-12-07 01:38:03,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=68, Unknown=28, NotChecked=450, Total=600 [2021-12-07 01:38:03,242 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand has 25 states, 25 states have (on average 1.2) internal successors, (30), 24 states have internal predecessors, (30), 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-12-07 01:38:05,417 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~x~0#1_6| (_ FloatingPoint 8 24))) (or (not (fp.gt |v_ULTIMATE.start_main_~x~0#1_6| (fp.div c_currentRoundingMode c_~pi~0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv3 32))))) (not (fp.lt |v_ULTIMATE.start_main_~x~0#1_6| c_~pi~0)) (let ((.cse3 (fp.mul c_currentRoundingMode |v_ULTIMATE.start_main_~x~0#1_6| (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~x~0#1_6| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv2 32)))))) (let ((.cse1 (fp.mul c_currentRoundingMode .cse3 (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~x~0#1_6| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv3 32)))))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32))) (.cse2 (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~x~0#1_6| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv4 32)))))) (fp.geq (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |v_ULTIMATE.start_main_~x~0#1_6| (fp.mul c_currentRoundingMode .cse0 .cse1)) (fp.mul c_currentRoundingMode .cse0 (fp.mul c_currentRoundingMode .cse2 (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~x~0#1_6| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv5 32)))))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (fp.mul c_currentRoundingMode .cse0 .cse3)) (fp.mul c_currentRoundingMode .cse0 .cse2)))))))) (= c_currentRoundingMode roundNearestTiesToEven) (= ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 314159.0 100000.0))) c_~pi~0)) is different from false [2021-12-07 01:38:07,638 WARN L860 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~x~0#1_6| (_ FloatingPoint 8 24))) (or (not (fp.gt |v_ULTIMATE.start_main_~x~0#1_6| (fp.div c_currentRoundingMode c_~pi~0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv3 32))))) (not (fp.lt |v_ULTIMATE.start_main_~x~0#1_6| c_~pi~0)) (let ((.cse3 (fp.mul c_currentRoundingMode |v_ULTIMATE.start_main_~x~0#1_6| (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~x~0#1_6| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv2 32)))))) (let ((.cse1 (fp.mul c_currentRoundingMode .cse3 (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~x~0#1_6| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv3 32)))))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32))) (.cse2 (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~x~0#1_6| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv4 32)))))) (fp.geq (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |v_ULTIMATE.start_main_~x~0#1_6| (fp.mul c_currentRoundingMode .cse0 .cse1)) (fp.mul c_currentRoundingMode .cse0 (fp.mul c_currentRoundingMode .cse2 (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~x~0#1_6| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv5 32)))))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (fp.mul c_currentRoundingMode .cse0 .cse3)) (fp.mul c_currentRoundingMode .cse0 .cse2)))))))) (= c_currentRoundingMode roundNearestTiesToEven) (= ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 314159.0 100000.0))) c_~pi~0)) is different from true [2021-12-07 01:38:09,798 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv0 32)))) (and (let ((.cse3 ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 314159.0 100000.0))))) (let ((.cse1 (fp.lt |c_ULTIMATE.start_main_~x~0#1| .cse3)) (.cse0 (fp.gt |c_ULTIMATE.start_main_~x~0#1| (fp.div c_currentRoundingMode .cse3 ((_ to_fp 8 24) c_currentRoundingMode (_ bv3 32)))))) (or (and (or (not .cse0) (not .cse1)) .cse2) (and .cse1 (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv1 32)) .cse0)))) (or .cse2 (let ((.cse7 (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv2 32)))))) (let ((.cse5 (fp.mul c_currentRoundingMode .cse7 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv3 32)))))) (let ((.cse4 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32))) (.cse6 (fp.mul c_currentRoundingMode .cse5 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv4 32)))))) (fp.geq (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| (fp.mul c_currentRoundingMode .cse4 .cse5)) (fp.mul c_currentRoundingMode .cse4 (fp.mul c_currentRoundingMode .cse6 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv5 32)))))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (fp.mul c_currentRoundingMode .cse4 .cse7)) (fp.mul c_currentRoundingMode .cse4 .cse6))))))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from false [2021-12-07 01:38:12,025 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse2 (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv0 32)))) (and (let ((.cse3 ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 314159.0 100000.0))))) (let ((.cse1 (fp.lt |c_ULTIMATE.start_main_~x~0#1| .cse3)) (.cse0 (fp.gt |c_ULTIMATE.start_main_~x~0#1| (fp.div c_currentRoundingMode .cse3 ((_ to_fp 8 24) c_currentRoundingMode (_ bv3 32)))))) (or (and (or (not .cse0) (not .cse1)) .cse2) (and .cse1 (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv1 32)) .cse0)))) (or .cse2 (let ((.cse7 (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv2 32)))))) (let ((.cse5 (fp.mul c_currentRoundingMode .cse7 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv3 32)))))) (let ((.cse4 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32))) (.cse6 (fp.mul c_currentRoundingMode .cse5 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv4 32)))))) (fp.geq (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| (fp.mul c_currentRoundingMode .cse4 .cse5)) (fp.mul c_currentRoundingMode .cse4 (fp.mul c_currentRoundingMode .cse6 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv5 32)))))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (fp.mul c_currentRoundingMode .cse4 .cse7)) (fp.mul c_currentRoundingMode .cse4 .cse6))))))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2021-12-07 01:38:14,252 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 314159.0 100000.0))))) (and (let ((.cse3 (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv2 32)))))) (let ((.cse1 (fp.mul c_currentRoundingMode .cse3 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv3 32)))))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32))) (.cse2 (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv4 32)))))) (fp.geq (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| (fp.mul c_currentRoundingMode .cse0 .cse1)) (fp.mul c_currentRoundingMode .cse0 (fp.mul c_currentRoundingMode .cse2 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv5 32)))))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (fp.mul c_currentRoundingMode .cse0 .cse3)) (fp.mul c_currentRoundingMode .cse0 .cse2)))))) (fp.lt |c_ULTIMATE.start_main_~x~0#1| .cse4) (= c_currentRoundingMode roundNearestTiesToEven) (fp.gt |c_ULTIMATE.start_main_~x~0#1| (fp.div c_currentRoundingMode .cse4 ((_ to_fp 8 24) c_currentRoundingMode (_ bv3 32)))))) is different from false [2021-12-07 01:38:16,470 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse4 ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 314159.0 100000.0))))) (and (let ((.cse3 (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv2 32)))))) (let ((.cse1 (fp.mul c_currentRoundingMode .cse3 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv3 32)))))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32))) (.cse2 (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv4 32)))))) (fp.geq (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| (fp.mul c_currentRoundingMode .cse0 .cse1)) (fp.mul c_currentRoundingMode .cse0 (fp.mul c_currentRoundingMode .cse2 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv5 32)))))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (fp.mul c_currentRoundingMode .cse0 .cse3)) (fp.mul c_currentRoundingMode .cse0 .cse2)))))) (fp.lt |c_ULTIMATE.start_main_~x~0#1| .cse4) (= c_currentRoundingMode roundNearestTiesToEven) (fp.gt |c_ULTIMATE.start_main_~x~0#1| (fp.div c_currentRoundingMode .cse4 ((_ to_fp 8 24) c_currentRoundingMode (_ bv3 32)))))) is different from true [2021-12-07 01:38:18,670 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 314159.0 100000.0))))) (and (= |c_ULTIMATE.start_main_~x~0#1| |c_ULTIMATE.start_main_~oddExp~0#1|) (= (_ bv2 32) |c_ULTIMATE.start_main_~count~0#1|) (= |c_ULTIMATE.start_main_~evenExp~0#1| ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (fp.lt |c_ULTIMATE.start_main_~x~0#1| .cse0) (let ((.cse4 (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~term~0#1| (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode |c_ULTIMATE.start_main_~count~0#1|))))) (let ((.cse2 (fp.mul c_currentRoundingMode .cse4 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd (_ bv1 32) |c_ULTIMATE.start_main_~count~0#1|)))))) (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv4294967295 32))) (.cse3 (fp.mul c_currentRoundingMode .cse2 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd (_ bv2 32) |c_ULTIMATE.start_main_~count~0#1|)))))) (fp.geq (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~oddExp~0#1| (fp.mul c_currentRoundingMode .cse1 .cse2)) (fp.mul c_currentRoundingMode .cse1 (fp.mul c_currentRoundingMode .cse3 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd (_ bv3 32) |c_ULTIMATE.start_main_~count~0#1|)))))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~evenExp~0#1| (fp.mul c_currentRoundingMode .cse1 .cse4)) (fp.mul c_currentRoundingMode .cse1 .cse3)))))) (= |c_ULTIMATE.start_main_~term~0#1| |c_ULTIMATE.start_main_~x~0#1|) (= c_currentRoundingMode roundNearestTiesToEven) (fp.gt |c_ULTIMATE.start_main_~x~0#1| (fp.div c_currentRoundingMode .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv3 32)))))) is different from false