./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/nla-digbench-scaling/freire1_valuebound2.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_2662a6ff-d3be-4b57-a06a-2269381120e6/bin/uautomizer-DrprNOufMa/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2662a6ff-d3be-4b57-a06a-2269381120e6/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_2662a6ff-d3be-4b57-a06a-2269381120e6/bin/uautomizer-DrprNOufMa/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2662a6ff-d3be-4b57-a06a-2269381120e6/bin/uautomizer-DrprNOufMa/config/AutomizerReach.xml -i ../../sv-benchmarks/c/nla-digbench-scaling/freire1_valuebound2.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2662a6ff-d3be-4b57-a06a-2269381120e6/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_2662a6ff-d3be-4b57-a06a-2269381120e6/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 2c82dcc3d917c20926ea634368e9542e23b7ae4e7817b33542bbba01403d748d --- Real Ultimate output --- This is Ultimate 0.2.2-hotfix-svcomp22-839c364 [2021-12-06 17:14:24,974 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-06 17:14:24,976 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-06 17:14:24,997 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-06 17:14:24,998 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-06 17:14:24,999 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-06 17:14:25,000 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-06 17:14:25,001 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-06 17:14:25,003 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-06 17:14:25,004 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-06 17:14:25,004 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-06 17:14:25,005 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-06 17:14:25,006 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-06 17:14:25,006 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-06 17:14:25,008 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-06 17:14:25,009 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-06 17:14:25,009 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-06 17:14:25,010 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-06 17:14:25,012 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-06 17:14:25,014 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-06 17:14:25,015 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-06 17:14:25,017 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-06 17:14:25,018 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-06 17:14:25,018 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-06 17:14:25,021 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-06 17:14:25,021 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-06 17:14:25,022 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-06 17:14:25,022 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-06 17:14:25,023 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-06 17:14:25,024 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-06 17:14:25,024 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-06 17:14:25,024 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-06 17:14:25,025 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-06 17:14:25,026 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-06 17:14:25,026 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-06 17:14:25,027 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-06 17:14:25,027 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-06 17:14:25,027 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-06 17:14:25,027 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-06 17:14:25,028 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-06 17:14:25,028 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-06 17:14:25,029 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2662a6ff-d3be-4b57-a06a-2269381120e6/bin/uautomizer-DrprNOufMa/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-06 17:14:25,046 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-06 17:14:25,046 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-06 17:14:25,046 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-06 17:14:25,046 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-06 17:14:25,047 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-06 17:14:25,047 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-06 17:14:25,047 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-06 17:14:25,048 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-06 17:14:25,048 INFO L138 SettingsManager]: * Use SBE=true [2021-12-06 17:14:25,048 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-06 17:14:25,048 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-06 17:14:25,048 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-06 17:14:25,048 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-06 17:14:25,048 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-06 17:14:25,048 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-06 17:14:25,048 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-06 17:14:25,049 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-06 17:14:25,049 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-06 17:14:25,049 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-06 17:14:25,049 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-06 17:14:25,049 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-06 17:14:25,049 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-06 17:14:25,049 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-06 17:14:25,049 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-06 17:14:25,049 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-06 17:14:25,050 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-06 17:14:25,050 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-06 17:14:25,050 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-06 17:14:25,050 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-06 17:14:25,050 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-06 17:14:25,050 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-06 17:14:25,050 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-06 17:14:25,050 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-06 17:14:25,050 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-06 17:14:25,051 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_2662a6ff-d3be-4b57-a06a-2269381120e6/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_2662a6ff-d3be-4b57-a06a-2269381120e6/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 -> 2c82dcc3d917c20926ea634368e9542e23b7ae4e7817b33542bbba01403d748d [2021-12-06 17:14:25,235 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-06 17:14:25,250 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-06 17:14:25,252 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-06 17:14:25,253 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-06 17:14:25,253 INFO L275 PluginConnector]: CDTParser initialized [2021-12-06 17:14:25,254 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2662a6ff-d3be-4b57-a06a-2269381120e6/bin/uautomizer-DrprNOufMa/../../sv-benchmarks/c/nla-digbench-scaling/freire1_valuebound2.c [2021-12-06 17:14:25,297 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2662a6ff-d3be-4b57-a06a-2269381120e6/bin/uautomizer-DrprNOufMa/data/7813cfc9b/9a67868f85aa4c2097f62fe276939b07/FLAG07af7faf1 [2021-12-06 17:14:25,660 INFO L306 CDTParser]: Found 1 translation units. [2021-12-06 17:14:25,660 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2662a6ff-d3be-4b57-a06a-2269381120e6/sv-benchmarks/c/nla-digbench-scaling/freire1_valuebound2.c [2021-12-06 17:14:25,664 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2662a6ff-d3be-4b57-a06a-2269381120e6/bin/uautomizer-DrprNOufMa/data/7813cfc9b/9a67868f85aa4c2097f62fe276939b07/FLAG07af7faf1 [2021-12-06 17:14:25,674 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2662a6ff-d3be-4b57-a06a-2269381120e6/bin/uautomizer-DrprNOufMa/data/7813cfc9b/9a67868f85aa4c2097f62fe276939b07 [2021-12-06 17:14:25,675 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-06 17:14:25,676 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-06 17:14:25,678 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-06 17:14:25,678 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-06 17:14:25,681 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-06 17:14:25,681 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 05:14:25" (1/1) ... [2021-12-06 17:14:25,682 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@16095b32 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:14:25, skipping insertion in model container [2021-12-06 17:14:25,682 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 05:14:25" (1/1) ... [2021-12-06 17:14:25,688 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-06 17:14:25,698 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-06 17:14:25,813 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_2662a6ff-d3be-4b57-a06a-2269381120e6/sv-benchmarks/c/nla-digbench-scaling/freire1_valuebound2.c[712,725] [2021-12-06 17:14:25,824 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-06 17:14:25,830 INFO L203 MainTranslator]: Completed pre-run [2021-12-06 17:14:25,838 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_2662a6ff-d3be-4b57-a06a-2269381120e6/sv-benchmarks/c/nla-digbench-scaling/freire1_valuebound2.c[712,725] [2021-12-06 17:14:25,842 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-06 17:14:25,851 INFO L208 MainTranslator]: Completed translation [2021-12-06 17:14:25,852 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:14:25 WrapperNode [2021-12-06 17:14:25,852 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-06 17:14:25,853 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-06 17:14:25,853 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-06 17:14:25,853 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-06 17:14:25,858 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:14:25" (1/1) ... [2021-12-06 17:14:25,863 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:14:25" (1/1) ... [2021-12-06 17:14:25,876 INFO L137 Inliner]: procedures = 14, calls = 10, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 33 [2021-12-06 17:14:25,876 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-06 17:14:25,877 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-06 17:14:25,877 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-06 17:14:25,877 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-06 17:14:25,883 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:14:25" (1/1) ... [2021-12-06 17:14:25,883 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:14:25" (1/1) ... [2021-12-06 17:14:25,884 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:14:25" (1/1) ... [2021-12-06 17:14:25,884 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:14:25" (1/1) ... [2021-12-06 17:14:25,888 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:14:25" (1/1) ... [2021-12-06 17:14:25,892 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:14:25" (1/1) ... [2021-12-06 17:14:25,893 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:14:25" (1/1) ... [2021-12-06 17:14:25,895 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-06 17:14:25,896 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-06 17:14:25,896 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-06 17:14:25,896 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-06 17:14:25,897 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:14:25" (1/1) ... [2021-12-06 17:14:25,904 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-06 17:14:25,914 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2662a6ff-d3be-4b57-a06a-2269381120e6/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 17:14:25,926 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2662a6ff-d3be-4b57-a06a-2269381120e6/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-06 17:14:25,928 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2662a6ff-d3be-4b57-a06a-2269381120e6/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-06 17:14:25,956 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-06 17:14:25,957 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-06 17:14:25,957 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-06 17:14:25,957 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-06 17:14:25,957 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2021-12-06 17:14:25,957 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2021-12-06 17:14:26,001 INFO L236 CfgBuilder]: Building ICFG [2021-12-06 17:14:26,003 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-06 17:14:26,075 INFO L277 CfgBuilder]: Performing block encoding [2021-12-06 17:14:26,081 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-06 17:14:26,081 INFO L301 CfgBuilder]: Removed 1 assume(true) statements. [2021-12-06 17:14:26,083 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 05:14:26 BoogieIcfgContainer [2021-12-06 17:14:26,083 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-06 17:14:26,085 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-06 17:14:26,085 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-06 17:14:26,088 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-06 17:14:26,088 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 05:14:25" (1/3) ... [2021-12-06 17:14:26,089 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@616b55fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 05:14:26, skipping insertion in model container [2021-12-06 17:14:26,089 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:14:25" (2/3) ... [2021-12-06 17:14:26,090 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@616b55fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 05:14:26, skipping insertion in model container [2021-12-06 17:14:26,090 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 05:14:26" (3/3) ... [2021-12-06 17:14:26,091 INFO L111 eAbstractionObserver]: Analyzing ICFG freire1_valuebound2.c [2021-12-06 17:14:26,096 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-06 17:14:26,096 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-06 17:14:26,145 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-06 17:14:26,152 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-06 17:14:26,152 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-06 17:14:26,169 INFO L276 IsEmpty]: Start isEmpty. Operand has 18 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 14 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-06 17:14:26,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-12-06 17:14:26,174 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:14:26,175 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:14:26,175 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 17:14:26,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:14:26,180 INFO L85 PathProgramCache]: Analyzing trace with hash -589467074, now seen corresponding path program 1 times [2021-12-06 17:14:26,189 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:14:26,189 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767492780] [2021-12-06 17:14:26,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:14:26,190 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:14:26,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:14:26,289 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-06 17:14:26,289 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 17:14:26,289 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767492780] [2021-12-06 17:14:26,290 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1767492780] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:14:26,290 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 17:14:26,290 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-06 17:14:26,292 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766010172] [2021-12-06 17:14:26,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:14:26,295 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-12-06 17:14:26,295 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 17:14:26,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-12-06 17:14:26,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-06 17:14:26,318 INFO L87 Difference]: Start difference. First operand has 18 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 14 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:14:26,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:14:26,331 INFO L93 Difference]: Finished difference Result 33 states and 44 transitions. [2021-12-06 17:14:26,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-06 17:14:26,333 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2021-12-06 17:14:26,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:14:26,338 INFO L225 Difference]: With dead ends: 33 [2021-12-06 17:14:26,338 INFO L226 Difference]: Without dead ends: 14 [2021-12-06 17:14:26,341 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-06 17:14:26,344 INFO L933 BasicCegarLoop]: 19 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, 19 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-06 17:14:26,345 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 17:14:26,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2021-12-06 17:14:26,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2021-12-06 17:14:26,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 10 states have (on average 1.2) internal successors, (12), 11 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-06 17:14:26,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2021-12-06 17:14:26,371 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 9 [2021-12-06 17:14:26,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:14:26,371 INFO L470 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2021-12-06 17:14:26,371 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:14:26,371 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2021-12-06 17:14:26,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-12-06 17:14:26,372 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:14:26,372 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:14:26,372 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-06 17:14:26,372 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 17:14:26,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:14:26,373 INFO L85 PathProgramCache]: Analyzing trace with hash 1187327748, now seen corresponding path program 1 times [2021-12-06 17:14:26,373 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 17:14:26,373 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769176008] [2021-12-06 17:14:26,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:14:26,374 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 17:14:26,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-06 17:14:26,389 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-06 17:14:26,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-06 17:14:26,410 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-06 17:14:26,410 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-12-06 17:14:26,412 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-12-06 17:14:26,413 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-06 17:14:26,416 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1] [2021-12-06 17:14:26,418 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-06 17:14:26,433 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 05:14:26 BoogieIcfgContainer [2021-12-06 17:14:26,433 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-06 17:14:26,434 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-06 17:14:26,434 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-06 17:14:26,434 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-06 17:14:26,434 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 05:14:26" (3/4) ... [2021-12-06 17:14:26,437 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-12-06 17:14:26,437 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-06 17:14:26,437 INFO L158 Benchmark]: Toolchain (without parser) took 760.82ms. Allocated memory is still 102.8MB. Free memory was 64.2MB in the beginning and 43.5MB in the end (delta: 20.7MB). Peak memory consumption was 18.6MB. Max. memory is 16.1GB. [2021-12-06 17:14:26,438 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 102.8MB. Free memory is still 80.4MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-06 17:14:26,438 INFO L158 Benchmark]: CACSL2BoogieTranslator took 174.44ms. Allocated memory is still 102.8MB. Free memory was 64.0MB in the beginning and 78.6MB in the end (delta: -14.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-12-06 17:14:26,439 INFO L158 Benchmark]: Boogie Procedure Inliner took 23.82ms. Allocated memory is still 102.8MB. Free memory was 78.6MB in the beginning and 77.1MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-06 17:14:26,439 INFO L158 Benchmark]: Boogie Preprocessor took 17.92ms. Allocated memory is still 102.8MB. Free memory was 77.1MB in the beginning and 76.2MB in the end (delta: 819.7kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-06 17:14:26,439 INFO L158 Benchmark]: RCFGBuilder took 187.67ms. Allocated memory is still 102.8MB. Free memory was 76.2MB in the beginning and 67.0MB in the end (delta: 9.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-12-06 17:14:26,440 INFO L158 Benchmark]: TraceAbstraction took 348.26ms. Allocated memory is still 102.8MB. Free memory was 66.6MB in the beginning and 43.9MB in the end (delta: 22.6MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2021-12-06 17:14:26,440 INFO L158 Benchmark]: Witness Printer took 2.99ms. Allocated memory is still 102.8MB. Free memory was 43.9MB in the beginning and 43.5MB in the end (delta: 420.1kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-06 17:14:26,443 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.15ms. Allocated memory is still 102.8MB. Free memory is still 80.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 174.44ms. Allocated memory is still 102.8MB. Free memory was 64.0MB in the beginning and 78.6MB in the end (delta: -14.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 23.82ms. Allocated memory is still 102.8MB. Free memory was 78.6MB in the beginning and 77.1MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 17.92ms. Allocated memory is still 102.8MB. Free memory was 77.1MB in the beginning and 76.2MB in the end (delta: 819.7kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 187.67ms. Allocated memory is still 102.8MB. Free memory was 76.2MB in the beginning and 67.0MB in the end (delta: 9.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 348.26ms. Allocated memory is still 102.8MB. Free memory was 66.6MB in the beginning and 43.9MB in the end (delta: 22.6MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Witness Printer took 2.99ms. Allocated memory is still 102.8MB. Free memory was 43.9MB in the beginning and 43.5MB in the end (delta: 420.1kB). 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: 19]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of to_int at line 33, overapproximation of someBinaryDOUBLEComparisonOperation at line 28, overapproximation of someBinaryArithmeticDOUBLEoperation at line 29. Possible FailurePath: [L25] int r; [L26] double a, x; [L27] a = __VERIFIER_nondet_double() [L28] CALL assume_abort_if_not(a>=0 && a<=2) [L14] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L28] RET assume_abort_if_not(a>=0 && a<=2) [L29] x = a / 2.0 [L30] r = 0 VAL [r=0] [L32] COND TRUE 1 VAL [r=0] [L33] CALL __VERIFIER_assert((int)(r*r - a - r + 2*x) == 0) VAL [\old(cond)=0] [L17] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L19] reach_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 18 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.3s, OverallIterations: 2, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 19 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 0 IncrementalHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 19 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=18occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 18 NumberOfCodeBlocks, 18 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 8 ConstructedInterpolants, 0 QuantifiedInterpolants, 8 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2021-12-06 17:14:26,485 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2662a6ff-d3be-4b57-a06a-2269381120e6/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_2662a6ff-d3be-4b57-a06a-2269381120e6/bin/uautomizer-DrprNOufMa/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2662a6ff-d3be-4b57-a06a-2269381120e6/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_2662a6ff-d3be-4b57-a06a-2269381120e6/bin/uautomizer-DrprNOufMa/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2662a6ff-d3be-4b57-a06a-2269381120e6/bin/uautomizer-DrprNOufMa/config/AutomizerReach.xml -i ../../sv-benchmarks/c/nla-digbench-scaling/freire1_valuebound2.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2662a6ff-d3be-4b57-a06a-2269381120e6/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_2662a6ff-d3be-4b57-a06a-2269381120e6/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 2c82dcc3d917c20926ea634368e9542e23b7ae4e7817b33542bbba01403d748d --- Real Ultimate output --- This is Ultimate 0.2.2-hotfix-svcomp22-839c364 [2021-12-06 17:14:28,170 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-06 17:14:28,172 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-06 17:14:28,193 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-06 17:14:28,193 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-06 17:14:28,194 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-06 17:14:28,195 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-06 17:14:28,197 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-06 17:14:28,198 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-06 17:14:28,199 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-06 17:14:28,200 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-06 17:14:28,201 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-06 17:14:28,201 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-06 17:14:28,202 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-06 17:14:28,203 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-06 17:14:28,204 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-06 17:14:28,205 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-06 17:14:28,206 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-06 17:14:28,221 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-06 17:14:28,223 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-06 17:14:28,225 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-06 17:14:28,227 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-06 17:14:28,228 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-06 17:14:28,229 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-06 17:14:28,233 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-06 17:14:28,234 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-06 17:14:28,234 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-06 17:14:28,235 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-06 17:14:28,236 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-06 17:14:28,237 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-06 17:14:28,238 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-06 17:14:28,239 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-06 17:14:28,239 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-06 17:14:28,240 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-06 17:14:28,241 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-06 17:14:28,242 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-06 17:14:28,242 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-06 17:14:28,243 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-06 17:14:28,243 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-06 17:14:28,244 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-06 17:14:28,244 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-06 17:14:28,245 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2662a6ff-d3be-4b57-a06a-2269381120e6/bin/uautomizer-DrprNOufMa/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2021-12-06 17:14:28,268 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-06 17:14:28,268 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-06 17:14:28,268 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-06 17:14:28,268 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-06 17:14:28,269 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-06 17:14:28,269 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-06 17:14:28,270 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-06 17:14:28,270 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-06 17:14:28,270 INFO L138 SettingsManager]: * Use SBE=true [2021-12-06 17:14:28,270 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-06 17:14:28,270 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-06 17:14:28,270 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-06 17:14:28,270 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-06 17:14:28,271 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-06 17:14:28,271 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-06 17:14:28,271 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-06 17:14:28,271 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-06 17:14:28,271 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-12-06 17:14:28,271 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-12-06 17:14:28,271 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-06 17:14:28,272 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-06 17:14:28,272 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-06 17:14:28,272 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-06 17:14:28,272 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-06 17:14:28,272 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-06 17:14:28,272 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-06 17:14:28,272 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-06 17:14:28,273 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-06 17:14:28,273 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-06 17:14:28,273 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-06 17:14:28,273 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-12-06 17:14:28,273 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-12-06 17:14:28,273 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-06 17:14:28,273 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-06 17:14:28,274 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-06 17:14:28,274 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-06 17:14:28,274 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-12-06 17:14:28,274 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_2662a6ff-d3be-4b57-a06a-2269381120e6/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_2662a6ff-d3be-4b57-a06a-2269381120e6/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 -> 2c82dcc3d917c20926ea634368e9542e23b7ae4e7817b33542bbba01403d748d [2021-12-06 17:14:28,506 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-06 17:14:28,522 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-06 17:14:28,525 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-06 17:14:28,526 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-06 17:14:28,526 INFO L275 PluginConnector]: CDTParser initialized [2021-12-06 17:14:28,528 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2662a6ff-d3be-4b57-a06a-2269381120e6/bin/uautomizer-DrprNOufMa/../../sv-benchmarks/c/nla-digbench-scaling/freire1_valuebound2.c [2021-12-06 17:14:28,570 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2662a6ff-d3be-4b57-a06a-2269381120e6/bin/uautomizer-DrprNOufMa/data/d76f082d4/fbae5a4c485043c1876c4a25ca212ede/FLAGd996637d7 [2021-12-06 17:14:28,943 INFO L306 CDTParser]: Found 1 translation units. [2021-12-06 17:14:28,944 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2662a6ff-d3be-4b57-a06a-2269381120e6/sv-benchmarks/c/nla-digbench-scaling/freire1_valuebound2.c [2021-12-06 17:14:28,948 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2662a6ff-d3be-4b57-a06a-2269381120e6/bin/uautomizer-DrprNOufMa/data/d76f082d4/fbae5a4c485043c1876c4a25ca212ede/FLAGd996637d7 [2021-12-06 17:14:28,958 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2662a6ff-d3be-4b57-a06a-2269381120e6/bin/uautomizer-DrprNOufMa/data/d76f082d4/fbae5a4c485043c1876c4a25ca212ede [2021-12-06 17:14:28,960 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-06 17:14:28,961 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-06 17:14:28,962 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-06 17:14:28,962 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-06 17:14:28,965 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-06 17:14:28,966 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 05:14:28" (1/1) ... [2021-12-06 17:14:28,966 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@67ede52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:14:28, skipping insertion in model container [2021-12-06 17:14:28,967 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 05:14:28" (1/1) ... [2021-12-06 17:14:28,971 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-06 17:14:28,981 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-06 17:14:29,077 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_2662a6ff-d3be-4b57-a06a-2269381120e6/sv-benchmarks/c/nla-digbench-scaling/freire1_valuebound2.c[712,725] [2021-12-06 17:14:29,088 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-06 17:14:29,096 INFO L203 MainTranslator]: Completed pre-run [2021-12-06 17:14:29,105 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_2662a6ff-d3be-4b57-a06a-2269381120e6/sv-benchmarks/c/nla-digbench-scaling/freire1_valuebound2.c[712,725] [2021-12-06 17:14:29,108 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-06 17:14:29,126 INFO L208 MainTranslator]: Completed translation [2021-12-06 17:14:29,126 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:14:29 WrapperNode [2021-12-06 17:14:29,127 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-06 17:14:29,127 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-06 17:14:29,127 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-06 17:14:29,128 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-06 17:14:29,135 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:14:29" (1/1) ... [2021-12-06 17:14:29,142 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:14:29" (1/1) ... [2021-12-06 17:14:29,159 INFO L137 Inliner]: procedures = 15, calls = 10, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 34 [2021-12-06 17:14:29,159 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-06 17:14:29,160 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-06 17:14:29,160 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-06 17:14:29,160 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-06 17:14:29,166 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:14:29" (1/1) ... [2021-12-06 17:14:29,166 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:14:29" (1/1) ... [2021-12-06 17:14:29,169 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:14:29" (1/1) ... [2021-12-06 17:14:29,169 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:14:29" (1/1) ... [2021-12-06 17:14:29,175 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:14:29" (1/1) ... [2021-12-06 17:14:29,178 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:14:29" (1/1) ... [2021-12-06 17:14:29,180 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:14:29" (1/1) ... [2021-12-06 17:14:29,183 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-06 17:14:29,184 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-06 17:14:29,184 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-06 17:14:29,184 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-06 17:14:29,185 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:14:29" (1/1) ... [2021-12-06 17:14:29,191 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-06 17:14:29,200 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2662a6ff-d3be-4b57-a06a-2269381120e6/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 17:14:29,210 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2662a6ff-d3be-4b57-a06a-2269381120e6/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-06 17:14:29,212 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2662a6ff-d3be-4b57-a06a-2269381120e6/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-06 17:14:29,239 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-06 17:14:29,239 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-12-06 17:14:29,239 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-06 17:14:29,239 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-06 17:14:29,239 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2021-12-06 17:14:29,239 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2021-12-06 17:14:29,284 INFO L236 CfgBuilder]: Building ICFG [2021-12-06 17:14:29,285 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-06 17:14:30,247 INFO L277 CfgBuilder]: Performing block encoding [2021-12-06 17:14:30,251 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-06 17:14:30,251 INFO L301 CfgBuilder]: Removed 1 assume(true) statements. [2021-12-06 17:14:30,253 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 05:14:30 BoogieIcfgContainer [2021-12-06 17:14:30,253 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-06 17:14:30,254 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-06 17:14:30,254 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-06 17:14:30,256 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-06 17:14:30,256 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 05:14:28" (1/3) ... [2021-12-06 17:14:30,257 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55734fdd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 05:14:30, skipping insertion in model container [2021-12-06 17:14:30,257 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:14:29" (2/3) ... [2021-12-06 17:14:30,257 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55734fdd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 05:14:30, skipping insertion in model container [2021-12-06 17:14:30,257 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 05:14:30" (3/3) ... [2021-12-06 17:14:30,258 INFO L111 eAbstractionObserver]: Analyzing ICFG freire1_valuebound2.c [2021-12-06 17:14:30,261 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-06 17:14:30,262 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-06 17:14:30,294 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-06 17:14:30,298 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-06 17:14:30,299 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-06 17:14:30,309 INFO L276 IsEmpty]: Start isEmpty. Operand has 18 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 14 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-06 17:14:30,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-12-06 17:14:30,312 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:14:30,312 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:14:30,313 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 17:14:30,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:14:30,317 INFO L85 PathProgramCache]: Analyzing trace with hash -589467074, now seen corresponding path program 1 times [2021-12-06 17:14:30,325 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 17:14:30,325 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2100407495] [2021-12-06 17:14:30,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:14:30,326 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 17:14:30,326 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2662a6ff-d3be-4b57-a06a-2269381120e6/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 17:14:30,327 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2662a6ff-d3be-4b57-a06a-2269381120e6/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 17:14:30,328 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2662a6ff-d3be-4b57-a06a-2269381120e6/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-12-06 17:14:30,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:14:30,658 INFO L263 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 1 conjunts are in the unsatisfiable core [2021-12-06 17:14:30,661 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 17:14:30,701 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-06 17:14:30,701 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 17:14:30,702 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 17:14:30,702 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2100407495] [2021-12-06 17:14:30,702 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2100407495] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:14:30,703 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 17:14:30,703 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-06 17:14:30,704 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669005932] [2021-12-06 17:14:30,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:14:30,707 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-12-06 17:14:30,708 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-06 17:14:30,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-12-06 17:14:30,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-06 17:14:30,729 INFO L87 Difference]: Start difference. First operand has 18 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 14 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:14:30,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:14:30,741 INFO L93 Difference]: Finished difference Result 33 states and 44 transitions. [2021-12-06 17:14:30,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-06 17:14:30,743 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2021-12-06 17:14:30,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:14:30,747 INFO L225 Difference]: With dead ends: 33 [2021-12-06 17:14:30,748 INFO L226 Difference]: Without dead ends: 14 [2021-12-06 17:14:30,750 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 8 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-06 17:14:30,752 INFO L933 BasicCegarLoop]: 19 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, 19 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-06 17:14:30,753 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-06 17:14:30,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2021-12-06 17:14:30,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2021-12-06 17:14:30,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 10 states have (on average 1.2) internal successors, (12), 11 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-06 17:14:30,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2021-12-06 17:14:30,778 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 9 [2021-12-06 17:14:30,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:14:30,778 INFO L470 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2021-12-06 17:14:30,778 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:14:30,779 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2021-12-06 17:14:30,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-12-06 17:14:30,779 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:14:30,779 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:14:30,794 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2662a6ff-d3be-4b57-a06a-2269381120e6/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2021-12-06 17:14:30,980 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2662a6ff-d3be-4b57-a06a-2269381120e6/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-06 17:14:30,980 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 17:14:30,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:14:30,981 INFO L85 PathProgramCache]: Analyzing trace with hash 1187327748, now seen corresponding path program 1 times [2021-12-06 17:14:30,982 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 17:14:30,982 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [50977048] [2021-12-06 17:14:30,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:14:30,982 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 17:14:30,982 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2662a6ff-d3be-4b57-a06a-2269381120e6/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 17:14:30,983 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2662a6ff-d3be-4b57-a06a-2269381120e6/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 17:14:30,984 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2662a6ff-d3be-4b57-a06a-2269381120e6/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-12-06 17:14:31,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:14:31,733 INFO L263 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 9 conjunts are in the unsatisfiable core [2021-12-06 17:14:31,735 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 17:15:24,301 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| (_ FloatingPoint 11 53))) (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32))) (.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32)))) (and (fp.leq |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| .cse0) (fp.geq |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| .cse1) (let ((.cse2 (= ((_ fp.to_sbv 32) roundTowardZero (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven .cse1 |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1|) .cse1) (fp.mul roundNearestTiesToEven .cse0 (fp.div roundNearestTiesToEven |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| ((_ to_fp 11 53) roundNearestTiesToEven 2.0))))) (_ bv0 32)))) (or (and .cse2 (= (_ bv1 32) |c___VERIFIER_assert_#in~cond|)) (and (not .cse2) (= |c___VERIFIER_assert_#in~cond| (_ bv0 32)))))))) is different from true [2021-12-06 17:16:04,274 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| (_ FloatingPoint 11 53))) (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32))) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (and (let ((.cse0 (= ((_ fp.to_sbv 32) roundTowardZero (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven .cse1 |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1|) .cse1) (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| ((_ to_fp 11 53) roundNearestTiesToEven 2.0))))) (_ bv0 32)))) (or (and (not .cse0) (= c___VERIFIER_assert_~cond (_ bv0 32))) (and .cse0 (= c___VERIFIER_assert_~cond (_ bv1 32))))) (fp.leq |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| .cse2) (fp.geq |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| .cse1)))) is different from true [2021-12-06 17:16:20,504 WARN L838 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| (_ FloatingPoint 11 53))) (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32))) (.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (and (not (= ((_ fp.to_sbv 32) roundTowardZero (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven .cse0 |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1|) .cse0) (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| ((_ to_fp 11 53) roundNearestTiesToEven 2.0))))) (_ bv0 32))) (fp.leq |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| .cse1) (fp.geq |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| .cse0)))) is different from false [2021-12-06 17:16:22,540 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| (_ FloatingPoint 11 53))) (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32))) (.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (and (not (= ((_ fp.to_sbv 32) roundTowardZero (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven .cse0 |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1|) .cse0) (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| ((_ to_fp 11 53) roundNearestTiesToEven 2.0))))) (_ bv0 32))) (fp.leq |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| .cse1) (fp.geq |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| .cse0)))) is different from true [2021-12-06 17:16:22,541 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-06 17:16:22,541 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-06 17:16:22,541 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 17:16:22,541 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [50977048] [2021-12-06 17:16:22,542 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [50977048] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 17:16:22,542 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 17:16:22,542 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-06 17:16:22,542 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893305581] [2021-12-06 17:16:22,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 17:16:22,543 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-06 17:16:22,543 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-06 17:16:22,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-06 17:16:22,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=19, Unknown=4, NotChecked=30, Total=72 [2021-12-06 17:16:22,545 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand has 9 states, 8 states have (on average 1.0) internal successors, (8), 7 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:16:36,043 WARN L227 SmtUtils]: Spent 12.88s on a formula simplification. DAG size of input: 28 DAG size of output: 21 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-06 17:16:37,738 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.48s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-06 17:16:39,937 WARN L838 $PredicateComparison]: unable to prove that (and (= c_currentRoundingMode roundNearestTiesToEven) (exists ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| (_ FloatingPoint 11 53))) (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32))) (.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32)))) (and (fp.leq |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| .cse0) (fp.geq |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| .cse1) (let ((.cse2 (= ((_ fp.to_sbv 32) roundTowardZero (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven .cse1 |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1|) .cse1) (fp.mul roundNearestTiesToEven .cse0 (fp.div roundNearestTiesToEven |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| ((_ to_fp 11 53) roundNearestTiesToEven 2.0))))) (_ bv0 32)))) (or (and .cse2 (= (_ bv1 32) |c___VERIFIER_assert_#in~cond|)) (and (not .cse2) (= |c___VERIFIER_assert_#in~cond| (_ bv0 32))))))))) is different from false [2021-12-06 17:16:41,971 WARN L860 $PredicateComparison]: unable to prove that (and (= c_currentRoundingMode roundNearestTiesToEven) (exists ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| (_ FloatingPoint 11 53))) (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32))) (.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32)))) (and (fp.leq |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| .cse0) (fp.geq |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| .cse1) (let ((.cse2 (= ((_ fp.to_sbv 32) roundTowardZero (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven .cse1 |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1|) .cse1) (fp.mul roundNearestTiesToEven .cse0 (fp.div roundNearestTiesToEven |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| ((_ to_fp 11 53) roundNearestTiesToEven 2.0))))) (_ bv0 32)))) (or (and .cse2 (= (_ bv1 32) |c___VERIFIER_assert_#in~cond|)) (and (not .cse2) (= |c___VERIFIER_assert_#in~cond| (_ bv0 32))))))))) is different from true [2021-12-06 17:16:43,610 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.37s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-06 17:16:45,730 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-06 17:16:47,947 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-06 17:16:49,954 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-06 17:16:50,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:16:50,225 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2021-12-06 17:16:50,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-06 17:16:50,234 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.0) internal successors, (8), 7 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2021-12-06 17:16:50,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:16:50,235 INFO L225 Difference]: With dead ends: 28 [2021-12-06 17:16:50,235 INFO L226 Difference]: Without dead ends: 24 [2021-12-06 17:16:50,235 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 31.8s TimeCoverageRelationStatistics Valid=33, Invalid=33, Unknown=6, NotChecked=60, Total=132 [2021-12-06 17:16:50,237 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 18 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 6 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 74 IncrementalHoareTripleChecker+Unchecked, 10.2s IncrementalHoareTripleChecker+Time [2021-12-06 17:16:50,237 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 31 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 11 Invalid, 3 Unknown, 74 Unchecked, 10.2s Time] [2021-12-06 17:16:50,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2021-12-06 17:16:50,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 22. [2021-12-06 17:16:50,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 16 states have (on average 1.1875) internal successors, (19), 16 states have internal predecessors, (19), 4 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-06 17:16:50,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2021-12-06 17:16:50,243 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 9 [2021-12-06 17:16:50,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:16:50,243 INFO L470 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2021-12-06 17:16:50,243 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.0) internal successors, (8), 7 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-06 17:16:50,243 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2021-12-06 17:16:50,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-12-06 17:16:50,244 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:16:50,244 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:16:50,258 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2662a6ff-d3be-4b57-a06a-2269381120e6/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (3)] Ended with exit code 0 [2021-12-06 17:16:50,445 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2662a6ff-d3be-4b57-a06a-2269381120e6/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-06 17:16:50,446 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 17:16:50,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:16:50,449 INFO L85 PathProgramCache]: Analyzing trace with hash -713464030, now seen corresponding path program 1 times [2021-12-06 17:16:50,450 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 17:16:50,450 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2060893433] [2021-12-06 17:16:50,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:16:50,451 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 17:16:50,452 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2662a6ff-d3be-4b57-a06a-2269381120e6/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 17:16:50,454 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2662a6ff-d3be-4b57-a06a-2269381120e6/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 17:16:50,457 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2662a6ff-d3be-4b57-a06a-2269381120e6/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-12-06 17:16:50,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:16:50,809 INFO L263 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-06 17:16:50,810 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 17:16:57,050 WARN L838 $PredicateComparison]: unable to prove that (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (bvmul |c_ULTIMATE.start_main_~r~0#1| |c_ULTIMATE.start_main_~r~0#1|)) |c_ULTIMATE.start_main_~a~0#1|) ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~r~0#1|)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) |c_ULTIMATE.start_main_~x~0#1|))) (_ bv0 32)) is different from false [2021-12-06 17:16:59,108 WARN L860 $PredicateComparison]: unable to prove that (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (bvmul |c_ULTIMATE.start_main_~r~0#1| |c_ULTIMATE.start_main_~r~0#1|)) |c_ULTIMATE.start_main_~a~0#1|) ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~r~0#1|)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) |c_ULTIMATE.start_main_~x~0#1|))) (_ bv0 32)) is different from true [2021-12-06 17:17:11,521 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_2| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2| (_ BitVec 32)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_2| (_ FloatingPoint 11 53)) (currentRoundingMode RoundingMode)) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add currentRoundingMode (fp.sub currentRoundingMode (fp.sub currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_2|) ((_ to_fp 11 53) currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2|)) (fp.mul currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (_ bv2 32)) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_2|))) (_ bv0 32))) (= (_ bv1 32) |c___VERIFIER_assert_#in~cond|)) is different from false [2021-12-06 17:17:19,785 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_2| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2| (_ BitVec 32)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_2| (_ FloatingPoint 11 53)) (currentRoundingMode RoundingMode)) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add currentRoundingMode (fp.sub currentRoundingMode (fp.sub currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_2|) ((_ to_fp 11 53) currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2|)) (fp.mul currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (_ bv2 32)) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_2|))) (_ bv0 32))) (= c___VERIFIER_assert_~cond (_ bv1 32))) is different from false [2021-12-06 17:17:19,796 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2021-12-06 17:17:19,796 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 17:17:44,786 WARN L227 SmtUtils]: Spent 16.65s on a formula simplification that was a NOOP. DAG size: 26 (called from [L 234] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2021-12-06 17:18:01,443 WARN L227 SmtUtils]: Spent 16.66s on a formula simplification that was a NOOP. DAG size: 26 (called from [L 271] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2021-12-06 17:18:09,734 WARN L860 $PredicateComparison]: unable to prove that (or (forall ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3| (_ BitVec 32)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_3| (_ FloatingPoint 11 53)) (currentRoundingMode RoundingMode)) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add currentRoundingMode (fp.sub currentRoundingMode (fp.sub currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3|) ((_ to_fp 11 53) currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3|)) (fp.mul currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (_ bv2 32)) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_3|))) (_ bv0 32))) (not (= |c___VERIFIER_assert_#in~cond| (_ bv0 32)))) is different from true [2021-12-06 17:18:24,239 WARN L860 $PredicateComparison]: unable to prove that (or (= c___VERIFIER_assert_~cond (_ bv0 32)) (forall ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3| (_ BitVec 32)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_3| (_ FloatingPoint 11 53)) (currentRoundingMode RoundingMode)) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add currentRoundingMode (fp.sub currentRoundingMode (fp.sub currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3|) ((_ to_fp 11 53) currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3|)) (fp.mul currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (_ bv2 32)) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_3|))) (_ bv0 32))) (not (= |c___VERIFIER_assert_#in~cond| (_ bv0 32)))) is different from true [2021-12-06 17:18:24,247 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2021-12-06 17:18:24,247 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 17:18:24,247 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2060893433] [2021-12-06 17:18:24,248 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2060893433] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 17:18:24,248 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-06 17:18:24,248 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2021-12-06 17:18:24,248 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950051625] [2021-12-06 17:18:24,248 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-06 17:18:24,249 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-06 17:18:24,249 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-06 17:18:24,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-06 17:18:24,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=17, Unknown=6, NotChecked=50, Total=90 [2021-12-06 17:18:24,250 INFO L87 Difference]: Start difference. First operand 22 states and 25 transitions. Second operand has 10 states, 10 states have (on average 1.7) internal successors, (17), 9 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-06 17:18:26,400 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.15s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-06 17:18:28,405 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-06 17:18:30,543 WARN L860 $PredicateComparison]: unable to prove that (and (= c___VERIFIER_assert_~cond |c___VERIFIER_assert_#in~cond|) (or (= c___VERIFIER_assert_~cond (_ bv0 32)) (forall ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3| (_ BitVec 32)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_3| (_ FloatingPoint 11 53)) (currentRoundingMode RoundingMode)) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add currentRoundingMode (fp.sub currentRoundingMode (fp.sub currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3|) ((_ to_fp 11 53) currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3|)) (fp.mul currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (_ bv2 32)) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_3|))) (_ bv0 32))) (not (= |c___VERIFIER_assert_#in~cond| (_ bv0 32))))) is different from true [2021-12-06 17:18:32,608 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (not (= |c___VERIFIER_assert_#in~cond| (_ bv0 32))))) (and (or (forall ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3| (_ BitVec 32)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_3| (_ FloatingPoint 11 53)) (currentRoundingMode RoundingMode)) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add currentRoundingMode (fp.sub currentRoundingMode (fp.sub currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3|) ((_ to_fp 11 53) currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3|)) (fp.mul currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (_ bv2 32)) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_3|))) (_ bv0 32))) .cse0) .cse0)) is different from true [2021-12-06 17:18:34,672 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_2| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2| (_ BitVec 32)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_2| (_ FloatingPoint 11 53)) (currentRoundingMode RoundingMode)) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add currentRoundingMode (fp.sub currentRoundingMode (fp.sub currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_2|) ((_ to_fp 11 53) currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2|)) (fp.mul currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (_ bv2 32)) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_2|))) (_ bv0 32))) (not (= |c___VERIFIER_assert_#in~cond| (_ bv0 32))) (= (_ bv1 32) |c___VERIFIER_assert_#in~cond|)) is different from false [2021-12-06 17:18:36,740 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (= c___VERIFIER_assert_~cond (_ bv0 32)))) (and (= c___VERIFIER_assert_~cond |c___VERIFIER_assert_#in~cond|) (not .cse0) (exists ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_2| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2| (_ BitVec 32)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_2| (_ FloatingPoint 11 53)) (currentRoundingMode RoundingMode)) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add currentRoundingMode (fp.sub currentRoundingMode (fp.sub currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_2|) ((_ to_fp 11 53) currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2|)) (fp.mul currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (_ bv2 32)) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_2|))) (_ bv0 32))) (or .cse0 (forall ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3| (_ BitVec 32)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_3| (_ FloatingPoint 11 53)) (currentRoundingMode RoundingMode)) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add currentRoundingMode (fp.sub currentRoundingMode (fp.sub currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3|) ((_ to_fp 11 53) currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3|)) (fp.mul currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (_ bv2 32)) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_3|))) (_ bv0 32))) (not (= |c___VERIFIER_assert_#in~cond| (_ bv0 32)))) (= c___VERIFIER_assert_~cond (_ bv1 32)))) is different from false [2021-12-06 17:18:38,802 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (= c___VERIFIER_assert_~cond (_ bv0 32)))) (and (= c___VERIFIER_assert_~cond |c___VERIFIER_assert_#in~cond|) (not .cse0) (exists ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_2| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2| (_ BitVec 32)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_2| (_ FloatingPoint 11 53)) (currentRoundingMode RoundingMode)) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add currentRoundingMode (fp.sub currentRoundingMode (fp.sub currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_2|) ((_ to_fp 11 53) currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2|)) (fp.mul currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (_ bv2 32)) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_2|))) (_ bv0 32))) (or .cse0 (forall ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3| (_ BitVec 32)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_3| (_ FloatingPoint 11 53)) (currentRoundingMode RoundingMode)) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add currentRoundingMode (fp.sub currentRoundingMode (fp.sub currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3|) ((_ to_fp 11 53) currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3|)) (fp.mul currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (_ bv2 32)) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_3|))) (_ bv0 32))) (not (= |c___VERIFIER_assert_#in~cond| (_ bv0 32)))) (= c___VERIFIER_assert_~cond (_ bv1 32)))) is different from true [2021-12-06 17:18:38,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:18:38,804 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2021-12-06 17:18:38,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-06 17:18:38,804 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.7) internal successors, (17), 9 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 15 [2021-12-06 17:18:38,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:18:38,805 INFO L225 Difference]: With dead ends: 26 [2021-12-06 17:18:38,805 INFO L226 Difference]: Without dead ends: 18 [2021-12-06 17:18:38,805 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 22.8s TimeCoverageRelationStatistics Valid=25, Invalid=20, Unknown=11, NotChecked=126, Total=182 [2021-12-06 17:18:38,807 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 0 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 43 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2021-12-06 17:18:38,807 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 41 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 2 Unknown, 43 Unchecked, 4.2s Time] [2021-12-06 17:18:38,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2021-12-06 17:18:38,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2021-12-06 17:18:38,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-06 17:18:38,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2021-12-06 17:18:38,812 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 15 [2021-12-06 17:18:38,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:18:38,813 INFO L470 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2021-12-06 17:18:38,813 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.7) internal successors, (17), 9 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-06 17:18:38,813 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2021-12-06 17:18:38,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-12-06 17:18:38,814 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:18:38,814 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 17:18:38,830 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2662a6ff-d3be-4b57-a06a-2269381120e6/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (4)] Ended with exit code 0 [2021-12-06 17:18:39,015 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2662a6ff-d3be-4b57-a06a-2269381120e6/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-06 17:18:39,016 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 17:18:39,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:18:39,018 INFO L85 PathProgramCache]: Analyzing trace with hash -610823942, now seen corresponding path program 1 times [2021-12-06 17:18:39,019 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 17:18:39,020 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1232880006] [2021-12-06 17:18:39,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 17:18:39,021 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 17:18:39,021 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2662a6ff-d3be-4b57-a06a-2269381120e6/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 17:18:39,023 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2662a6ff-d3be-4b57-a06a-2269381120e6/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 17:18:39,026 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2662a6ff-d3be-4b57-a06a-2269381120e6/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-12-06 17:18:41,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 17:18:41,145 INFO L263 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 12 conjunts are in the unsatisfiable core [2021-12-06 17:18:41,146 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 17:18:54,391 WARN L227 SmtUtils]: Spent 5.35s on a formula simplification that was a NOOP. DAG size: 18 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-06 17:19:35,409 WARN L227 SmtUtils]: Spent 9.25s on a formula simplification that was a NOOP. DAG size: 21 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-06 17:20:45,095 WARN L838 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_5| (_ FloatingPoint 11 53))) (let ((.cse3 (fp.div roundNearestTiesToEven |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_5| ((_ to_fp 11 53) roundNearestTiesToEven 2.0))) (.cse4 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32))) (.cse2 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32)))) (and (let ((.cse0 (= ((_ fp.to_sbv 32) roundTowardZero (fp.add roundNearestTiesToEven (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32)))) (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven .cse1 |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_5|) .cse1)) (fp.mul roundNearestTiesToEven .cse2 (fp.sub roundNearestTiesToEven .cse3 .cse4)))) (_ bv0 32)))) (or (and (not .cse0) (= |c___VERIFIER_assert_#in~cond| (_ bv0 32))) (and .cse0 (= (_ bv1 32) |c___VERIFIER_assert_#in~cond|)))) (fp.gt .cse3 .cse4) (fp.leq |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_5| .cse2)))) is different from false [2021-12-06 17:20:47,142 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_5| (_ FloatingPoint 11 53))) (let ((.cse3 (fp.div roundNearestTiesToEven |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_5| ((_ to_fp 11 53) roundNearestTiesToEven 2.0))) (.cse4 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32))) (.cse2 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32)))) (and (let ((.cse0 (= ((_ fp.to_sbv 32) roundTowardZero (fp.add roundNearestTiesToEven (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32)))) (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven .cse1 |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_5|) .cse1)) (fp.mul roundNearestTiesToEven .cse2 (fp.sub roundNearestTiesToEven .cse3 .cse4)))) (_ bv0 32)))) (or (and (not .cse0) (= |c___VERIFIER_assert_#in~cond| (_ bv0 32))) (and .cse0 (= (_ bv1 32) |c___VERIFIER_assert_#in~cond|)))) (fp.gt .cse3 .cse4) (fp.leq |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_5| .cse2)))) is different from true [2021-12-06 17:21:42,614 WARN L838 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_5| (_ FloatingPoint 11 53))) (let ((.cse0 (fp.div roundNearestTiesToEven |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_5| ((_ to_fp 11 53) roundNearestTiesToEven 2.0))) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32))) (.cse4 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32)))) (and (fp.gt .cse0 .cse1) (let ((.cse2 (= ((_ fp.to_sbv 32) roundTowardZero (fp.add roundNearestTiesToEven (let ((.cse3 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32)))) (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven .cse3 |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_5|) .cse3)) (fp.mul roundNearestTiesToEven .cse4 (fp.sub roundNearestTiesToEven .cse0 .cse1)))) (_ bv0 32)))) (or (and .cse2 (= c___VERIFIER_assert_~cond (_ bv1 32))) (and (= c___VERIFIER_assert_~cond (_ bv0 32)) (not .cse2)))) (fp.leq |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_5| .cse4)))) is different from false [2021-12-06 17:21:44,661 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_5| (_ FloatingPoint 11 53))) (let ((.cse0 (fp.div roundNearestTiesToEven |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_5| ((_ to_fp 11 53) roundNearestTiesToEven 2.0))) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32))) (.cse4 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32)))) (and (fp.gt .cse0 .cse1) (let ((.cse2 (= ((_ fp.to_sbv 32) roundTowardZero (fp.add roundNearestTiesToEven (let ((.cse3 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32)))) (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven .cse3 |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_5|) .cse3)) (fp.mul roundNearestTiesToEven .cse4 (fp.sub roundNearestTiesToEven .cse0 .cse1)))) (_ bv0 32)))) (or (and .cse2 (= c___VERIFIER_assert_~cond (_ bv1 32))) (and (= c___VERIFIER_assert_~cond (_ bv0 32)) (not .cse2)))) (fp.leq |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_5| .cse4)))) is different from true [2021-12-06 17:22:01,398 WARN L838 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_5| (_ FloatingPoint 11 53))) (let ((.cse0 (fp.div roundNearestTiesToEven |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_5| ((_ to_fp 11 53) roundNearestTiesToEven 2.0))) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32))) (.cse3 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32)))) (and (fp.gt .cse0 .cse1) (not (= ((_ fp.to_sbv 32) roundTowardZero (fp.add roundNearestTiesToEven (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32)))) (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven .cse2 |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_5|) .cse2)) (fp.mul roundNearestTiesToEven .cse3 (fp.sub roundNearestTiesToEven .cse0 .cse1)))) (_ bv0 32))) (fp.leq |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_5| .cse3)))) is different from false [2021-12-06 17:22:03,444 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_5| (_ FloatingPoint 11 53))) (let ((.cse0 (fp.div roundNearestTiesToEven |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_5| ((_ to_fp 11 53) roundNearestTiesToEven 2.0))) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32))) (.cse3 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32)))) (and (fp.gt .cse0 .cse1) (not (= ((_ fp.to_sbv 32) roundTowardZero (fp.add roundNearestTiesToEven (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32)))) (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven .cse2 |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_5|) .cse2)) (fp.mul roundNearestTiesToEven .cse3 (fp.sub roundNearestTiesToEven .cse0 .cse1)))) (_ bv0 32))) (fp.leq |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_5| .cse3)))) is different from true [2021-12-06 17:22:03,445 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2021-12-06 17:22:03,445 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 17:22:12,874 WARN L838 $PredicateComparison]: unable to prove that (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (bvmul |c_ULTIMATE.start_main_~r~0#1| |c_ULTIMATE.start_main_~r~0#1|)) |c_ULTIMATE.start_main_~a~0#1|) ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~r~0#1|)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) |c_ULTIMATE.start_main_~x~0#1|))) (_ bv0 32)) is different from false [2021-12-06 17:22:14,936 WARN L860 $PredicateComparison]: unable to prove that (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (bvmul |c_ULTIMATE.start_main_~r~0#1| |c_ULTIMATE.start_main_~r~0#1|)) |c_ULTIMATE.start_main_~a~0#1|) ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~r~0#1|)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) |c_ULTIMATE.start_main_~x~0#1|))) (_ bv0 32)) is different from true [2021-12-06 17:22:29,580 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~r~0#1|))) (or (not (fp.gt |c_ULTIMATE.start_main_~x~0#1| .cse0)) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~r~0#1| (_ bv1 32)))) (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (bvmul .cse1 .cse1)) |c_ULTIMATE.start_main_~a~0#1|) ((_ to_fp 11 53) c_currentRoundingMode .cse1))) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse0)))) (_ bv0 32)))) is different from false [2021-12-06 17:22:31,659 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~r~0#1|))) (or (not (fp.gt |c_ULTIMATE.start_main_~x~0#1| .cse0)) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~r~0#1| (_ bv1 32)))) (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (bvmul .cse1 .cse1)) |c_ULTIMATE.start_main_~a~0#1|) ((_ to_fp 11 53) c_currentRoundingMode .cse1))) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse0)))) (_ bv0 32)))) is different from true [2021-12-06 17:22:58,986 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~a~0#1| ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (or (not (fp.gt .cse0 .cse1)) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode (_ bv1 32)))) (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode .cse2 |c_ULTIMATE.start_main_~a~0#1|) .cse2)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) (fp.sub c_currentRoundingMode .cse0 .cse1)))) (_ bv0 32)))) is different from false [2021-12-06 17:23:01,049 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~a~0#1| ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (or (not (fp.gt .cse0 .cse1)) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode (_ bv1 32)))) (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode .cse2 |c_ULTIMATE.start_main_~a~0#1|) .cse2)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) (fp.sub c_currentRoundingMode .cse0 .cse1)))) (_ bv0 32)))) is different from true [2021-12-06 17:23:15,731 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~a~0#1| ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (or (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv0 32)) (not (fp.gt .cse0 .cse1)) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode (_ bv1 32)))) (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode .cse2 |c_ULTIMATE.start_main_~a~0#1|) .cse2)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) (fp.sub c_currentRoundingMode .cse0 .cse1)))) (_ bv0 32)))) is different from false [2021-12-06 17:23:17,793 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~a~0#1| ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (or (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv0 32)) (not (fp.gt .cse0 .cse1)) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode (_ bv1 32)))) (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode .cse2 |c_ULTIMATE.start_main_~a~0#1|) .cse2)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) (fp.sub c_currentRoundingMode .cse0 .cse1)))) (_ bv0 32)))) is different from true [2021-12-06 17:23:33,434 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~a~0#1_10| (_ FloatingPoint 11 53))) (let ((.cse2 (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~a~0#1_10| ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (.cse3 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)))) (or (= (_ bv0 32) ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv1 32)))) (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~a~0#1_10|) .cse0)) (fp.mul c_currentRoundingMode .cse1 (fp.sub c_currentRoundingMode .cse2 .cse3))))) (not (fp.gt .cse2 .cse3)) (not (fp.leq |v_ULTIMATE.start_main_~a~0#1_10| .cse1))))) is different from false [2021-12-06 17:23:35,500 WARN L860 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~a~0#1_10| (_ FloatingPoint 11 53))) (let ((.cse2 (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~a~0#1_10| ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (.cse3 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)))) (or (= (_ bv0 32) ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv1 32)))) (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~a~0#1_10|) .cse0)) (fp.mul c_currentRoundingMode .cse1 (fp.sub c_currentRoundingMode .cse2 .cse3))))) (not (fp.gt .cse2 .cse3)) (not (fp.leq |v_ULTIMATE.start_main_~a~0#1_10| .cse1))))) is different from true [2021-12-06 17:23:35,501 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2021-12-06 17:23:35,501 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 17:23:35,501 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1232880006] [2021-12-06 17:23:35,502 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1232880006] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-06 17:23:35,502 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-06 17:23:35,502 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 17 [2021-12-06 17:23:35,502 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625056726] [2021-12-06 17:23:35,502 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-06 17:23:35,503 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-12-06 17:23:35,503 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-06 17:23:35,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-12-06 17:23:35,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=50, Unknown=17, NotChecked=168, Total=272 [2021-12-06 17:23:35,504 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand has 17 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 15 states have internal predecessors, (26), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-06 17:23:37,571 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~a~0#1_10| (_ FloatingPoint 11 53))) (let ((.cse2 (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~a~0#1_10| ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (.cse3 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)))) (or (= (_ bv0 32) ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv1 32)))) (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~a~0#1_10|) .cse0)) (fp.mul c_currentRoundingMode .cse1 (fp.sub c_currentRoundingMode .cse2 .cse3))))) (not (fp.gt .cse2 .cse3)) (not (fp.leq |v_ULTIMATE.start_main_~a~0#1_10| .cse1))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2021-12-06 17:23:39,641 WARN L860 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~a~0#1_10| (_ FloatingPoint 11 53))) (let ((.cse2 (fp.div c_currentRoundingMode |v_ULTIMATE.start_main_~a~0#1_10| ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (.cse3 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)))) (or (= (_ bv0 32) ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv1 32)))) (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode .cse0 |v_ULTIMATE.start_main_~a~0#1_10|) .cse0)) (fp.mul c_currentRoundingMode .cse1 (fp.sub c_currentRoundingMode .cse2 .cse3))))) (not (fp.gt .cse2 .cse3)) (not (fp.leq |v_ULTIMATE.start_main_~a~0#1_10| .cse1))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2021-12-06 17:23:41,715 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv0 32))) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (.cse4 ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)))) (and (let ((.cse1 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~a~0#1| ((_ to_fp 11 53) c_currentRoundingMode 2.0)))) (or .cse0 (not (fp.gt .cse1 .cse2)) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode (_ bv1 32)))) (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode .cse3 |c_ULTIMATE.start_main_~a~0#1|) .cse3)) (fp.mul c_currentRoundingMode .cse4 (fp.sub c_currentRoundingMode .cse1 .cse2)))) (_ bv0 32)))) (= c_currentRoundingMode roundNearestTiesToEven) (let ((.cse6 (fp.leq |c_ULTIMATE.start_main_~a~0#1| .cse4)) (.cse5 (fp.geq |c_ULTIMATE.start_main_~a~0#1| .cse2))) (or (and .cse5 .cse6 (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv1 32))) (and .cse0 (or (not .cse6) (not .cse5))))))) is different from false [2021-12-06 17:23:43,783 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv0 32))) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (.cse4 ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)))) (and (let ((.cse1 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~a~0#1| ((_ to_fp 11 53) c_currentRoundingMode 2.0)))) (or .cse0 (not (fp.gt .cse1 .cse2)) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode (_ bv1 32)))) (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode .cse3 |c_ULTIMATE.start_main_~a~0#1|) .cse3)) (fp.mul c_currentRoundingMode .cse4 (fp.sub c_currentRoundingMode .cse1 .cse2)))) (_ bv0 32)))) (= c_currentRoundingMode roundNearestTiesToEven) (let ((.cse6 (fp.leq |c_ULTIMATE.start_main_~a~0#1| .cse4)) (.cse5 (fp.geq |c_ULTIMATE.start_main_~a~0#1| .cse2))) (or (and .cse5 .cse6 (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv1 32))) (and .cse0 (or (not .cse6) (not .cse5))))))) is different from true [2021-12-06 17:23:45,852 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32))) (.cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (and (fp.geq |c_ULTIMATE.start_main_~a~0#1| .cse0) (fp.leq |c_ULTIMATE.start_main_~a~0#1| .cse1) (= c_currentRoundingMode roundNearestTiesToEven) (let ((.cse2 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~a~0#1| ((_ to_fp 11 53) c_currentRoundingMode 2.0)))) (or (not (fp.gt .cse2 .cse0)) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode (_ bv1 32)))) (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode .cse3 |c_ULTIMATE.start_main_~a~0#1|) .cse3)) (fp.mul c_currentRoundingMode .cse1 (fp.sub c_currentRoundingMode .cse2 .cse0)))) (_ bv0 32)))))) is different from false [2021-12-06 17:23:47,917 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32))) (.cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (and (fp.geq |c_ULTIMATE.start_main_~a~0#1| .cse0) (fp.leq |c_ULTIMATE.start_main_~a~0#1| .cse1) (= c_currentRoundingMode roundNearestTiesToEven) (let ((.cse2 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~a~0#1| ((_ to_fp 11 53) c_currentRoundingMode 2.0)))) (or (not (fp.gt .cse2 .cse0)) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode (_ bv1 32)))) (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode .cse3 |c_ULTIMATE.start_main_~a~0#1|) .cse3)) (fp.mul c_currentRoundingMode .cse1 (fp.sub c_currentRoundingMode .cse2 .cse0)))) (_ bv0 32)))))) is different from true [2021-12-06 17:23:49,983 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)))) (and (= |c_ULTIMATE.start_main_~r~0#1| (_ bv0 32)) (fp.geq |c_ULTIMATE.start_main_~a~0#1| ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (= |c_ULTIMATE.start_main_~x~0#1| (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~a~0#1| ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~r~0#1|))) (or (not (fp.gt |c_ULTIMATE.start_main_~x~0#1| .cse0)) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~r~0#1| (_ bv1 32)))) (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (bvmul .cse1 .cse1)) |c_ULTIMATE.start_main_~a~0#1|) ((_ to_fp 11 53) c_currentRoundingMode .cse1))) (fp.mul c_currentRoundingMode .cse2 (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse0)))) (_ bv0 32)))) (fp.leq |c_ULTIMATE.start_main_~a~0#1| .cse2) (= c_currentRoundingMode roundNearestTiesToEven))) is different from false [2021-12-06 17:23:52,059 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)))) (and (= |c_ULTIMATE.start_main_~r~0#1| (_ bv0 32)) (fp.geq |c_ULTIMATE.start_main_~a~0#1| ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (= |c_ULTIMATE.start_main_~x~0#1| (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~a~0#1| ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~r~0#1|))) (or (not (fp.gt |c_ULTIMATE.start_main_~x~0#1| .cse0)) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~r~0#1| (_ bv1 32)))) (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (bvmul .cse1 .cse1)) |c_ULTIMATE.start_main_~a~0#1|) ((_ to_fp 11 53) c_currentRoundingMode .cse1))) (fp.mul c_currentRoundingMode .cse2 (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| .cse0)))) (_ bv0 32)))) (fp.leq |c_ULTIMATE.start_main_~a~0#1| .cse2) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2021-12-06 17:23:54,198 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32))) (.cse1 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~a~0#1| ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode (bvadd (_ bv4294967295 32) |c_ULTIMATE.start_main_~r~0#1|)))) (and (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (bvmul |c_ULTIMATE.start_main_~r~0#1| |c_ULTIMATE.start_main_~r~0#1|)) |c_ULTIMATE.start_main_~a~0#1|) ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~r~0#1|)) (fp.mul c_currentRoundingMode .cse0 |c_ULTIMATE.start_main_~x~0#1|))) (_ bv0 32)) (fp.gt .cse1 .cse2) (= |c_ULTIMATE.start_main_~r~0#1| (_ bv1 32)) (fp.leq |c_ULTIMATE.start_main_~a~0#1| .cse0) (= (fp.sub c_currentRoundingMode .cse1 .cse2) |c_ULTIMATE.start_main_~x~0#1|) (= c_currentRoundingMode roundNearestTiesToEven))) is different from false [2021-12-06 17:23:56,288 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32))) (.cse1 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~a~0#1| ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode (bvadd (_ bv4294967295 32) |c_ULTIMATE.start_main_~r~0#1|)))) (and (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (bvmul |c_ULTIMATE.start_main_~r~0#1| |c_ULTIMATE.start_main_~r~0#1|)) |c_ULTIMATE.start_main_~a~0#1|) ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~r~0#1|)) (fp.mul c_currentRoundingMode .cse0 |c_ULTIMATE.start_main_~x~0#1|))) (_ bv0 32)) (fp.gt .cse1 .cse2) (= |c_ULTIMATE.start_main_~r~0#1| (_ bv1 32)) (fp.leq |c_ULTIMATE.start_main_~a~0#1| .cse0) (= (fp.sub c_currentRoundingMode .cse1 .cse2) |c_ULTIMATE.start_main_~x~0#1|) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2021-12-06 17:23:58,358 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_5| (_ FloatingPoint 11 53))) (let ((.cse3 (fp.div roundNearestTiesToEven |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_5| ((_ to_fp 11 53) roundNearestTiesToEven 2.0))) (.cse4 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32))) (.cse2 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32)))) (and (let ((.cse0 (= ((_ fp.to_sbv 32) roundTowardZero (fp.add roundNearestTiesToEven (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32)))) (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven .cse1 |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_5|) .cse1)) (fp.mul roundNearestTiesToEven .cse2 (fp.sub roundNearestTiesToEven .cse3 .cse4)))) (_ bv0 32)))) (or (and (not .cse0) (= |c___VERIFIER_assert_#in~cond| (_ bv0 32))) (and .cse0 (= (_ bv1 32) |c___VERIFIER_assert_#in~cond|)))) (fp.gt .cse3 .cse4) (fp.leq |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_5| .cse2)))) (not (= |c___VERIFIER_assert_#in~cond| (_ bv0 32)))) is different from false [2021-12-06 17:24:00,431 WARN L838 $PredicateComparison]: unable to prove that (and (not (= c___VERIFIER_assert_~cond (_ bv0 32))) (exists ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_5| (_ FloatingPoint 11 53))) (let ((.cse0 (fp.div roundNearestTiesToEven |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_5| ((_ to_fp 11 53) roundNearestTiesToEven 2.0))) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32))) (.cse4 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32)))) (and (fp.gt .cse0 .cse1) (let ((.cse2 (= ((_ fp.to_sbv 32) roundTowardZero (fp.add roundNearestTiesToEven (let ((.cse3 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32)))) (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven .cse3 |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_5|) .cse3)) (fp.mul roundNearestTiesToEven .cse4 (fp.sub roundNearestTiesToEven .cse0 .cse1)))) (_ bv0 32)))) (or (and .cse2 (= c___VERIFIER_assert_~cond (_ bv1 32))) (and (= c___VERIFIER_assert_~cond (_ bv0 32)) (not .cse2)))) (fp.leq |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_5| .cse4))))) is different from false [2021-12-06 17:24:00,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 17:24:00,445 INFO L93 Difference]: Finished difference Result 26 states and 27 transitions. [2021-12-06 17:24:00,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-06 17:24:00,446 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 15 states have internal predecessors, (26), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 16 [2021-12-06 17:24:00,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 17:24:00,448 INFO L225 Difference]: With dead ends: 26 [2021-12-06 17:24:00,448 INFO L226 Difference]: Without dead ends: 24 [2021-12-06 17:24:00,449 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 15 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 88.2s TimeCoverageRelationStatistics Valid=55, Invalid=66, Unknown=29, NotChecked=450, Total=600 [2021-12-06 17:24:00,450 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 1 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 76 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-06 17:24:00,450 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 30 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 76 Unchecked, 0.0s Time] [2021-12-06 17:24:00,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2021-12-06 17:24:00,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2021-12-06 17:24:00,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 18 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-06 17:24:00,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2021-12-06 17:24:00,456 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 16 [2021-12-06 17:24:00,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 17:24:00,456 INFO L470 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2021-12-06 17:24:00,457 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 15 states have internal predecessors, (26), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-06 17:24:00,457 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2021-12-06 17:24:00,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-12-06 17:24:00,457 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 17:24:00,458 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2021-12-06 17:24:00,480 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2662a6ff-d3be-4b57-a06a-2269381120e6/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (5)] Ended with exit code 0 [2021-12-06 17:24:00,658 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2662a6ff-d3be-4b57-a06a-2269381120e6/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 [2021-12-06 17:24:00,660 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 17:24:00,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 17:24:00,661 INFO L85 PathProgramCache]: Analyzing trace with hash -1159254460, now seen corresponding path program 2 times [2021-12-06 17:24:00,662 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-06 17:24:00,662 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [413160993] [2021-12-06 17:24:00,663 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-06 17:24:00,663 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-06 17:24:00,664 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2662a6ff-d3be-4b57-a06a-2269381120e6/bin/uautomizer-DrprNOufMa/mathsat [2021-12-06 17:24:00,666 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2662a6ff-d3be-4b57-a06a-2269381120e6/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-06 17:24:00,668 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2662a6ff-d3be-4b57-a06a-2269381120e6/bin/uautomizer-DrprNOufMa/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2021-12-06 17:24:01,817 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-06 17:24:01,818 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-06 17:24:01,878 INFO L263 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 14 conjunts are in the unsatisfiable core [2021-12-06 17:24:01,880 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 17:24:14,770 WARN L227 SmtUtils]: Spent 6.47s on a formula simplification that was a NOOP. DAG size: 18 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-06 17:24:39,438 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~a~0#1| ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode (bvadd (_ bv4294967295 32) |c_ULTIMATE.start_main_~r~0#1|)))) (and (fp.gt .cse0 .cse1) (= |c_ULTIMATE.start_main_~r~0#1| (_ bv1 32)) (fp.leq |c_ULTIMATE.start_main_~a~0#1| ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32))) (= (fp.sub c_currentRoundingMode .cse0 .cse1) |c_ULTIMATE.start_main_~x~0#1|) (= c_currentRoundingMode roundNearestTiesToEven))) is different from false [2021-12-06 17:25:26,961 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.sub c_currentRoundingMode (fp.div c_currentRoundingMode |c_ULTIMATE.start_main_~a~0#1| ((_ to_fp 11 53) c_currentRoundingMode 2.0)) ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode (_ bv1 32)))) (and (fp.gt .cse0 .cse1) (= (fp.sub c_currentRoundingMode .cse0 .cse1) |c_ULTIMATE.start_main_~x~0#1|) (fp.leq |c_ULTIMATE.start_main_~a~0#1| ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from false [2021-12-06 17:27:01,136 WARN L838 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_9| (_ FloatingPoint 11 53))) (and (or (and (= |c___VERIFIER_assert_#in~cond| (_ bv0 32)) (exists ((|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_9| (_ BitVec 32))) (not (= ((_ fp.to_sbv 32) roundTowardZero (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_9| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_9|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_9|) ((_ to_fp 11 53) roundNearestTiesToEven |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_9|)) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32)) (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.div roundNearestTiesToEven |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_9| ((_ to_fp 11 53) roundNearestTiesToEven 2.0)) ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32))) ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32)))))) (_ bv0 32))))) (and (exists ((|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_9| (_ BitVec 32))) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_9| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_9|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_9|) ((_ to_fp 11 53) roundNearestTiesToEven |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_9|)) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32)) (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.div roundNearestTiesToEven |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_9| ((_ to_fp 11 53) roundNearestTiesToEven 2.0)) ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32))) ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32)))))) (_ bv0 32))) (= (_ bv1 32) |c___VERIFIER_assert_#in~cond|))) (fp.leq |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_9| ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32))) (fp.gt (fp.sub roundNearestTiesToEven (fp.div roundNearestTiesToEven |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_9| ((_ to_fp 11 53) roundNearestTiesToEven 2.0)) ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32))) ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32))))) is different from false [2021-12-06 17:27:03,209 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_9| (_ FloatingPoint 11 53))) (and (or (and (= |c___VERIFIER_assert_#in~cond| (_ bv0 32)) (exists ((|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_9| (_ BitVec 32))) (not (= ((_ fp.to_sbv 32) roundTowardZero (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_9| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_9|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_9|) ((_ to_fp 11 53) roundNearestTiesToEven |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_9|)) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32)) (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.div roundNearestTiesToEven |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_9| ((_ to_fp 11 53) roundNearestTiesToEven 2.0)) ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32))) ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32)))))) (_ bv0 32))))) (and (exists ((|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_9| (_ BitVec 32))) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_9| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_9|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_9|) ((_ to_fp 11 53) roundNearestTiesToEven |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_9|)) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32)) (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.div roundNearestTiesToEven |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_9| ((_ to_fp 11 53) roundNearestTiesToEven 2.0)) ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32))) ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32)))))) (_ bv0 32))) (= (_ bv1 32) |c___VERIFIER_assert_#in~cond|))) (fp.leq |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_9| ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32))) (fp.gt (fp.sub roundNearestTiesToEven (fp.div roundNearestTiesToEven |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_9| ((_ to_fp 11 53) roundNearestTiesToEven 2.0)) ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32))) ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32))))) is different from true [2021-12-06 17:28:06,219 WARN L838 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_9| (_ FloatingPoint 11 53))) (and (fp.leq |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_9| ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32))) (or (and (exists ((|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_9| (_ BitVec 32))) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_9| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_9|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_9|) ((_ to_fp 11 53) roundNearestTiesToEven |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_9|)) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32)) (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.div roundNearestTiesToEven |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_9| ((_ to_fp 11 53) roundNearestTiesToEven 2.0)) ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32))) ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32)))))) (_ bv0 32))) (= c___VERIFIER_assert_~cond (_ bv1 32))) (and (= c___VERIFIER_assert_~cond (_ bv0 32)) (exists ((|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_9| (_ BitVec 32))) (not (= ((_ fp.to_sbv 32) roundTowardZero (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_9| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_9|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_9|) ((_ to_fp 11 53) roundNearestTiesToEven |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_9|)) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32)) (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.div roundNearestTiesToEven |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_9| ((_ to_fp 11 53) roundNearestTiesToEven 2.0)) ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32))) ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32)))))) (_ bv0 32)))))) (fp.gt (fp.sub roundNearestTiesToEven (fp.div roundNearestTiesToEven |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_9| ((_ to_fp 11 53) roundNearestTiesToEven 2.0)) ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32))) ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32))))) is different from false [2021-12-06 17:28:08,292 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_9| (_ FloatingPoint 11 53))) (and (fp.leq |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_9| ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32))) (or (and (exists ((|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_9| (_ BitVec 32))) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_9| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_9|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_9|) ((_ to_fp 11 53) roundNearestTiesToEven |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_9|)) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32)) (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.div roundNearestTiesToEven |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_9| ((_ to_fp 11 53) roundNearestTiesToEven 2.0)) ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32))) ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32)))))) (_ bv0 32))) (= c___VERIFIER_assert_~cond (_ bv1 32))) (and (= c___VERIFIER_assert_~cond (_ bv0 32)) (exists ((|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_9| (_ BitVec 32))) (not (= ((_ fp.to_sbv 32) roundTowardZero (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_9| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_9|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_9|) ((_ to_fp 11 53) roundNearestTiesToEven |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_9|)) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32)) (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.div roundNearestTiesToEven |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_9| ((_ to_fp 11 53) roundNearestTiesToEven 2.0)) ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32))) ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32)))))) (_ bv0 32)))))) (fp.gt (fp.sub roundNearestTiesToEven (fp.div roundNearestTiesToEven |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_9| ((_ to_fp 11 53) roundNearestTiesToEven 2.0)) ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32))) ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32))))) is different from true [2021-12-06 17:28:29,580 WARN L838 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_9| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_9| (_ BitVec 32))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32))) (.cse1 (fp.sub roundNearestTiesToEven (fp.div roundNearestTiesToEven |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_9| ((_ to_fp 11 53) roundNearestTiesToEven 2.0)) ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (.cse2 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32)))) (and (not (= ((_ fp.to_sbv 32) roundTowardZero (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_9| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_9|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_9|) ((_ to_fp 11 53) roundNearestTiesToEven |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_9|)) (fp.mul roundNearestTiesToEven .cse0 (fp.sub roundNearestTiesToEven .cse1 .cse2)))) (_ bv0 32))) (fp.leq |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_9| .cse0) (fp.gt .cse1 .cse2)))) is different from false [2021-12-06 17:28:31,660 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_9| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_9| (_ BitVec 32))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32))) (.cse1 (fp.sub roundNearestTiesToEven (fp.div roundNearestTiesToEven |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_9| ((_ to_fp 11 53) roundNearestTiesToEven 2.0)) ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (.cse2 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32)))) (and (not (= ((_ fp.to_sbv 32) roundTowardZero (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_9| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_9|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_9|) ((_ to_fp 11 53) roundNearestTiesToEven |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_9|)) (fp.mul roundNearestTiesToEven .cse0 (fp.sub roundNearestTiesToEven .cse1 .cse2)))) (_ bv0 32))) (fp.leq |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_9| .cse0) (fp.gt .cse1 .cse2)))) is different from true [2021-12-06 17:28:31,660 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 11 not checked. [2021-12-06 17:28:31,660 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-06 17:28:38,194 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~r~0#1| (_ BitVec 32))) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (bvmul |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~r~0#1|)) |c_ULTIMATE.start_main_~a~0#1|) ((_ to_fp 11 53) c_currentRoundingMode |ULTIMATE.start_main_~r~0#1|)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) |c_ULTIMATE.start_main_~x~0#1|))) (_ bv0 32))) is different from false [2021-12-06 17:28:40,256 WARN L860 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~r~0#1| (_ BitVec 32))) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (bvmul |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~r~0#1|)) |c_ULTIMATE.start_main_~a~0#1|) ((_ to_fp 11 53) c_currentRoundingMode |ULTIMATE.start_main_~r~0#1|)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) |c_ULTIMATE.start_main_~x~0#1|))) (_ bv0 32))) is different from true [2021-12-06 17:28:51,535 WARN L860 $PredicateComparison]: unable to prove that (or (not (fp.gt |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~r~0#1|))) (forall ((|v_ULTIMATE.start_main_~r~0#1_19| (_ BitVec 32))) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_19| |v_ULTIMATE.start_main_~r~0#1_19|)) |c_ULTIMATE.start_main_~a~0#1|) ((_ to_fp 11 53) c_currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_19|)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) (fp.sub c_currentRoundingMode |c_ULTIMATE.start_main_~x~0#1| ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~r~0#1|))))) (_ bv0 32)))) is different from true [2021-12-06 17:28:56,079 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-06 17:28:56,080 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [413160993] [2021-12-06 17:28:56,080 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [413160993] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-06 17:28:56,080 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1466658821] [2021-12-06 17:28:56,080 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-06 17:28:56,080 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-12-06 17:28:56,080 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2662a6ff-d3be-4b57-a06a-2269381120e6/bin/uautomizer-DrprNOufMa/cvc4 [2021-12-06 17:28:56,081 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2662a6ff-d3be-4b57-a06a-2269381120e6/bin/uautomizer-DrprNOufMa/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-12-06 17:28:56,083 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2662a6ff-d3be-4b57-a06a-2269381120e6/bin/uautomizer-DrprNOufMa/cvc4 --incremental --print-success --lang smt (7)] Waiting until timeout for monitored process [2021-12-06 17:28:57,123 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-06 17:28:57,123 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-06 17:28:57,130 INFO L263 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-06 17:28:57,131 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-06 17:29:34,402 WARN L227 SmtUtils]: Spent 6.24s on a formula simplification that was a NOOP. DAG size: 22 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-06 17:29:57,167 WARN L838 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~a~0#1| (_ FloatingPoint 11 53))) (and (fp.leq |ULTIMATE.start_main_~a~0#1| ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32))) (fp.gt (fp.sub roundNearestTiesToEven (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~a~0#1| ((_ to_fp 11 53) roundNearestTiesToEven 2.0)) ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32))) ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32))))) is different from false [2021-12-06 17:29:59,188 WARN L860 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~a~0#1| (_ FloatingPoint 11 53))) (and (fp.leq |ULTIMATE.start_main_~a~0#1| ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32))) (fp.gt (fp.sub roundNearestTiesToEven (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~a~0#1| ((_ to_fp 11 53) roundNearestTiesToEven 2.0)) ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32))) ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32))))) is different from true