./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/geo2-ll_valuebound10.c --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/geo2-ll_valuebound10.c -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 aa915012f0ecb48890da92348b9b4d3565f79528800e403e93f67405fe73f7dd --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 17:29:22,199 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 17:29:22,202 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 17:29:22,235 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 17:29:22,238 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 17:29:22,240 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 17:29:22,241 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 17:29:22,244 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 17:29:22,246 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 17:29:22,246 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 17:29:22,247 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 17:29:22,249 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 17:29:22,249 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 17:29:22,254 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 17:29:22,256 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 17:29:22,257 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 17:29:22,258 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 17:29:22,260 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 17:29:22,261 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 17:29:22,266 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 17:29:22,267 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 17:29:22,269 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 17:29:22,269 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 17:29:22,270 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 17:29:22,273 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 17:29:22,275 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 17:29:22,275 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 17:29:22,276 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 17:29:22,277 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 17:29:22,277 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 17:29:22,277 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 17:29:22,278 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 17:29:22,279 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 17:29:22,280 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 17:29:22,281 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 17:29:22,281 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 17:29:22,282 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 17:29:22,282 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 17:29:22,282 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 17:29:22,283 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 17:29:22,283 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 17:29:22,284 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:29:22,308 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 17:29:22,309 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 17:29:22,309 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 17:29:22,309 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 17:29:22,310 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 17:29:22,310 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 17:29:22,310 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 17:29:22,311 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 17:29:22,311 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 17:29:22,311 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 17:29:22,311 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 17:29:22,312 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 17:29:22,312 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 17:29:22,312 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 17:29:22,312 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 17:29:22,312 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 17:29:22,312 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 17:29:22,313 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 17:29:22,313 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 17:29:22,313 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 17:29:22,313 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 17:29:22,313 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 17:29:22,313 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 17:29:22,313 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 17:29:22,314 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 17:29:22,314 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 17:29:22,314 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 17:29:22,315 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 17:29:22,315 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 17:29:22,315 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 17:29:22,315 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 17:29:22,316 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 17:29:22,316 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 17:29:22,316 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 -> aa915012f0ecb48890da92348b9b4d3565f79528800e403e93f67405fe73f7dd [2022-02-20 17:29:22,495 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 17:29:22,530 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 17:29:22,532 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 17:29:22,532 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 17:29:22,533 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 17:29:22,535 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/geo2-ll_valuebound10.c [2022-02-20 17:29:22,576 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4a3c92805/190f4cb921c848b6bb98d8017f199d6f/FLAG5d90c0780 [2022-02-20 17:29:22,903 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 17:29:22,904 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/geo2-ll_valuebound10.c [2022-02-20 17:29:22,907 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4a3c92805/190f4cb921c848b6bb98d8017f199d6f/FLAG5d90c0780 [2022-02-20 17:29:23,348 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4a3c92805/190f4cb921c848b6bb98d8017f199d6f [2022-02-20 17:29:23,350 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 17:29:23,350 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 17:29:23,359 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 17:29:23,359 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 17:29:23,365 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 17:29:23,366 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 05:29:23" (1/1) ... [2022-02-20 17:29:23,368 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@14b70b78 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:29:23, skipping insertion in model container [2022-02-20 17:29:23,368 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 05:29:23" (1/1) ... [2022-02-20 17:29:23,381 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 17:29:23,404 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 17:29:23,515 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/geo2-ll_valuebound10.c[525,538] [2022-02-20 17:29:23,534 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 17:29:23,540 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 17:29:23,549 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/geo2-ll_valuebound10.c[525,538] [2022-02-20 17:29:23,553 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 17:29:23,562 INFO L208 MainTranslator]: Completed translation [2022-02-20 17:29:23,563 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:29:23 WrapperNode [2022-02-20 17:29:23,563 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 17:29:23,564 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 17:29:23,564 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 17:29:23,564 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 17:29:23,569 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:29:23" (1/1) ... [2022-02-20 17:29:23,573 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:29:23" (1/1) ... [2022-02-20 17:29:23,585 INFO L137 Inliner]: procedures = 14, calls = 11, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 39 [2022-02-20 17:29:23,585 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 17:29:23,586 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 17:29:23,586 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 17:29:23,586 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 17:29:23,593 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:29:23" (1/1) ... [2022-02-20 17:29:23,596 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:29:23" (1/1) ... [2022-02-20 17:29:23,597 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:29:23" (1/1) ... [2022-02-20 17:29:23,597 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:29:23" (1/1) ... [2022-02-20 17:29:23,600 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:29:23" (1/1) ... [2022-02-20 17:29:23,602 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:29:23" (1/1) ... [2022-02-20 17:29:23,603 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:29:23" (1/1) ... [2022-02-20 17:29:23,603 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 17:29:23,604 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 17:29:23,604 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 17:29:23,604 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 17:29:23,605 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:29:23" (1/1) ... [2022-02-20 17:29:23,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 17:29:23,618 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:29:23,633 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:29:23,638 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:29:23,666 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 17:29:23,666 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-02-20 17:29:23,666 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-02-20 17:29:23,666 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 17:29:23,666 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 17:29:23,667 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 17:29:23,667 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-02-20 17:29:23,667 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-02-20 17:29:23,705 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 17:29:23,706 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 17:29:23,804 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 17:29:23,809 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 17:29:23,809 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-20 17:29:23,810 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:29:23 BoogieIcfgContainer [2022-02-20 17:29:23,810 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 17:29:23,811 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 17:29:23,812 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 17:29:23,814 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 17:29:23,814 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 05:29:23" (1/3) ... [2022-02-20 17:29:23,814 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a2e3060 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 05:29:23, skipping insertion in model container [2022-02-20 17:29:23,815 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:29:23" (2/3) ... [2022-02-20 17:29:23,815 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a2e3060 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 05:29:23, skipping insertion in model container [2022-02-20 17:29:23,815 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:29:23" (3/3) ... [2022-02-20 17:29:23,816 INFO L111 eAbstractionObserver]: Analyzing ICFG geo2-ll_valuebound10.c [2022-02-20 17:29:23,819 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 17:29:23,819 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 17:29:23,872 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 17:29:23,877 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:29:23,883 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 17:29:23,907 INFO L276 IsEmpty]: Start isEmpty. Operand has 24 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 17:29:23,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-02-20 17:29:23,910 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:29:23,911 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:29:23,911 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:29:23,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:29:23,915 INFO L85 PathProgramCache]: Analyzing trace with hash 1945977121, now seen corresponding path program 1 times [2022-02-20 17:29:23,927 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:29:23,928 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745604007] [2022-02-20 17:29:23,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:29:23,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:29:24,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:29:24,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 17:29:24,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:29:24,104 INFO L290 TraceCheckUtils]: 0: Hoare triple {27#true} ~cond := #in~cond; {27#true} is VALID [2022-02-20 17:29:24,105 INFO L290 TraceCheckUtils]: 1: Hoare triple {27#true} assume 0 == ~cond;assume false; {28#false} is VALID [2022-02-20 17:29:24,106 INFO L290 TraceCheckUtils]: 2: Hoare triple {28#false} assume true; {28#false} is VALID [2022-02-20 17:29:24,106 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28#false} {27#true} #50#return; {28#false} is VALID [2022-02-20 17:29:24,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-02-20 17:29:24,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:29:24,125 INFO L290 TraceCheckUtils]: 0: Hoare triple {27#true} ~cond := #in~cond; {27#true} is VALID [2022-02-20 17:29:24,126 INFO L290 TraceCheckUtils]: 1: Hoare triple {27#true} assume 0 == ~cond;assume false; {28#false} is VALID [2022-02-20 17:29:24,126 INFO L290 TraceCheckUtils]: 2: Hoare triple {28#false} assume true; {28#false} is VALID [2022-02-20 17:29:24,126 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28#false} {28#false} #52#return; {28#false} is VALID [2022-02-20 17:29:24,127 INFO L290 TraceCheckUtils]: 0: Hoare triple {27#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {27#true} is VALID [2022-02-20 17:29:24,127 INFO L290 TraceCheckUtils]: 1: Hoare triple {27#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_~z~0#1, main_~k~0#1, main_~x~0#1, main_~y~0#1, main_~c~0#1;havoc main_~z~0#1;havoc main_~k~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~c~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~z~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {27#true} is VALID [2022-02-20 17:29:24,128 INFO L272 TraceCheckUtils]: 2: Hoare triple {27#true} call assume_abort_if_not((if main_~z~0#1 >= 0 && main_~z~0#1 <= 10 then 1 else 0)); {27#true} is VALID [2022-02-20 17:29:24,128 INFO L290 TraceCheckUtils]: 3: Hoare triple {27#true} ~cond := #in~cond; {27#true} is VALID [2022-02-20 17:29:24,129 INFO L290 TraceCheckUtils]: 4: Hoare triple {27#true} assume 0 == ~cond;assume false; {28#false} is VALID [2022-02-20 17:29:24,129 INFO L290 TraceCheckUtils]: 5: Hoare triple {28#false} assume true; {28#false} is VALID [2022-02-20 17:29:24,129 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {28#false} {27#true} #50#return; {28#false} is VALID [2022-02-20 17:29:24,130 INFO L290 TraceCheckUtils]: 7: Hoare triple {28#false} assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~k~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {28#false} is VALID [2022-02-20 17:29:24,130 INFO L272 TraceCheckUtils]: 8: Hoare triple {28#false} call assume_abort_if_not((if main_~k~0#1 >= 0 && main_~k~0#1 <= 10 then 1 else 0)); {27#true} is VALID [2022-02-20 17:29:24,130 INFO L290 TraceCheckUtils]: 9: Hoare triple {27#true} ~cond := #in~cond; {27#true} is VALID [2022-02-20 17:29:24,134 INFO L290 TraceCheckUtils]: 10: Hoare triple {27#true} assume 0 == ~cond;assume false; {28#false} is VALID [2022-02-20 17:29:24,134 INFO L290 TraceCheckUtils]: 11: Hoare triple {28#false} assume true; {28#false} is VALID [2022-02-20 17:29:24,135 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {28#false} {28#false} #52#return; {28#false} is VALID [2022-02-20 17:29:24,135 INFO L290 TraceCheckUtils]: 13: Hoare triple {28#false} main_~x~0#1 := 1;main_~y~0#1 := 1;main_~c~0#1 := 1; {28#false} is VALID [2022-02-20 17:29:24,135 INFO L290 TraceCheckUtils]: 14: Hoare triple {28#false} assume !true; {28#false} is VALID [2022-02-20 17:29:24,135 INFO L272 TraceCheckUtils]: 15: Hoare triple {28#false} call __VERIFIER_assert((if 0 == 1 + main_~x~0#1 * main_~z~0#1 - main_~x~0#1 - main_~z~0#1 * main_~y~0#1 then 1 else 0)); {28#false} is VALID [2022-02-20 17:29:24,136 INFO L290 TraceCheckUtils]: 16: Hoare triple {28#false} ~cond := #in~cond; {28#false} is VALID [2022-02-20 17:29:24,136 INFO L290 TraceCheckUtils]: 17: Hoare triple {28#false} assume 0 == ~cond; {28#false} is VALID [2022-02-20 17:29:24,137 INFO L290 TraceCheckUtils]: 18: Hoare triple {28#false} assume !false; {28#false} is VALID [2022-02-20 17:29:24,137 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-20 17:29:24,138 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:29:24,139 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745604007] [2022-02-20 17:29:24,140 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [745604007] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:29:24,140 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:29:24,140 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 17:29:24,142 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647740898] [2022-02-20 17:29:24,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:29:24,149 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 19 [2022-02-20 17:29:24,150 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:29:24,153 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:29:24,180 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:29:24,180 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 17:29:24,181 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:29:24,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 17:29:24,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 17:29:24,211 INFO L87 Difference]: Start difference. First operand has 24 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:29:24,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:29:24,267 INFO L93 Difference]: Finished difference Result 45 states and 60 transitions. [2022-02-20 17:29:24,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 17:29:24,267 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 19 [2022-02-20 17:29:24,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:29:24,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:29:24,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 60 transitions. [2022-02-20 17:29:24,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:29:24,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 60 transitions. [2022-02-20 17:29:24,283 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 60 transitions. [2022-02-20 17:29:24,342 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:29:24,347 INFO L225 Difference]: With dead ends: 45 [2022-02-20 17:29:24,348 INFO L226 Difference]: Without dead ends: 20 [2022-02-20 17:29:24,350 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 17:29:24,353 INFO L933 BasicCegarLoop]: 26 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, 26 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:29:24,354 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:29:24,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-02-20 17:29:24,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2022-02-20 17:29:24,383 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:29:24,384 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand has 20 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 17:29:24,385 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand has 20 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 17:29:24,385 INFO L87 Difference]: Start difference. First operand 20 states. Second operand has 20 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 17:29:24,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:29:24,388 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2022-02-20 17:29:24,388 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2022-02-20 17:29:24,388 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:29:24,389 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:29:24,389 INFO L74 IsIncluded]: Start isIncluded. First operand has 20 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 20 states. [2022-02-20 17:29:24,389 INFO L87 Difference]: Start difference. First operand has 20 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 20 states. [2022-02-20 17:29:24,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:29:24,391 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2022-02-20 17:29:24,392 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2022-02-20 17:29:24,392 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:29:24,392 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:29:24,392 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:29:24,392 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:29:24,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 17:29:24,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2022-02-20 17:29:24,395 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 22 transitions. Word has length 19 [2022-02-20 17:29:24,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:29:24,396 INFO L470 AbstractCegarLoop]: Abstraction has 20 states and 22 transitions. [2022-02-20 17:29:24,396 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:29:24,396 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2022-02-20 17:29:24,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-02-20 17:29:24,397 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:29:24,397 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:29:24,397 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 17:29:24,398 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:29:24,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:29:24,398 INFO L85 PathProgramCache]: Analyzing trace with hash 1338724063, now seen corresponding path program 1 times [2022-02-20 17:29:24,398 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:29:24,399 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100510903] [2022-02-20 17:29:24,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:29:24,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:29:24,415 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:29:24,416 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1225871545] [2022-02-20 17:29:24,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:29:24,416 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:29:24,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:29:24,418 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 17:29:24,419 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-02-20 17:29:24,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:29:24,456 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 12 conjunts are in the unsatisfiable core [2022-02-20 17:29:24,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:29:24,467 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:29:24,699 INFO L290 TraceCheckUtils]: 0: Hoare triple {166#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {166#true} is VALID [2022-02-20 17:29:24,699 INFO L290 TraceCheckUtils]: 1: Hoare triple {166#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_~z~0#1, main_~k~0#1, main_~x~0#1, main_~y~0#1, main_~c~0#1;havoc main_~z~0#1;havoc main_~k~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~c~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~z~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {166#true} is VALID [2022-02-20 17:29:24,699 INFO L272 TraceCheckUtils]: 2: Hoare triple {166#true} call assume_abort_if_not((if main_~z~0#1 >= 0 && main_~z~0#1 <= 10 then 1 else 0)); {166#true} is VALID [2022-02-20 17:29:24,700 INFO L290 TraceCheckUtils]: 3: Hoare triple {166#true} ~cond := #in~cond; {180#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-02-20 17:29:24,700 INFO L290 TraceCheckUtils]: 4: Hoare triple {180#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {184#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-02-20 17:29:24,701 INFO L290 TraceCheckUtils]: 5: Hoare triple {184#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {184#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-02-20 17:29:24,701 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {184#(not (= |assume_abort_if_not_#in~cond| 0))} {166#true} #50#return; {191#(and (<= |ULTIMATE.start_main_~z~0#1| 10) (<= 0 |ULTIMATE.start_main_~z~0#1|))} is VALID [2022-02-20 17:29:24,702 INFO L290 TraceCheckUtils]: 7: Hoare triple {191#(and (<= |ULTIMATE.start_main_~z~0#1| 10) (<= 0 |ULTIMATE.start_main_~z~0#1|))} assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~k~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {191#(and (<= |ULTIMATE.start_main_~z~0#1| 10) (<= 0 |ULTIMATE.start_main_~z~0#1|))} is VALID [2022-02-20 17:29:24,702 INFO L272 TraceCheckUtils]: 8: Hoare triple {191#(and (<= |ULTIMATE.start_main_~z~0#1| 10) (<= 0 |ULTIMATE.start_main_~z~0#1|))} call assume_abort_if_not((if main_~k~0#1 >= 0 && main_~k~0#1 <= 10 then 1 else 0)); {166#true} is VALID [2022-02-20 17:29:24,702 INFO L290 TraceCheckUtils]: 9: Hoare triple {166#true} ~cond := #in~cond; {166#true} is VALID [2022-02-20 17:29:24,702 INFO L290 TraceCheckUtils]: 10: Hoare triple {166#true} assume !(0 == ~cond); {166#true} is VALID [2022-02-20 17:29:24,702 INFO L290 TraceCheckUtils]: 11: Hoare triple {166#true} assume true; {166#true} is VALID [2022-02-20 17:29:24,703 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {166#true} {191#(and (<= |ULTIMATE.start_main_~z~0#1| 10) (<= 0 |ULTIMATE.start_main_~z~0#1|))} #52#return; {191#(and (<= |ULTIMATE.start_main_~z~0#1| 10) (<= 0 |ULTIMATE.start_main_~z~0#1|))} is VALID [2022-02-20 17:29:24,704 INFO L290 TraceCheckUtils]: 13: Hoare triple {191#(and (<= |ULTIMATE.start_main_~z~0#1| 10) (<= 0 |ULTIMATE.start_main_~z~0#1|))} main_~x~0#1 := 1;main_~y~0#1 := 1;main_~c~0#1 := 1; {213#(and (= |ULTIMATE.start_main_~x~0#1| 1) (= |ULTIMATE.start_main_~y~0#1| 1) (<= |ULTIMATE.start_main_~z~0#1| 10) (<= 0 |ULTIMATE.start_main_~z~0#1|))} is VALID [2022-02-20 17:29:24,704 INFO L290 TraceCheckUtils]: 14: Hoare triple {213#(and (= |ULTIMATE.start_main_~x~0#1| 1) (= |ULTIMATE.start_main_~y~0#1| 1) (<= |ULTIMATE.start_main_~z~0#1| 10) (<= 0 |ULTIMATE.start_main_~z~0#1|))} assume !false; {213#(and (= |ULTIMATE.start_main_~x~0#1| 1) (= |ULTIMATE.start_main_~y~0#1| 1) (<= |ULTIMATE.start_main_~z~0#1| 10) (<= 0 |ULTIMATE.start_main_~z~0#1|))} is VALID [2022-02-20 17:29:24,705 INFO L272 TraceCheckUtils]: 15: Hoare triple {213#(and (= |ULTIMATE.start_main_~x~0#1| 1) (= |ULTIMATE.start_main_~y~0#1| 1) (<= |ULTIMATE.start_main_~z~0#1| 10) (<= 0 |ULTIMATE.start_main_~z~0#1|))} call __VERIFIER_assert((if 0 == 1 + main_~x~0#1 * main_~z~0#1 - main_~x~0#1 - main_~z~0#1 * main_~y~0#1 then 1 else 0)); {220#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:29:24,705 INFO L290 TraceCheckUtils]: 16: Hoare triple {220#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {224#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:29:24,706 INFO L290 TraceCheckUtils]: 17: Hoare triple {224#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {167#false} is VALID [2022-02-20 17:29:24,706 INFO L290 TraceCheckUtils]: 18: Hoare triple {167#false} assume !false; {167#false} is VALID [2022-02-20 17:29:24,706 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 17:29:24,706 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:29:24,887 INFO L290 TraceCheckUtils]: 18: Hoare triple {167#false} assume !false; {167#false} is VALID [2022-02-20 17:29:24,888 INFO L290 TraceCheckUtils]: 17: Hoare triple {224#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {167#false} is VALID [2022-02-20 17:29:24,888 INFO L290 TraceCheckUtils]: 16: Hoare triple {220#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {224#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:29:24,892 INFO L272 TraceCheckUtils]: 15: Hoare triple {240#(= (+ (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) |ULTIMATE.start_main_~x~0#1|) (+ (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~z~0#1|) 1))} call __VERIFIER_assert((if 0 == 1 + main_~x~0#1 * main_~z~0#1 - main_~x~0#1 - main_~z~0#1 * main_~y~0#1 then 1 else 0)); {220#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:29:24,892 INFO L290 TraceCheckUtils]: 14: Hoare triple {240#(= (+ (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) |ULTIMATE.start_main_~x~0#1|) (+ (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~z~0#1|) 1))} assume !false; {240#(= (+ (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) |ULTIMATE.start_main_~x~0#1|) (+ (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~z~0#1|) 1))} is VALID [2022-02-20 17:29:24,893 INFO L290 TraceCheckUtils]: 13: Hoare triple {166#true} main_~x~0#1 := 1;main_~y~0#1 := 1;main_~c~0#1 := 1; {240#(= (+ (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) |ULTIMATE.start_main_~x~0#1|) (+ (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~z~0#1|) 1))} is VALID [2022-02-20 17:29:24,893 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {166#true} {166#true} #52#return; {166#true} is VALID [2022-02-20 17:29:24,893 INFO L290 TraceCheckUtils]: 11: Hoare triple {166#true} assume true; {166#true} is VALID [2022-02-20 17:29:24,894 INFO L290 TraceCheckUtils]: 10: Hoare triple {166#true} assume !(0 == ~cond); {166#true} is VALID [2022-02-20 17:29:24,894 INFO L290 TraceCheckUtils]: 9: Hoare triple {166#true} ~cond := #in~cond; {166#true} is VALID [2022-02-20 17:29:24,894 INFO L272 TraceCheckUtils]: 8: Hoare triple {166#true} call assume_abort_if_not((if main_~k~0#1 >= 0 && main_~k~0#1 <= 10 then 1 else 0)); {166#true} is VALID [2022-02-20 17:29:24,894 INFO L290 TraceCheckUtils]: 7: Hoare triple {166#true} assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~k~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {166#true} is VALID [2022-02-20 17:29:24,896 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {166#true} {166#true} #50#return; {166#true} is VALID [2022-02-20 17:29:24,896 INFO L290 TraceCheckUtils]: 5: Hoare triple {166#true} assume true; {166#true} is VALID [2022-02-20 17:29:24,897 INFO L290 TraceCheckUtils]: 4: Hoare triple {166#true} assume !(0 == ~cond); {166#true} is VALID [2022-02-20 17:29:24,898 INFO L290 TraceCheckUtils]: 3: Hoare triple {166#true} ~cond := #in~cond; {166#true} is VALID [2022-02-20 17:29:24,898 INFO L272 TraceCheckUtils]: 2: Hoare triple {166#true} call assume_abort_if_not((if main_~z~0#1 >= 0 && main_~z~0#1 <= 10 then 1 else 0)); {166#true} is VALID [2022-02-20 17:29:24,899 INFO L290 TraceCheckUtils]: 1: Hoare triple {166#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_~z~0#1, main_~k~0#1, main_~x~0#1, main_~y~0#1, main_~c~0#1;havoc main_~z~0#1;havoc main_~k~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~c~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~z~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {166#true} is VALID [2022-02-20 17:29:24,899 INFO L290 TraceCheckUtils]: 0: Hoare triple {166#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {166#true} is VALID [2022-02-20 17:29:24,899 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-20 17:29:24,899 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:29:24,900 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100510903] [2022-02-20 17:29:24,900 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:29:24,900 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1225871545] [2022-02-20 17:29:24,902 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1225871545] provided 1 perfect and 1 imperfect interpolant sequences [2022-02-20 17:29:24,902 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-20 17:29:24,902 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 9 [2022-02-20 17:29:24,903 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499651567] [2022-02-20 17:29:24,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:29:24,904 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 19 [2022-02-20 17:29:24,904 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:29:24,904 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 17:29:24,920 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:29:24,920 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 17:29:24,920 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:29:24,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 17:29:24,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-02-20 17:29:24,921 INFO L87 Difference]: Start difference. First operand 20 states and 22 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 17:29:25,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:29:25,167 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2022-02-20 17:29:25,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 17:29:25,167 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 19 [2022-02-20 17:29:25,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:29:25,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 17:29:25,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 22 transitions. [2022-02-20 17:29:25,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 17:29:25,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 22 transitions. [2022-02-20 17:29:25,170 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 22 transitions. [2022-02-20 17:29:25,200 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:29:25,200 INFO L225 Difference]: With dead ends: 20 [2022-02-20 17:29:25,200 INFO L226 Difference]: Without dead ends: 0 [2022-02-20 17:29:25,201 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-02-20 17:29:25,202 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 6 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 17:29:25,202 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 56 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 17:29:25,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-02-20 17:29:25,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-02-20 17:29:25,203 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:29:25,203 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:29:25,203 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:29:25,203 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:29:25,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:29:25,203 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-20 17:29:25,203 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 17:29:25,203 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:29:25,203 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:29:25,203 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:29:25,204 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:29:25,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:29:25,204 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-20 17:29:25,204 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 17:29:25,204 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:29:25,204 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:29:25,204 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:29:25,204 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:29:25,204 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:29:25,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-02-20 17:29:25,204 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 19 [2022-02-20 17:29:25,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:29:25,205 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-20 17:29:25,205 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 17:29:25,205 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 17:29:25,205 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:29:25,207 INFO L764 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-20 17:29:25,251 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-02-20 17:29:25,417 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:29:25,420 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-02-20 17:29:25,434 INFO L854 garLoopResultBuilder]: At program point L35-2(lines 35 44) the Hoare annotation is: (= (+ (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) |ULTIMATE.start_main_~x~0#1|) (+ (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~z~0#1|) 1)) [2022-02-20 17:29:25,435 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-02-20 17:29:25,435 INFO L854 garLoopResultBuilder]: At program point L35-3(lines 35 44) the Hoare annotation is: (= (+ (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) |ULTIMATE.start_main_~x~0#1|) (+ (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~z~0#1|) 1)) [2022-02-20 17:29:25,435 INFO L861 garLoopResultBuilder]: At program point L29(line 29) the Hoare annotation is: true [2022-02-20 17:29:25,435 INFO L858 garLoopResultBuilder]: For program point L29-1(line 29) no Hoare annotation was computed. [2022-02-20 17:29:25,435 INFO L861 garLoopResultBuilder]: At program point L27(line 27) the Hoare annotation is: true [2022-02-20 17:29:25,435 INFO L858 garLoopResultBuilder]: For program point L27-1(line 27) no Hoare annotation was computed. [2022-02-20 17:29:25,436 INFO L861 garLoopResultBuilder]: At program point L46(lines 23 47) the Hoare annotation is: true [2022-02-20 17:29:25,436 INFO L854 garLoopResultBuilder]: At program point L36(line 36) the Hoare annotation is: (= (+ (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) |ULTIMATE.start_main_~x~0#1|) (+ (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~z~0#1|) 1)) [2022-02-20 17:29:25,436 INFO L858 garLoopResultBuilder]: For program point L36-1(lines 35 44) no Hoare annotation was computed. [2022-02-20 17:29:25,436 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-02-20 17:29:25,436 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-02-20 17:29:25,436 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-02-20 17:29:25,436 INFO L858 garLoopResultBuilder]: For program point L45(line 45) no Hoare annotation was computed. [2022-02-20 17:29:25,439 INFO L861 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 11 13) the Hoare annotation is: true [2022-02-20 17:29:25,439 INFO L858 garLoopResultBuilder]: For program point L12(line 12) no Hoare annotation was computed. [2022-02-20 17:29:25,439 INFO L858 garLoopResultBuilder]: For program point L12-2(lines 11 13) no Hoare annotation was computed. [2022-02-20 17:29:25,440 INFO L858 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 11 13) no Hoare annotation was computed. [2022-02-20 17:29:25,440 INFO L858 garLoopResultBuilder]: For program point L16(lines 16 17) no Hoare annotation was computed. [2022-02-20 17:29:25,441 INFO L858 garLoopResultBuilder]: For program point L15(lines 15 18) no Hoare annotation was computed. [2022-02-20 17:29:25,441 INFO L861 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 14 20) the Hoare annotation is: true [2022-02-20 17:29:25,441 INFO L858 garLoopResultBuilder]: For program point L15-2(lines 14 20) no Hoare annotation was computed. [2022-02-20 17:29:25,441 INFO L858 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 14 20) no Hoare annotation was computed. [2022-02-20 17:29:25,442 INFO L858 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 17) no Hoare annotation was computed. [2022-02-20 17:29:25,446 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1] [2022-02-20 17:29:25,447 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 17:29:25,449 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-02-20 17:29:25,449 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-02-20 17:29:25,449 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-02-20 17:29:25,449 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-02-20 17:29:25,450 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-02-20 17:29:25,450 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-02-20 17:29:25,450 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-02-20 17:29:25,450 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-02-20 17:29:25,450 WARN L170 areAnnotationChecker]: L27-1 has no Hoare annotation [2022-02-20 17:29:25,450 WARN L170 areAnnotationChecker]: L12-2 has no Hoare annotation [2022-02-20 17:29:25,450 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-02-20 17:29:25,450 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-02-20 17:29:25,450 WARN L170 areAnnotationChecker]: L15-2 has no Hoare annotation [2022-02-20 17:29:25,450 WARN L170 areAnnotationChecker]: L27-1 has no Hoare annotation [2022-02-20 17:29:25,450 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-02-20 17:29:25,451 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-02-20 17:29:25,451 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-02-20 17:29:25,451 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-02-20 17:29:25,451 WARN L170 areAnnotationChecker]: L29-1 has no Hoare annotation [2022-02-20 17:29:25,451 WARN L170 areAnnotationChecker]: L29-1 has no Hoare annotation [2022-02-20 17:29:25,451 WARN L170 areAnnotationChecker]: L36-1 has no Hoare annotation [2022-02-20 17:29:25,451 WARN L170 areAnnotationChecker]: L36-1 has no Hoare annotation [2022-02-20 17:29:25,451 WARN L170 areAnnotationChecker]: L45 has no Hoare annotation [2022-02-20 17:29:25,452 WARN L170 areAnnotationChecker]: L45 has no Hoare annotation [2022-02-20 17:29:25,453 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 17:29:25,453 WARN L170 areAnnotationChecker]: L36-1 has no Hoare annotation [2022-02-20 17:29:25,453 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 17:29:25,453 INFO L163 areAnnotationChecker]: CFG has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-02-20 17:29:25,459 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.02 05:29:25 BoogieIcfgContainer [2022-02-20 17:29:25,459 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-20 17:29:25,459 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-20 17:29:25,460 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-20 17:29:25,460 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-20 17:29:25,460 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:29:23" (3/4) ... [2022-02-20 17:29:25,462 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-02-20 17:29:25,465 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2022-02-20 17:29:25,465 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2022-02-20 17:29:25,467 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2022-02-20 17:29:25,468 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2022-02-20 17:29:25,468 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-02-20 17:29:25,468 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-02-20 17:29:25,486 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-02-20 17:29:25,487 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-20 17:29:25,488 INFO L158 Benchmark]: Toolchain (without parser) took 2137.16ms. Allocated memory was 113.2MB in the beginning and 136.3MB in the end (delta: 23.1MB). Free memory was 81.2MB in the beginning and 98.6MB in the end (delta: -17.4MB). Peak memory consumption was 3.8MB. Max. memory is 16.1GB. [2022-02-20 17:29:25,488 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 113.2MB. Free memory was 66.2MB in the beginning and 66.2MB in the end (delta: 25.9kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 17:29:25,488 INFO L158 Benchmark]: CACSL2BoogieTranslator took 203.91ms. Allocated memory is still 113.2MB. Free memory was 80.9MB in the beginning and 87.7MB in the end (delta: -6.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-20 17:29:25,488 INFO L158 Benchmark]: Boogie Procedure Inliner took 21.33ms. Allocated memory is still 113.2MB. Free memory was 87.3MB in the beginning and 85.9MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 17:29:25,489 INFO L158 Benchmark]: Boogie Preprocessor took 17.92ms. Allocated memory is still 113.2MB. Free memory was 85.9MB in the beginning and 84.6MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 17:29:25,489 INFO L158 Benchmark]: RCFGBuilder took 206.48ms. Allocated memory is still 113.2MB. Free memory was 84.6MB in the beginning and 74.3MB in the end (delta: 10.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-02-20 17:29:25,489 INFO L158 Benchmark]: TraceAbstraction took 1647.60ms. Allocated memory was 113.2MB in the beginning and 136.3MB in the end (delta: 23.1MB). Free memory was 74.0MB in the beginning and 101.7MB in the end (delta: -27.7MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 17:29:25,489 INFO L158 Benchmark]: Witness Printer took 27.44ms. Allocated memory is still 136.3MB. Free memory was 101.7MB in the beginning and 98.6MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-02-20 17:29:25,490 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.18ms. Allocated memory is still 113.2MB. Free memory was 66.2MB in the beginning and 66.2MB in the end (delta: 25.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 203.91ms. Allocated memory is still 113.2MB. Free memory was 80.9MB in the beginning and 87.7MB in the end (delta: -6.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 21.33ms. Allocated memory is still 113.2MB. Free memory was 87.3MB in the beginning and 85.9MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 17.92ms. Allocated memory is still 113.2MB. Free memory was 85.9MB in the beginning and 84.6MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 206.48ms. Allocated memory is still 113.2MB. Free memory was 84.6MB in the beginning and 74.3MB in the end (delta: 10.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 1647.60ms. Allocated memory was 113.2MB in the beginning and 136.3MB in the end (delta: 23.1MB). Free memory was 74.0MB in the beginning and 101.7MB in the end (delta: -27.7MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 27.44ms. Allocated memory is still 136.3MB. Free memory was 101.7MB in the beginning and 98.6MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. 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: 17]: 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, 24 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.6s, OverallIterations: 2, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 7 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6 mSDsluCounter, 82 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 40 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 11 IncrementalHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 42 mSDtfsCounter, 11 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 45 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=24occurred 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, 8 LocationsWithAnnotation, 13 PreInvPairs, 18 NumberOfFragments, 38 HoareAnnotationTreeSize, 13 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 8 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 38 NumberOfCodeBlocks, 38 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 54 ConstructedInterpolants, 0 QuantifiedInterpolants, 132 SizeOfPredicates, 2 NumberOfNonLiveVariables, 65 ConjunctsInSsa, 12 ConjunctsInUnsatCore, 3 InterpolantComputations, 2 PerfectInterpolantSequences, 9/12 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 23]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 35]: Loop Invariant Derived loop invariant: y * z + x == x * z + 1 RESULT: Ultimate proved your program to be correct! [2022-02-20 17:29:25,509 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 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE