./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/nla-digbench-scaling/knuth_valuebound10.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 7b2dab56 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_849c3f1d-6965-49ab-afb9-2a4df5ccf9fc/bin/utaipan/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_849c3f1d-6965-49ab-afb9-2a4df5ccf9fc/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_849c3f1d-6965-49ab-afb9-2a4df5ccf9fc/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_849c3f1d-6965-49ab-afb9-2a4df5ccf9fc/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/nla-digbench-scaling/knuth_valuebound10.i -s /tmp/vcloud-vcloud-master/worker/run_dir_849c3f1d-6965-49ab-afb9-2a4df5ccf9fc/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_849c3f1d-6965-49ab-afb9-2a4df5ccf9fc/bin/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d553ea9f9bdcb2c71addc52be09760b206bf9b79 ......................................................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_849c3f1d-6965-49ab-afb9-2a4df5ccf9fc/bin/utaipan/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_849c3f1d-6965-49ab-afb9-2a4df5ccf9fc/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_849c3f1d-6965-49ab-afb9-2a4df5ccf9fc/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_849c3f1d-6965-49ab-afb9-2a4df5ccf9fc/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/nla-digbench-scaling/knuth_valuebound10.i -s /tmp/vcloud-vcloud-master/worker/run_dir_849c3f1d-6965-49ab-afb9-2a4df5ccf9fc/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_849c3f1d-6965-49ab-afb9-2a4df5ccf9fc/bin/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d553ea9f9bdcb2c71addc52be09760b206bf9b79 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN --- Real Ultimate output --- This is Ultimate 0.2.0-7b2dab5 [2020-12-09 06:11:46,920 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-09 06:11:46,922 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-09 06:11:46,965 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-09 06:11:46,965 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-09 06:11:46,966 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-09 06:11:46,968 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-09 06:11:46,970 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-09 06:11:46,972 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-09 06:11:46,973 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-09 06:11:46,974 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-09 06:11:46,976 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-09 06:11:46,976 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-09 06:11:46,977 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-09 06:11:46,978 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-09 06:11:46,980 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-09 06:11:46,980 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-09 06:11:46,981 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-09 06:11:46,983 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-09 06:11:46,985 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-09 06:11:46,987 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-09 06:11:46,989 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-09 06:11:46,990 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-09 06:11:46,991 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-09 06:11:46,994 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-09 06:11:46,994 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-09 06:11:46,994 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-09 06:11:46,995 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-09 06:11:46,996 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-09 06:11:46,997 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-09 06:11:46,997 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-09 06:11:46,998 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-09 06:11:46,999 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-09 06:11:47,000 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-09 06:11:47,001 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-09 06:11:47,001 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-09 06:11:47,002 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-09 06:11:47,002 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-09 06:11:47,002 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-09 06:11:47,003 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-09 06:11:47,004 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-09 06:11:47,005 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_849c3f1d-6965-49ab-afb9-2a4df5ccf9fc/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2020-12-09 06:11:47,026 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-09 06:11:47,027 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-09 06:11:47,027 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2020-12-09 06:11:47,028 INFO L138 SettingsManager]: * User list type=DISABLED [2020-12-09 06:11:47,028 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2020-12-09 06:11:47,028 INFO L138 SettingsManager]: * Explicit value domain=true [2020-12-09 06:11:47,028 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2020-12-09 06:11:47,028 INFO L138 SettingsManager]: * Octagon Domain=false [2020-12-09 06:11:47,028 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2020-12-09 06:11:47,029 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2020-12-09 06:11:47,029 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2020-12-09 06:11:47,029 INFO L138 SettingsManager]: * Interval Domain=false [2020-12-09 06:11:47,029 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2020-12-09 06:11:47,029 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2020-12-09 06:11:47,030 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2020-12-09 06:11:47,030 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-09 06:11:47,031 INFO L138 SettingsManager]: * sizeof long=4 [2020-12-09 06:11:47,031 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-09 06:11:47,031 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-12-09 06:11:47,031 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-09 06:11:47,031 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-09 06:11:47,031 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-09 06:11:47,032 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-09 06:11:47,032 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2020-12-09 06:11:47,032 INFO L138 SettingsManager]: * sizeof long double=12 [2020-12-09 06:11:47,032 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-09 06:11:47,032 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-09 06:11:47,032 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-09 06:11:47,033 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-09 06:11:47,033 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-09 06:11:47,033 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-09 06:11:47,033 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-09 06:11:47,033 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-09 06:11:47,034 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-09 06:11:47,034 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2020-12-09 06:11:47,034 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-09 06:11:47,034 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-09 06:11:47,034 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-09 06:11:47,034 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-12-09 06:11:47,035 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud-vcloud-master/worker/run_dir_849c3f1d-6965-49ab-afb9-2a4df5ccf9fc/bin/utaipan/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-vcloud-master/worker/run_dir_849c3f1d-6965-49ab-afb9-2a4df5ccf9fc/bin/utaipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d553ea9f9bdcb2c71addc52be09760b206bf9b79 [2020-12-09 06:11:47,216 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-09 06:11:47,236 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-09 06:11:47,238 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-09 06:11:47,239 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-09 06:11:47,239 INFO L275 PluginConnector]: CDTParser initialized [2020-12-09 06:11:47,240 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_849c3f1d-6965-49ab-afb9-2a4df5ccf9fc/bin/utaipan/../../sv-benchmarks/c/nla-digbench-scaling/knuth_valuebound10.i [2020-12-09 06:11:47,281 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_849c3f1d-6965-49ab-afb9-2a4df5ccf9fc/bin/utaipan/data/4002ec381/0414c2bad4b84fe5b76a67d8842a1d5d/FLAG8b307bab7 [2020-12-09 06:11:47,639 INFO L306 CDTParser]: Found 1 translation units. [2020-12-09 06:11:47,639 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_849c3f1d-6965-49ab-afb9-2a4df5ccf9fc/sv-benchmarks/c/nla-digbench-scaling/knuth_valuebound10.i [2020-12-09 06:11:47,644 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_849c3f1d-6965-49ab-afb9-2a4df5ccf9fc/bin/utaipan/data/4002ec381/0414c2bad4b84fe5b76a67d8842a1d5d/FLAG8b307bab7 [2020-12-09 06:11:47,654 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_849c3f1d-6965-49ab-afb9-2a4df5ccf9fc/bin/utaipan/data/4002ec381/0414c2bad4b84fe5b76a67d8842a1d5d [2020-12-09 06:11:47,655 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-09 06:11:47,656 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-09 06:11:47,658 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-09 06:11:47,658 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-09 06:11:47,660 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-09 06:11:47,661 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 06:11:47" (1/1) ... [2020-12-09 06:11:47,662 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@121f3083 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:11:47, skipping insertion in model container [2020-12-09 06:11:47,663 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 06:11:47" (1/1) ... [2020-12-09 06:11:47,667 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-09 06:11:47,682 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-09 06:11:47,788 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud-vcloud-master/worker/run_dir_849c3f1d-6965-49ab-afb9-2a4df5ccf9fc/sv-benchmarks/c/nla-digbench-scaling/knuth_valuebound10.i[948,961] [2020-12-09 06:11:47,802 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator has thrown an exception: java.lang.UnsupportedOperationException: floating point operation not supported in non-bitprecise translation: sqrt at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.expressiontranslation.IntegerTranslation.constructOtherUnaryFloatOperation(IntegerTranslation.java:846) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.standardfunctions.StandardFunctionHandler.handleUnaryFloatFunction(StandardFunctionHandler.java:1710) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.standardfunctions.StandardFunctionHandler.translateStandardFunction(StandardFunctionHandler.java:234) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1402) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:267) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:707) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:282) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1353) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:220) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1046) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:232) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.FunctionHandler.handleFunctionDefinition(FunctionHandler.java:372) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1424) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:155) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.processTUchild(CHandler.java:3213) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:2293) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:580) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:134) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainTranslator.translate(MainTranslator.java:192) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainTranslator.run(MainTranslator.java:115) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainTranslator.(MainTranslator.java:93) at de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver.finish(CACSL2BoogieTranslatorObserver.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2020-12-09 06:11:47,806 INFO L168 Benchmark]: Toolchain (without parser) took 148.49 ms. Allocated memory is still 100.7 MB. Free memory was 60.1 MB in the beginning and 78.0 MB in the end (delta: -17.9 MB). Peak memory consumption was 9.1 MB. Max. memory is 16.1 GB. [2020-12-09 06:11:47,807 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 100.7 MB. Free memory was 76.3 MB in the beginning and 76.2 MB in the end (delta: 136.4 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-12-09 06:11:47,808 INFO L168 Benchmark]: CACSL2BoogieTranslator took 146.66 ms. Allocated memory is still 100.7 MB. Free memory was 59.9 MB in the beginning and 78.0 MB in the end (delta: -18.2 MB). Peak memory consumption was 9.1 MB. Max. memory is 16.1 GB. [2020-12-09 06:11:47,810 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.17 ms. Allocated memory is still 100.7 MB. Free memory was 76.3 MB in the beginning and 76.2 MB in the end (delta: 136.4 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 146.66 ms. Allocated memory is still 100.7 MB. Free memory was 59.9 MB in the beginning and 78.0 MB in the end (delta: -18.2 MB). Peak memory consumption was 9.1 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - ExceptionOrErrorResult: UnsupportedOperationException: floating point operation not supported in non-bitprecise translation: sqrt de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: UnsupportedOperationException: floating point operation not supported in non-bitprecise translation: sqrt: de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.expressiontranslation.IntegerTranslation.constructOtherUnaryFloatOperation(IntegerTranslation.java:846) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.2.0-7b2dab5 [2020-12-09 06:11:49,141 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-09 06:11:49,143 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-09 06:11:49,172 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-09 06:11:49,173 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-09 06:11:49,174 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-09 06:11:49,176 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-09 06:11:49,178 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-09 06:11:49,180 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-09 06:11:49,182 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-09 06:11:49,183 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-09 06:11:49,184 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-09 06:11:49,185 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-09 06:11:49,186 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-09 06:11:49,187 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-09 06:11:49,188 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-09 06:11:49,189 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-09 06:11:49,190 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-09 06:11:49,192 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-09 06:11:49,195 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-09 06:11:49,196 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-09 06:11:49,198 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-09 06:11:49,199 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-09 06:11:49,200 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-09 06:11:49,202 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-09 06:11:49,202 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-09 06:11:49,203 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-09 06:11:49,203 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-09 06:11:49,204 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-09 06:11:49,205 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-09 06:11:49,205 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-09 06:11:49,206 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-09 06:11:49,207 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-09 06:11:49,207 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-09 06:11:49,208 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-09 06:11:49,208 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-09 06:11:49,209 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-09 06:11:49,209 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-09 06:11:49,210 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-09 06:11:49,210 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-09 06:11:49,211 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-09 06:11:49,212 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_849c3f1d-6965-49ab-afb9-2a4df5ccf9fc/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2020-12-09 06:11:49,235 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-09 06:11:49,235 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-09 06:11:49,236 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2020-12-09 06:11:49,236 INFO L138 SettingsManager]: * User list type=DISABLED [2020-12-09 06:11:49,236 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2020-12-09 06:11:49,236 INFO L138 SettingsManager]: * Explicit value domain=true [2020-12-09 06:11:49,237 INFO L138 SettingsManager]: * Octagon Domain=false [2020-12-09 06:11:49,237 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2020-12-09 06:11:49,237 INFO L138 SettingsManager]: * Interval Domain=false [2020-12-09 06:11:49,237 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-09 06:11:49,238 INFO L138 SettingsManager]: * sizeof long=4 [2020-12-09 06:11:49,238 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-12-09 06:11:49,238 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-09 06:11:49,238 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-09 06:11:49,238 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-09 06:11:49,238 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-09 06:11:49,238 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2020-12-09 06:11:49,239 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2020-12-09 06:11:49,239 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2020-12-09 06:11:49,239 INFO L138 SettingsManager]: * sizeof long double=12 [2020-12-09 06:11:49,239 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-09 06:11:49,239 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-09 06:11:49,239 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-09 06:11:49,239 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-09 06:11:49,240 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-12-09 06:11:49,240 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-09 06:11:49,240 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-09 06:11:49,240 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-09 06:11:49,240 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-09 06:11:49,240 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-09 06:11:49,240 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2020-12-09 06:11:49,241 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2020-12-09 06:11:49,241 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-09 06:11:49,241 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-09 06:11:49,241 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-12-09 06:11:49,241 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-vcloud-master/worker/run_dir_849c3f1d-6965-49ab-afb9-2a4df5ccf9fc/bin/utaipan/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-vcloud-master/worker/run_dir_849c3f1d-6965-49ab-afb9-2a4df5ccf9fc/bin/utaipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d553ea9f9bdcb2c71addc52be09760b206bf9b79 [2020-12-09 06:11:49,457 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-09 06:11:49,473 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-09 06:11:49,475 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-09 06:11:49,476 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-09 06:11:49,476 INFO L275 PluginConnector]: CDTParser initialized [2020-12-09 06:11:49,477 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_849c3f1d-6965-49ab-afb9-2a4df5ccf9fc/bin/utaipan/../../sv-benchmarks/c/nla-digbench-scaling/knuth_valuebound10.i [2020-12-09 06:11:49,518 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_849c3f1d-6965-49ab-afb9-2a4df5ccf9fc/bin/utaipan/data/1cbccc5f7/482b9a4fa52f4d11b47aa65dabf93c58/FLAG7ef1446a6 [2020-12-09 06:11:49,899 INFO L306 CDTParser]: Found 1 translation units. [2020-12-09 06:11:49,899 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_849c3f1d-6965-49ab-afb9-2a4df5ccf9fc/sv-benchmarks/c/nla-digbench-scaling/knuth_valuebound10.i [2020-12-09 06:11:49,905 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_849c3f1d-6965-49ab-afb9-2a4df5ccf9fc/bin/utaipan/data/1cbccc5f7/482b9a4fa52f4d11b47aa65dabf93c58/FLAG7ef1446a6 [2020-12-09 06:11:49,915 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_849c3f1d-6965-49ab-afb9-2a4df5ccf9fc/bin/utaipan/data/1cbccc5f7/482b9a4fa52f4d11b47aa65dabf93c58 [2020-12-09 06:11:49,917 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-09 06:11:49,918 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-09 06:11:49,919 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-09 06:11:49,919 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-09 06:11:49,923 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-09 06:11:49,923 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 06:11:49" (1/1) ... [2020-12-09 06:11:49,925 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@55cb4f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:11:49, skipping insertion in model container [2020-12-09 06:11:49,925 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 06:11:49" (1/1) ... [2020-12-09 06:11:49,932 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-09 06:11:49,950 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-09 06:11:50,043 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud-vcloud-master/worker/run_dir_849c3f1d-6965-49ab-afb9-2a4df5ccf9fc/sv-benchmarks/c/nla-digbench-scaling/knuth_valuebound10.i[948,961] [2020-12-09 06:11:50,065 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-09 06:11:50,074 INFO L203 MainTranslator]: Completed pre-run [2020-12-09 06:11:50,088 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud-vcloud-master/worker/run_dir_849c3f1d-6965-49ab-afb9-2a4df5ccf9fc/sv-benchmarks/c/nla-digbench-scaling/knuth_valuebound10.i[948,961] [2020-12-09 06:11:50,109 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-09 06:11:50,126 INFO L208 MainTranslator]: Completed translation [2020-12-09 06:11:50,126 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:11:50 WrapperNode [2020-12-09 06:11:50,126 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-09 06:11:50,127 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-09 06:11:50,127 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-09 06:11:50,127 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-09 06:11:50,133 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:11:50" (1/1) ... [2020-12-09 06:11:50,140 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:11:50" (1/1) ... [2020-12-09 06:11:50,157 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-09 06:11:50,157 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-09 06:11:50,157 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-09 06:11:50,157 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-09 06:11:50,163 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:11:50" (1/1) ... [2020-12-09 06:11:50,163 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:11:50" (1/1) ... [2020-12-09 06:11:50,166 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:11:50" (1/1) ... [2020-12-09 06:11:50,166 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:11:50" (1/1) ... [2020-12-09 06:11:50,172 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:11:50" (1/1) ... [2020-12-09 06:11:50,175 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:11:50" (1/1) ... [2020-12-09 06:11:50,177 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:11:50" (1/1) ... [2020-12-09 06:11:50,179 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-09 06:11:50,180 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-09 06:11:50,180 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-09 06:11:50,180 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-09 06:11:50,181 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:11:50" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_849c3f1d-6965-49ab-afb9-2a4df5ccf9fc/bin/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-09 06:11:50,238 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2020-12-09 06:11:50,238 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-09 06:11:50,238 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-09 06:11:50,238 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-09 06:11:53,230 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-09 06:11:53,230 INFO L299 CfgBuilder]: Removed 21 assume(true) statements. [2020-12-09 06:11:53,231 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 06:11:53 BoogieIcfgContainer [2020-12-09 06:11:53,231 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-09 06:11:53,232 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-09 06:11:53,233 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-09 06:11:53,234 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-09 06:11:53,235 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 06:11:49" (1/3) ... [2020-12-09 06:11:53,235 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b59e82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 06:11:53, skipping insertion in model container [2020-12-09 06:11:53,235 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:11:50" (2/3) ... [2020-12-09 06:11:53,236 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b59e82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 06:11:53, skipping insertion in model container [2020-12-09 06:11:53,236 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 06:11:53" (3/3) ... [2020-12-09 06:11:53,237 INFO L111 eAbstractionObserver]: Analyzing ICFG knuth_valuebound10.i [2020-12-09 06:11:53,246 INFO L180 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-09 06:11:53,248 INFO L192 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2020-12-09 06:11:53,255 INFO L253 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2020-12-09 06:11:53,270 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-09 06:11:53,271 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-09 06:11:53,271 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-09 06:11:53,271 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-09 06:11:53,271 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-09 06:11:53,271 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-09 06:11:53,271 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-09 06:11:53,271 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-09 06:11:53,279 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states. [2020-12-09 06:11:53,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-12-09 06:11:53,282 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 06:11:53,283 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 06:11:53,283 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 06:11:53,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 06:11:53,286 INFO L82 PathProgramCache]: Analyzing trace with hash -144177098, now seen corresponding path program 1 times [2020-12-09 06:11:53,294 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 06:11:53,294 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [453080868] [2020-12-09 06:11:53,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_849c3f1d-6965-49ab-afb9-2a4df5ccf9fc/bin/utaipan/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2020-12-09 06:11:53,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 06:11:53,583 INFO L263 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 1 conjunts are in the unsatisfiable core [2020-12-09 06:11:53,586 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 06:11:53,604 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 06:11:53,604 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 06:11:53,605 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [453080868] [2020-12-09 06:11:53,605 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 06:11:53,606 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-09 06:11:53,609 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648241490] [2020-12-09 06:11:53,612 INFO L461 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-12-09 06:11:53,612 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 06:11:53,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-12-09 06:11:53,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-12-09 06:11:53,622 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 2 states. [2020-12-09 06:11:53,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 06:11:53,633 INFO L93 Difference]: Finished difference Result 65 states and 90 transitions. [2020-12-09 06:11:53,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-12-09 06:11:53,634 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 13 [2020-12-09 06:11:53,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 06:11:53,640 INFO L225 Difference]: With dead ends: 65 [2020-12-09 06:11:53,640 INFO L226 Difference]: Without dead ends: 30 [2020-12-09 06:11:53,642 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-12-09 06:11:53,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2020-12-09 06:11:53,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2020-12-09 06:11:53,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-12-09 06:11:53,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2020-12-09 06:11:53,665 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 13 [2020-12-09 06:11:53,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 06:11:53,665 INFO L481 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2020-12-09 06:11:53,665 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-12-09 06:11:53,665 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2020-12-09 06:11:53,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-12-09 06:11:53,665 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 06:11:53,666 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 06:11:53,866 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2020-12-09 06:11:53,867 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 06:11:53,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 06:11:53,867 INFO L82 PathProgramCache]: Analyzing trace with hash -1281167042, now seen corresponding path program 1 times [2020-12-09 06:11:53,868 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 06:11:53,868 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1628307421] [2020-12-09 06:11:53,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_849c3f1d-6965-49ab-afb9-2a4df5ccf9fc/bin/utaipan/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2020-12-09 06:11:54,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 06:11:54,570 INFO L263 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 16 conjunts are in the unsatisfiable core [2020-12-09 06:11:54,571 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 06:11:54,906 WARN L197 SmtUtils]: Spent 298.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 12 [2020-12-09 06:11:55,387 WARN L197 SmtUtils]: Spent 368.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 15 [2020-12-09 06:11:55,769 WARN L197 SmtUtils]: Spent 186.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2020-12-09 06:11:57,209 WARN L197 SmtUtils]: Spent 606.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2020-12-09 06:11:57,235 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 06:11:57,244 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:11:57,252 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 06:11:57,968 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 06:11:57,968 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 06:11:57,969 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1628307421] [2020-12-09 06:11:57,969 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 06:11:57,969 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-12-09 06:11:57,969 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018659547] [2020-12-09 06:11:57,970 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-12-09 06:11:57,970 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 06:11:57,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-12-09 06:11:57,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2020-12-09 06:11:57,972 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand 10 states. [2020-12-09 06:11:58,480 WARN L197 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 7 [2020-12-09 06:11:58,973 WARN L197 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 9 [2020-12-09 06:11:59,766 WARN L197 SmtUtils]: Spent 338.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 11 [2020-12-09 06:12:04,917 WARN L197 SmtUtils]: Spent 743.00 ms on a formula simplification that was a NOOP. DAG size: 30 [2020-12-09 06:12:10,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 06:12:10,579 INFO L93 Difference]: Finished difference Result 50 states and 56 transitions. [2020-12-09 06:12:10,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-12-09 06:12:10,588 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 13 [2020-12-09 06:12:10,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 06:12:10,589 INFO L225 Difference]: With dead ends: 50 [2020-12-09 06:12:10,589 INFO L226 Difference]: Without dead ends: 48 [2020-12-09 06:12:10,590 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2020-12-09 06:12:10,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2020-12-09 06:12:10,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 32. [2020-12-09 06:12:10,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-12-09 06:12:10,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2020-12-09 06:12:10,596 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 13 [2020-12-09 06:12:10,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 06:12:10,597 INFO L481 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2020-12-09 06:12:10,597 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-12-09 06:12:10,597 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2020-12-09 06:12:10,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-12-09 06:12:10,597 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 06:12:10,598 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 06:12:10,798 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2020-12-09 06:12:10,800 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 06:12:10,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 06:12:10,802 INFO L82 PathProgramCache]: Analyzing trace with hash 1454243009, now seen corresponding path program 1 times [2020-12-09 06:12:10,803 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 06:12:10,804 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1975503741] [2020-12-09 06:12:10,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_849c3f1d-6965-49ab-afb9-2a4df5ccf9fc/bin/utaipan/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2020-12-09 06:12:11,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 06:12:11,156 INFO L263 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 4 conjunts are in the unsatisfiable core [2020-12-09 06:12:11,157 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 06:12:11,276 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 06:12:11,276 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 06:12:11,276 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1975503741] [2020-12-09 06:12:11,276 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 06:12:11,277 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-09 06:12:11,277 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472635372] [2020-12-09 06:12:11,277 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 06:12:11,278 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 06:12:11,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 06:12:11,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-09 06:12:11,279 INFO L87 Difference]: Start difference. First operand 32 states and 35 transitions. Second operand 4 states. [2020-12-09 06:12:12,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 06:12:12,153 INFO L93 Difference]: Finished difference Result 48 states and 54 transitions. [2020-12-09 06:12:12,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-09 06:12:12,162 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2020-12-09 06:12:12,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 06:12:12,163 INFO L225 Difference]: With dead ends: 48 [2020-12-09 06:12:12,163 INFO L226 Difference]: Without dead ends: 46 [2020-12-09 06:12:12,163 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-09 06:12:12,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2020-12-09 06:12:12,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 34. [2020-12-09 06:12:12,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2020-12-09 06:12:12,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 37 transitions. [2020-12-09 06:12:12,170 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 37 transitions. Word has length 15 [2020-12-09 06:12:12,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 06:12:12,170 INFO L481 AbstractCegarLoop]: Abstraction has 34 states and 37 transitions. [2020-12-09 06:12:12,171 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 06:12:12,171 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2020-12-09 06:12:12,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-12-09 06:12:12,171 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 06:12:12,172 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 06:12:12,372 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2020-12-09 06:12:12,374 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 06:12:12,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 06:12:12,375 INFO L82 PathProgramCache]: Analyzing trace with hash 1663317220, now seen corresponding path program 1 times [2020-12-09 06:12:12,376 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 06:12:12,377 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [594487310] [2020-12-09 06:12:12,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_849c3f1d-6965-49ab-afb9-2a4df5ccf9fc/bin/utaipan/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2020-12-09 06:12:13,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 06:12:13,339 INFO L263 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 20 conjunts are in the unsatisfiable core [2020-12-09 06:12:13,341 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 06:12:13,749 WARN L197 SmtUtils]: Spent 383.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 12 [2020-12-09 06:12:14,354 WARN L197 SmtUtils]: Spent 471.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 15 [2020-12-09 06:12:14,826 WARN L197 SmtUtils]: Spent 230.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2020-12-09 06:12:16,631 WARN L197 SmtUtils]: Spent 832.00 ms on a formula simplification that was a NOOP. DAG size: 30 [2020-12-09 06:12:23,210 WARN L197 SmtUtils]: Spent 3.53 s on a formula simplification. DAG size of input: 53 DAG size of output: 34 [2020-12-09 06:12:23,229 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 06:12:23,234 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 06:12:23,237 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 06:12:24,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 06:12:24,101 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-09 06:12:24,101 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [594487310] [2020-12-09 06:12:24,101 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 06:12:24,101 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-12-09 06:12:24,101 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081961973] [2020-12-09 06:12:24,102 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-12-09 06:12:24,102 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 06:12:24,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-12-09 06:12:24,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2020-12-09 06:12:24,103 INFO L87 Difference]: Start difference. First operand 34 states and 37 transitions. Second operand 11 states. [2020-12-09 06:12:24,683 WARN L197 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 7 [2020-12-09 06:12:25,306 WARN L197 SmtUtils]: Spent 317.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 9 [2020-12-09 06:12:26,496 WARN L197 SmtUtils]: Spent 388.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 11 [2020-12-09 06:12:34,334 WARN L197 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2020-12-09 06:12:38,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 06:12:38,599 INFO L93 Difference]: Finished difference Result 47 states and 53 transitions. [2020-12-09 06:12:38,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-12-09 06:12:38,612 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 17 [2020-12-09 06:12:38,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 06:12:38,613 INFO L225 Difference]: With dead ends: 47 [2020-12-09 06:12:38,613 INFO L226 Difference]: Without dead ends: 43 [2020-12-09 06:12:38,613 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 11.5s TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2020-12-09 06:12:38,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2020-12-09 06:12:38,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 38. [2020-12-09 06:12:38,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2020-12-09 06:12:38,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2020-12-09 06:12:38,621 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 17 [2020-12-09 06:12:38,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 06:12:38,622 INFO L481 AbstractCegarLoop]: Abstraction has 38 states and 41 transitions. [2020-12-09 06:12:38,622 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-12-09 06:12:38,622 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2020-12-09 06:12:38,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-12-09 06:12:38,623 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 06:12:38,623 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 06:12:38,824 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2020-12-09 06:12:38,825 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 06:12:38,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 06:12:38,827 INFO L82 PathProgramCache]: Analyzing trace with hash 729574747, now seen corresponding path program 1 times [2020-12-09 06:12:38,829 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 06:12:38,830 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [487904379] [2020-12-09 06:12:38,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_849c3f1d-6965-49ab-afb9-2a4df5ccf9fc/bin/utaipan/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2020-12-09 06:12:39,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 06:12:39,314 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 18 conjunts are in the unsatisfiable core [2020-12-09 06:12:39,316 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 06:12:39,909 WARN L197 SmtUtils]: Spent 505.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 16 [2020-12-09 06:12:40,673 WARN L197 SmtUtils]: Spent 546.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 18 [2020-12-09 06:12:41,274 WARN L197 SmtUtils]: Spent 287.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2020-12-09 06:12:41,531 WARN L197 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2020-12-09 06:12:43,934 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((ULTIMATE.start_main_~n~0 (_ BitVec 32))) (let ((.cse0 (bvadd c_ULTIMATE.start_main_~d~0 (_ bv4294967294 32)))) (and (= (bvadd (bvmul (_ bv4 32) (bvneg (bvudiv ULTIMATE.start_main_~n~0 c_ULTIMATE.start_main_~d~0))) (bvmul (_ bv4 32) (bvudiv ULTIMATE.start_main_~n~0 .cse0))) c_ULTIMATE.start_main_~q~0) (= ((_ fp.to_ubv 32) roundTowardZero (fp.sqrt roundNearestTiesToEven ((_ to_fp_unsigned 11 53) roundNearestTiesToEven ULTIMATE.start_main_~n~0))) c_ULTIMATE.start_main_~s~0) (= c_ULTIMATE.start_main_~k~0 (bvurem ULTIMATE.start_main_~n~0 .cse0)) (= c_ULTIMATE.start_main_~r~0 (bvurem ULTIMATE.start_main_~n~0 c_ULTIMATE.start_main_~d~0)) (bvule ULTIMATE.start_main_~n~0 (_ bv10 32))))) (bvugt c_ULTIMATE.start_main_~d~0 (_ bv2 32)) (bvule c_ULTIMATE.start_main_~d~0 (_ bv10 32))) is different from false [2020-12-09 06:12:46,385 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((ULTIMATE.start_main_~n~0 (_ BitVec 32)) (ULTIMATE.start_main_~d~0 (_ BitVec 32))) (let ((.cse0 (bvadd ULTIMATE.start_main_~d~0 (_ bv4294967294 32)))) (and (= (bvadd (bvmul (_ bv4 32) (bvneg (bvudiv ULTIMATE.start_main_~n~0 ULTIMATE.start_main_~d~0))) (bvmul (_ bv4 32) (bvudiv ULTIMATE.start_main_~n~0 .cse0))) c_ULTIMATE.start_main_~q~0) (= c_ULTIMATE.start_main_~k~0 (bvurem ULTIMATE.start_main_~n~0 .cse0)) (bvugt ULTIMATE.start_main_~d~0 (_ bv2 32)) (= c_ULTIMATE.start_main_~r~0 (bvurem ULTIMATE.start_main_~n~0 ULTIMATE.start_main_~d~0)) (bvuge ((_ fp.to_ubv 32) roundTowardZero (fp.sqrt roundNearestTiesToEven ((_ to_fp_unsigned 11 53) roundNearestTiesToEven ULTIMATE.start_main_~n~0))) ULTIMATE.start_main_~d~0) (bvule ULTIMATE.start_main_~d~0 (_ bv10 32)) (bvule ULTIMATE.start_main_~n~0 (_ bv10 32))))) (not (= (_ bv0 32) c_ULTIMATE.start_main_~r~0))) is different from false [2020-12-09 06:12:53,537 WARN L838 $PredicateComparison]: unable to prove that (exists ((ULTIMATE.start_main_~n~0 (_ BitVec 32)) (ULTIMATE.start_main_~d~0 (_ BitVec 32))) (let ((.cse0 (bvurem ULTIMATE.start_main_~n~0 ULTIMATE.start_main_~d~0))) (and (not (= (_ bv0 32) .cse0)) (let ((.cse1 (bvadd ULTIMATE.start_main_~d~0 (_ bv4294967294 32)))) (bvult (bvadd (bvmul (bvneg (bvudiv ULTIMATE.start_main_~n~0 ULTIMATE.start_main_~d~0)) (_ bv4 32)) (bvmul .cse0 (_ bv2 32)) (bvmul (bvudiv ULTIMATE.start_main_~n~0 .cse1) (_ bv4 32))) (bvurem ULTIMATE.start_main_~n~0 .cse1))) (bvugt ULTIMATE.start_main_~d~0 (_ bv2 32)) (bvuge ((_ fp.to_ubv 32) roundTowardZero (fp.sqrt roundNearestTiesToEven ((_ to_fp_unsigned 11 53) roundNearestTiesToEven ULTIMATE.start_main_~n~0))) ULTIMATE.start_main_~d~0) (bvule ULTIMATE.start_main_~d~0 (_ bv10 32)) (bvule ULTIMATE.start_main_~n~0 (_ bv10 32))))) is different from false [2020-12-09 06:12:55,819 WARN L860 $PredicateComparison]: unable to prove that (exists ((ULTIMATE.start_main_~n~0 (_ BitVec 32)) (ULTIMATE.start_main_~d~0 (_ BitVec 32))) (let ((.cse0 (bvurem ULTIMATE.start_main_~n~0 ULTIMATE.start_main_~d~0))) (and (not (= (_ bv0 32) .cse0)) (let ((.cse1 (bvadd ULTIMATE.start_main_~d~0 (_ bv4294967294 32)))) (bvult (bvadd (bvmul (bvneg (bvudiv ULTIMATE.start_main_~n~0 ULTIMATE.start_main_~d~0)) (_ bv4 32)) (bvmul .cse0 (_ bv2 32)) (bvmul (bvudiv ULTIMATE.start_main_~n~0 .cse1) (_ bv4 32))) (bvurem ULTIMATE.start_main_~n~0 .cse1))) (bvugt ULTIMATE.start_main_~d~0 (_ bv2 32)) (bvuge ((_ fp.to_ubv 32) roundTowardZero (fp.sqrt roundNearestTiesToEven ((_ to_fp_unsigned 11 53) roundNearestTiesToEven ULTIMATE.start_main_~n~0))) ULTIMATE.start_main_~d~0) (bvule ULTIMATE.start_main_~d~0 (_ bv10 32)) (bvule ULTIMATE.start_main_~n~0 (_ bv10 32))))) is different from true [2020-12-09 06:13:05,348 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2020-12-09 06:13:05,348 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 06:13:05,847 WARN L197 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2020-12-09 06:13:08,247 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (bvurem c_ULTIMATE.start_main_~n~0 c_ULTIMATE.start_main_~a~0))) (or (= .cse0 (_ bv0 32)) (not (bvuge ((_ fp.to_ubv 32) roundTowardZero (fp.sqrt c_currentRoundingMode ((_ to_fp_unsigned 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~n~0))) c_ULTIMATE.start_main_~a~0)) (not (let ((.cse1 (bvadd c_ULTIMATE.start_main_~a~0 (_ bv4294967294 32)))) (bvult (bvadd (bvmul (bvudiv c_ULTIMATE.start_main_~n~0 .cse1) (_ bv4 32)) (bvmul (bvneg (bvudiv c_ULTIMATE.start_main_~n~0 c_ULTIMATE.start_main_~a~0)) (_ bv4 32)) (bvmul .cse0 (_ bv2 32))) (bvurem c_ULTIMATE.start_main_~n~0 .cse1)))))) is different from false [2020-12-09 06:13:10,632 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (bvurem c_ULTIMATE.start_main_~n~0 c_ULTIMATE.start_main_~a~0))) (or (= .cse0 (_ bv0 32)) (not (bvuge ((_ fp.to_ubv 32) roundTowardZero (fp.sqrt c_currentRoundingMode ((_ to_fp_unsigned 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~n~0))) c_ULTIMATE.start_main_~a~0)) (not (let ((.cse1 (bvadd c_ULTIMATE.start_main_~a~0 (_ bv4294967294 32)))) (bvult (bvadd (bvmul (bvudiv c_ULTIMATE.start_main_~n~0 .cse1) (_ bv4 32)) (bvmul (bvneg (bvudiv c_ULTIMATE.start_main_~n~0 c_ULTIMATE.start_main_~a~0)) (_ bv4 32)) (bvmul .cse0 (_ bv2 32))) (bvurem c_ULTIMATE.start_main_~n~0 .cse1)))))) is different from true [2020-12-09 06:13:13,024 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (bvurem c_ULTIMATE.start_main_~n~0 c_ULTIMATE.start_main_~a~0))) (or (= .cse0 (_ bv0 32)) (not (bvuge ((_ fp.to_ubv 32) roundTowardZero (fp.sqrt c_currentRoundingMode ((_ to_fp_unsigned 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~n~0))) c_ULTIMATE.start_main_~a~0)) (= (_ bv0 32) c_ULTIMATE.start_assume_abort_if_not_~cond) (not (let ((.cse1 (bvadd c_ULTIMATE.start_main_~a~0 (_ bv4294967294 32)))) (bvult (bvadd (bvmul (bvudiv c_ULTIMATE.start_main_~n~0 .cse1) (_ bv4 32)) (bvmul (bvneg (bvudiv c_ULTIMATE.start_main_~n~0 c_ULTIMATE.start_main_~a~0)) (_ bv4 32)) (bvmul .cse0 (_ bv2 32))) (bvurem c_ULTIMATE.start_main_~n~0 .cse1)))))) is different from false [2020-12-09 06:13:15,413 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (bvurem c_ULTIMATE.start_main_~n~0 c_ULTIMATE.start_main_~a~0))) (or (= .cse0 (_ bv0 32)) (not (bvuge ((_ fp.to_ubv 32) roundTowardZero (fp.sqrt c_currentRoundingMode ((_ to_fp_unsigned 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~n~0))) c_ULTIMATE.start_main_~a~0)) (= (_ bv0 32) c_ULTIMATE.start_assume_abort_if_not_~cond) (not (let ((.cse1 (bvadd c_ULTIMATE.start_main_~a~0 (_ bv4294967294 32)))) (bvult (bvadd (bvmul (bvudiv c_ULTIMATE.start_main_~n~0 .cse1) (_ bv4 32)) (bvmul (bvneg (bvudiv c_ULTIMATE.start_main_~n~0 c_ULTIMATE.start_main_~a~0)) (_ bv4 32)) (bvmul .cse0 (_ bv2 32))) (bvurem c_ULTIMATE.start_main_~n~0 .cse1)))))) is different from true [2020-12-09 06:13:15,420 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-12-09 06:13:15,421 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 06:13:17,822 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (bvurem c_ULTIMATE.start_main_~n~0 c_ULTIMATE.start_main_~a~0))) (or (= .cse0 (_ bv0 32)) (not (bvugt c_ULTIMATE.start_main_~a~0 (_ bv2 32))) (not (bvuge ((_ fp.to_ubv 32) roundTowardZero (fp.sqrt c_currentRoundingMode ((_ to_fp_unsigned 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~n~0))) c_ULTIMATE.start_main_~a~0)) (not (let ((.cse1 (bvadd c_ULTIMATE.start_main_~a~0 (_ bv4294967294 32)))) (bvult (bvadd (bvmul (bvudiv c_ULTIMATE.start_main_~n~0 .cse1) (_ bv4 32)) (bvmul (bvneg (bvudiv c_ULTIMATE.start_main_~n~0 c_ULTIMATE.start_main_~a~0)) (_ bv4 32)) (bvmul .cse0 (_ bv2 32))) (bvurem c_ULTIMATE.start_main_~n~0 .cse1)))))) is different from false [2020-12-09 06:13:20,199 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (bvurem c_ULTIMATE.start_main_~n~0 c_ULTIMATE.start_main_~a~0))) (or (= .cse0 (_ bv0 32)) (not (bvugt c_ULTIMATE.start_main_~a~0 (_ bv2 32))) (not (bvuge ((_ fp.to_ubv 32) roundTowardZero (fp.sqrt c_currentRoundingMode ((_ to_fp_unsigned 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~n~0))) c_ULTIMATE.start_main_~a~0)) (not (let ((.cse1 (bvadd c_ULTIMATE.start_main_~a~0 (_ bv4294967294 32)))) (bvult (bvadd (bvmul (bvudiv c_ULTIMATE.start_main_~n~0 .cse1) (_ bv4 32)) (bvmul (bvneg (bvudiv c_ULTIMATE.start_main_~n~0 c_ULTIMATE.start_main_~a~0)) (_ bv4 32)) (bvmul .cse0 (_ bv2 32))) (bvurem c_ULTIMATE.start_main_~n~0 .cse1)))))) is different from true [2020-12-09 06:13:22,648 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (bvurem c_ULTIMATE.start_main_~n~0 c_ULTIMATE.start_main_~a~0))) (or (= .cse0 (_ bv0 32)) (not (bvugt c_ULTIMATE.start_main_~a~0 (_ bv2 32))) (not (bvuge ((_ fp.to_ubv 32) roundTowardZero (fp.sqrt c_currentRoundingMode ((_ to_fp_unsigned 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~n~0))) c_ULTIMATE.start_main_~a~0)) (= (_ bv0 32) c_ULTIMATE.start_assume_abort_if_not_~cond) (not (let ((.cse1 (bvadd c_ULTIMATE.start_main_~a~0 (_ bv4294967294 32)))) (bvult (bvadd (bvmul (bvudiv c_ULTIMATE.start_main_~n~0 .cse1) (_ bv4 32)) (bvmul (bvneg (bvudiv c_ULTIMATE.start_main_~n~0 c_ULTIMATE.start_main_~a~0)) (_ bv4 32)) (bvmul .cse0 (_ bv2 32))) (bvurem c_ULTIMATE.start_main_~n~0 .cse1)))))) is different from false [2020-12-09 06:13:25,055 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (bvurem c_ULTIMATE.start_main_~n~0 c_ULTIMATE.start_main_~a~0))) (or (= .cse0 (_ bv0 32)) (not (bvugt c_ULTIMATE.start_main_~a~0 (_ bv2 32))) (not (bvuge ((_ fp.to_ubv 32) roundTowardZero (fp.sqrt c_currentRoundingMode ((_ to_fp_unsigned 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~n~0))) c_ULTIMATE.start_main_~a~0)) (= (_ bv0 32) c_ULTIMATE.start_assume_abort_if_not_~cond) (not (let ((.cse1 (bvadd c_ULTIMATE.start_main_~a~0 (_ bv4294967294 32)))) (bvult (bvadd (bvmul (bvudiv c_ULTIMATE.start_main_~n~0 .cse1) (_ bv4 32)) (bvmul (bvneg (bvudiv c_ULTIMATE.start_main_~n~0 c_ULTIMATE.start_main_~a~0)) (_ bv4 32)) (bvmul .cse0 (_ bv2 32))) (bvurem c_ULTIMATE.start_main_~n~0 .cse1)))))) is different from true [2020-12-09 06:13:25,067 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 06:13:25,067 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 06:13:27,468 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_main_~a~0_9 (_ BitVec 32))) (let ((.cse0 (bvurem c_ULTIMATE.start_main_~n~0 v_ULTIMATE.start_main_~a~0_9))) (or (not (bvuge ((_ fp.to_ubv 32) roundTowardZero (fp.sqrt c_currentRoundingMode ((_ to_fp_unsigned 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~n~0))) v_ULTIMATE.start_main_~a~0_9)) (= (_ bv0 32) .cse0) (not (let ((.cse1 (bvadd v_ULTIMATE.start_main_~a~0_9 (_ bv4294967294 32)))) (bvult (bvadd (bvmul (bvudiv c_ULTIMATE.start_main_~n~0 .cse1) (_ bv4 32)) (bvmul .cse0 (_ bv2 32)) (bvmul (bvneg (bvudiv c_ULTIMATE.start_main_~n~0 v_ULTIMATE.start_main_~a~0_9)) (_ bv4 32))) (bvurem c_ULTIMATE.start_main_~n~0 .cse1)))) (not (bvugt v_ULTIMATE.start_main_~a~0_9 (_ bv2 32))) (not (bvule v_ULTIMATE.start_main_~a~0_9 (_ bv10 32))) (not (bvuge v_ULTIMATE.start_main_~a~0_9 (_ bv0 32)))))) is different from false [2020-12-09 06:13:29,845 WARN L860 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_main_~a~0_9 (_ BitVec 32))) (let ((.cse0 (bvurem c_ULTIMATE.start_main_~n~0 v_ULTIMATE.start_main_~a~0_9))) (or (not (bvuge ((_ fp.to_ubv 32) roundTowardZero (fp.sqrt c_currentRoundingMode ((_ to_fp_unsigned 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~n~0))) v_ULTIMATE.start_main_~a~0_9)) (= (_ bv0 32) .cse0) (not (let ((.cse1 (bvadd v_ULTIMATE.start_main_~a~0_9 (_ bv4294967294 32)))) (bvult (bvadd (bvmul (bvudiv c_ULTIMATE.start_main_~n~0 .cse1) (_ bv4 32)) (bvmul .cse0 (_ bv2 32)) (bvmul (bvneg (bvudiv c_ULTIMATE.start_main_~n~0 v_ULTIMATE.start_main_~a~0_9)) (_ bv4 32))) (bvurem c_ULTIMATE.start_main_~n~0 .cse1)))) (not (bvugt v_ULTIMATE.start_main_~a~0_9 (_ bv2 32))) (not (bvule v_ULTIMATE.start_main_~a~0_9 (_ bv10 32))) (not (bvuge v_ULTIMATE.start_main_~a~0_9 (_ bv0 32)))))) is different from true [2020-12-09 06:13:32,259 WARN L860 $PredicateComparison]: unable to prove that (or (forall ((v_ULTIMATE.start_main_~a~0_9 (_ BitVec 32))) (let ((.cse0 (bvurem c_ULTIMATE.start_main_~n~0 v_ULTIMATE.start_main_~a~0_9))) (or (not (bvuge ((_ fp.to_ubv 32) roundTowardZero (fp.sqrt c_currentRoundingMode ((_ to_fp_unsigned 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~n~0))) v_ULTIMATE.start_main_~a~0_9)) (= (_ bv0 32) .cse0) (not (let ((.cse1 (bvadd v_ULTIMATE.start_main_~a~0_9 (_ bv4294967294 32)))) (bvult (bvadd (bvmul (bvudiv c_ULTIMATE.start_main_~n~0 .cse1) (_ bv4 32)) (bvmul .cse0 (_ bv2 32)) (bvmul (bvneg (bvudiv c_ULTIMATE.start_main_~n~0 v_ULTIMATE.start_main_~a~0_9)) (_ bv4 32))) (bvurem c_ULTIMATE.start_main_~n~0 .cse1)))) (not (bvugt v_ULTIMATE.start_main_~a~0_9 (_ bv2 32))) (not (bvule v_ULTIMATE.start_main_~a~0_9 (_ bv10 32))) (not (bvuge v_ULTIMATE.start_main_~a~0_9 (_ bv0 32)))))) (= (_ bv0 32) c_ULTIMATE.start_assume_abort_if_not_~cond)) is different from true [2020-12-09 06:13:32,268 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 06:13:32,269 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 06:13:34,596 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_main_~a~0_9 (_ BitVec 32)) (v_ULTIMATE.start_main_~n~0_10 (_ BitVec 32))) (let ((.cse0 (bvurem v_ULTIMATE.start_main_~n~0_10 v_ULTIMATE.start_main_~a~0_9))) (or (not (bvule v_ULTIMATE.start_main_~n~0_10 (_ bv10 32))) (= .cse0 (_ bv0 32)) (not (bvugt v_ULTIMATE.start_main_~a~0_9 (_ bv2 32))) (not (bvule v_ULTIMATE.start_main_~a~0_9 (_ bv10 32))) (not (bvuge v_ULTIMATE.start_main_~n~0_10 (_ bv0 32))) (not (let ((.cse1 (bvadd v_ULTIMATE.start_main_~a~0_9 (_ bv4294967294 32)))) (bvult (bvadd (bvmul .cse0 (_ bv2 32)) (bvmul (bvudiv v_ULTIMATE.start_main_~n~0_10 .cse1) (_ bv4 32)) (bvmul (bvneg (bvudiv v_ULTIMATE.start_main_~n~0_10 v_ULTIMATE.start_main_~a~0_9)) (_ bv4 32))) (bvurem v_ULTIMATE.start_main_~n~0_10 .cse1)))) (not (bvuge ((_ fp.to_ubv 32) roundTowardZero (fp.sqrt c_currentRoundingMode ((_ to_fp_unsigned 11 53) c_currentRoundingMode v_ULTIMATE.start_main_~n~0_10))) v_ULTIMATE.start_main_~a~0_9)) (not (bvuge v_ULTIMATE.start_main_~a~0_9 (_ bv0 32)))))) is different from false [2020-12-09 06:13:36,993 WARN L860 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_main_~a~0_9 (_ BitVec 32)) (v_ULTIMATE.start_main_~n~0_10 (_ BitVec 32))) (let ((.cse0 (bvurem v_ULTIMATE.start_main_~n~0_10 v_ULTIMATE.start_main_~a~0_9))) (or (not (bvule v_ULTIMATE.start_main_~n~0_10 (_ bv10 32))) (= .cse0 (_ bv0 32)) (not (bvugt v_ULTIMATE.start_main_~a~0_9 (_ bv2 32))) (not (bvule v_ULTIMATE.start_main_~a~0_9 (_ bv10 32))) (not (bvuge v_ULTIMATE.start_main_~n~0_10 (_ bv0 32))) (not (let ((.cse1 (bvadd v_ULTIMATE.start_main_~a~0_9 (_ bv4294967294 32)))) (bvult (bvadd (bvmul .cse0 (_ bv2 32)) (bvmul (bvudiv v_ULTIMATE.start_main_~n~0_10 .cse1) (_ bv4 32)) (bvmul (bvneg (bvudiv v_ULTIMATE.start_main_~n~0_10 v_ULTIMATE.start_main_~a~0_9)) (_ bv4 32))) (bvurem v_ULTIMATE.start_main_~n~0_10 .cse1)))) (not (bvuge ((_ fp.to_ubv 32) roundTowardZero (fp.sqrt c_currentRoundingMode ((_ to_fp_unsigned 11 53) c_currentRoundingMode v_ULTIMATE.start_main_~n~0_10))) v_ULTIMATE.start_main_~a~0_9)) (not (bvuge v_ULTIMATE.start_main_~a~0_9 (_ bv0 32)))))) is different from true [2020-12-09 06:13:36,997 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 06:13:36,997 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [487904379] [2020-12-09 06:13:36,997 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-12-09 06:13:36,997 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [10] total 20 [2020-12-09 06:13:36,997 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117779483] [2020-12-09 06:13:36,998 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-12-09 06:13:36,998 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 06:13:36,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-12-09 06:13:36,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=81, Unknown=17, NotChecked=270, Total=420 [2020-12-09 06:13:36,999 INFO L87 Difference]: Start difference. First operand 38 states and 41 transitions. Second operand 11 states. [2020-12-09 06:13:38,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 06:13:38,311 INFO L93 Difference]: Finished difference Result 60 states and 67 transitions. [2020-12-09 06:13:38,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-12-09 06:13:38,312 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 23 [2020-12-09 06:13:38,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 06:13:38,313 INFO L225 Difference]: With dead ends: 60 [2020-12-09 06:13:38,313 INFO L226 Difference]: Without dead ends: 40 [2020-12-09 06:13:38,313 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 43.2s TimeCoverageRelationStatistics Valid=52, Invalid=81, Unknown=17, NotChecked=270, Total=420 [2020-12-09 06:13:38,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2020-12-09 06:13:38,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2020-12-09 06:13:38,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2020-12-09 06:13:38,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 43 transitions. [2020-12-09 06:13:38,318 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 43 transitions. Word has length 23 [2020-12-09 06:13:38,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 06:13:38,319 INFO L481 AbstractCegarLoop]: Abstraction has 40 states and 43 transitions. [2020-12-09 06:13:38,319 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-12-09 06:13:38,319 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2020-12-09 06:13:38,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-12-09 06:13:38,319 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 06:13:38,320 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 06:13:38,520 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2020-12-09 06:13:38,521 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 06:13:38,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 06:13:38,522 INFO L82 PathProgramCache]: Analyzing trace with hash 1145493114, now seen corresponding path program 1 times [2020-12-09 06:13:38,523 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 06:13:38,524 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1543882321] [2020-12-09 06:13:38,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_849c3f1d-6965-49ab-afb9-2a4df5ccf9fc/bin/utaipan/mathsat Starting monitored process 7 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with mathsat -unsat_core_generation=3 [2020-12-09 06:13:38,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 06:13:39,021 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 18 conjunts are in the unsatisfiable core [2020-12-09 06:13:39,025 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 06:13:39,805 WARN L197 SmtUtils]: Spent 671.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 16 [2020-12-09 06:13:40,764 WARN L197 SmtUtils]: Spent 689.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 18 [2020-12-09 06:13:41,006 WARN L197 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2020-12-09 06:13:41,486 WARN L197 SmtUtils]: Spent 337.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2020-12-09 06:13:41,801 WARN L197 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2020-12-09 06:13:44,222 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((ULTIMATE.start_main_~n~0 (_ BitVec 32))) (let ((.cse0 (bvadd c_ULTIMATE.start_main_~d~0 (_ bv4294967294 32)))) (and (= (bvadd (bvmul (_ bv4 32) (bvneg (bvudiv ULTIMATE.start_main_~n~0 c_ULTIMATE.start_main_~d~0))) (bvmul (_ bv4 32) (bvudiv ULTIMATE.start_main_~n~0 .cse0))) c_ULTIMATE.start_main_~q~0) (= ((_ fp.to_ubv 32) roundTowardZero (fp.sqrt roundNearestTiesToEven ((_ to_fp_unsigned 11 53) roundNearestTiesToEven ULTIMATE.start_main_~n~0))) c_ULTIMATE.start_main_~s~0) (= c_ULTIMATE.start_main_~k~0 (bvurem ULTIMATE.start_main_~n~0 .cse0)) (= c_ULTIMATE.start_main_~r~0 (bvurem ULTIMATE.start_main_~n~0 c_ULTIMATE.start_main_~d~0)) (bvule ULTIMATE.start_main_~n~0 (_ bv10 32))))) (bvugt c_ULTIMATE.start_main_~d~0 (_ bv2 32)) (bvule c_ULTIMATE.start_main_~d~0 (_ bv10 32))) is different from false [2020-12-09 06:13:46,686 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((ULTIMATE.start_main_~n~0 (_ BitVec 32))) (let ((.cse0 (bvadd c_ULTIMATE.start_main_~d~0 (_ bv4294967294 32)))) (and (= (bvadd (bvmul (_ bv4 32) (bvneg (bvudiv ULTIMATE.start_main_~n~0 c_ULTIMATE.start_main_~d~0))) (bvmul (_ bv4 32) (bvudiv ULTIMATE.start_main_~n~0 .cse0))) c_ULTIMATE.start_main_~q~0) (= c_ULTIMATE.start_main_~k~0 (bvurem ULTIMATE.start_main_~n~0 .cse0)) (= c_ULTIMATE.start_main_~r~0 (bvurem ULTIMATE.start_main_~n~0 c_ULTIMATE.start_main_~d~0)) (bvuge ((_ fp.to_ubv 32) roundTowardZero (fp.sqrt roundNearestTiesToEven ((_ to_fp_unsigned 11 53) roundNearestTiesToEven ULTIMATE.start_main_~n~0))) c_ULTIMATE.start_main_~d~0) (bvule ULTIMATE.start_main_~n~0 (_ bv10 32))))) (bvugt c_ULTIMATE.start_main_~d~0 (_ bv2 32)) (not (= (_ bv0 32) c_ULTIMATE.start_main_~r~0)) (bvule c_ULTIMATE.start_main_~d~0 (_ bv10 32))) is different from false [2020-12-09 06:13:53,937 WARN L838 $PredicateComparison]: unable to prove that (exists ((v_ULTIMATE.start_main_~d~0_22 (_ BitVec 32)) (ULTIMATE.start_main_~n~0 (_ BitVec 32))) (let ((.cse0 (bvurem ULTIMATE.start_main_~n~0 v_ULTIMATE.start_main_~d~0_22))) (and (bvugt v_ULTIMATE.start_main_~d~0_22 (_ bv2 32)) (bvule v_ULTIMATE.start_main_~d~0_22 (_ bv10 32)) (not (= (_ bv0 32) .cse0)) (let ((.cse1 (bvadd v_ULTIMATE.start_main_~d~0_22 (_ bv4294967294 32)))) (bvult (bvadd (bvmul .cse0 (_ bv2 32)) (bvmul (bvudiv ULTIMATE.start_main_~n~0 .cse1) (_ bv4 32)) (bvmul (bvneg (bvudiv ULTIMATE.start_main_~n~0 v_ULTIMATE.start_main_~d~0_22)) (_ bv4 32))) (bvadd v_ULTIMATE.start_main_~d~0_22 (bvurem ULTIMATE.start_main_~n~0 .cse1) (_ bv2 32)))) (bvuge ((_ fp.to_ubv 32) roundTowardZero (fp.sqrt roundNearestTiesToEven ((_ to_fp_unsigned 11 53) roundNearestTiesToEven ULTIMATE.start_main_~n~0))) v_ULTIMATE.start_main_~d~0_22) (bvule ULTIMATE.start_main_~n~0 (_ bv10 32))))) is different from false [2020-12-09 06:13:56,235 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_ULTIMATE.start_main_~d~0_22 (_ BitVec 32)) (ULTIMATE.start_main_~n~0 (_ BitVec 32))) (let ((.cse0 (bvurem ULTIMATE.start_main_~n~0 v_ULTIMATE.start_main_~d~0_22))) (and (bvugt v_ULTIMATE.start_main_~d~0_22 (_ bv2 32)) (bvule v_ULTIMATE.start_main_~d~0_22 (_ bv10 32)) (not (= (_ bv0 32) .cse0)) (let ((.cse1 (bvadd v_ULTIMATE.start_main_~d~0_22 (_ bv4294967294 32)))) (bvult (bvadd (bvmul .cse0 (_ bv2 32)) (bvmul (bvudiv ULTIMATE.start_main_~n~0 .cse1) (_ bv4 32)) (bvmul (bvneg (bvudiv ULTIMATE.start_main_~n~0 v_ULTIMATE.start_main_~d~0_22)) (_ bv4 32))) (bvadd v_ULTIMATE.start_main_~d~0_22 (bvurem ULTIMATE.start_main_~n~0 .cse1) (_ bv2 32)))) (bvuge ((_ fp.to_ubv 32) roundTowardZero (fp.sqrt roundNearestTiesToEven ((_ to_fp_unsigned 11 53) roundNearestTiesToEven ULTIMATE.start_main_~n~0))) v_ULTIMATE.start_main_~d~0_22) (bvule ULTIMATE.start_main_~n~0 (_ bv10 32))))) is different from true [2020-12-09 06:14:05,900 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2020-12-09 06:14:05,900 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 06:14:06,534 WARN L197 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2020-12-09 06:14:08,951 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (bvurem c_ULTIMATE.start_main_~n~0 c_ULTIMATE.start_main_~a~0))) (or (not (let ((.cse0 (bvadd c_ULTIMATE.start_main_~a~0 (_ bv4294967294 32)))) (bvult (bvadd (bvmul (bvudiv c_ULTIMATE.start_main_~n~0 .cse0) (_ bv4 32)) (bvmul (bvneg (bvudiv c_ULTIMATE.start_main_~n~0 c_ULTIMATE.start_main_~a~0)) (_ bv4 32)) (bvmul .cse1 (_ bv2 32))) (bvadd (bvurem c_ULTIMATE.start_main_~n~0 .cse0) c_ULTIMATE.start_main_~a~0 (_ bv2 32))))) (= .cse1 (_ bv0 32)) (not (bvuge ((_ fp.to_ubv 32) roundTowardZero (fp.sqrt c_currentRoundingMode ((_ to_fp_unsigned 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~n~0))) c_ULTIMATE.start_main_~a~0)))) is different from false [2020-12-09 06:14:11,342 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 (bvurem c_ULTIMATE.start_main_~n~0 c_ULTIMATE.start_main_~a~0))) (or (not (let ((.cse0 (bvadd c_ULTIMATE.start_main_~a~0 (_ bv4294967294 32)))) (bvult (bvadd (bvmul (bvudiv c_ULTIMATE.start_main_~n~0 .cse0) (_ bv4 32)) (bvmul (bvneg (bvudiv c_ULTIMATE.start_main_~n~0 c_ULTIMATE.start_main_~a~0)) (_ bv4 32)) (bvmul .cse1 (_ bv2 32))) (bvadd (bvurem c_ULTIMATE.start_main_~n~0 .cse0) c_ULTIMATE.start_main_~a~0 (_ bv2 32))))) (= .cse1 (_ bv0 32)) (not (bvuge ((_ fp.to_ubv 32) roundTowardZero (fp.sqrt c_currentRoundingMode ((_ to_fp_unsigned 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~n~0))) c_ULTIMATE.start_main_~a~0)))) is different from true [2020-12-09 06:14:13,757 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (bvurem c_ULTIMATE.start_main_~n~0 c_ULTIMATE.start_main_~a~0))) (or (not (let ((.cse0 (bvadd c_ULTIMATE.start_main_~a~0 (_ bv4294967294 32)))) (bvult (bvadd (bvmul (bvudiv c_ULTIMATE.start_main_~n~0 .cse0) (_ bv4 32)) (bvmul (bvneg (bvudiv c_ULTIMATE.start_main_~n~0 c_ULTIMATE.start_main_~a~0)) (_ bv4 32)) (bvmul .cse1 (_ bv2 32))) (bvadd (bvurem c_ULTIMATE.start_main_~n~0 .cse0) c_ULTIMATE.start_main_~a~0 (_ bv2 32))))) (= .cse1 (_ bv0 32)) (not (bvuge ((_ fp.to_ubv 32) roundTowardZero (fp.sqrt c_currentRoundingMode ((_ to_fp_unsigned 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~n~0))) c_ULTIMATE.start_main_~a~0)) (= (_ bv0 32) c_ULTIMATE.start_assume_abort_if_not_~cond))) is different from false [2020-12-09 06:14:16,164 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 (bvurem c_ULTIMATE.start_main_~n~0 c_ULTIMATE.start_main_~a~0))) (or (not (let ((.cse0 (bvadd c_ULTIMATE.start_main_~a~0 (_ bv4294967294 32)))) (bvult (bvadd (bvmul (bvudiv c_ULTIMATE.start_main_~n~0 .cse0) (_ bv4 32)) (bvmul (bvneg (bvudiv c_ULTIMATE.start_main_~n~0 c_ULTIMATE.start_main_~a~0)) (_ bv4 32)) (bvmul .cse1 (_ bv2 32))) (bvadd (bvurem c_ULTIMATE.start_main_~n~0 .cse0) c_ULTIMATE.start_main_~a~0 (_ bv2 32))))) (= .cse1 (_ bv0 32)) (not (bvuge ((_ fp.to_ubv 32) roundTowardZero (fp.sqrt c_currentRoundingMode ((_ to_fp_unsigned 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~n~0))) c_ULTIMATE.start_main_~a~0)) (= (_ bv0 32) c_ULTIMATE.start_assume_abort_if_not_~cond))) is different from true [2020-12-09 06:14:16,169 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-12-09 06:14:16,169 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 06:14:18,599 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (bvurem c_ULTIMATE.start_main_~n~0 c_ULTIMATE.start_main_~a~0))) (or (not (let ((.cse0 (bvadd c_ULTIMATE.start_main_~a~0 (_ bv4294967294 32)))) (bvult (bvadd (bvmul (bvudiv c_ULTIMATE.start_main_~n~0 .cse0) (_ bv4 32)) (bvmul (bvneg (bvudiv c_ULTIMATE.start_main_~n~0 c_ULTIMATE.start_main_~a~0)) (_ bv4 32)) (bvmul .cse1 (_ bv2 32))) (bvadd (bvurem c_ULTIMATE.start_main_~n~0 .cse0) c_ULTIMATE.start_main_~a~0 (_ bv2 32))))) (= .cse1 (_ bv0 32)) (not (bvugt c_ULTIMATE.start_main_~a~0 (_ bv2 32))) (not (bvuge ((_ fp.to_ubv 32) roundTowardZero (fp.sqrt c_currentRoundingMode ((_ to_fp_unsigned 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~n~0))) c_ULTIMATE.start_main_~a~0)))) is different from false [2020-12-09 06:14:20,987 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 (bvurem c_ULTIMATE.start_main_~n~0 c_ULTIMATE.start_main_~a~0))) (or (not (let ((.cse0 (bvadd c_ULTIMATE.start_main_~a~0 (_ bv4294967294 32)))) (bvult (bvadd (bvmul (bvudiv c_ULTIMATE.start_main_~n~0 .cse0) (_ bv4 32)) (bvmul (bvneg (bvudiv c_ULTIMATE.start_main_~n~0 c_ULTIMATE.start_main_~a~0)) (_ bv4 32)) (bvmul .cse1 (_ bv2 32))) (bvadd (bvurem c_ULTIMATE.start_main_~n~0 .cse0) c_ULTIMATE.start_main_~a~0 (_ bv2 32))))) (= .cse1 (_ bv0 32)) (not (bvugt c_ULTIMATE.start_main_~a~0 (_ bv2 32))) (not (bvuge ((_ fp.to_ubv 32) roundTowardZero (fp.sqrt c_currentRoundingMode ((_ to_fp_unsigned 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~n~0))) c_ULTIMATE.start_main_~a~0)))) is different from true [2020-12-09 06:14:23,394 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (bvurem c_ULTIMATE.start_main_~n~0 c_ULTIMATE.start_main_~a~0))) (or (not (let ((.cse0 (bvadd c_ULTIMATE.start_main_~a~0 (_ bv4294967294 32)))) (bvult (bvadd (bvmul (bvudiv c_ULTIMATE.start_main_~n~0 .cse0) (_ bv4 32)) (bvmul (bvneg (bvudiv c_ULTIMATE.start_main_~n~0 c_ULTIMATE.start_main_~a~0)) (_ bv4 32)) (bvmul .cse1 (_ bv2 32))) (bvadd (bvurem c_ULTIMATE.start_main_~n~0 .cse0) c_ULTIMATE.start_main_~a~0 (_ bv2 32))))) (= .cse1 (_ bv0 32)) (not (bvugt c_ULTIMATE.start_main_~a~0 (_ bv2 32))) (not (bvuge ((_ fp.to_ubv 32) roundTowardZero (fp.sqrt c_currentRoundingMode ((_ to_fp_unsigned 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~n~0))) c_ULTIMATE.start_main_~a~0)) (= (_ bv0 32) c_ULTIMATE.start_assume_abort_if_not_~cond))) is different from false [2020-12-09 06:14:25,802 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 (bvurem c_ULTIMATE.start_main_~n~0 c_ULTIMATE.start_main_~a~0))) (or (not (let ((.cse0 (bvadd c_ULTIMATE.start_main_~a~0 (_ bv4294967294 32)))) (bvult (bvadd (bvmul (bvudiv c_ULTIMATE.start_main_~n~0 .cse0) (_ bv4 32)) (bvmul (bvneg (bvudiv c_ULTIMATE.start_main_~n~0 c_ULTIMATE.start_main_~a~0)) (_ bv4 32)) (bvmul .cse1 (_ bv2 32))) (bvadd (bvurem c_ULTIMATE.start_main_~n~0 .cse0) c_ULTIMATE.start_main_~a~0 (_ bv2 32))))) (= .cse1 (_ bv0 32)) (not (bvugt c_ULTIMATE.start_main_~a~0 (_ bv2 32))) (not (bvuge ((_ fp.to_ubv 32) roundTowardZero (fp.sqrt c_currentRoundingMode ((_ to_fp_unsigned 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~n~0))) c_ULTIMATE.start_main_~a~0)) (= (_ bv0 32) c_ULTIMATE.start_assume_abort_if_not_~cond))) is different from true [2020-12-09 06:14:25,808 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 06:14:25,808 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 06:14:28,224 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_main_~a~0_11 (_ BitVec 32))) (let ((.cse0 (bvurem c_ULTIMATE.start_main_~n~0 v_ULTIMATE.start_main_~a~0_11))) (or (not (bvule v_ULTIMATE.start_main_~a~0_11 (_ bv10 32))) (not (bvuge ((_ fp.to_ubv 32) roundTowardZero (fp.sqrt c_currentRoundingMode ((_ to_fp_unsigned 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~n~0))) v_ULTIMATE.start_main_~a~0_11)) (not (bvugt v_ULTIMATE.start_main_~a~0_11 (_ bv2 32))) (not (bvuge v_ULTIMATE.start_main_~a~0_11 (_ bv0 32))) (not (let ((.cse1 (bvadd v_ULTIMATE.start_main_~a~0_11 (_ bv4294967294 32)))) (bvult (bvadd (bvmul .cse0 (_ bv2 32)) (bvmul (bvneg (bvudiv c_ULTIMATE.start_main_~n~0 v_ULTIMATE.start_main_~a~0_11)) (_ bv4 32)) (bvmul (bvudiv c_ULTIMATE.start_main_~n~0 .cse1) (_ bv4 32))) (bvadd (bvurem c_ULTIMATE.start_main_~n~0 .cse1) v_ULTIMATE.start_main_~a~0_11 (_ bv2 32))))) (= (_ bv0 32) .cse0)))) is different from false [2020-12-09 06:14:30,649 WARN L860 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_main_~a~0_11 (_ BitVec 32))) (let ((.cse0 (bvurem c_ULTIMATE.start_main_~n~0 v_ULTIMATE.start_main_~a~0_11))) (or (not (bvule v_ULTIMATE.start_main_~a~0_11 (_ bv10 32))) (not (bvuge ((_ fp.to_ubv 32) roundTowardZero (fp.sqrt c_currentRoundingMode ((_ to_fp_unsigned 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~n~0))) v_ULTIMATE.start_main_~a~0_11)) (not (bvugt v_ULTIMATE.start_main_~a~0_11 (_ bv2 32))) (not (bvuge v_ULTIMATE.start_main_~a~0_11 (_ bv0 32))) (not (let ((.cse1 (bvadd v_ULTIMATE.start_main_~a~0_11 (_ bv4294967294 32)))) (bvult (bvadd (bvmul .cse0 (_ bv2 32)) (bvmul (bvneg (bvudiv c_ULTIMATE.start_main_~n~0 v_ULTIMATE.start_main_~a~0_11)) (_ bv4 32)) (bvmul (bvudiv c_ULTIMATE.start_main_~n~0 .cse1) (_ bv4 32))) (bvadd (bvurem c_ULTIMATE.start_main_~n~0 .cse1) v_ULTIMATE.start_main_~a~0_11 (_ bv2 32))))) (= (_ bv0 32) .cse0)))) is different from true [2020-12-09 06:14:33,097 WARN L860 $PredicateComparison]: unable to prove that (or (= (_ bv0 32) c_ULTIMATE.start_assume_abort_if_not_~cond) (forall ((v_ULTIMATE.start_main_~a~0_11 (_ BitVec 32))) (let ((.cse0 (bvurem c_ULTIMATE.start_main_~n~0 v_ULTIMATE.start_main_~a~0_11))) (or (not (bvule v_ULTIMATE.start_main_~a~0_11 (_ bv10 32))) (not (bvuge ((_ fp.to_ubv 32) roundTowardZero (fp.sqrt c_currentRoundingMode ((_ to_fp_unsigned 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~n~0))) v_ULTIMATE.start_main_~a~0_11)) (not (bvugt v_ULTIMATE.start_main_~a~0_11 (_ bv2 32))) (not (bvuge v_ULTIMATE.start_main_~a~0_11 (_ bv0 32))) (not (let ((.cse1 (bvadd v_ULTIMATE.start_main_~a~0_11 (_ bv4294967294 32)))) (bvult (bvadd (bvmul .cse0 (_ bv2 32)) (bvmul (bvneg (bvudiv c_ULTIMATE.start_main_~n~0 v_ULTIMATE.start_main_~a~0_11)) (_ bv4 32)) (bvmul (bvudiv c_ULTIMATE.start_main_~n~0 .cse1) (_ bv4 32))) (bvadd (bvurem c_ULTIMATE.start_main_~n~0 .cse1) v_ULTIMATE.start_main_~a~0_11 (_ bv2 32))))) (= (_ bv0 32) .cse0))))) is different from true [2020-12-09 06:14:33,105 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 06:14:33,105 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 06:14:35,429 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_main_~a~0_11 (_ BitVec 32)) (v_ULTIMATE.start_main_~n~0_11 (_ BitVec 32))) (let ((.cse0 (bvurem v_ULTIMATE.start_main_~n~0_11 v_ULTIMATE.start_main_~a~0_11))) (or (not (bvule v_ULTIMATE.start_main_~a~0_11 (_ bv10 32))) (not (bvuge v_ULTIMATE.start_main_~n~0_11 (_ bv0 32))) (not (bvugt v_ULTIMATE.start_main_~a~0_11 (_ bv2 32))) (= .cse0 (_ bv0 32)) (not (bvuge v_ULTIMATE.start_main_~a~0_11 (_ bv0 32))) (not (bvule v_ULTIMATE.start_main_~n~0_11 (_ bv10 32))) (not (let ((.cse1 (bvadd v_ULTIMATE.start_main_~a~0_11 (_ bv4294967294 32)))) (bvult (bvadd (bvmul .cse0 (_ bv2 32)) (bvmul (bvneg (bvudiv v_ULTIMATE.start_main_~n~0_11 v_ULTIMATE.start_main_~a~0_11)) (_ bv4 32)) (bvmul (bvudiv v_ULTIMATE.start_main_~n~0_11 .cse1) (_ bv4 32))) (bvadd (bvurem v_ULTIMATE.start_main_~n~0_11 .cse1) v_ULTIMATE.start_main_~a~0_11 (_ bv2 32))))) (not (bvuge ((_ fp.to_ubv 32) roundTowardZero (fp.sqrt c_currentRoundingMode ((_ to_fp_unsigned 11 53) c_currentRoundingMode v_ULTIMATE.start_main_~n~0_11))) v_ULTIMATE.start_main_~a~0_11))))) is different from false [2020-12-09 06:14:37,836 WARN L860 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_main_~a~0_11 (_ BitVec 32)) (v_ULTIMATE.start_main_~n~0_11 (_ BitVec 32))) (let ((.cse0 (bvurem v_ULTIMATE.start_main_~n~0_11 v_ULTIMATE.start_main_~a~0_11))) (or (not (bvule v_ULTIMATE.start_main_~a~0_11 (_ bv10 32))) (not (bvuge v_ULTIMATE.start_main_~n~0_11 (_ bv0 32))) (not (bvugt v_ULTIMATE.start_main_~a~0_11 (_ bv2 32))) (= .cse0 (_ bv0 32)) (not (bvuge v_ULTIMATE.start_main_~a~0_11 (_ bv0 32))) (not (bvule v_ULTIMATE.start_main_~n~0_11 (_ bv10 32))) (not (let ((.cse1 (bvadd v_ULTIMATE.start_main_~a~0_11 (_ bv4294967294 32)))) (bvult (bvadd (bvmul .cse0 (_ bv2 32)) (bvmul (bvneg (bvudiv v_ULTIMATE.start_main_~n~0_11 v_ULTIMATE.start_main_~a~0_11)) (_ bv4 32)) (bvmul (bvudiv v_ULTIMATE.start_main_~n~0_11 .cse1) (_ bv4 32))) (bvadd (bvurem v_ULTIMATE.start_main_~n~0_11 .cse1) v_ULTIMATE.start_main_~a~0_11 (_ bv2 32))))) (not (bvuge ((_ fp.to_ubv 32) roundTowardZero (fp.sqrt c_currentRoundingMode ((_ to_fp_unsigned 11 53) c_currentRoundingMode v_ULTIMATE.start_main_~n~0_11))) v_ULTIMATE.start_main_~a~0_11))))) is different from true [2020-12-09 06:14:37,840 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 06:14:37,841 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1543882321] [2020-12-09 06:14:37,841 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-12-09 06:14:37,841 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [10] total 20 [2020-12-09 06:14:37,841 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724293395] [2020-12-09 06:14:37,841 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-12-09 06:14:37,842 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 06:14:37,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-12-09 06:14:37,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=81, Unknown=17, NotChecked=270, Total=420 [2020-12-09 06:14:37,842 INFO L87 Difference]: Start difference. First operand 40 states and 43 transitions. Second operand 11 states. [2020-12-09 06:14:39,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 06:14:39,640 INFO L93 Difference]: Finished difference Result 62 states and 70 transitions. [2020-12-09 06:14:39,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-12-09 06:14:39,643 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 24 [2020-12-09 06:14:39,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 06:14:39,644 INFO L225 Difference]: With dead ends: 62 [2020-12-09 06:14:39,644 INFO L226 Difference]: Without dead ends: 42 [2020-12-09 06:14:39,645 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 44.2s TimeCoverageRelationStatistics Valid=52, Invalid=81, Unknown=17, NotChecked=270, Total=420 [2020-12-09 06:14:39,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2020-12-09 06:14:39,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2020-12-09 06:14:39,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2020-12-09 06:14:39,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 44 transitions. [2020-12-09 06:14:39,650 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 44 transitions. Word has length 24 [2020-12-09 06:14:39,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 06:14:39,650 INFO L481 AbstractCegarLoop]: Abstraction has 41 states and 44 transitions. [2020-12-09 06:14:39,650 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-12-09 06:14:39,650 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 44 transitions. [2020-12-09 06:14:39,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-12-09 06:14:39,651 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 06:14:39,651 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 06:14:39,852 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2020-12-09 06:14:39,853 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 06:14:39,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 06:14:39,854 INFO L82 PathProgramCache]: Analyzing trace with hash 1154209558, now seen corresponding path program 1 times [2020-12-09 06:14:39,855 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 06:14:39,856 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1935839825] [2020-12-09 06:14:39,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_849c3f1d-6965-49ab-afb9-2a4df5ccf9fc/bin/utaipan/mathsat Starting monitored process 8 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with mathsat -unsat_core_generation=3 [2020-12-09 06:14:40,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 06:14:40,360 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 18 conjunts are in the unsatisfiable core [2020-12-09 06:14:40,361 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 06:14:41,177 WARN L197 SmtUtils]: Spent 705.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 16 [2020-12-09 06:14:42,150 WARN L197 SmtUtils]: Spent 692.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 18 [2020-12-09 06:14:42,398 WARN L197 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2020-12-09 06:14:42,908 WARN L197 SmtUtils]: Spent 364.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2020-12-09 06:14:43,235 WARN L197 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2020-12-09 06:14:45,695 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((ULTIMATE.start_main_~n~0 (_ BitVec 32))) (let ((.cse0 (bvadd c_ULTIMATE.start_main_~d~0 (_ bv4294967294 32)))) (and (= (bvadd (bvmul (_ bv4 32) (bvneg (bvudiv ULTIMATE.start_main_~n~0 c_ULTIMATE.start_main_~d~0))) (bvmul (_ bv4 32) (bvudiv ULTIMATE.start_main_~n~0 .cse0))) c_ULTIMATE.start_main_~q~0) (= ((_ fp.to_ubv 32) roundTowardZero (fp.sqrt roundNearestTiesToEven ((_ to_fp_unsigned 11 53) roundNearestTiesToEven ULTIMATE.start_main_~n~0))) c_ULTIMATE.start_main_~s~0) (= c_ULTIMATE.start_main_~k~0 (bvurem ULTIMATE.start_main_~n~0 .cse0)) (= c_ULTIMATE.start_main_~r~0 (bvurem ULTIMATE.start_main_~n~0 c_ULTIMATE.start_main_~d~0)) (bvule ULTIMATE.start_main_~n~0 (_ bv10 32))))) (bvugt c_ULTIMATE.start_main_~d~0 (_ bv2 32)) (bvule c_ULTIMATE.start_main_~d~0 (_ bv10 32))) is different from false [2020-12-09 06:14:48,182 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((ULTIMATE.start_main_~n~0 (_ BitVec 32))) (let ((.cse0 (bvadd c_ULTIMATE.start_main_~d~0 (_ bv4294967294 32)))) (and (= (bvadd (bvmul (_ bv4 32) (bvneg (bvudiv ULTIMATE.start_main_~n~0 c_ULTIMATE.start_main_~d~0))) (bvmul (_ bv4 32) (bvudiv ULTIMATE.start_main_~n~0 .cse0))) c_ULTIMATE.start_main_~q~0) (= c_ULTIMATE.start_main_~k~0 (bvurem ULTIMATE.start_main_~n~0 .cse0)) (= c_ULTIMATE.start_main_~r~0 (bvurem ULTIMATE.start_main_~n~0 c_ULTIMATE.start_main_~d~0)) (bvuge ((_ fp.to_ubv 32) roundTowardZero (fp.sqrt roundNearestTiesToEven ((_ to_fp_unsigned 11 53) roundNearestTiesToEven ULTIMATE.start_main_~n~0))) c_ULTIMATE.start_main_~d~0) (bvule ULTIMATE.start_main_~n~0 (_ bv10 32))))) (bvugt c_ULTIMATE.start_main_~d~0 (_ bv2 32)) (not (= (_ bv0 32) c_ULTIMATE.start_main_~r~0)) (bvule c_ULTIMATE.start_main_~d~0 (_ bv10 32))) is different from false [2020-12-09 06:14:55,445 WARN L838 $PredicateComparison]: unable to prove that (exists ((ULTIMATE.start_main_~n~0 (_ BitVec 32)) (v_ULTIMATE.start_main_~d~0_26 (_ BitVec 32))) (let ((.cse0 (bvurem ULTIMATE.start_main_~n~0 v_ULTIMATE.start_main_~d~0_26))) (and (bvuge ((_ fp.to_ubv 32) roundTowardZero (fp.sqrt roundNearestTiesToEven ((_ to_fp_unsigned 11 53) roundNearestTiesToEven ULTIMATE.start_main_~n~0))) v_ULTIMATE.start_main_~d~0_26) (bvugt v_ULTIMATE.start_main_~d~0_26 (_ bv2 32)) (bvule ULTIMATE.start_main_~n~0 (_ bv10 32)) (not (= .cse0 (_ bv0 32))) (bvule v_ULTIMATE.start_main_~d~0_26 (_ bv10 32)) (let ((.cse1 (bvadd v_ULTIMATE.start_main_~d~0_26 (_ bv4294967294 32)))) (bvult (bvadd (bvmul (bvudiv ULTIMATE.start_main_~n~0 .cse1) (_ bv4 32)) (bvmul (bvneg (bvudiv ULTIMATE.start_main_~n~0 v_ULTIMATE.start_main_~d~0_26)) (_ bv4 32)) (bvmul .cse0 (_ bv2 32))) (bvadd (bvmul v_ULTIMATE.start_main_~d~0_26 (_ bv2 32)) (bvurem ULTIMATE.start_main_~n~0 .cse1) (_ bv4 32))))))) is different from false [2020-12-09 06:14:57,743 WARN L860 $PredicateComparison]: unable to prove that (exists ((ULTIMATE.start_main_~n~0 (_ BitVec 32)) (v_ULTIMATE.start_main_~d~0_26 (_ BitVec 32))) (let ((.cse0 (bvurem ULTIMATE.start_main_~n~0 v_ULTIMATE.start_main_~d~0_26))) (and (bvuge ((_ fp.to_ubv 32) roundTowardZero (fp.sqrt roundNearestTiesToEven ((_ to_fp_unsigned 11 53) roundNearestTiesToEven ULTIMATE.start_main_~n~0))) v_ULTIMATE.start_main_~d~0_26) (bvugt v_ULTIMATE.start_main_~d~0_26 (_ bv2 32)) (bvule ULTIMATE.start_main_~n~0 (_ bv10 32)) (not (= .cse0 (_ bv0 32))) (bvule v_ULTIMATE.start_main_~d~0_26 (_ bv10 32)) (let ((.cse1 (bvadd v_ULTIMATE.start_main_~d~0_26 (_ bv4294967294 32)))) (bvult (bvadd (bvmul (bvudiv ULTIMATE.start_main_~n~0 .cse1) (_ bv4 32)) (bvmul (bvneg (bvudiv ULTIMATE.start_main_~n~0 v_ULTIMATE.start_main_~d~0_26)) (_ bv4 32)) (bvmul .cse0 (_ bv2 32))) (bvadd (bvmul v_ULTIMATE.start_main_~d~0_26 (_ bv2 32)) (bvurem ULTIMATE.start_main_~n~0 .cse1) (_ bv4 32))))))) is different from true [2020-12-09 06:15:07,452 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2020-12-09 06:15:07,452 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-09 06:15:08,085 WARN L197 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2020-12-09 06:15:10,505 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (bvurem c_ULTIMATE.start_main_~n~0 c_ULTIMATE.start_main_~a~0))) (or (= .cse0 (_ bv0 32)) (not (bvuge ((_ fp.to_ubv 32) roundTowardZero (fp.sqrt c_currentRoundingMode ((_ to_fp_unsigned 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~n~0))) c_ULTIMATE.start_main_~a~0)) (not (let ((.cse1 (bvadd c_ULTIMATE.start_main_~a~0 (_ bv4294967294 32)))) (bvult (bvadd (bvmul (bvudiv c_ULTIMATE.start_main_~n~0 .cse1) (_ bv4 32)) (bvmul (bvneg (bvudiv c_ULTIMATE.start_main_~n~0 c_ULTIMATE.start_main_~a~0)) (_ bv4 32)) (bvmul .cse0 (_ bv2 32))) (bvadd (bvurem c_ULTIMATE.start_main_~n~0 .cse1) (bvmul c_ULTIMATE.start_main_~a~0 (_ bv2 32)) (_ bv4 32))))))) is different from false [2020-12-09 06:15:12,913 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (bvurem c_ULTIMATE.start_main_~n~0 c_ULTIMATE.start_main_~a~0))) (or (= .cse0 (_ bv0 32)) (not (bvuge ((_ fp.to_ubv 32) roundTowardZero (fp.sqrt c_currentRoundingMode ((_ to_fp_unsigned 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~n~0))) c_ULTIMATE.start_main_~a~0)) (not (let ((.cse1 (bvadd c_ULTIMATE.start_main_~a~0 (_ bv4294967294 32)))) (bvult (bvadd (bvmul (bvudiv c_ULTIMATE.start_main_~n~0 .cse1) (_ bv4 32)) (bvmul (bvneg (bvudiv c_ULTIMATE.start_main_~n~0 c_ULTIMATE.start_main_~a~0)) (_ bv4 32)) (bvmul .cse0 (_ bv2 32))) (bvadd (bvurem c_ULTIMATE.start_main_~n~0 .cse1) (bvmul c_ULTIMATE.start_main_~a~0 (_ bv2 32)) (_ bv4 32))))))) is different from true [2020-12-09 06:15:15,317 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (bvurem c_ULTIMATE.start_main_~n~0 c_ULTIMATE.start_main_~a~0))) (or (= .cse0 (_ bv0 32)) (not (bvuge ((_ fp.to_ubv 32) roundTowardZero (fp.sqrt c_currentRoundingMode ((_ to_fp_unsigned 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~n~0))) c_ULTIMATE.start_main_~a~0)) (= (_ bv0 32) c_ULTIMATE.start_assume_abort_if_not_~cond) (not (let ((.cse1 (bvadd c_ULTIMATE.start_main_~a~0 (_ bv4294967294 32)))) (bvult (bvadd (bvmul (bvudiv c_ULTIMATE.start_main_~n~0 .cse1) (_ bv4 32)) (bvmul (bvneg (bvudiv c_ULTIMATE.start_main_~n~0 c_ULTIMATE.start_main_~a~0)) (_ bv4 32)) (bvmul .cse0 (_ bv2 32))) (bvadd (bvurem c_ULTIMATE.start_main_~n~0 .cse1) (bvmul c_ULTIMATE.start_main_~a~0 (_ bv2 32)) (_ bv4 32))))))) is different from false [2020-12-09 06:15:17,715 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (bvurem c_ULTIMATE.start_main_~n~0 c_ULTIMATE.start_main_~a~0))) (or (= .cse0 (_ bv0 32)) (not (bvuge ((_ fp.to_ubv 32) roundTowardZero (fp.sqrt c_currentRoundingMode ((_ to_fp_unsigned 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~n~0))) c_ULTIMATE.start_main_~a~0)) (= (_ bv0 32) c_ULTIMATE.start_assume_abort_if_not_~cond) (not (let ((.cse1 (bvadd c_ULTIMATE.start_main_~a~0 (_ bv4294967294 32)))) (bvult (bvadd (bvmul (bvudiv c_ULTIMATE.start_main_~n~0 .cse1) (_ bv4 32)) (bvmul (bvneg (bvudiv c_ULTIMATE.start_main_~n~0 c_ULTIMATE.start_main_~a~0)) (_ bv4 32)) (bvmul .cse0 (_ bv2 32))) (bvadd (bvurem c_ULTIMATE.start_main_~n~0 .cse1) (bvmul c_ULTIMATE.start_main_~a~0 (_ bv2 32)) (_ bv4 32))))))) is different from true [2020-12-09 06:15:17,719 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-12-09 06:15:17,720 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 06:15:20,137 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (bvurem c_ULTIMATE.start_main_~n~0 c_ULTIMATE.start_main_~a~0))) (or (= .cse0 (_ bv0 32)) (not (bvugt c_ULTIMATE.start_main_~a~0 (_ bv2 32))) (not (bvuge ((_ fp.to_ubv 32) roundTowardZero (fp.sqrt c_currentRoundingMode ((_ to_fp_unsigned 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~n~0))) c_ULTIMATE.start_main_~a~0)) (not (let ((.cse1 (bvadd c_ULTIMATE.start_main_~a~0 (_ bv4294967294 32)))) (bvult (bvadd (bvmul (bvudiv c_ULTIMATE.start_main_~n~0 .cse1) (_ bv4 32)) (bvmul (bvneg (bvudiv c_ULTIMATE.start_main_~n~0 c_ULTIMATE.start_main_~a~0)) (_ bv4 32)) (bvmul .cse0 (_ bv2 32))) (bvadd (bvurem c_ULTIMATE.start_main_~n~0 .cse1) (bvmul c_ULTIMATE.start_main_~a~0 (_ bv2 32)) (_ bv4 32))))))) is different from false [2020-12-09 06:15:22,548 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (bvurem c_ULTIMATE.start_main_~n~0 c_ULTIMATE.start_main_~a~0))) (or (= .cse0 (_ bv0 32)) (not (bvugt c_ULTIMATE.start_main_~a~0 (_ bv2 32))) (not (bvuge ((_ fp.to_ubv 32) roundTowardZero (fp.sqrt c_currentRoundingMode ((_ to_fp_unsigned 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~n~0))) c_ULTIMATE.start_main_~a~0)) (not (let ((.cse1 (bvadd c_ULTIMATE.start_main_~a~0 (_ bv4294967294 32)))) (bvult (bvadd (bvmul (bvudiv c_ULTIMATE.start_main_~n~0 .cse1) (_ bv4 32)) (bvmul (bvneg (bvudiv c_ULTIMATE.start_main_~n~0 c_ULTIMATE.start_main_~a~0)) (_ bv4 32)) (bvmul .cse0 (_ bv2 32))) (bvadd (bvurem c_ULTIMATE.start_main_~n~0 .cse1) (bvmul c_ULTIMATE.start_main_~a~0 (_ bv2 32)) (_ bv4 32))))))) is different from true [2020-12-09 06:15:24,958 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (bvurem c_ULTIMATE.start_main_~n~0 c_ULTIMATE.start_main_~a~0))) (or (= .cse0 (_ bv0 32)) (not (bvugt c_ULTIMATE.start_main_~a~0 (_ bv2 32))) (not (bvuge ((_ fp.to_ubv 32) roundTowardZero (fp.sqrt c_currentRoundingMode ((_ to_fp_unsigned 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~n~0))) c_ULTIMATE.start_main_~a~0)) (= (_ bv0 32) c_ULTIMATE.start_assume_abort_if_not_~cond) (not (let ((.cse1 (bvadd c_ULTIMATE.start_main_~a~0 (_ bv4294967294 32)))) (bvult (bvadd (bvmul (bvudiv c_ULTIMATE.start_main_~n~0 .cse1) (_ bv4 32)) (bvmul (bvneg (bvudiv c_ULTIMATE.start_main_~n~0 c_ULTIMATE.start_main_~a~0)) (_ bv4 32)) (bvmul .cse0 (_ bv2 32))) (bvadd (bvurem c_ULTIMATE.start_main_~n~0 .cse1) (bvmul c_ULTIMATE.start_main_~a~0 (_ bv2 32)) (_ bv4 32))))))) is different from false [2020-12-09 06:15:27,361 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (bvurem c_ULTIMATE.start_main_~n~0 c_ULTIMATE.start_main_~a~0))) (or (= .cse0 (_ bv0 32)) (not (bvugt c_ULTIMATE.start_main_~a~0 (_ bv2 32))) (not (bvuge ((_ fp.to_ubv 32) roundTowardZero (fp.sqrt c_currentRoundingMode ((_ to_fp_unsigned 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~n~0))) c_ULTIMATE.start_main_~a~0)) (= (_ bv0 32) c_ULTIMATE.start_assume_abort_if_not_~cond) (not (let ((.cse1 (bvadd c_ULTIMATE.start_main_~a~0 (_ bv4294967294 32)))) (bvult (bvadd (bvmul (bvudiv c_ULTIMATE.start_main_~n~0 .cse1) (_ bv4 32)) (bvmul (bvneg (bvudiv c_ULTIMATE.start_main_~n~0 c_ULTIMATE.start_main_~a~0)) (_ bv4 32)) (bvmul .cse0 (_ bv2 32))) (bvadd (bvurem c_ULTIMATE.start_main_~n~0 .cse1) (bvmul c_ULTIMATE.start_main_~a~0 (_ bv2 32)) (_ bv4 32))))))) is different from true [2020-12-09 06:15:27,367 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 06:15:27,368 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 06:15:29,810 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_main_~a~0_13 (_ BitVec 32))) (let ((.cse0 (bvurem c_ULTIMATE.start_main_~n~0 v_ULTIMATE.start_main_~a~0_13))) (or (not (bvuge ((_ fp.to_ubv 32) roundTowardZero (fp.sqrt c_currentRoundingMode ((_ to_fp_unsigned 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~n~0))) v_ULTIMATE.start_main_~a~0_13)) (not (bvuge v_ULTIMATE.start_main_~a~0_13 (_ bv0 32))) (not (bvule v_ULTIMATE.start_main_~a~0_13 (_ bv10 32))) (= .cse0 (_ bv0 32)) (not (bvugt v_ULTIMATE.start_main_~a~0_13 (_ bv2 32))) (not (let ((.cse1 (bvadd v_ULTIMATE.start_main_~a~0_13 (_ bv4294967294 32)))) (bvult (bvadd (bvmul .cse0 (_ bv2 32)) (bvmul (bvneg (bvudiv c_ULTIMATE.start_main_~n~0 v_ULTIMATE.start_main_~a~0_13)) (_ bv4 32)) (bvmul (bvudiv c_ULTIMATE.start_main_~n~0 .cse1) (_ bv4 32))) (bvadd (bvmul v_ULTIMATE.start_main_~a~0_13 (_ bv2 32)) (bvurem c_ULTIMATE.start_main_~n~0 .cse1) (_ bv4 32)))))))) is different from false [2020-12-09 06:15:32,220 WARN L860 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_main_~a~0_13 (_ BitVec 32))) (let ((.cse0 (bvurem c_ULTIMATE.start_main_~n~0 v_ULTIMATE.start_main_~a~0_13))) (or (not (bvuge ((_ fp.to_ubv 32) roundTowardZero (fp.sqrt c_currentRoundingMode ((_ to_fp_unsigned 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~n~0))) v_ULTIMATE.start_main_~a~0_13)) (not (bvuge v_ULTIMATE.start_main_~a~0_13 (_ bv0 32))) (not (bvule v_ULTIMATE.start_main_~a~0_13 (_ bv10 32))) (= .cse0 (_ bv0 32)) (not (bvugt v_ULTIMATE.start_main_~a~0_13 (_ bv2 32))) (not (let ((.cse1 (bvadd v_ULTIMATE.start_main_~a~0_13 (_ bv4294967294 32)))) (bvult (bvadd (bvmul .cse0 (_ bv2 32)) (bvmul (bvneg (bvudiv c_ULTIMATE.start_main_~n~0 v_ULTIMATE.start_main_~a~0_13)) (_ bv4 32)) (bvmul (bvudiv c_ULTIMATE.start_main_~n~0 .cse1) (_ bv4 32))) (bvadd (bvmul v_ULTIMATE.start_main_~a~0_13 (_ bv2 32)) (bvurem c_ULTIMATE.start_main_~n~0 .cse1) (_ bv4 32)))))))) is different from true [2020-12-09 06:15:34,678 WARN L860 $PredicateComparison]: unable to prove that (or (= (_ bv0 32) c_ULTIMATE.start_assume_abort_if_not_~cond) (forall ((v_ULTIMATE.start_main_~a~0_13 (_ BitVec 32))) (let ((.cse0 (bvurem c_ULTIMATE.start_main_~n~0 v_ULTIMATE.start_main_~a~0_13))) (or (not (bvuge ((_ fp.to_ubv 32) roundTowardZero (fp.sqrt c_currentRoundingMode ((_ to_fp_unsigned 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~n~0))) v_ULTIMATE.start_main_~a~0_13)) (not (bvuge v_ULTIMATE.start_main_~a~0_13 (_ bv0 32))) (not (bvule v_ULTIMATE.start_main_~a~0_13 (_ bv10 32))) (= .cse0 (_ bv0 32)) (not (bvugt v_ULTIMATE.start_main_~a~0_13 (_ bv2 32))) (not (let ((.cse1 (bvadd v_ULTIMATE.start_main_~a~0_13 (_ bv4294967294 32)))) (bvult (bvadd (bvmul .cse0 (_ bv2 32)) (bvmul (bvneg (bvudiv c_ULTIMATE.start_main_~n~0 v_ULTIMATE.start_main_~a~0_13)) (_ bv4 32)) (bvmul (bvudiv c_ULTIMATE.start_main_~n~0 .cse1) (_ bv4 32))) (bvadd (bvmul v_ULTIMATE.start_main_~a~0_13 (_ bv2 32)) (bvurem c_ULTIMATE.start_main_~n~0 .cse1) (_ bv4 32))))))))) is different from true [2020-12-09 06:15:34,685 INFO L398 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-12-09 06:15:34,686 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-09 06:15:37,009 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_main_~a~0_13 (_ BitVec 32)) (v_ULTIMATE.start_main_~n~0_12 (_ BitVec 32))) (let ((.cse0 (bvurem v_ULTIMATE.start_main_~n~0_12 v_ULTIMATE.start_main_~a~0_13))) (or (= .cse0 (_ bv0 32)) (not (bvuge v_ULTIMATE.start_main_~a~0_13 (_ bv0 32))) (not (bvule v_ULTIMATE.start_main_~n~0_12 (_ bv10 32))) (not (bvule v_ULTIMATE.start_main_~a~0_13 (_ bv10 32))) (not (bvuge v_ULTIMATE.start_main_~n~0_12 (_ bv0 32))) (not (bvuge ((_ fp.to_ubv 32) roundTowardZero (fp.sqrt c_currentRoundingMode ((_ to_fp_unsigned 11 53) c_currentRoundingMode v_ULTIMATE.start_main_~n~0_12))) v_ULTIMATE.start_main_~a~0_13)) (not (bvugt v_ULTIMATE.start_main_~a~0_13 (_ bv2 32))) (not (let ((.cse1 (bvadd v_ULTIMATE.start_main_~a~0_13 (_ bv4294967294 32)))) (bvult (bvadd (bvmul (bvneg (bvudiv v_ULTIMATE.start_main_~n~0_12 v_ULTIMATE.start_main_~a~0_13)) (_ bv4 32)) (bvmul .cse0 (_ bv2 32)) (bvmul (bvudiv v_ULTIMATE.start_main_~n~0_12 .cse1) (_ bv4 32))) (bvadd (bvmul v_ULTIMATE.start_main_~a~0_13 (_ bv2 32)) (bvurem v_ULTIMATE.start_main_~n~0_12 .cse1) (_ bv4 32)))))))) is different from false [2020-12-09 06:15:39,434 WARN L860 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_main_~a~0_13 (_ BitVec 32)) (v_ULTIMATE.start_main_~n~0_12 (_ BitVec 32))) (let ((.cse0 (bvurem v_ULTIMATE.start_main_~n~0_12 v_ULTIMATE.start_main_~a~0_13))) (or (= .cse0 (_ bv0 32)) (not (bvuge v_ULTIMATE.start_main_~a~0_13 (_ bv0 32))) (not (bvule v_ULTIMATE.start_main_~n~0_12 (_ bv10 32))) (not (bvule v_ULTIMATE.start_main_~a~0_13 (_ bv10 32))) (not (bvuge v_ULTIMATE.start_main_~n~0_12 (_ bv0 32))) (not (bvuge ((_ fp.to_ubv 32) roundTowardZero (fp.sqrt c_currentRoundingMode ((_ to_fp_unsigned 11 53) c_currentRoundingMode v_ULTIMATE.start_main_~n~0_12))) v_ULTIMATE.start_main_~a~0_13)) (not (bvugt v_ULTIMATE.start_main_~a~0_13 (_ bv2 32))) (not (let ((.cse1 (bvadd v_ULTIMATE.start_main_~a~0_13 (_ bv4294967294 32)))) (bvult (bvadd (bvmul (bvneg (bvudiv v_ULTIMATE.start_main_~n~0_12 v_ULTIMATE.start_main_~a~0_13)) (_ bv4 32)) (bvmul .cse0 (_ bv2 32)) (bvmul (bvudiv v_ULTIMATE.start_main_~n~0_12 .cse1) (_ bv4 32))) (bvadd (bvmul v_ULTIMATE.start_main_~a~0_13 (_ bv2 32)) (bvurem v_ULTIMATE.start_main_~n~0_12 .cse1) (_ bv4 32)))))))) is different from true [2020-12-09 06:15:39,439 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 06:15:39,439 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1935839825] [2020-12-09 06:15:39,439 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-12-09 06:15:39,439 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [10] total 20 [2020-12-09 06:15:39,439 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159835792] [2020-12-09 06:15:39,440 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-12-09 06:15:39,440 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2020-12-09 06:15:39,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-12-09 06:15:39,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=81, Unknown=17, NotChecked=270, Total=420 [2020-12-09 06:15:39,441 INFO L87 Difference]: Start difference. First operand 41 states and 44 transitions. Second operand 11 states. [2020-12-09 06:15:41,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 06:15:41,017 INFO L93 Difference]: Finished difference Result 62 states and 69 transitions. [2020-12-09 06:15:41,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-12-09 06:15:41,021 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25 [2020-12-09 06:15:41,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 06:15:41,021 INFO L225 Difference]: With dead ends: 62 [2020-12-09 06:15:41,022 INFO L226 Difference]: Without dead ends: 42 [2020-12-09 06:15:41,022 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 44.4s TimeCoverageRelationStatistics Valid=52, Invalid=81, Unknown=17, NotChecked=270, Total=420 [2020-12-09 06:15:41,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2020-12-09 06:15:41,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2020-12-09 06:15:41,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-12-09 06:15:41,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 45 transitions. [2020-12-09 06:15:41,030 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 45 transitions. Word has length 25 [2020-12-09 06:15:41,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 06:15:41,033 INFO L481 AbstractCegarLoop]: Abstraction has 42 states and 45 transitions. [2020-12-09 06:15:41,033 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-12-09 06:15:41,033 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 45 transitions. [2020-12-09 06:15:41,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-12-09 06:15:41,034 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 06:15:41,034 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 06:15:41,235 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 mathsat -unsat_core_generation=3 [2020-12-09 06:15:41,236 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 06:15:41,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 06:15:41,237 INFO L82 PathProgramCache]: Analyzing trace with hash 1154269140, now seen corresponding path program 1 times [2020-12-09 06:15:41,238 INFO L162 FreeRefinementEngine]: Executing refinement strategy WALRUS [2020-12-09 06:15:41,239 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1217534225] [2020-12-09 06:15:41,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_849c3f1d-6965-49ab-afb9-2a4df5ccf9fc/bin/utaipan/mathsat Starting monitored process 9 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with mathsat -unsat_core_generation=3 [2020-12-09 06:15:41,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 06:15:41,709 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 25 conjunts are in the unsatisfiable core [2020-12-09 06:15:41,711 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 06:15:42,538 WARN L197 SmtUtils]: Spent 717.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 16 [2020-12-09 06:15:42,735 WARN L197 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 7 [2020-12-09 06:15:43,619 WARN L197 SmtUtils]: Spent 778.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 18 [2020-12-09 06:15:43,921 WARN L197 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2020-12-09 06:15:44,458 WARN L197 SmtUtils]: Spent 379.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2020-12-09 06:15:44,801 WARN L197 SmtUtils]: Spent 158.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2020-12-09 06:15:47,232 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd c_ULTIMATE.start_main_~d~0 (_ bv4294967294 32)))) (and (= (bvadd (bvmul (_ bv4 32) (bvneg (bvudiv c_ULTIMATE.start_main_~n~0 c_ULTIMATE.start_main_~d~0))) (bvmul (_ bv4 32) (bvudiv c_ULTIMATE.start_main_~n~0 .cse0))) c_ULTIMATE.start_main_~q~0) (= ((_ fp.to_ubv 32) roundTowardZero (fp.sqrt roundNearestTiesToEven ((_ to_fp_unsigned 11 53) roundNearestTiesToEven c_ULTIMATE.start_main_~n~0))) c_ULTIMATE.start_main_~s~0) (= c_ULTIMATE.start_main_~k~0 (bvurem c_ULTIMATE.start_main_~n~0 .cse0)) (bvugt c_ULTIMATE.start_main_~d~0 (_ bv2 32)) (= c_ULTIMATE.start_main_~r~0 (bvurem c_ULTIMATE.start_main_~n~0 c_ULTIMATE.start_main_~d~0)) (bvule c_ULTIMATE.start_main_~d~0 (_ bv10 32)) (bvule c_ULTIMATE.start_main_~n~0 (_ bv10 32)))) is different from false [2020-12-09 06:15:49,640 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd c_ULTIMATE.start_main_~d~0 (_ bv4294967294 32)))) (and (= (bvadd (bvmul (_ bv4 32) (bvneg (bvudiv c_ULTIMATE.start_main_~n~0 c_ULTIMATE.start_main_~d~0))) (bvmul (_ bv4 32) (bvudiv c_ULTIMATE.start_main_~n~0 .cse0))) c_ULTIMATE.start_main_~q~0) (= ((_ fp.to_ubv 32) roundTowardZero (fp.sqrt roundNearestTiesToEven ((_ to_fp_unsigned 11 53) roundNearestTiesToEven c_ULTIMATE.start_main_~n~0))) c_ULTIMATE.start_main_~s~0) (= c_ULTIMATE.start_main_~k~0 (bvurem c_ULTIMATE.start_main_~n~0 .cse0)) (bvugt c_ULTIMATE.start_main_~d~0 (_ bv2 32)) (= c_ULTIMATE.start_main_~r~0 (bvurem c_ULTIMATE.start_main_~n~0 c_ULTIMATE.start_main_~d~0)) (bvule c_ULTIMATE.start_main_~d~0 (_ bv10 32)) (bvule c_ULTIMATE.start_main_~n~0 (_ bv10 32)))) is different from true [2020-12-09 06:15:52,083 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd c_ULTIMATE.start_main_~d~0 (_ bv4294967294 32)))) (and (= (bvadd (bvmul (_ bv4 32) (bvneg (bvudiv c_ULTIMATE.start_main_~n~0 c_ULTIMATE.start_main_~d~0))) (bvmul (_ bv4 32) (bvudiv c_ULTIMATE.start_main_~n~0 .cse0))) c_ULTIMATE.start_main_~q~0) (= c_ULTIMATE.start_main_~k~0 (bvurem c_ULTIMATE.start_main_~n~0 .cse0)) (bvugt c_ULTIMATE.start_main_~d~0 (_ bv2 32)) (not (= (_ bv0 32) c_ULTIMATE.start_main_~r~0)) (= c_ULTIMATE.start_main_~r~0 (bvurem c_ULTIMATE.start_main_~n~0 c_ULTIMATE.start_main_~d~0)) (bvuge ((_ fp.to_ubv 32) roundTowardZero (fp.sqrt roundNearestTiesToEven ((_ to_fp_unsigned 11 53) roundNearestTiesToEven c_ULTIMATE.start_main_~n~0))) c_ULTIMATE.start_main_~d~0) (bvule c_ULTIMATE.start_main_~d~0 (_ bv10 32)) (bvule c_ULTIMATE.start_main_~n~0 (_ bv10 32)))) is different from false [2020-12-09 06:15:54,556 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd c_ULTIMATE.start_main_~d~0 (_ bv4294967294 32)))) (and (= (bvadd (bvmul (_ bv4 32) (bvneg (bvudiv c_ULTIMATE.start_main_~n~0 c_ULTIMATE.start_main_~d~0))) (bvmul (_ bv4 32) (bvudiv c_ULTIMATE.start_main_~n~0 .cse0))) c_ULTIMATE.start_main_~q~0) (= c_ULTIMATE.start_main_~k~0 (bvurem c_ULTIMATE.start_main_~n~0 .cse0)) (bvugt c_ULTIMATE.start_main_~d~0 (_ bv2 32)) (not (= (_ bv0 32) c_ULTIMATE.start_main_~r~0)) (= c_ULTIMATE.start_main_~r~0 (bvurem c_ULTIMATE.start_main_~n~0 c_ULTIMATE.start_main_~d~0)) (bvuge ((_ fp.to_ubv 32) roundTowardZero (fp.sqrt roundNearestTiesToEven ((_ to_fp_unsigned 11 53) roundNearestTiesToEven c_ULTIMATE.start_main_~n~0))) c_ULTIMATE.start_main_~d~0) (bvule c_ULTIMATE.start_main_~d~0 (_ bv10 32)) (bvule c_ULTIMATE.start_main_~n~0 (_ bv10 32)))) is different from true [2020-12-09 06:15:56,995 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd c_ULTIMATE.start_main_~d~0 (_ bv4294967294 32))) (.cse2 (bvadd c_ULTIMATE.start_main_~d~0 (_ bv4294967292 32)))) (let ((.cse0 (bvmul (_ bv4 32) (bvudiv c_ULTIMATE.start_main_~n~0 .cse2))) (.cse1 (bvmul (_ bv4 32) (bvneg (bvudiv c_ULTIMATE.start_main_~n~0 .cse3))))) (and (= (bvadd c_ULTIMATE.start_main_~r~0 (_ bv4 32)) (bvadd (bvneg (bvadd (bvmul c_ULTIMATE.start_main_~d~0 (_ bv2 32)) (_ bv4294967292 32))) .cse0 (bvmul (_ bv2 32) c_ULTIMATE.start_main_~k~0) .cse1 (bvneg (bvurem c_ULTIMATE.start_main_~n~0 .cse2)))) (bvugt .cse3 (_ bv2 32)) (bvuge ((_ fp.to_ubv 32) roundTowardZero (fp.sqrt roundNearestTiesToEven ((_ to_fp_unsigned 11 53) roundNearestTiesToEven c_ULTIMATE.start_main_~n~0))) .cse3) (= c_ULTIMATE.start_main_~k~0 (bvurem c_ULTIMATE.start_main_~n~0 .cse3)) (bvule .cse3 (_ bv10 32)) (bvule c_ULTIMATE.start_main_~n~0 (_ bv10 32)) (= (bvadd c_ULTIMATE.start_main_~q~0 (_ bv8 32)) (bvadd .cse0 .cse1)) (not (= (_ bv0 32) c_ULTIMATE.start_main_~k~0))))) is different from false [2020-12-09 06:15:59,416 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd c_ULTIMATE.start_main_~d~0 (_ bv4294967294 32))) (.cse2 (bvadd c_ULTIMATE.start_main_~d~0 (_ bv4294967292 32)))) (let ((.cse0 (bvmul (_ bv4 32) (bvudiv c_ULTIMATE.start_main_~n~0 .cse2))) (.cse1 (bvmul (_ bv4 32) (bvneg (bvudiv c_ULTIMATE.start_main_~n~0 .cse3))))) (and (= (bvadd c_ULTIMATE.start_main_~r~0 (_ bv4 32)) (bvadd (bvneg (bvadd (bvmul c_ULTIMATE.start_main_~d~0 (_ bv2 32)) (_ bv4294967292 32))) .cse0 (bvmul (_ bv2 32) c_ULTIMATE.start_main_~k~0) .cse1 (bvneg (bvurem c_ULTIMATE.start_main_~n~0 .cse2)))) (bvugt .cse3 (_ bv2 32)) (bvuge ((_ fp.to_ubv 32) roundTowardZero (fp.sqrt roundNearestTiesToEven ((_ to_fp_unsigned 11 53) roundNearestTiesToEven c_ULTIMATE.start_main_~n~0))) .cse3) (= c_ULTIMATE.start_main_~k~0 (bvurem c_ULTIMATE.start_main_~n~0 .cse3)) (bvule .cse3 (_ bv10 32)) (bvule c_ULTIMATE.start_main_~n~0 (_ bv10 32)) (= (bvadd c_ULTIMATE.start_main_~q~0 (_ bv8 32)) (bvadd .cse0 .cse1)) (not (= (_ bv0 32) c_ULTIMATE.start_main_~k~0))))) is different from true [2020-12-09 06:15:59,425 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 06:15:59,429 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 06:15:59,433 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-09 06:16:12,383 WARN L195 Executor]: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) stderr output: (error "out of memory") [2020-12-09 06:16:12,384 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1217534225] [2020-12-09 06:16:12,385 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") [2020-12-09 06:16:12,385 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2131264922] [2020-12-09 06:16:12,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_849c3f1d-6965-49ab-afb9-2a4df5ccf9fc/bin/utaipan/cvc4 Starting monitored process 10 with cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with cvc4 --incremental --print-success --lang smt [2020-12-09 06:16:18,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 06:16:18,277 WARN L261 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 36 conjunts are in the unsatisfiable core [2020-12-09 06:16:18,279 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 06:16:18,279 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) Connection to SMT solver broken [2020-12-09 06:16:18,280 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [907917172] [2020-12-09 06:16:18,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_849c3f1d-6965-49ab-afb9-2a4df5ccf9fc/bin/utaipan/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 06:19:46,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 06:19:46,907 WARN L261 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 35 conjunts are in the unsatisfiable core [2020-12-09 06:19:46,909 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-09 06:19:46,909 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) Connection to SMT solver broken [2020-12-09 06:19:46,909 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 0 imperfect interpolant sequences. [2020-12-09 06:19:46,909 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [] total 0 [2020-12-09 06:19:46,910 ERROR L205 FreeRefinementEngine]: Strategy WALRUS failed to provide any proof altough trace is infeasible [2020-12-09 06:19:46,910 INFO L523 BasicCegarLoop]: Counterexample might be feasible [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forcibly destroying the process [2020-12-09 06:19:47,515 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 mathsat -unsat_core_generation=3,10 cvc4 --incremental --print-success --lang smt,11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-09 06:19:47,526 WARN L254 ceAbstractionStarter]: Unable to decide correctness. Please check the following counterexample manually. [2020-12-09 06:19:47,527 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 06:19:47 BoogieIcfgContainer [2020-12-09 06:19:47,527 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-12-09 06:19:47,527 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-12-09 06:19:47,527 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-12-09 06:19:47,528 INFO L275 PluginConnector]: Witness Printer initialized [2020-12-09 06:19:47,528 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 06:11:53" (3/4) ... [2020-12-09 06:19:47,531 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-12-09 06:19:47,531 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-12-09 06:19:47,532 INFO L168 Benchmark]: Toolchain (without parser) took 477612.95 ms. Allocated memory was 56.6 MB in the beginning and 71.3 MB in the end (delta: 14.7 MB). Free memory was 36.1 MB in the beginning and 37.1 MB in the end (delta: -1.0 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. [2020-12-09 06:19:47,532 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 56.6 MB. Free memory was 39.2 MB in the beginning and 39.1 MB in the end (delta: 73.4 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-12-09 06:19:47,533 INFO L168 Benchmark]: CACSL2BoogieTranslator took 207.05 ms. Allocated memory was 56.6 MB in the beginning and 71.3 MB in the end (delta: 14.7 MB). Free memory was 35.9 MB in the beginning and 54.3 MB in the end (delta: -18.4 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. [2020-12-09 06:19:47,534 INFO L168 Benchmark]: Boogie Procedure Inliner took 29.80 ms. Allocated memory is still 71.3 MB. Free memory was 54.3 MB in the beginning and 52.5 MB in the end (delta: 1.9 MB). There was no memory consumed. Max. memory is 16.1 GB. [2020-12-09 06:19:47,534 INFO L168 Benchmark]: Boogie Preprocessor took 22.02 ms. Allocated memory is still 71.3 MB. Free memory was 52.5 MB in the beginning and 50.9 MB in the end (delta: 1.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-12-09 06:19:47,535 INFO L168 Benchmark]: RCFGBuilder took 3051.75 ms. Allocated memory is still 71.3 MB. Free memory was 50.9 MB in the beginning and 50.4 MB in the end (delta: 431.7 kB). Peak memory consumption was 18.2 MB. Max. memory is 16.1 GB. [2020-12-09 06:19:47,535 INFO L168 Benchmark]: TraceAbstraction took 474294.48 ms. Allocated memory is still 71.3 MB. Free memory was 50.1 MB in the beginning and 37.7 MB in the end (delta: 12.4 MB). Peak memory consumption was 12.0 MB. Max. memory is 16.1 GB. [2020-12-09 06:19:47,536 INFO L168 Benchmark]: Witness Printer took 3.55 ms. Allocated memory is still 71.3 MB. Free memory was 37.7 MB in the beginning and 37.1 MB in the end (delta: 660.9 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-12-09 06:19:47,539 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.11 ms. Allocated memory is still 56.6 MB. Free memory was 39.2 MB in the beginning and 39.1 MB in the end (delta: 73.4 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 207.05 ms. Allocated memory was 56.6 MB in the beginning and 71.3 MB in the end (delta: 14.7 MB). Free memory was 35.9 MB in the beginning and 54.3 MB in the end (delta: -18.4 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 29.80 ms. Allocated memory is still 71.3 MB. Free memory was 54.3 MB in the beginning and 52.5 MB in the end (delta: 1.9 MB). There was no memory consumed. Max. memory is 16.1 GB. * Boogie Preprocessor took 22.02 ms. Allocated memory is still 71.3 MB. Free memory was 52.5 MB in the beginning and 50.9 MB in the end (delta: 1.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 3051.75 ms. Allocated memory is still 71.3 MB. Free memory was 50.9 MB in the beginning and 50.4 MB in the end (delta: 431.7 kB). Peak memory consumption was 18.2 MB. Max. memory is 16.1 GB. * TraceAbstraction took 474294.48 ms. Allocated memory is still 71.3 MB. Free memory was 50.1 MB in the beginning and 37.7 MB in the end (delta: 12.4 MB). Peak memory consumption was 12.0 MB. Max. memory is 16.1 GB. * Witness Printer took 3.55 ms. Allocated memory is still 71.3 MB. Free memory was 37.7 MB in the beginning and 37.1 MB in the end (delta: 660.9 kB). There was no memory consumed. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 21]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: unable to decide satisfiability of path constraint. Possible FailurePath: [L27] unsigned n, a; [L28] unsigned r, k, q, d, s, t; [L29] n = __VERIFIER_nondet_uint() [L16] COND FALSE !(!cond) [L31] a = __VERIFIER_nondet_uint() [L16] COND FALSE !(!cond) [L16] COND FALSE !(!cond) [L16] COND FALSE !(!cond) [L35] d = a [L36] r = n % d [L37] t = 0 [L38] k = n % (d - 2) [L39] q = 4 * (n / (d - 2) - n / d) [L40] s = sqrt(n) [L41] COND TRUE 1 [L19] COND FALSE !(!(cond)) [L19] COND FALSE !(!(cond)) [L19] COND FALSE !(!(cond)) [L19] COND FALSE !(!(cond)) [L46] COND FALSE !(!((s >= d) && (r != 0))) [L47] COND FALSE !(2 * r + q < k) [L53] COND FALSE !((2 * r + q >= k) && (2 * r + q < d + k + 2)) [L58] COND FALSE !((2 * r + q >= k) && (2 * r + q >= d + k + 2) && (2 * r + q < 2 * d + k + 4)) [L65] t = r [L66] r = 2 * r - k + q - 2 * d - 4 [L67] k = t [L68] q = q - 8 [L69] d = d + 2 [L41] COND TRUE 1 [L19] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 34 locations, 4 error locations. Started 1 CEGAR loops. VerificationResult: UNKNOWN, OverallTime: 474.2s, OverallIterations: 8, TraceHistogramMax: 2, AutomataDifference: 32.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 136 SDtfs, 138 SDslu, 240 SDs, 0 SdLazy, 385 SolverSat, 43 SolverUnsat, 2 SolverUnknown, 0 SolverNotchecked, 26.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 201 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 30 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 148.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=42occurred in iteration=7, 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, 7 MinimizatonAttempts, 34 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 3.1s SatisfiabilityAnalysisTime, 190.1s InterpolantComputationTime, 130 NumberOfCodeBlocks, 130 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 192 ConstructedInterpolants, 51 QuantifiedInterpolants, 111009 SizeOfPredicates, 64 NumberOfNonLiveVariables, 368 ConjunctsInSsa, 95 ConjunctsInUnsatCore, 10 InterpolantComputations, 7 PerfectInterpolantSequences, 6/12 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 Received shutdown request...