./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/knuth_valuebound2.i --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/nla-digbench-scaling/knuth_valuebound2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5a67a238aa48b8a3ec66dc98385c4a2787b829a5e88d431b41ae6ef24ee0832f --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 17:33:46,358 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 17:33:46,360 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 17:33:46,393 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 17:33:46,394 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 17:33:46,407 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 17:33:46,408 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 17:33:46,410 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 17:33:46,411 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 17:33:46,414 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 17:33:46,414 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 17:33:46,415 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 17:33:46,415 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 17:33:46,417 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 17:33:46,418 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 17:33:46,421 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 17:33:46,422 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 17:33:46,422 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 17:33:46,424 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 17:33:46,429 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 17:33:46,434 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 17:33:46,434 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 17:33:46,436 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 17:33:46,437 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 17:33:46,441 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 17:33:46,441 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 17:33:46,441 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 17:33:46,442 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 17:33:46,443 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 17:33:46,443 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 17:33:46,443 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 17:33:46,444 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 17:33:46,445 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 17:33:46,445 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 17:33:46,446 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 17:33:46,446 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 17:33:46,447 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 17:33:46,447 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 17:33:46,447 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 17:33:46,448 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 17:33:46,448 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 17:33:46,449 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-02-20 17:33:46,470 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 17:33:46,471 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 17:33:46,471 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 17:33:46,471 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 17:33:46,472 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 17:33:46,472 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 17:33:46,472 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 17:33:46,472 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 17:33:46,472 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 17:33:46,473 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 17:33:46,473 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 17:33:46,473 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 17:33:46,473 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 17:33:46,474 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 17:33:46,474 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 17:33:46,474 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 17:33:46,474 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 17:33:46,474 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 17:33:46,474 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 17:33:46,474 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 17:33:46,474 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 17:33:46,475 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 17:33:46,475 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 17:33:46,475 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 17:33:46,475 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 17:33:46,475 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 17:33:46,475 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 17:33:46,476 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 17:33:46,476 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 17:33:46,476 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 17:33:46,477 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 17:33:46,477 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 17:33:46,477 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 17:33:46,477 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 5a67a238aa48b8a3ec66dc98385c4a2787b829a5e88d431b41ae6ef24ee0832f [2022-02-20 17:33:46,676 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 17:33:46,700 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 17:33:46,702 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 17:33:46,703 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 17:33:46,713 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 17:33:46,714 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/knuth_valuebound2.i [2022-02-20 17:33:46,759 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e6cac3ba/b9763ca4c17b48f7a73ee63def5ccce3/FLAG6afa5b38b [2022-02-20 17:33:47,079 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 17:33:47,080 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/knuth_valuebound2.i [2022-02-20 17:33:47,087 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e6cac3ba/b9763ca4c17b48f7a73ee63def5ccce3/FLAG6afa5b38b [2022-02-20 17:33:47,505 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e6cac3ba/b9763ca4c17b48f7a73ee63def5ccce3 [2022-02-20 17:33:47,508 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 17:33:47,509 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 17:33:47,511 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 17:33:47,511 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 17:33:47,513 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 17:33:47,513 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 05:33:47" (1/1) ... [2022-02-20 17:33:47,515 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f7aaa3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:33:47, skipping insertion in model container [2022-02-20 17:33:47,515 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 05:33:47" (1/1) ... [2022-02-20 17:33:47,519 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 17:33:47,534 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 17:33:47,628 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/knuth_valuebound2.i[948,961] [2022-02-20 17:33:47,641 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:848) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.standardfunctions.StandardFunctionHandler.handleUnaryFloatFunction(StandardFunctionHandler.java:1792) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.standardfunctions.StandardFunctionHandler.translateStandardFunction(StandardFunctionHandler.java:235) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1442) 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:729) 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:1392) 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:1076) 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:371) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1465) 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:3271) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:2356) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:601) 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) [2022-02-20 17:33:47,646 INFO L158 Benchmark]: Toolchain (without parser) took 135.74ms. Allocated memory is still 92.3MB. Free memory was 53.3MB in the beginning and 44.6MB in the end (delta: 8.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-02-20 17:33:47,646 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 92.3MB. Free memory is still 70.1MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 17:33:47,647 INFO L158 Benchmark]: CACSL2BoogieTranslator took 133.25ms. Allocated memory is still 92.3MB. Free memory was 53.1MB in the beginning and 44.6MB in the end (delta: 8.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-20 17:33:47,647 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 92.3MB. Free memory is still 70.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 133.25ms. Allocated memory is still 92.3MB. Free memory was 53.1MB in the beginning and 44.6MB in the end (delta: 8.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * 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:848) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/nla-digbench-scaling/knuth_valuebound2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5a67a238aa48b8a3ec66dc98385c4a2787b829a5e88d431b41ae6ef24ee0832f --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 17:33:49,039 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 17:33:49,040 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 17:33:49,059 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 17:33:49,060 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 17:33:49,060 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 17:33:49,061 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 17:33:49,063 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 17:33:49,064 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 17:33:49,064 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 17:33:49,065 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 17:33:49,066 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 17:33:49,073 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 17:33:49,078 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 17:33:49,080 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 17:33:49,082 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 17:33:49,087 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 17:33:49,089 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 17:33:49,090 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 17:33:49,093 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 17:33:49,096 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 17:33:49,097 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 17:33:49,098 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 17:33:49,099 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 17:33:49,101 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 17:33:49,105 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 17:33:49,105 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 17:33:49,105 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 17:33:49,106 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 17:33:49,107 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 17:33:49,107 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 17:33:49,107 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 17:33:49,108 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 17:33:49,110 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 17:33:49,111 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 17:33:49,111 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 17:33:49,112 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 17:33:49,112 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 17:33:49,112 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 17:33:49,113 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 17:33:49,114 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 17:33:49,115 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2022-02-20 17:33:49,142 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 17:33:49,142 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 17:33:49,143 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 17:33:49,143 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 17:33:49,144 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 17:33:49,144 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 17:33:49,145 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 17:33:49,145 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 17:33:49,145 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 17:33:49,145 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 17:33:49,146 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 17:33:49,146 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 17:33:49,146 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 17:33:49,146 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 17:33:49,146 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 17:33:49,147 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 17:33:49,147 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 17:33:49,147 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-02-20 17:33:49,147 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-02-20 17:33:49,147 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 17:33:49,147 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 17:33:49,147 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 17:33:49,148 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 17:33:49,148 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 17:33:49,148 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 17:33:49,148 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 17:33:49,148 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 17:33:49,148 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 17:33:49,149 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 17:33:49,149 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 17:33:49,149 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-02-20 17:33:49,149 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-02-20 17:33:49,149 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 17:33:49,149 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 17:33:49,150 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 17:33:49,150 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-02-20 17:33:49,150 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:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 5a67a238aa48b8a3ec66dc98385c4a2787b829a5e88d431b41ae6ef24ee0832f [2022-02-20 17:33:49,385 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 17:33:49,413 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 17:33:49,415 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 17:33:49,415 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 17:33:49,417 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 17:33:49,418 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/knuth_valuebound2.i [2022-02-20 17:33:49,464 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e04548921/3057f004540541568d237774192d0a5a/FLAG2ef2d4e00 [2022-02-20 17:33:49,816 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 17:33:49,817 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/knuth_valuebound2.i [2022-02-20 17:33:49,822 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e04548921/3057f004540541568d237774192d0a5a/FLAG2ef2d4e00 [2022-02-20 17:33:49,834 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e04548921/3057f004540541568d237774192d0a5a [2022-02-20 17:33:49,836 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 17:33:49,837 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 17:33:49,838 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 17:33:49,838 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 17:33:49,840 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 17:33:49,841 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 05:33:49" (1/1) ... [2022-02-20 17:33:49,842 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36d19de6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:33:49, skipping insertion in model container [2022-02-20 17:33:49,842 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 05:33:49" (1/1) ... [2022-02-20 17:33:49,847 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 17:33:49,864 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 17:33:49,973 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/knuth_valuebound2.i[948,961] [2022-02-20 17:33:50,020 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 17:33:50,033 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 17:33:50,042 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/knuth_valuebound2.i[948,961] [2022-02-20 17:33:50,068 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 17:33:50,080 INFO L208 MainTranslator]: Completed translation [2022-02-20 17:33:50,080 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:33:50 WrapperNode [2022-02-20 17:33:50,081 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 17:33:50,081 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 17:33:50,081 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 17:33:50,082 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 17:33:50,086 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:33:50" (1/1) ... [2022-02-20 17:33:50,092 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:33:50" (1/1) ... [2022-02-20 17:33:50,112 INFO L137 Inliner]: procedures = 18, calls = 14, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 66 [2022-02-20 17:33:50,113 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 17:33:50,113 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 17:33:50,113 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 17:33:50,113 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 17:33:50,119 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:33:50" (1/1) ... [2022-02-20 17:33:50,119 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:33:50" (1/1) ... [2022-02-20 17:33:50,121 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:33:50" (1/1) ... [2022-02-20 17:33:50,121 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:33:50" (1/1) ... [2022-02-20 17:33:50,128 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:33:50" (1/1) ... [2022-02-20 17:33:50,135 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:33:50" (1/1) ... [2022-02-20 17:33:50,137 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:33:50" (1/1) ... [2022-02-20 17:33:50,139 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 17:33:50,139 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 17:33:50,139 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 17:33:50,139 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 17:33:50,140 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:33:50" (1/1) ... [2022-02-20 17:33:50,151 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 17:33:50,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:33:50,168 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-20 17:33:50,170 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-20 17:33:50,192 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 17:33:50,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-02-20 17:33:50,192 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-02-20 17:33:50,192 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-02-20 17:33:50,192 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 17:33:50,192 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 17:33:50,192 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-02-20 17:33:50,192 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-02-20 17:33:50,256 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 17:33:50,259 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 17:33:53,200 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 17:33:53,205 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 17:33:53,205 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-20 17:33:53,206 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:33:53 BoogieIcfgContainer [2022-02-20 17:33:53,206 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 17:33:53,207 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 17:33:53,207 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 17:33:53,209 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 17:33:53,209 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 05:33:49" (1/3) ... [2022-02-20 17:33:53,210 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17203354 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 05:33:53, skipping insertion in model container [2022-02-20 17:33:53,210 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:33:50" (2/3) ... [2022-02-20 17:33:53,210 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17203354 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 05:33:53, skipping insertion in model container [2022-02-20 17:33:53,210 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:33:53" (3/3) ... [2022-02-20 17:33:53,211 INFO L111 eAbstractionObserver]: Analyzing ICFG knuth_valuebound2.i [2022-02-20 17:33:53,215 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 17:33:53,215 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 17:33:53,252 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 17:33:53,258 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 17:33:53,259 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 17:33:53,270 INFO L276 IsEmpty]: Start isEmpty. Operand has 31 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 20 states have internal predecessors, (28), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 17:33:53,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-02-20 17:33:53,274 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:33:53,274 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:33:53,275 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:33:53,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:33:53,282 INFO L85 PathProgramCache]: Analyzing trace with hash 919095715, now seen corresponding path program 1 times [2022-02-20 17:33:53,290 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 17:33:53,290 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1715926832] [2022-02-20 17:33:53,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:33:53,291 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 17:33:53,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 17:33:53,293 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 17:33:53,294 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-02-20 17:33:53,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:33:53,533 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 1 conjunts are in the unsatisfiable core [2022-02-20 17:33:53,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:33:53,546 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:33:54,009 INFO L290 TraceCheckUtils]: 0: Hoare triple {34#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(8bv32, 2bv32); {34#true} is VALID [2022-02-20 17:33:54,009 INFO L290 TraceCheckUtils]: 1: Hoare triple {34#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~nondet3#1, main_~n~0#1, main_~a~0#1, main_~r~0#1, main_~k~0#1, main_~q~0#1, main_~d~0#1, main_~s~0#1, main_~t~0#1;havoc main_~n~0#1;havoc main_~a~0#1;havoc main_~r~0#1;havoc main_~k~0#1;havoc main_~q~0#1;havoc main_~d~0#1;havoc main_~s~0#1;havoc main_~t~0#1;main_~n~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; {34#true} is VALID [2022-02-20 17:33:54,009 INFO L272 TraceCheckUtils]: 2: Hoare triple {34#true} call assume_abort_if_not((if ~bvuge32(main_~n~0#1, 0bv32) && ~bvule32(main_~n~0#1, 2bv32) then 1bv32 else 0bv32)); {34#true} is VALID [2022-02-20 17:33:54,009 INFO L290 TraceCheckUtils]: 3: Hoare triple {34#true} ~cond := #in~cond; {34#true} is VALID [2022-02-20 17:33:54,010 INFO L290 TraceCheckUtils]: 4: Hoare triple {34#true} assume 0bv32 == ~cond;assume false; {35#false} is VALID [2022-02-20 17:33:54,010 INFO L290 TraceCheckUtils]: 5: Hoare triple {35#false} assume true; {35#false} is VALID [2022-02-20 17:33:54,010 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {35#false} {34#true} #70#return; {35#false} is VALID [2022-02-20 17:33:54,011 INFO L290 TraceCheckUtils]: 7: Hoare triple {35#false} main_~a~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1; {35#false} is VALID [2022-02-20 17:33:54,011 INFO L272 TraceCheckUtils]: 8: Hoare triple {35#false} call assume_abort_if_not((if ~bvuge32(main_~a~0#1, 0bv32) && ~bvule32(main_~a~0#1, 2bv32) then 1bv32 else 0bv32)); {35#false} is VALID [2022-02-20 17:33:54,012 INFO L290 TraceCheckUtils]: 9: Hoare triple {35#false} ~cond := #in~cond; {35#false} is VALID [2022-02-20 17:33:54,012 INFO L290 TraceCheckUtils]: 10: Hoare triple {35#false} assume 0bv32 == ~cond;assume false; {35#false} is VALID [2022-02-20 17:33:54,012 INFO L290 TraceCheckUtils]: 11: Hoare triple {35#false} assume true; {35#false} is VALID [2022-02-20 17:33:54,013 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {35#false} {35#false} #72#return; {35#false} is VALID [2022-02-20 17:33:54,013 INFO L272 TraceCheckUtils]: 13: Hoare triple {35#false} call assume_abort_if_not((if ~bvult32(main_~n~0#1, 536870911bv32) then 1bv32 else 0bv32)); {35#false} is VALID [2022-02-20 17:33:54,013 INFO L290 TraceCheckUtils]: 14: Hoare triple {35#false} ~cond := #in~cond; {35#false} is VALID [2022-02-20 17:33:54,013 INFO L290 TraceCheckUtils]: 15: Hoare triple {35#false} assume 0bv32 == ~cond;assume false; {35#false} is VALID [2022-02-20 17:33:54,014 INFO L290 TraceCheckUtils]: 16: Hoare triple {35#false} assume true; {35#false} is VALID [2022-02-20 17:33:54,014 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {35#false} {35#false} #74#return; {35#false} is VALID [2022-02-20 17:33:54,014 INFO L272 TraceCheckUtils]: 18: Hoare triple {35#false} call assume_abort_if_not((if ~bvugt32(main_~a~0#1, 2bv32) then 1bv32 else 0bv32)); {35#false} is VALID [2022-02-20 17:33:54,014 INFO L290 TraceCheckUtils]: 19: Hoare triple {35#false} ~cond := #in~cond; {35#false} is VALID [2022-02-20 17:33:54,015 INFO L290 TraceCheckUtils]: 20: Hoare triple {35#false} assume 0bv32 == ~cond;assume false; {35#false} is VALID [2022-02-20 17:33:54,015 INFO L290 TraceCheckUtils]: 21: Hoare triple {35#false} assume true; {35#false} is VALID [2022-02-20 17:33:54,016 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {35#false} {35#false} #76#return; {35#false} is VALID [2022-02-20 17:33:54,016 INFO L290 TraceCheckUtils]: 23: Hoare triple {35#false} main_~d~0#1 := main_~a~0#1;main_~r~0#1 := ~bvurem32(main_~n~0#1, main_~d~0#1);main_~t~0#1 := 0bv32;main_~k~0#1 := ~bvurem32(main_~n~0#1, ~bvsub32(main_~d~0#1, 2bv32));main_~q~0#1 := ~bvmul32(4bv32, ~bvsub32(~bvudiv32(main_~n~0#1, ~bvsub32(main_~d~0#1, 2bv32)), ~bvudiv32(main_~n~0#1, main_~d~0#1)));main_~s~0#1 := ~convertDOUBLEToUINT(~roundTowardZero, ~fp.sqrt~DOUBLE(currentRoundingMode, ~convertUINTToDOUBLE(currentRoundingMode, main_~n~0#1))); {35#false} is VALID [2022-02-20 17:33:54,016 INFO L290 TraceCheckUtils]: 24: Hoare triple {35#false} assume !false; {35#false} is VALID [2022-02-20 17:33:54,017 INFO L272 TraceCheckUtils]: 25: Hoare triple {35#false} call __VERIFIER_assert((if ~bvadd32(~bvadd32(~bvsub32(~bvsub32(~bvmul32(~bvmul32(main_~d~0#1, main_~d~0#1), main_~q~0#1), ~bvmul32(~bvmul32(2bv32, main_~q~0#1), main_~d~0#1)), ~bvmul32(~bvmul32(4bv32, main_~r~0#1), main_~d~0#1)), ~bvmul32(~bvmul32(4bv32, main_~k~0#1), main_~d~0#1)), ~bvmul32(8bv32, main_~r~0#1)) == ~bvmul32(8bv32, main_~n~0#1) then 1bv32 else 0bv32)); {35#false} is VALID [2022-02-20 17:33:54,017 INFO L290 TraceCheckUtils]: 26: Hoare triple {35#false} ~cond := #in~cond; {35#false} is VALID [2022-02-20 17:33:54,017 INFO L290 TraceCheckUtils]: 27: Hoare triple {35#false} assume 0bv32 == ~cond; {35#false} is VALID [2022-02-20 17:33:54,017 INFO L290 TraceCheckUtils]: 28: Hoare triple {35#false} assume !false; {35#false} is VALID [2022-02-20 17:33:54,018 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-02-20 17:33:54,018 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 17:33:54,019 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 17:33:54,019 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1715926832] [2022-02-20 17:33:54,019 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1715926832] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:33:54,020 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:33:54,020 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 17:33:54,023 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233725802] [2022-02-20 17:33:54,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:33:54,027 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 29 [2022-02-20 17:33:54,028 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:33:54,030 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 17:33:55,551 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:33:55,551 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 17:33:55,552 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 17:33:55,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 17:33:55,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 17:33:55,567 INFO L87 Difference]: Start difference. First operand has 31 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 20 states have internal predecessors, (28), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 17:33:59,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:33:59,552 INFO L93 Difference]: Finished difference Result 59 states and 92 transitions. [2022-02-20 17:33:59,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 17:33:59,552 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 29 [2022-02-20 17:33:59,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:33:59,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 17:33:59,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 92 transitions. [2022-02-20 17:33:59,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 17:33:59,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 92 transitions. [2022-02-20 17:33:59,566 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 92 transitions. [2022-02-20 17:34:03,104 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:34:03,110 INFO L225 Difference]: With dead ends: 59 [2022-02-20 17:34:03,110 INFO L226 Difference]: Without dead ends: 27 [2022-02-20 17:34:03,112 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 17:34:03,114 INFO L933 BasicCegarLoop]: 40 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:34:03,115 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:34:03,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-02-20 17:34:03,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-02-20 17:34:03,143 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:34:03,143 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand has 27 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 17:34:03,144 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand has 27 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 17:34:03,144 INFO L87 Difference]: Start difference. First operand 27 states. Second operand has 27 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 17:34:03,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:34:03,148 INFO L93 Difference]: Finished difference Result 27 states and 36 transitions. [2022-02-20 17:34:03,148 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 36 transitions. [2022-02-20 17:34:03,148 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:34:03,148 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:34:03,149 INFO L74 IsIncluded]: Start isIncluded. First operand has 27 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 27 states. [2022-02-20 17:34:03,149 INFO L87 Difference]: Start difference. First operand has 27 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 27 states. [2022-02-20 17:34:03,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:34:03,152 INFO L93 Difference]: Finished difference Result 27 states and 36 transitions. [2022-02-20 17:34:03,152 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 36 transitions. [2022-02-20 17:34:03,153 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:34:03,153 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:34:03,153 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:34:03,153 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:34:03,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 17:34:03,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 36 transitions. [2022-02-20 17:34:03,157 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 36 transitions. Word has length 29 [2022-02-20 17:34:03,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:34:03,157 INFO L470 AbstractCegarLoop]: Abstraction has 27 states and 36 transitions. [2022-02-20 17:34:03,158 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 17:34:03,158 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 36 transitions. [2022-02-20 17:34:03,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-02-20 17:34:03,158 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:34:03,159 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:34:03,176 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2022-02-20 17:34:03,363 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 17:34:03,364 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:34:03,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:34:03,364 INFO L85 PathProgramCache]: Analyzing trace with hash -960358297, now seen corresponding path program 1 times [2022-02-20 17:34:03,365 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 17:34:03,365 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1906485135] [2022-02-20 17:34:03,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:34:03,365 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 17:34:03,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 17:34:03,367 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 17:34:03,370 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-02-20 17:34:03,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:34:03,582 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-20 17:34:03,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:34:03,592 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:34:04,499 INFO L290 TraceCheckUtils]: 0: Hoare triple {296#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(8bv32, 2bv32); {296#true} is VALID [2022-02-20 17:34:04,499 INFO L290 TraceCheckUtils]: 1: Hoare triple {296#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~nondet3#1, main_~n~0#1, main_~a~0#1, main_~r~0#1, main_~k~0#1, main_~q~0#1, main_~d~0#1, main_~s~0#1, main_~t~0#1;havoc main_~n~0#1;havoc main_~a~0#1;havoc main_~r~0#1;havoc main_~k~0#1;havoc main_~q~0#1;havoc main_~d~0#1;havoc main_~s~0#1;havoc main_~t~0#1;main_~n~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; {296#true} is VALID [2022-02-20 17:34:04,499 INFO L272 TraceCheckUtils]: 2: Hoare triple {296#true} call assume_abort_if_not((if ~bvuge32(main_~n~0#1, 0bv32) && ~bvule32(main_~n~0#1, 2bv32) then 1bv32 else 0bv32)); {296#true} is VALID [2022-02-20 17:34:04,499 INFO L290 TraceCheckUtils]: 3: Hoare triple {296#true} ~cond := #in~cond; {296#true} is VALID [2022-02-20 17:34:04,500 INFO L290 TraceCheckUtils]: 4: Hoare triple {296#true} assume !(0bv32 == ~cond); {296#true} is VALID [2022-02-20 17:34:04,500 INFO L290 TraceCheckUtils]: 5: Hoare triple {296#true} assume true; {296#true} is VALID [2022-02-20 17:34:04,500 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {296#true} {296#true} #70#return; {296#true} is VALID [2022-02-20 17:34:04,500 INFO L290 TraceCheckUtils]: 7: Hoare triple {296#true} main_~a~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1; {296#true} is VALID [2022-02-20 17:34:04,500 INFO L272 TraceCheckUtils]: 8: Hoare triple {296#true} call assume_abort_if_not((if ~bvuge32(main_~a~0#1, 0bv32) && ~bvule32(main_~a~0#1, 2bv32) then 1bv32 else 0bv32)); {296#true} is VALID [2022-02-20 17:34:04,500 INFO L290 TraceCheckUtils]: 9: Hoare triple {296#true} ~cond := #in~cond; {328#(= |assume_abort_if_not_#in~cond| assume_abort_if_not_~cond)} is VALID [2022-02-20 17:34:04,501 INFO L290 TraceCheckUtils]: 10: Hoare triple {328#(= |assume_abort_if_not_#in~cond| assume_abort_if_not_~cond)} assume !(0bv32 == ~cond); {332#(not (= |assume_abort_if_not_#in~cond| (_ bv0 32)))} is VALID [2022-02-20 17:34:04,501 INFO L290 TraceCheckUtils]: 11: Hoare triple {332#(not (= |assume_abort_if_not_#in~cond| (_ bv0 32)))} assume true; {332#(not (= |assume_abort_if_not_#in~cond| (_ bv0 32)))} is VALID [2022-02-20 17:34:04,502 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {332#(not (= |assume_abort_if_not_#in~cond| (_ bv0 32)))} {296#true} #72#return; {339#(bvule |ULTIMATE.start_main_~a~0#1| (_ bv2 32))} is VALID [2022-02-20 17:34:04,502 INFO L272 TraceCheckUtils]: 13: Hoare triple {339#(bvule |ULTIMATE.start_main_~a~0#1| (_ bv2 32))} call assume_abort_if_not((if ~bvult32(main_~n~0#1, 536870911bv32) then 1bv32 else 0bv32)); {296#true} is VALID [2022-02-20 17:34:04,502 INFO L290 TraceCheckUtils]: 14: Hoare triple {296#true} ~cond := #in~cond; {296#true} is VALID [2022-02-20 17:34:04,502 INFO L290 TraceCheckUtils]: 15: Hoare triple {296#true} assume !(0bv32 == ~cond); {296#true} is VALID [2022-02-20 17:34:04,502 INFO L290 TraceCheckUtils]: 16: Hoare triple {296#true} assume true; {296#true} is VALID [2022-02-20 17:34:04,503 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {296#true} {339#(bvule |ULTIMATE.start_main_~a~0#1| (_ bv2 32))} #74#return; {339#(bvule |ULTIMATE.start_main_~a~0#1| (_ bv2 32))} is VALID [2022-02-20 17:34:04,503 INFO L272 TraceCheckUtils]: 18: Hoare triple {339#(bvule |ULTIMATE.start_main_~a~0#1| (_ bv2 32))} call assume_abort_if_not((if ~bvugt32(main_~a~0#1, 2bv32) then 1bv32 else 0bv32)); {296#true} is VALID [2022-02-20 17:34:04,503 INFO L290 TraceCheckUtils]: 19: Hoare triple {296#true} ~cond := #in~cond; {328#(= |assume_abort_if_not_#in~cond| assume_abort_if_not_~cond)} is VALID [2022-02-20 17:34:04,504 INFO L290 TraceCheckUtils]: 20: Hoare triple {328#(= |assume_abort_if_not_#in~cond| assume_abort_if_not_~cond)} assume !(0bv32 == ~cond); {332#(not (= |assume_abort_if_not_#in~cond| (_ bv0 32)))} is VALID [2022-02-20 17:34:04,504 INFO L290 TraceCheckUtils]: 21: Hoare triple {332#(not (= |assume_abort_if_not_#in~cond| (_ bv0 32)))} assume true; {332#(not (= |assume_abort_if_not_#in~cond| (_ bv0 32)))} is VALID [2022-02-20 17:34:04,505 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {332#(not (= |assume_abort_if_not_#in~cond| (_ bv0 32)))} {339#(bvule |ULTIMATE.start_main_~a~0#1| (_ bv2 32))} #76#return; {297#false} is VALID [2022-02-20 17:34:04,505 INFO L290 TraceCheckUtils]: 23: Hoare triple {297#false} main_~d~0#1 := main_~a~0#1;main_~r~0#1 := ~bvurem32(main_~n~0#1, main_~d~0#1);main_~t~0#1 := 0bv32;main_~k~0#1 := ~bvurem32(main_~n~0#1, ~bvsub32(main_~d~0#1, 2bv32));main_~q~0#1 := ~bvmul32(4bv32, ~bvsub32(~bvudiv32(main_~n~0#1, ~bvsub32(main_~d~0#1, 2bv32)), ~bvudiv32(main_~n~0#1, main_~d~0#1)));main_~s~0#1 := ~convertDOUBLEToUINT(~roundTowardZero, ~fp.sqrt~DOUBLE(currentRoundingMode, ~convertUINTToDOUBLE(currentRoundingMode, main_~n~0#1))); {297#false} is VALID [2022-02-20 17:34:04,505 INFO L290 TraceCheckUtils]: 24: Hoare triple {297#false} assume !false; {297#false} is VALID [2022-02-20 17:34:04,505 INFO L272 TraceCheckUtils]: 25: Hoare triple {297#false} call __VERIFIER_assert((if ~bvadd32(~bvadd32(~bvsub32(~bvsub32(~bvmul32(~bvmul32(main_~d~0#1, main_~d~0#1), main_~q~0#1), ~bvmul32(~bvmul32(2bv32, main_~q~0#1), main_~d~0#1)), ~bvmul32(~bvmul32(4bv32, main_~r~0#1), main_~d~0#1)), ~bvmul32(~bvmul32(4bv32, main_~k~0#1), main_~d~0#1)), ~bvmul32(8bv32, main_~r~0#1)) == ~bvmul32(8bv32, main_~n~0#1) then 1bv32 else 0bv32)); {297#false} is VALID [2022-02-20 17:34:04,505 INFO L290 TraceCheckUtils]: 26: Hoare triple {297#false} ~cond := #in~cond; {297#false} is VALID [2022-02-20 17:34:04,505 INFO L290 TraceCheckUtils]: 27: Hoare triple {297#false} assume 0bv32 == ~cond; {297#false} is VALID [2022-02-20 17:34:04,505 INFO L290 TraceCheckUtils]: 28: Hoare triple {297#false} assume !false; {297#false} is VALID [2022-02-20 17:34:04,506 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-02-20 17:34:04,506 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:34:06,666 INFO L290 TraceCheckUtils]: 28: Hoare triple {297#false} assume !false; {297#false} is VALID [2022-02-20 17:34:06,666 INFO L290 TraceCheckUtils]: 27: Hoare triple {297#false} assume 0bv32 == ~cond; {297#false} is VALID [2022-02-20 17:34:06,666 INFO L290 TraceCheckUtils]: 26: Hoare triple {297#false} ~cond := #in~cond; {297#false} is VALID [2022-02-20 17:34:06,667 INFO L272 TraceCheckUtils]: 25: Hoare triple {297#false} call __VERIFIER_assert((if ~bvadd32(~bvadd32(~bvsub32(~bvsub32(~bvmul32(~bvmul32(main_~d~0#1, main_~d~0#1), main_~q~0#1), ~bvmul32(~bvmul32(2bv32, main_~q~0#1), main_~d~0#1)), ~bvmul32(~bvmul32(4bv32, main_~r~0#1), main_~d~0#1)), ~bvmul32(~bvmul32(4bv32, main_~k~0#1), main_~d~0#1)), ~bvmul32(8bv32, main_~r~0#1)) == ~bvmul32(8bv32, main_~n~0#1) then 1bv32 else 0bv32)); {297#false} is VALID [2022-02-20 17:34:06,667 INFO L290 TraceCheckUtils]: 24: Hoare triple {297#false} assume !false; {297#false} is VALID [2022-02-20 17:34:06,667 INFO L290 TraceCheckUtils]: 23: Hoare triple {297#false} main_~d~0#1 := main_~a~0#1;main_~r~0#1 := ~bvurem32(main_~n~0#1, main_~d~0#1);main_~t~0#1 := 0bv32;main_~k~0#1 := ~bvurem32(main_~n~0#1, ~bvsub32(main_~d~0#1, 2bv32));main_~q~0#1 := ~bvmul32(4bv32, ~bvsub32(~bvudiv32(main_~n~0#1, ~bvsub32(main_~d~0#1, 2bv32)), ~bvudiv32(main_~n~0#1, main_~d~0#1)));main_~s~0#1 := ~convertDOUBLEToUINT(~roundTowardZero, ~fp.sqrt~DOUBLE(currentRoundingMode, ~convertUINTToDOUBLE(currentRoundingMode, main_~n~0#1))); {297#false} is VALID [2022-02-20 17:34:06,667 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {332#(not (= |assume_abort_if_not_#in~cond| (_ bv0 32)))} {339#(bvule |ULTIMATE.start_main_~a~0#1| (_ bv2 32))} #76#return; {297#false} is VALID [2022-02-20 17:34:06,668 INFO L290 TraceCheckUtils]: 21: Hoare triple {332#(not (= |assume_abort_if_not_#in~cond| (_ bv0 32)))} assume true; {332#(not (= |assume_abort_if_not_#in~cond| (_ bv0 32)))} is VALID [2022-02-20 17:34:06,668 INFO L290 TraceCheckUtils]: 20: Hoare triple {415#(or (not (= |assume_abort_if_not_#in~cond| (_ bv0 32))) (= assume_abort_if_not_~cond (_ bv0 32)))} assume !(0bv32 == ~cond); {332#(not (= |assume_abort_if_not_#in~cond| (_ bv0 32)))} is VALID [2022-02-20 17:34:06,669 INFO L290 TraceCheckUtils]: 19: Hoare triple {296#true} ~cond := #in~cond; {415#(or (not (= |assume_abort_if_not_#in~cond| (_ bv0 32))) (= assume_abort_if_not_~cond (_ bv0 32)))} is VALID [2022-02-20 17:34:06,669 INFO L272 TraceCheckUtils]: 18: Hoare triple {339#(bvule |ULTIMATE.start_main_~a~0#1| (_ bv2 32))} call assume_abort_if_not((if ~bvugt32(main_~a~0#1, 2bv32) then 1bv32 else 0bv32)); {296#true} is VALID [2022-02-20 17:34:06,669 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {296#true} {339#(bvule |ULTIMATE.start_main_~a~0#1| (_ bv2 32))} #74#return; {339#(bvule |ULTIMATE.start_main_~a~0#1| (_ bv2 32))} is VALID [2022-02-20 17:34:06,669 INFO L290 TraceCheckUtils]: 16: Hoare triple {296#true} assume true; {296#true} is VALID [2022-02-20 17:34:06,670 INFO L290 TraceCheckUtils]: 15: Hoare triple {296#true} assume !(0bv32 == ~cond); {296#true} is VALID [2022-02-20 17:34:06,670 INFO L290 TraceCheckUtils]: 14: Hoare triple {296#true} ~cond := #in~cond; {296#true} is VALID [2022-02-20 17:34:06,670 INFO L272 TraceCheckUtils]: 13: Hoare triple {339#(bvule |ULTIMATE.start_main_~a~0#1| (_ bv2 32))} call assume_abort_if_not((if ~bvult32(main_~n~0#1, 536870911bv32) then 1bv32 else 0bv32)); {296#true} is VALID [2022-02-20 17:34:06,670 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {332#(not (= |assume_abort_if_not_#in~cond| (_ bv0 32)))} {296#true} #72#return; {339#(bvule |ULTIMATE.start_main_~a~0#1| (_ bv2 32))} is VALID [2022-02-20 17:34:06,671 INFO L290 TraceCheckUtils]: 11: Hoare triple {332#(not (= |assume_abort_if_not_#in~cond| (_ bv0 32)))} assume true; {332#(not (= |assume_abort_if_not_#in~cond| (_ bv0 32)))} is VALID [2022-02-20 17:34:06,672 INFO L290 TraceCheckUtils]: 10: Hoare triple {415#(or (not (= |assume_abort_if_not_#in~cond| (_ bv0 32))) (= assume_abort_if_not_~cond (_ bv0 32)))} assume !(0bv32 == ~cond); {332#(not (= |assume_abort_if_not_#in~cond| (_ bv0 32)))} is VALID [2022-02-20 17:34:06,672 INFO L290 TraceCheckUtils]: 9: Hoare triple {296#true} ~cond := #in~cond; {415#(or (not (= |assume_abort_if_not_#in~cond| (_ bv0 32))) (= assume_abort_if_not_~cond (_ bv0 32)))} is VALID [2022-02-20 17:34:06,672 INFO L272 TraceCheckUtils]: 8: Hoare triple {296#true} call assume_abort_if_not((if ~bvuge32(main_~a~0#1, 0bv32) && ~bvule32(main_~a~0#1, 2bv32) then 1bv32 else 0bv32)); {296#true} is VALID [2022-02-20 17:34:06,672 INFO L290 TraceCheckUtils]: 7: Hoare triple {296#true} main_~a~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1; {296#true} is VALID [2022-02-20 17:34:06,673 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {296#true} {296#true} #70#return; {296#true} is VALID [2022-02-20 17:34:06,673 INFO L290 TraceCheckUtils]: 5: Hoare triple {296#true} assume true; {296#true} is VALID [2022-02-20 17:34:06,673 INFO L290 TraceCheckUtils]: 4: Hoare triple {296#true} assume !(0bv32 == ~cond); {296#true} is VALID [2022-02-20 17:34:06,673 INFO L290 TraceCheckUtils]: 3: Hoare triple {296#true} ~cond := #in~cond; {296#true} is VALID [2022-02-20 17:34:06,673 INFO L272 TraceCheckUtils]: 2: Hoare triple {296#true} call assume_abort_if_not((if ~bvuge32(main_~n~0#1, 0bv32) && ~bvule32(main_~n~0#1, 2bv32) then 1bv32 else 0bv32)); {296#true} is VALID [2022-02-20 17:34:06,673 INFO L290 TraceCheckUtils]: 1: Hoare triple {296#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~nondet3#1, main_~n~0#1, main_~a~0#1, main_~r~0#1, main_~k~0#1, main_~q~0#1, main_~d~0#1, main_~s~0#1, main_~t~0#1;havoc main_~n~0#1;havoc main_~a~0#1;havoc main_~r~0#1;havoc main_~k~0#1;havoc main_~q~0#1;havoc main_~d~0#1;havoc main_~s~0#1;havoc main_~t~0#1;main_~n~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1; {296#true} is VALID [2022-02-20 17:34:06,673 INFO L290 TraceCheckUtils]: 0: Hoare triple {296#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(8bv32, 2bv32); {296#true} is VALID [2022-02-20 17:34:06,673 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-02-20 17:34:06,673 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 17:34:06,674 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1906485135] [2022-02-20 17:34:06,674 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1906485135] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 17:34:06,674 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 17:34:06,674 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2022-02-20 17:34:06,674 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098831423] [2022-02-20 17:34:06,674 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 17:34:06,675 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 29 [2022-02-20 17:34:06,675 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:34:06,676 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 17:34:08,124 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:34:08,124 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 17:34:08,125 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 17:34:08,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 17:34:08,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-02-20 17:34:08,126 INFO L87 Difference]: Start difference. First operand 27 states and 36 transitions. Second operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 17:34:09,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:34:09,866 INFO L93 Difference]: Finished difference Result 27 states and 36 transitions. [2022-02-20 17:34:09,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 17:34:09,866 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 29 [2022-02-20 17:34:09,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:34:09,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 17:34:09,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 36 transitions. [2022-02-20 17:34:09,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 17:34:09,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 36 transitions. [2022-02-20 17:34:09,870 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 36 transitions. [2022-02-20 17:34:11,520 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:34:11,521 INFO L225 Difference]: With dead ends: 27 [2022-02-20 17:34:11,521 INFO L226 Difference]: Without dead ends: 0 [2022-02-20 17:34:11,521 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-02-20 17:34:11,522 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 2 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-02-20 17:34:11,522 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 25 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-02-20 17:34:11,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-02-20 17:34:11,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-02-20 17:34:11,523 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:34:11,523 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:34:11,523 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:34:11,523 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:34:11,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:34:11,523 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-20 17:34:11,523 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 17:34:11,523 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:34:11,523 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:34:11,523 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-02-20 17:34:11,524 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-02-20 17:34:11,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:34:11,524 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-20 17:34:11,524 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 17:34:11,524 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:34:11,524 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:34:11,524 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:34:11,524 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:34:11,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:34:11,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-02-20 17:34:11,524 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 29 [2022-02-20 17:34:11,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:34:11,524 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-20 17:34:11,525 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 17:34:11,525 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 17:34:11,525 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:34:11,527 INFO L764 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-20 17:34:11,544 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-02-20 17:34:11,735 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 17:34:11,737 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-02-20 17:34:11,906 INFO L854 garLoopResultBuilder]: At program point L33(line 33) the Hoare annotation is: (bvule |ULTIMATE.start_main_~a~0#1| (_ bv2 32)) [2022-02-20 17:34:11,907 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-02-20 17:34:11,907 INFO L858 garLoopResultBuilder]: For program point L58(lines 58 70) no Hoare annotation was computed. [2022-02-20 17:34:11,907 INFO L854 garLoopResultBuilder]: At program point L58-2(lines 41 71) the Hoare annotation is: false [2022-02-20 17:34:11,907 INFO L854 garLoopResultBuilder]: At program point L44(line 44) the Hoare annotation is: false [2022-02-20 17:34:11,907 INFO L854 garLoopResultBuilder]: At program point L42(line 42) the Hoare annotation is: false [2022-02-20 17:34:11,907 INFO L854 garLoopResultBuilder]: At program point L42-1(line 42) the Hoare annotation is: false [2022-02-20 17:34:11,907 INFO L858 garLoopResultBuilder]: For program point L34(line 34) no Hoare annotation was computed. [2022-02-20 17:34:11,907 INFO L861 garLoopResultBuilder]: At program point L32(line 32) the Hoare annotation is: true [2022-02-20 17:34:11,907 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-02-20 17:34:11,908 INFO L854 garLoopResultBuilder]: At program point L32-1(line 32) the Hoare annotation is: (bvule |ULTIMATE.start_main_~a~0#1| (_ bv2 32)) [2022-02-20 17:34:11,908 INFO L861 garLoopResultBuilder]: At program point L30(line 30) the Hoare annotation is: true [2022-02-20 17:34:11,908 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-02-20 17:34:11,908 INFO L858 garLoopResultBuilder]: For program point L30-1(line 30) no Hoare annotation was computed. [2022-02-20 17:34:11,908 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-02-20 17:34:11,908 INFO L858 garLoopResultBuilder]: For program point L53(lines 53 70) no Hoare annotation was computed. [2022-02-20 17:34:11,908 INFO L858 garLoopResultBuilder]: For program point L47(lines 47 70) no Hoare annotation was computed. [2022-02-20 17:34:11,908 INFO L858 garLoopResultBuilder]: For program point L45(lines 41 71) no Hoare annotation was computed. [2022-02-20 17:34:11,908 INFO L854 garLoopResultBuilder]: At program point L43(line 43) the Hoare annotation is: false [2022-02-20 17:34:11,908 INFO L861 garLoopResultBuilder]: At program point L72(lines 26 73) the Hoare annotation is: true [2022-02-20 17:34:11,908 INFO L858 garLoopResultBuilder]: For program point L41-2(lines 41 71) no Hoare annotation was computed. [2022-02-20 17:34:11,908 INFO L858 garLoopResultBuilder]: For program point L16(line 16) no Hoare annotation was computed. [2022-02-20 17:34:11,909 INFO L858 garLoopResultBuilder]: For program point L16-2(lines 15 17) no Hoare annotation was computed. [2022-02-20 17:34:11,909 INFO L861 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 15 17) the Hoare annotation is: true [2022-02-20 17:34:11,909 INFO L858 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 15 17) no Hoare annotation was computed. [2022-02-20 17:34:11,909 INFO L858 garLoopResultBuilder]: For program point L19-2(lines 18 24) no Hoare annotation was computed. [2022-02-20 17:34:11,909 INFO L861 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 18 24) the Hoare annotation is: true [2022-02-20 17:34:11,909 INFO L858 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 18 24) no Hoare annotation was computed. [2022-02-20 17:34:11,909 INFO L858 garLoopResultBuilder]: For program point L20(lines 20 21) no Hoare annotation was computed. [2022-02-20 17:34:11,909 INFO L858 garLoopResultBuilder]: For program point L19(lines 19 22) no Hoare annotation was computed. [2022-02-20 17:34:11,910 INFO L858 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 21) no Hoare annotation was computed. [2022-02-20 17:34:11,912 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1] [2022-02-20 17:34:11,913 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 17:34:11,916 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-02-20 17:34:11,916 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-02-20 17:34:11,916 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2022-02-20 17:34:11,916 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-02-20 17:34:11,917 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-02-20 17:34:11,917 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-02-20 17:34:11,917 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2022-02-20 17:34:11,917 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2022-02-20 17:34:11,917 WARN L170 areAnnotationChecker]: L30-1 has no Hoare annotation [2022-02-20 17:34:11,917 WARN L170 areAnnotationChecker]: L16-2 has no Hoare annotation [2022-02-20 17:34:11,917 WARN L170 areAnnotationChecker]: L20 has no Hoare annotation [2022-02-20 17:34:11,917 WARN L170 areAnnotationChecker]: L20 has no Hoare annotation [2022-02-20 17:34:11,917 WARN L170 areAnnotationChecker]: L19-2 has no Hoare annotation [2022-02-20 17:34:11,918 WARN L170 areAnnotationChecker]: L30-1 has no Hoare annotation [2022-02-20 17:34:11,918 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-02-20 17:34:11,918 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-02-20 17:34:11,918 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-02-20 17:34:11,918 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-02-20 17:34:11,918 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-02-20 17:34:11,918 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-02-20 17:34:11,918 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-02-20 17:34:11,918 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-02-20 17:34:11,918 WARN L170 areAnnotationChecker]: L34 has no Hoare annotation [2022-02-20 17:34:11,919 WARN L170 areAnnotationChecker]: L34 has no Hoare annotation [2022-02-20 17:34:11,919 WARN L170 areAnnotationChecker]: L45 has no Hoare annotation [2022-02-20 17:34:11,919 WARN L170 areAnnotationChecker]: L45 has no Hoare annotation [2022-02-20 17:34:11,919 WARN L170 areAnnotationChecker]: L45 has no Hoare annotation [2022-02-20 17:34:11,919 WARN L170 areAnnotationChecker]: L41-2 has no Hoare annotation [2022-02-20 17:34:11,919 WARN L170 areAnnotationChecker]: L41-2 has no Hoare annotation [2022-02-20 17:34:11,919 WARN L170 areAnnotationChecker]: L41-2 has no Hoare annotation [2022-02-20 17:34:11,919 WARN L170 areAnnotationChecker]: L47 has no Hoare annotation [2022-02-20 17:34:11,919 WARN L170 areAnnotationChecker]: L47 has no Hoare annotation [2022-02-20 17:34:11,919 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 17:34:11,920 WARN L170 areAnnotationChecker]: L53 has no Hoare annotation [2022-02-20 17:34:11,920 WARN L170 areAnnotationChecker]: L53 has no Hoare annotation [2022-02-20 17:34:11,920 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 17:34:11,920 WARN L170 areAnnotationChecker]: L58 has no Hoare annotation [2022-02-20 17:34:11,920 WARN L170 areAnnotationChecker]: L58 has no Hoare annotation [2022-02-20 17:34:11,920 INFO L163 areAnnotationChecker]: CFG has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-02-20 17:34:11,932 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.02 05:34:11 BoogieIcfgContainer [2022-02-20 17:34:11,932 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-20 17:34:11,933 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-20 17:34:11,933 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-20 17:34:11,933 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-20 17:34:11,938 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:33:53" (3/4) ... [2022-02-20 17:34:11,940 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-02-20 17:34:11,944 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2022-02-20 17:34:11,944 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2022-02-20 17:34:11,951 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2022-02-20 17:34:11,951 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2022-02-20 17:34:11,951 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-02-20 17:34:11,952 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-02-20 17:34:11,981 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-02-20 17:34:11,982 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-20 17:34:11,983 INFO L158 Benchmark]: Toolchain (without parser) took 22146.28ms. Allocated memory was 52.4MB in the beginning and 67.1MB in the end (delta: 14.7MB). Free memory was 31.2MB in the beginning and 47.1MB in the end (delta: -15.9MB). Peak memory consumption was 20.7MB. Max. memory is 16.1GB. [2022-02-20 17:34:11,983 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 52.4MB. Free memory was 33.6MB in the beginning and 33.5MB in the end (delta: 52.1kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 17:34:11,986 INFO L158 Benchmark]: CACSL2BoogieTranslator took 243.04ms. Allocated memory was 52.4MB in the beginning and 67.1MB in the end (delta: 14.7MB). Free memory was 31.0MB in the beginning and 47.9MB in the end (delta: -16.9MB). Peak memory consumption was 9.2MB. Max. memory is 16.1GB. [2022-02-20 17:34:11,986 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.36ms. Allocated memory is still 67.1MB. Free memory was 47.7MB in the beginning and 45.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 17:34:11,986 INFO L158 Benchmark]: Boogie Preprocessor took 25.43ms. Allocated memory is still 67.1MB. Free memory was 45.6MB in the beginning and 44.2MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 17:34:11,987 INFO L158 Benchmark]: RCFGBuilder took 3067.27ms. Allocated memory is still 67.1MB. Free memory was 44.0MB in the beginning and 48.2MB in the end (delta: -4.2MB). Peak memory consumption was 16.4MB. Max. memory is 16.1GB. [2022-02-20 17:34:11,987 INFO L158 Benchmark]: TraceAbstraction took 18725.20ms. Allocated memory is still 67.1MB. Free memory was 48.0MB in the beginning and 27.0MB in the end (delta: 21.0MB). Peak memory consumption was 20.2MB. Max. memory is 16.1GB. [2022-02-20 17:34:11,987 INFO L158 Benchmark]: Witness Printer took 49.23ms. Allocated memory is still 67.1MB. Free memory was 26.6MB in the beginning and 47.1MB in the end (delta: -20.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 17:34:11,989 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 52.4MB. Free memory was 33.6MB in the beginning and 33.5MB in the end (delta: 52.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 243.04ms. Allocated memory was 52.4MB in the beginning and 67.1MB in the end (delta: 14.7MB). Free memory was 31.0MB in the beginning and 47.9MB in the end (delta: -16.9MB). Peak memory consumption was 9.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 31.36ms. Allocated memory is still 67.1MB. Free memory was 47.7MB in the beginning and 45.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 25.43ms. Allocated memory is still 67.1MB. Free memory was 45.6MB in the beginning and 44.2MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 3067.27ms. Allocated memory is still 67.1MB. Free memory was 44.0MB in the beginning and 48.2MB in the end (delta: -4.2MB). Peak memory consumption was 16.4MB. Max. memory is 16.1GB. * TraceAbstraction took 18725.20ms. Allocated memory is still 67.1MB. Free memory was 48.0MB in the beginning and 27.0MB in the end (delta: 21.0MB). Peak memory consumption was 20.2MB. Max. memory is 16.1GB. * Witness Printer took 49.23ms. Allocated memory is still 67.1MB. Free memory was 26.6MB in the beginning and 47.1MB in the end (delta: -20.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 21]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 31 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 18.7s, OverallIterations: 2, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 11.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.2s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2 mSDsluCounter, 65 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 16 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 30 IncrementalHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 49 mSDtfsCounter, 30 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 85 GetRequests, 79 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=31occurred in iteration=0, InterpolantAutomatonStates: 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, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 12 LocationsWithAnnotation, 25 PreInvPairs, 29 NumberOfFragments, 16 HoareAnnotationTreeSize, 25 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 12 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.6s InterpolantComputationTime, 58 NumberOfCodeBlocks, 58 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 84 ConstructedInterpolants, 0 QuantifiedInterpolants, 134 SizeOfPredicates, 3 NumberOfNonLiveVariables, 112 ConjunctsInSsa, 7 ConjunctsInUnsatCore, 3 InterpolantComputations, 1 PerfectInterpolantSequences, 66/72 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 41]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 26]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2022-02-20 17:34:12,219 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2022-02-20 17:34:12,263 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 137 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE