./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/geo1-ll_unwindbound2.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/geo1-ll_unwindbound2.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 7e2bf307cb8f7c9c94b988ac468881aa12e08b820a3a7e7ee2376cf91aff114e --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 17:28:32,101 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 17:28:32,103 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 17:28:32,129 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 17:28:32,130 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 17:28:32,131 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 17:28:32,132 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 17:28:32,134 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 17:28:32,135 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 17:28:32,136 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 17:28:32,137 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 17:28:32,138 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 17:28:32,138 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 17:28:32,139 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 17:28:32,140 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 17:28:32,141 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 17:28:32,142 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 17:28:32,143 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 17:28:32,148 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 17:28:32,149 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 17:28:32,155 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 17:28:32,157 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 17:28:32,158 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 17:28:32,159 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 17:28:32,166 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 17:28:32,166 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 17:28:32,167 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 17:28:32,168 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 17:28:32,174 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 17:28:32,175 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 17:28:32,175 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 17:28:32,176 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 17:28:32,177 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 17:28:32,177 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 17:28:32,178 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 17:28:32,179 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 17:28:32,179 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 17:28:32,180 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 17:28:32,180 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 17:28:32,182 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 17:28:32,183 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 17:28:32,184 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:28:32,222 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 17:28:32,223 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 17:28:32,224 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 17:28:32,224 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 17:28:32,225 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 17:28:32,225 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 17:28:32,226 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 17:28:32,226 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 17:28:32,226 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 17:28:32,226 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 17:28:32,227 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 17:28:32,227 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 17:28:32,228 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 17:28:32,228 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 17:28:32,228 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 17:28:32,228 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 17:28:32,228 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 17:28:32,228 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 17:28:32,229 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 17:28:32,229 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 17:28:32,229 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 17:28:32,229 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 17:28:32,229 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 17:28:32,230 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 17:28:32,230 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 17:28:32,230 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 17:28:32,230 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 17:28:32,231 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 17:28:32,231 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 17:28:32,231 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 17:28:32,231 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 17:28:32,231 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 17:28:32,232 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 17:28:32,232 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 -> 7e2bf307cb8f7c9c94b988ac468881aa12e08b820a3a7e7ee2376cf91aff114e [2022-02-20 17:28:32,496 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 17:28:32,523 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 17:28:32,525 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 17:28:32,527 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 17:28:32,527 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 17:28:32,529 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/geo1-ll_unwindbound2.c [2022-02-20 17:28:32,586 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b554ca159/67e7adac5bbf49a18d31804ea99d27d7/FLAG1684c51cd [2022-02-20 17:28:33,052 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 17:28:33,053 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/geo1-ll_unwindbound2.c [2022-02-20 17:28:33,062 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b554ca159/67e7adac5bbf49a18d31804ea99d27d7/FLAG1684c51cd [2022-02-20 17:28:33,076 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b554ca159/67e7adac5bbf49a18d31804ea99d27d7 [2022-02-20 17:28:33,078 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 17:28:33,079 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 17:28:33,081 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 17:28:33,081 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 17:28:33,084 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 17:28:33,085 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 05:28:33" (1/1) ... [2022-02-20 17:28:33,085 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@554bbf3f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:28:33, skipping insertion in model container [2022-02-20 17:28:33,086 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 05:28:33" (1/1) ... [2022-02-20 17:28:33,092 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 17:28:33,105 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 17:28:33,280 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/geo1-ll_unwindbound2.c[546,559] [2022-02-20 17:28:33,306 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 17:28:33,320 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 17:28:33,333 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/geo1-ll_unwindbound2.c[546,559] [2022-02-20 17:28:33,346 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 17:28:33,364 INFO L208 MainTranslator]: Completed translation [2022-02-20 17:28:33,364 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:28:33 WrapperNode [2022-02-20 17:28:33,364 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 17:28:33,365 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 17:28:33,366 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 17:28:33,366 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 17:28:33,372 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:28:33" (1/1) ... [2022-02-20 17:28:33,378 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:28:33" (1/1) ... [2022-02-20 17:28:33,399 INFO L137 Inliner]: procedures = 14, calls = 11, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 45 [2022-02-20 17:28:33,399 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 17:28:33,400 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 17:28:33,400 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 17:28:33,400 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 17:28:33,408 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:28:33" (1/1) ... [2022-02-20 17:28:33,408 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:28:33" (1/1) ... [2022-02-20 17:28:33,416 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:28:33" (1/1) ... [2022-02-20 17:28:33,417 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:28:33" (1/1) ... [2022-02-20 17:28:33,420 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:28:33" (1/1) ... [2022-02-20 17:28:33,423 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:28:33" (1/1) ... [2022-02-20 17:28:33,424 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:28:33" (1/1) ... [2022-02-20 17:28:33,425 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 17:28:33,426 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 17:28:33,426 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 17:28:33,426 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 17:28:33,427 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:28:33" (1/1) ... [2022-02-20 17:28:33,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 17:28:33,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:28:33,465 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:28:33,487 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:28:33,500 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 17:28:33,500 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-02-20 17:28:33,500 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-02-20 17:28:33,501 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 17:28:33,501 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 17:28:33,501 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 17:28:33,501 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-02-20 17:28:33,501 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-02-20 17:28:33,554 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 17:28:33,556 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 17:28:33,741 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 17:28:33,747 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 17:28:33,747 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-20 17:28:33,749 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:28:33 BoogieIcfgContainer [2022-02-20 17:28:33,749 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 17:28:33,750 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 17:28:33,750 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 17:28:33,753 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 17:28:33,754 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 05:28:33" (1/3) ... [2022-02-20 17:28:33,754 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1588a913 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 05:28:33, skipping insertion in model container [2022-02-20 17:28:33,754 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:28:33" (2/3) ... [2022-02-20 17:28:33,755 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1588a913 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 05:28:33, skipping insertion in model container [2022-02-20 17:28:33,755 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:28:33" (3/3) ... [2022-02-20 17:28:33,756 INFO L111 eAbstractionObserver]: Analyzing ICFG geo1-ll_unwindbound2.c [2022-02-20 17:28:33,760 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 17:28:33,760 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 17:28:33,815 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 17:28:33,823 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:28:33,824 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 17:28:33,850 INFO L276 IsEmpty]: Start isEmpty. Operand has 25 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 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:28:33,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-02-20 17:28:33,855 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:28:33,856 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:28:33,856 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:28:33,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:28:33,862 INFO L85 PathProgramCache]: Analyzing trace with hash 995043441, now seen corresponding path program 1 times [2022-02-20 17:28:33,869 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:28:33,870 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270191368] [2022-02-20 17:28:33,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:28:33,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:28:33,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:28:34,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 17:28:34,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:28:34,053 INFO L290 TraceCheckUtils]: 0: Hoare triple {28#true} ~cond := #in~cond; {28#true} is VALID [2022-02-20 17:28:34,054 INFO L290 TraceCheckUtils]: 1: Hoare triple {28#true} assume 0 == ~cond;assume false; {29#false} is VALID [2022-02-20 17:28:34,054 INFO L290 TraceCheckUtils]: 2: Hoare triple {29#false} assume true; {29#false} is VALID [2022-02-20 17:28:34,054 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29#false} {28#true} #51#return; {29#false} is VALID [2022-02-20 17:28:34,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-02-20 17:28:34,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:28:34,072 INFO L290 TraceCheckUtils]: 0: Hoare triple {28#true} ~cond := #in~cond; {28#true} is VALID [2022-02-20 17:28:34,072 INFO L290 TraceCheckUtils]: 1: Hoare triple {28#true} assume 0 == ~cond;assume false; {29#false} is VALID [2022-02-20 17:28:34,073 INFO L290 TraceCheckUtils]: 2: Hoare triple {29#false} assume true; {29#false} is VALID [2022-02-20 17:28:34,073 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29#false} {29#false} #53#return; {29#false} is VALID [2022-02-20 17:28:34,073 INFO L290 TraceCheckUtils]: 0: Hoare triple {28#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);~counter~0 := 0; {28#true} is VALID [2022-02-20 17:28:34,074 INFO L290 TraceCheckUtils]: 1: Hoare triple {28#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_#t~post6#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;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#true} is VALID [2022-02-20 17:28:34,075 INFO L272 TraceCheckUtils]: 2: Hoare triple {28#true} call assume_abort_if_not((if main_~z~0#1 >= 1 then 1 else 0)); {28#true} is VALID [2022-02-20 17:28:34,075 INFO L290 TraceCheckUtils]: 3: Hoare triple {28#true} ~cond := #in~cond; {28#true} is VALID [2022-02-20 17:28:34,076 INFO L290 TraceCheckUtils]: 4: Hoare triple {28#true} assume 0 == ~cond;assume false; {29#false} is VALID [2022-02-20 17:28:34,076 INFO L290 TraceCheckUtils]: 5: Hoare triple {29#false} assume true; {29#false} is VALID [2022-02-20 17:28:34,076 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {29#false} {28#true} #51#return; {29#false} is VALID [2022-02-20 17:28:34,076 INFO L272 TraceCheckUtils]: 7: Hoare triple {29#false} call assume_abort_if_not((if main_~k~0#1 >= 1 then 1 else 0)); {28#true} is VALID [2022-02-20 17:28:34,077 INFO L290 TraceCheckUtils]: 8: Hoare triple {28#true} ~cond := #in~cond; {28#true} is VALID [2022-02-20 17:28:34,077 INFO L290 TraceCheckUtils]: 9: Hoare triple {28#true} assume 0 == ~cond;assume false; {29#false} is VALID [2022-02-20 17:28:34,077 INFO L290 TraceCheckUtils]: 10: Hoare triple {29#false} assume true; {29#false} is VALID [2022-02-20 17:28:34,078 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {29#false} {29#false} #53#return; {29#false} is VALID [2022-02-20 17:28:34,078 INFO L290 TraceCheckUtils]: 12: Hoare triple {29#false} main_~x~0#1 := 1;main_~y~0#1 := main_~z~0#1;main_~c~0#1 := 1; {29#false} is VALID [2022-02-20 17:28:34,078 INFO L290 TraceCheckUtils]: 13: Hoare triple {29#false} assume !true; {29#false} is VALID [2022-02-20 17:28:34,079 INFO L290 TraceCheckUtils]: 14: Hoare triple {29#false} main_~x~0#1 := main_~x~0#1 * (main_~z~0#1 - 1); {29#false} is VALID [2022-02-20 17:28:34,080 INFO L272 TraceCheckUtils]: 15: Hoare triple {29#false} call __VERIFIER_assert((if 0 == 1 + main_~x~0#1 - main_~y~0#1 then 1 else 0)); {29#false} is VALID [2022-02-20 17:28:34,081 INFO L290 TraceCheckUtils]: 16: Hoare triple {29#false} ~cond := #in~cond; {29#false} is VALID [2022-02-20 17:28:34,081 INFO L290 TraceCheckUtils]: 17: Hoare triple {29#false} assume 0 == ~cond; {29#false} is VALID [2022-02-20 17:28:34,081 INFO L290 TraceCheckUtils]: 18: Hoare triple {29#false} assume !false; {29#false} is VALID [2022-02-20 17:28:34,082 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:28:34,083 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:28:34,083 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270191368] [2022-02-20 17:28:34,084 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270191368] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:28:34,084 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:28:34,084 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 17:28:34,086 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6099281] [2022-02-20 17:28:34,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:28:34,092 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:28:34,094 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:28:34,097 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:28:34,125 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:28:34,125 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 17:28:34,126 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:28:34,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 17:28:34,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 17:28:34,146 INFO L87 Difference]: Start difference. First operand has 25 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 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:28:34,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:28:34,184 INFO L93 Difference]: Finished difference Result 47 states and 62 transitions. [2022-02-20 17:28:34,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 17:28:34,185 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:28:34,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:28:34,186 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:28:34,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 62 transitions. [2022-02-20 17:28:34,193 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:28:34,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 62 transitions. [2022-02-20 17:28:34,196 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 62 transitions. [2022-02-20 17:28:34,253 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:28:34,260 INFO L225 Difference]: With dead ends: 47 [2022-02-20 17:28:34,260 INFO L226 Difference]: Without dead ends: 21 [2022-02-20 17:28:34,263 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:28:34,266 INFO L933 BasicCegarLoop]: 28 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, 28 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:28:34,267 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:28:34,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-02-20 17:28:34,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2022-02-20 17:28:34,295 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:28:34,295 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand has 21 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 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:28:34,296 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand has 21 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 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:28:34,297 INFO L87 Difference]: Start difference. First operand 21 states. Second operand has 21 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 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:28:34,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:28:34,304 INFO L93 Difference]: Finished difference Result 21 states and 24 transitions. [2022-02-20 17:28:34,304 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2022-02-20 17:28:34,305 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:28:34,305 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:28:34,306 INFO L74 IsIncluded]: Start isIncluded. First operand has 21 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 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 21 states. [2022-02-20 17:28:34,309 INFO L87 Difference]: Start difference. First operand has 21 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 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 21 states. [2022-02-20 17:28:34,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:28:34,313 INFO L93 Difference]: Finished difference Result 21 states and 24 transitions. [2022-02-20 17:28:34,313 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2022-02-20 17:28:34,314 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:28:34,314 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:28:34,315 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:28:34,315 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:28:34,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 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:28:34,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2022-02-20 17:28:34,326 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 19 [2022-02-20 17:28:34,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:28:34,327 INFO L470 AbstractCegarLoop]: Abstraction has 21 states and 24 transitions. [2022-02-20 17:28:34,327 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:28:34,327 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2022-02-20 17:28:34,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-02-20 17:28:34,328 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:28:34,328 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:28:34,329 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 17:28:34,330 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:28:34,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:28:34,331 INFO L85 PathProgramCache]: Analyzing trace with hash -1059321002, now seen corresponding path program 1 times [2022-02-20 17:28:34,331 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:28:34,332 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663938561] [2022-02-20 17:28:34,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:28:34,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:28:34,371 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:28:34,373 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [552912787] [2022-02-20 17:28:34,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:28:34,374 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:28:34,374 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:28:34,383 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:28:34,415 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:28:34,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:28:34,431 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-20 17:28:34,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:28:34,443 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:28:34,574 INFO L290 TraceCheckUtils]: 0: Hoare triple {172#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);~counter~0 := 0; {172#true} is VALID [2022-02-20 17:28:34,575 INFO L290 TraceCheckUtils]: 1: Hoare triple {172#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_#t~post6#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;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~k~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {172#true} is VALID [2022-02-20 17:28:34,575 INFO L272 TraceCheckUtils]: 2: Hoare triple {172#true} call assume_abort_if_not((if main_~z~0#1 >= 1 then 1 else 0)); {172#true} is VALID [2022-02-20 17:28:34,575 INFO L290 TraceCheckUtils]: 3: Hoare triple {172#true} ~cond := #in~cond; {172#true} is VALID [2022-02-20 17:28:34,576 INFO L290 TraceCheckUtils]: 4: Hoare triple {172#true} assume !(0 == ~cond); {172#true} is VALID [2022-02-20 17:28:34,576 INFO L290 TraceCheckUtils]: 5: Hoare triple {172#true} assume true; {172#true} is VALID [2022-02-20 17:28:34,576 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {172#true} {172#true} #51#return; {172#true} is VALID [2022-02-20 17:28:34,576 INFO L272 TraceCheckUtils]: 7: Hoare triple {172#true} call assume_abort_if_not((if main_~k~0#1 >= 1 then 1 else 0)); {172#true} is VALID [2022-02-20 17:28:34,577 INFO L290 TraceCheckUtils]: 8: Hoare triple {172#true} ~cond := #in~cond; {172#true} is VALID [2022-02-20 17:28:34,577 INFO L290 TraceCheckUtils]: 9: Hoare triple {172#true} assume !(0 == ~cond); {172#true} is VALID [2022-02-20 17:28:34,577 INFO L290 TraceCheckUtils]: 10: Hoare triple {172#true} assume true; {172#true} is VALID [2022-02-20 17:28:34,577 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {172#true} {172#true} #53#return; {172#true} is VALID [2022-02-20 17:28:34,578 INFO L290 TraceCheckUtils]: 12: Hoare triple {172#true} main_~x~0#1 := 1;main_~y~0#1 := main_~z~0#1;main_~c~0#1 := 1; {213#(and (= |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) (= |ULTIMATE.start_main_~x~0#1| 1))} is VALID [2022-02-20 17:28:34,579 INFO L290 TraceCheckUtils]: 13: Hoare triple {213#(and (= |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) (= |ULTIMATE.start_main_~x~0#1| 1))} main_#t~post6#1 := ~counter~0;~counter~0 := 1 + main_#t~post6#1; {213#(and (= |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) (= |ULTIMATE.start_main_~x~0#1| 1))} is VALID [2022-02-20 17:28:34,579 INFO L290 TraceCheckUtils]: 14: Hoare triple {213#(and (= |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) (= |ULTIMATE.start_main_~x~0#1| 1))} assume !!(main_#t~post6#1 < 2);havoc main_#t~post6#1; {213#(and (= |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) (= |ULTIMATE.start_main_~x~0#1| 1))} is VALID [2022-02-20 17:28:34,580 INFO L272 TraceCheckUtils]: 15: Hoare triple {213#(and (= |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~z~0#1|) (= |ULTIMATE.start_main_~x~0#1| 1))} call __VERIFIER_assert((if 0 == 1 + (main_~x~0#1 * main_~z~0#1 - main_~x~0#1 - main_~y~0#1) then 1 else 0)); {223#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:28:34,588 INFO L290 TraceCheckUtils]: 16: Hoare triple {223#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {227#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:28:34,589 INFO L290 TraceCheckUtils]: 17: Hoare triple {227#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {173#false} is VALID [2022-02-20 17:28:34,589 INFO L290 TraceCheckUtils]: 18: Hoare triple {173#false} assume !false; {173#false} is VALID [2022-02-20 17:28:34,589 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:28:34,589 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 17:28:34,590 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:28:34,590 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663938561] [2022-02-20 17:28:34,590 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:28:34,590 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [552912787] [2022-02-20 17:28:34,591 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [552912787] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:28:34,591 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:28:34,591 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 17:28:34,592 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071725619] [2022-02-20 17:28:34,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:28:34,593 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:28:34,593 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:28:34,593 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:28:34,609 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:28:34,609 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 17:28:34,610 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:28:34,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 17:28:34,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 17:28:34,612 INFO L87 Difference]: Start difference. First operand 21 states and 24 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:28:34,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:28:34,740 INFO L93 Difference]: Finished difference Result 32 states and 37 transitions. [2022-02-20 17:28:34,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 17:28:34,741 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:28:34,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:28:34,741 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:28:34,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 37 transitions. [2022-02-20 17:28:34,744 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:28:34,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 37 transitions. [2022-02-20 17:28:34,745 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 37 transitions. [2022-02-20 17:28:34,778 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:28:34,780 INFO L225 Difference]: With dead ends: 32 [2022-02-20 17:28:34,780 INFO L226 Difference]: Without dead ends: 30 [2022-02-20 17:28:34,780 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-02-20 17:28:34,782 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 7 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:28:34,782 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 76 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:28:34,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-02-20 17:28:34,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2022-02-20 17:28:34,787 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:28:34,788 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand has 28 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 21 states have internal predecessors, (23), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 17:28:34,788 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand has 28 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 21 states have internal predecessors, (23), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 17:28:34,788 INFO L87 Difference]: Start difference. First operand 30 states. Second operand has 28 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 21 states have internal predecessors, (23), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 17:28:34,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:28:34,791 INFO L93 Difference]: Finished difference Result 30 states and 35 transitions. [2022-02-20 17:28:34,791 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2022-02-20 17:28:34,792 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:28:34,792 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:28:34,792 INFO L74 IsIncluded]: Start isIncluded. First operand has 28 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 21 states have internal predecessors, (23), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Second operand 30 states. [2022-02-20 17:28:34,793 INFO L87 Difference]: Start difference. First operand has 28 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 21 states have internal predecessors, (23), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Second operand 30 states. [2022-02-20 17:28:34,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:28:34,795 INFO L93 Difference]: Finished difference Result 30 states and 35 transitions. [2022-02-20 17:28:34,795 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2022-02-20 17:28:34,795 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:28:34,796 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:28:34,796 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:28:34,796 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:28:34,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 21 states have internal predecessors, (23), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 17:28:34,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2022-02-20 17:28:34,798 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 19 [2022-02-20 17:28:34,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:28:34,799 INFO L470 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2022-02-20 17:28:34,799 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:28:34,799 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2022-02-20 17:28:34,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-02-20 17:28:34,800 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:28:34,800 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:28:34,830 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-02-20 17:28:35,027 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:28:35,028 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:28:35,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:28:35,028 INFO L85 PathProgramCache]: Analyzing trace with hash 1437250441, now seen corresponding path program 1 times [2022-02-20 17:28:35,029 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:28:35,029 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668999756] [2022-02-20 17:28:35,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:28:35,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:28:35,043 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:28:35,044 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1457298581] [2022-02-20 17:28:35,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:28:35,044 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:28:35,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:28:35,046 INFO L229 MonitoredProcess]: Starting monitored process 3 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:28:35,047 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-02-20 17:28:35,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:28:35,092 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-20 17:28:35,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:28:35,109 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:28:35,197 INFO L290 TraceCheckUtils]: 0: Hoare triple {375#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);~counter~0 := 0; {380#(<= ~counter~0 0)} is VALID [2022-02-20 17:28:35,197 INFO L290 TraceCheckUtils]: 1: Hoare triple {380#(<= ~counter~0 0)} 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_#t~post6#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;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~k~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {380#(<= ~counter~0 0)} is VALID [2022-02-20 17:28:35,198 INFO L272 TraceCheckUtils]: 2: Hoare triple {380#(<= ~counter~0 0)} call assume_abort_if_not((if main_~z~0#1 >= 1 then 1 else 0)); {380#(<= ~counter~0 0)} is VALID [2022-02-20 17:28:35,199 INFO L290 TraceCheckUtils]: 3: Hoare triple {380#(<= ~counter~0 0)} ~cond := #in~cond; {380#(<= ~counter~0 0)} is VALID [2022-02-20 17:28:35,199 INFO L290 TraceCheckUtils]: 4: Hoare triple {380#(<= ~counter~0 0)} assume !(0 == ~cond); {380#(<= ~counter~0 0)} is VALID [2022-02-20 17:28:35,199 INFO L290 TraceCheckUtils]: 5: Hoare triple {380#(<= ~counter~0 0)} assume true; {380#(<= ~counter~0 0)} is VALID [2022-02-20 17:28:35,200 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {380#(<= ~counter~0 0)} {380#(<= ~counter~0 0)} #51#return; {380#(<= ~counter~0 0)} is VALID [2022-02-20 17:28:35,201 INFO L272 TraceCheckUtils]: 7: Hoare triple {380#(<= ~counter~0 0)} call assume_abort_if_not((if main_~k~0#1 >= 1 then 1 else 0)); {380#(<= ~counter~0 0)} is VALID [2022-02-20 17:28:35,201 INFO L290 TraceCheckUtils]: 8: Hoare triple {380#(<= ~counter~0 0)} ~cond := #in~cond; {380#(<= ~counter~0 0)} is VALID [2022-02-20 17:28:35,202 INFO L290 TraceCheckUtils]: 9: Hoare triple {380#(<= ~counter~0 0)} assume !(0 == ~cond); {380#(<= ~counter~0 0)} is VALID [2022-02-20 17:28:35,202 INFO L290 TraceCheckUtils]: 10: Hoare triple {380#(<= ~counter~0 0)} assume true; {380#(<= ~counter~0 0)} is VALID [2022-02-20 17:28:35,203 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {380#(<= ~counter~0 0)} {380#(<= ~counter~0 0)} #53#return; {380#(<= ~counter~0 0)} is VALID [2022-02-20 17:28:35,203 INFO L290 TraceCheckUtils]: 12: Hoare triple {380#(<= ~counter~0 0)} main_~x~0#1 := 1;main_~y~0#1 := main_~z~0#1;main_~c~0#1 := 1; {380#(<= ~counter~0 0)} is VALID [2022-02-20 17:28:35,204 INFO L290 TraceCheckUtils]: 13: Hoare triple {380#(<= ~counter~0 0)} main_#t~post6#1 := ~counter~0;~counter~0 := 1 + main_#t~post6#1; {420#(<= |ULTIMATE.start_main_#t~post6#1| 0)} is VALID [2022-02-20 17:28:35,204 INFO L290 TraceCheckUtils]: 14: Hoare triple {420#(<= |ULTIMATE.start_main_#t~post6#1| 0)} assume !(main_#t~post6#1 < 2);havoc main_#t~post6#1; {376#false} is VALID [2022-02-20 17:28:35,205 INFO L290 TraceCheckUtils]: 15: Hoare triple {376#false} main_~x~0#1 := main_~x~0#1 * (main_~z~0#1 - 1); {376#false} is VALID [2022-02-20 17:28:35,205 INFO L272 TraceCheckUtils]: 16: Hoare triple {376#false} call __VERIFIER_assert((if 0 == 1 + main_~x~0#1 - main_~y~0#1 then 1 else 0)); {376#false} is VALID [2022-02-20 17:28:35,205 INFO L290 TraceCheckUtils]: 17: Hoare triple {376#false} ~cond := #in~cond; {376#false} is VALID [2022-02-20 17:28:35,205 INFO L290 TraceCheckUtils]: 18: Hoare triple {376#false} assume 0 == ~cond; {376#false} is VALID [2022-02-20 17:28:35,206 INFO L290 TraceCheckUtils]: 19: Hoare triple {376#false} assume !false; {376#false} is VALID [2022-02-20 17:28:35,206 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:28:35,206 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 17:28:35,206 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:28:35,207 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668999756] [2022-02-20 17:28:35,207 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:28:35,207 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1457298581] [2022-02-20 17:28:35,207 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1457298581] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:28:35,207 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:28:35,207 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 17:28:35,208 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13451701] [2022-02-20 17:28:35,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:28:35,208 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 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 20 [2022-02-20 17:28:35,209 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:28:35,209 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 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:28:35,223 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:28:35,224 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 17:28:35,224 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:28:35,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 17:28:35,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 17:28:35,225 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 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:28:35,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:28:35,270 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2022-02-20 17:28:35,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 17:28:35,275 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 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 20 [2022-02-20 17:28:35,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:28:35,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 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:28:35,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 34 transitions. [2022-02-20 17:28:35,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 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:28:35,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 34 transitions. [2022-02-20 17:28:35,284 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 34 transitions. [2022-02-20 17:28:35,311 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:28:35,314 INFO L225 Difference]: With dead ends: 36 [2022-02-20 17:28:35,314 INFO L226 Difference]: Without dead ends: 28 [2022-02-20 17:28:35,314 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 17:28:35,317 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 0 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:28:35,318 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 54 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:28:35,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-02-20 17:28:35,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2022-02-20 17:28:35,327 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:28:35,327 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand has 28 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 21 states have internal predecessors, (22), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 17:28:35,327 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand has 28 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 21 states have internal predecessors, (22), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 17:28:35,328 INFO L87 Difference]: Start difference. First operand 28 states. Second operand has 28 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 21 states have internal predecessors, (22), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 17:28:35,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:28:35,331 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2022-02-20 17:28:35,331 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2022-02-20 17:28:35,331 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:28:35,331 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:28:35,332 INFO L74 IsIncluded]: Start isIncluded. First operand has 28 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 21 states have internal predecessors, (22), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Second operand 28 states. [2022-02-20 17:28:35,332 INFO L87 Difference]: Start difference. First operand has 28 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 21 states have internal predecessors, (22), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Second operand 28 states. [2022-02-20 17:28:35,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:28:35,334 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2022-02-20 17:28:35,334 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2022-02-20 17:28:35,335 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:28:35,335 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:28:35,335 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:28:35,335 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:28:35,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 21 states have internal predecessors, (22), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 17:28:35,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2022-02-20 17:28:35,337 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 20 [2022-02-20 17:28:35,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:28:35,337 INFO L470 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2022-02-20 17:28:35,337 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 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:28:35,338 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2022-02-20 17:28:35,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-02-20 17:28:35,338 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:28:35,339 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:28:35,359 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-02-20 17:28:35,551 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-02-20 17:28:35,552 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:28:35,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:28:35,552 INFO L85 PathProgramCache]: Analyzing trace with hash -833627624, now seen corresponding path program 1 times [2022-02-20 17:28:35,553 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:28:35,553 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813294024] [2022-02-20 17:28:35,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:28:35,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:28:35,574 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:28:35,574 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [676823709] [2022-02-20 17:28:35,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:28:35,574 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:28:35,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:28:35,580 INFO L229 MonitoredProcess]: Starting monitored process 4 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:28:35,582 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-02-20 17:28:35,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:28:35,621 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 10 conjunts are in the unsatisfiable core [2022-02-20 17:28:35,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:28:35,631 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:28:39,492 INFO L290 TraceCheckUtils]: 0: Hoare triple {580#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);~counter~0 := 0; {580#true} is VALID [2022-02-20 17:28:39,492 INFO L290 TraceCheckUtils]: 1: Hoare triple {580#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_#t~post6#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;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~k~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {580#true} is VALID [2022-02-20 17:28:39,492 INFO L272 TraceCheckUtils]: 2: Hoare triple {580#true} call assume_abort_if_not((if main_~z~0#1 >= 1 then 1 else 0)); {580#true} is VALID [2022-02-20 17:28:39,493 INFO L290 TraceCheckUtils]: 3: Hoare triple {580#true} ~cond := #in~cond; {580#true} is VALID [2022-02-20 17:28:39,493 INFO L290 TraceCheckUtils]: 4: Hoare triple {580#true} assume !(0 == ~cond); {580#true} is VALID [2022-02-20 17:28:39,493 INFO L290 TraceCheckUtils]: 5: Hoare triple {580#true} assume true; {580#true} is VALID [2022-02-20 17:28:39,493 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {580#true} {580#true} #51#return; {580#true} is VALID [2022-02-20 17:28:39,494 INFO L272 TraceCheckUtils]: 7: Hoare triple {580#true} call assume_abort_if_not((if main_~k~0#1 >= 1 then 1 else 0)); {580#true} is VALID [2022-02-20 17:28:39,494 INFO L290 TraceCheckUtils]: 8: Hoare triple {580#true} ~cond := #in~cond; {580#true} is VALID [2022-02-20 17:28:39,494 INFO L290 TraceCheckUtils]: 9: Hoare triple {580#true} assume !(0 == ~cond); {580#true} is VALID [2022-02-20 17:28:39,494 INFO L290 TraceCheckUtils]: 10: Hoare triple {580#true} assume true; {580#true} is VALID [2022-02-20 17:28:39,494 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {580#true} {580#true} #53#return; {580#true} is VALID [2022-02-20 17:28:39,495 INFO L290 TraceCheckUtils]: 12: Hoare triple {580#true} main_~x~0#1 := 1;main_~y~0#1 := main_~z~0#1;main_~c~0#1 := 1; {580#true} is VALID [2022-02-20 17:28:39,495 INFO L290 TraceCheckUtils]: 13: Hoare triple {580#true} main_#t~post6#1 := ~counter~0;~counter~0 := 1 + main_#t~post6#1; {580#true} is VALID [2022-02-20 17:28:39,495 INFO L290 TraceCheckUtils]: 14: Hoare triple {580#true} assume !!(main_#t~post6#1 < 2);havoc main_#t~post6#1; {580#true} is VALID [2022-02-20 17:28:39,495 INFO L272 TraceCheckUtils]: 15: Hoare triple {580#true} call __VERIFIER_assert((if 0 == 1 + (main_~x~0#1 * main_~z~0#1 - main_~x~0#1 - main_~y~0#1) then 1 else 0)); {580#true} is VALID [2022-02-20 17:28:39,496 INFO L290 TraceCheckUtils]: 16: Hoare triple {580#true} ~cond := #in~cond; {633#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:28:39,496 INFO L290 TraceCheckUtils]: 17: Hoare triple {633#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {637#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 17:28:39,497 INFO L290 TraceCheckUtils]: 18: Hoare triple {637#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {637#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 17:28:39,498 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {637#(not (= |__VERIFIER_assert_#in~cond| 0))} {580#true} #55#return; {644#(= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) (+ (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~z~0#1|) 1))} is VALID [2022-02-20 17:28:39,498 INFO L290 TraceCheckUtils]: 20: Hoare triple {644#(= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) (+ (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~z~0#1|) 1))} assume !(main_~c~0#1 < main_~k~0#1); {644#(= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) (+ (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~z~0#1|) 1))} is VALID [2022-02-20 17:28:39,500 INFO L290 TraceCheckUtils]: 21: Hoare triple {644#(= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) (+ (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~z~0#1|) 1))} main_~x~0#1 := main_~x~0#1 * (main_~z~0#1 - 1); {651#(exists ((|v_ULTIMATE.start_main_~x~0#1_12| Int) (|ULTIMATE.start_main_~z~0#1| Int)) (and (= |ULTIMATE.start_main_~x~0#1| (* |v_ULTIMATE.start_main_~x~0#1_12| (+ (- 1) |ULTIMATE.start_main_~z~0#1|))) (= (+ |v_ULTIMATE.start_main_~x~0#1_12| |ULTIMATE.start_main_~y~0#1|) (+ (* |v_ULTIMATE.start_main_~x~0#1_12| |ULTIMATE.start_main_~z~0#1|) 1))))} is VALID [2022-02-20 17:28:39,501 INFO L272 TraceCheckUtils]: 22: Hoare triple {651#(exists ((|v_ULTIMATE.start_main_~x~0#1_12| Int) (|ULTIMATE.start_main_~z~0#1| Int)) (and (= |ULTIMATE.start_main_~x~0#1| (* |v_ULTIMATE.start_main_~x~0#1_12| (+ (- 1) |ULTIMATE.start_main_~z~0#1|))) (= (+ |v_ULTIMATE.start_main_~x~0#1_12| |ULTIMATE.start_main_~y~0#1|) (+ (* |v_ULTIMATE.start_main_~x~0#1_12| |ULTIMATE.start_main_~z~0#1|) 1))))} call __VERIFIER_assert((if 0 == 1 + main_~x~0#1 - main_~y~0#1 then 1 else 0)); {655#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:28:39,501 INFO L290 TraceCheckUtils]: 23: Hoare triple {655#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {659#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:28:39,502 INFO L290 TraceCheckUtils]: 24: Hoare triple {659#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {581#false} is VALID [2022-02-20 17:28:39,502 INFO L290 TraceCheckUtils]: 25: Hoare triple {581#false} assume !false; {581#false} is VALID [2022-02-20 17:28:39,502 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-20 17:28:39,503 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:28:43,133 INFO L290 TraceCheckUtils]: 25: Hoare triple {581#false} assume !false; {581#false} is VALID [2022-02-20 17:28:43,134 INFO L290 TraceCheckUtils]: 24: Hoare triple {659#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {581#false} is VALID [2022-02-20 17:28:43,135 INFO L290 TraceCheckUtils]: 23: Hoare triple {655#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {659#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:28:43,136 INFO L272 TraceCheckUtils]: 22: Hoare triple {675#(= |ULTIMATE.start_main_~y~0#1| (+ |ULTIMATE.start_main_~x~0#1| 1))} call __VERIFIER_assert((if 0 == 1 + main_~x~0#1 - main_~y~0#1 then 1 else 0)); {655#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:28:43,137 INFO L290 TraceCheckUtils]: 21: Hoare triple {644#(= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) (+ (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~z~0#1|) 1))} main_~x~0#1 := main_~x~0#1 * (main_~z~0#1 - 1); {675#(= |ULTIMATE.start_main_~y~0#1| (+ |ULTIMATE.start_main_~x~0#1| 1))} is VALID [2022-02-20 17:28:43,137 INFO L290 TraceCheckUtils]: 20: Hoare triple {644#(= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) (+ (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~z~0#1|) 1))} assume !(main_~c~0#1 < main_~k~0#1); {644#(= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) (+ (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~z~0#1|) 1))} is VALID [2022-02-20 17:28:43,138 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {637#(not (= |__VERIFIER_assert_#in~cond| 0))} {580#true} #55#return; {644#(= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) (+ (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~z~0#1|) 1))} is VALID [2022-02-20 17:28:43,139 INFO L290 TraceCheckUtils]: 18: Hoare triple {637#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {637#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 17:28:43,139 INFO L290 TraceCheckUtils]: 17: Hoare triple {694#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {637#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 17:28:43,140 INFO L290 TraceCheckUtils]: 16: Hoare triple {580#true} ~cond := #in~cond; {694#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-02-20 17:28:43,140 INFO L272 TraceCheckUtils]: 15: Hoare triple {580#true} call __VERIFIER_assert((if 0 == 1 + (main_~x~0#1 * main_~z~0#1 - main_~x~0#1 - main_~y~0#1) then 1 else 0)); {580#true} is VALID [2022-02-20 17:28:43,140 INFO L290 TraceCheckUtils]: 14: Hoare triple {580#true} assume !!(main_#t~post6#1 < 2);havoc main_#t~post6#1; {580#true} is VALID [2022-02-20 17:28:43,140 INFO L290 TraceCheckUtils]: 13: Hoare triple {580#true} main_#t~post6#1 := ~counter~0;~counter~0 := 1 + main_#t~post6#1; {580#true} is VALID [2022-02-20 17:28:43,141 INFO L290 TraceCheckUtils]: 12: Hoare triple {580#true} main_~x~0#1 := 1;main_~y~0#1 := main_~z~0#1;main_~c~0#1 := 1; {580#true} is VALID [2022-02-20 17:28:43,141 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {580#true} {580#true} #53#return; {580#true} is VALID [2022-02-20 17:28:43,141 INFO L290 TraceCheckUtils]: 10: Hoare triple {580#true} assume true; {580#true} is VALID [2022-02-20 17:28:43,141 INFO L290 TraceCheckUtils]: 9: Hoare triple {580#true} assume !(0 == ~cond); {580#true} is VALID [2022-02-20 17:28:43,142 INFO L290 TraceCheckUtils]: 8: Hoare triple {580#true} ~cond := #in~cond; {580#true} is VALID [2022-02-20 17:28:43,142 INFO L272 TraceCheckUtils]: 7: Hoare triple {580#true} call assume_abort_if_not((if main_~k~0#1 >= 1 then 1 else 0)); {580#true} is VALID [2022-02-20 17:28:43,142 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {580#true} {580#true} #51#return; {580#true} is VALID [2022-02-20 17:28:43,142 INFO L290 TraceCheckUtils]: 5: Hoare triple {580#true} assume true; {580#true} is VALID [2022-02-20 17:28:43,142 INFO L290 TraceCheckUtils]: 4: Hoare triple {580#true} assume !(0 == ~cond); {580#true} is VALID [2022-02-20 17:28:43,143 INFO L290 TraceCheckUtils]: 3: Hoare triple {580#true} ~cond := #in~cond; {580#true} is VALID [2022-02-20 17:28:43,143 INFO L272 TraceCheckUtils]: 2: Hoare triple {580#true} call assume_abort_if_not((if main_~z~0#1 >= 1 then 1 else 0)); {580#true} is VALID [2022-02-20 17:28:43,143 INFO L290 TraceCheckUtils]: 1: Hoare triple {580#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_#t~post6#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;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~k~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {580#true} is VALID [2022-02-20 17:28:43,143 INFO L290 TraceCheckUtils]: 0: Hoare triple {580#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);~counter~0 := 0; {580#true} is VALID [2022-02-20 17:28:43,144 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-20 17:28:43,144 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:28:43,144 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813294024] [2022-02-20 17:28:43,144 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:28:43,144 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [676823709] [2022-02-20 17:28:43,145 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [676823709] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 17:28:43,145 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 17:28:43,145 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2022-02-20 17:28:43,145 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906046758] [2022-02-20 17:28:43,145 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 17:28:43,146 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 2.375) internal successors, (19), 9 states have internal predecessors, (19), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 26 [2022-02-20 17:28:43,146 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:28:43,147 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 10 states, 8 states have (on average 2.375) internal successors, (19), 9 states have internal predecessors, (19), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 17:28:43,168 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:28:43,168 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-20 17:28:43,168 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:28:43,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-20 17:28:43,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-02-20 17:28:43,170 INFO L87 Difference]: Start difference. First operand 28 states and 31 transitions. Second operand has 10 states, 8 states have (on average 2.375) internal successors, (19), 9 states have internal predecessors, (19), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 17:28:43,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:28:43,361 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2022-02-20 17:28:43,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 17:28:43,362 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 2.375) internal successors, (19), 9 states have internal predecessors, (19), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 26 [2022-02-20 17:28:43,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:28:43,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 8 states have (on average 2.375) internal successors, (19), 9 states have internal predecessors, (19), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 17:28:43,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 24 transitions. [2022-02-20 17:28:43,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 8 states have (on average 2.375) internal successors, (19), 9 states have internal predecessors, (19), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 17:28:43,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 24 transitions. [2022-02-20 17:28:43,364 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 24 transitions. [2022-02-20 17:28:43,406 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:28:43,406 INFO L225 Difference]: With dead ends: 28 [2022-02-20 17:28:43,406 INFO L226 Difference]: Without dead ends: 0 [2022-02-20 17:28:43,407 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 40 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2022-02-20 17:28:43,408 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 11 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 6 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 17:28:43,408 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 101 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 23 Invalid, 0 Unknown, 6 Unchecked, 0.1s Time] [2022-02-20 17:28:43,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-02-20 17:28:43,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-02-20 17:28:43,409 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:28:43,409 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:28:43,409 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:28:43,409 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:28:43,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:28:43,409 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-20 17:28:43,409 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 17:28:43,409 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:28:43,409 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:28:43,409 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:28:43,410 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:28:43,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:28:43,410 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-20 17:28:43,410 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 17:28:43,410 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:28:43,410 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:28:43,410 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:28:43,410 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:28:43,410 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:28:43,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-02-20 17:28:43,411 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 26 [2022-02-20 17:28:43,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:28:43,411 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-20 17:28:43,411 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 2.375) internal successors, (19), 9 states have internal predecessors, (19), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 17:28:43,411 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 17:28:43,411 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:28:43,414 INFO L764 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-20 17:28:43,440 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-02-20 17:28:43,614 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:28:43,616 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-02-20 17:28:43,642 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-02-20 17:28:43,642 INFO L854 garLoopResultBuilder]: At program point L35-3(lines 35 45) the Hoare annotation is: (= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) (+ (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~z~0#1|) 1)) [2022-02-20 17:28:43,642 INFO L858 garLoopResultBuilder]: For program point L35-4(lines 35 45) no Hoare annotation was computed. [2022-02-20 17:28:43,642 INFO L858 garLoopResultBuilder]: For program point L29(line 29) no Hoare annotation was computed. [2022-02-20 17:28:43,643 INFO L861 garLoopResultBuilder]: At program point L50(lines 23 51) the Hoare annotation is: true [2022-02-20 17:28:43,643 INFO L854 garLoopResultBuilder]: At program point L36(line 36) the Hoare annotation is: (= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|) (+ (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~z~0#1|) 1)) [2022-02-20 17:28:43,643 INFO L858 garLoopResultBuilder]: For program point L36-1(lines 35 45) no Hoare annotation was computed. [2022-02-20 17:28:43,643 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-02-20 17:28:43,643 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-02-20 17:28:43,643 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-02-20 17:28:43,643 INFO L854 garLoopResultBuilder]: At program point L28(line 28) the Hoare annotation is: (<= ~counter~0 0) [2022-02-20 17:28:43,644 INFO L854 garLoopResultBuilder]: At program point L28-1(line 28) the Hoare annotation is: (<= ~counter~0 0) [2022-02-20 17:28:43,644 INFO L854 garLoopResultBuilder]: At program point L49(line 49) the Hoare annotation is: (= |ULTIMATE.start_main_~y~0#1| (+ |ULTIMATE.start_main_~x~0#1| 1)) [2022-02-20 17:28:43,644 INFO L858 garLoopResultBuilder]: For program point L49-1(line 49) no Hoare annotation was computed. [2022-02-20 17:28:43,644 INFO L858 garLoopResultBuilder]: For program point L35-1(lines 35 45) no Hoare annotation was computed. [2022-02-20 17:28:43,644 INFO L861 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 12 14) the Hoare annotation is: true [2022-02-20 17:28:43,644 INFO L858 garLoopResultBuilder]: For program point L13(line 13) no Hoare annotation was computed. [2022-02-20 17:28:43,645 INFO L858 garLoopResultBuilder]: For program point L13-2(lines 12 14) no Hoare annotation was computed. [2022-02-20 17:28:43,645 INFO L858 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 12 14) no Hoare annotation was computed. [2022-02-20 17:28:43,645 INFO L858 garLoopResultBuilder]: For program point L17(lines 17 18) no Hoare annotation was computed. [2022-02-20 17:28:43,645 INFO L858 garLoopResultBuilder]: For program point L16(lines 16 19) no Hoare annotation was computed. [2022-02-20 17:28:43,645 INFO L861 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 15 21) the Hoare annotation is: true [2022-02-20 17:28:43,645 INFO L858 garLoopResultBuilder]: For program point L16-2(lines 15 21) no Hoare annotation was computed. [2022-02-20 17:28:43,646 INFO L858 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 15 21) no Hoare annotation was computed. [2022-02-20 17:28:43,646 INFO L858 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 18) no Hoare annotation was computed. [2022-02-20 17:28:43,649 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2022-02-20 17:28:43,650 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 17:28:43,653 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-02-20 17:28:43,653 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2022-02-20 17:28:43,653 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-02-20 17:28:43,653 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-02-20 17:28:43,653 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2022-02-20 17:28:43,653 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2022-02-20 17:28:43,653 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-02-20 17:28:43,654 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-02-20 17:28:43,654 WARN L170 areAnnotationChecker]: L13-2 has no Hoare annotation [2022-02-20 17:28:43,654 WARN L170 areAnnotationChecker]: L17 has no Hoare annotation [2022-02-20 17:28:43,654 WARN L170 areAnnotationChecker]: L17 has no Hoare annotation [2022-02-20 17:28:43,654 WARN L170 areAnnotationChecker]: L16-2 has no Hoare annotation [2022-02-20 17:28:43,654 WARN L170 areAnnotationChecker]: L29 has no Hoare annotation [2022-02-20 17:28:43,654 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-02-20 17:28:43,654 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-02-20 17:28:43,655 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-02-20 17:28:43,655 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-02-20 17:28:43,655 WARN L170 areAnnotationChecker]: L29 has no Hoare annotation [2022-02-20 17:28:43,655 WARN L170 areAnnotationChecker]: L36-1 has no Hoare annotation [2022-02-20 17:28:43,655 WARN L170 areAnnotationChecker]: L36-1 has no Hoare annotation [2022-02-20 17:28:43,655 WARN L170 areAnnotationChecker]: L49-1 has no Hoare annotation [2022-02-20 17:28:43,655 WARN L170 areAnnotationChecker]: L35-4 has no Hoare annotation [2022-02-20 17:28:43,655 WARN L170 areAnnotationChecker]: L35-1 has no Hoare annotation [2022-02-20 17:28:43,656 WARN L170 areAnnotationChecker]: L35-4 has no Hoare annotation [2022-02-20 17:28:43,656 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 17:28:43,656 WARN L170 areAnnotationChecker]: L35-1 has no Hoare annotation [2022-02-20 17:28:43,656 WARN L170 areAnnotationChecker]: L35-1 has no Hoare annotation [2022-02-20 17:28:43,656 WARN L170 areAnnotationChecker]: L49-1 has no Hoare annotation [2022-02-20 17:28:43,656 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 17:28:43,656 WARN L170 areAnnotationChecker]: L36-1 has no Hoare annotation [2022-02-20 17:28:43,656 INFO L163 areAnnotationChecker]: CFG has 4 edges. 4 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-02-20 17:28:43,663 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.02 05:28:43 BoogieIcfgContainer [2022-02-20 17:28:43,664 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-20 17:28:43,664 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-20 17:28:43,664 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-20 17:28:43,664 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-20 17:28:43,665 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:28:33" (3/4) ... [2022-02-20 17:28:43,667 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-02-20 17:28:43,672 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2022-02-20 17:28:43,672 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2022-02-20 17:28:43,675 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2022-02-20 17:28:43,675 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2022-02-20 17:28:43,675 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-02-20 17:28:43,675 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-02-20 17:28:43,701 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-02-20 17:28:43,701 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-20 17:28:43,703 INFO L158 Benchmark]: Toolchain (without parser) took 10623.54ms. Allocated memory was 88.1MB in the beginning and 132.1MB in the end (delta: 44.0MB). Free memory was 53.9MB in the beginning and 65.2MB in the end (delta: -11.3MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2022-02-20 17:28:43,703 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 88.1MB. Free memory was 58.1MB in the beginning and 58.1MB in the end (delta: 24.2kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 17:28:43,703 INFO L158 Benchmark]: CACSL2BoogieTranslator took 283.69ms. Allocated memory was 88.1MB in the beginning and 109.1MB in the end (delta: 21.0MB). Free memory was 53.6MB in the beginning and 84.7MB in the end (delta: -31.1MB). Peak memory consumption was 7.6MB. Max. memory is 16.1GB. [2022-02-20 17:28:43,704 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.98ms. Allocated memory is still 109.1MB. Free memory was 84.4MB in the beginning and 82.9MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 17:28:43,704 INFO L158 Benchmark]: Boogie Preprocessor took 25.17ms. Allocated memory is still 109.1MB. Free memory was 82.9MB in the beginning and 81.9MB in the end (delta: 1.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 17:28:43,704 INFO L158 Benchmark]: RCFGBuilder took 323.05ms. Allocated memory is still 109.1MB. Free memory was 81.9MB in the beginning and 71.1MB in the end (delta: 10.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-02-20 17:28:43,705 INFO L158 Benchmark]: TraceAbstraction took 9913.39ms. Allocated memory was 109.1MB in the beginning and 132.1MB in the end (delta: 23.1MB). Free memory was 70.8MB in the beginning and 67.3MB in the end (delta: 3.4MB). Peak memory consumption was 28.0MB. Max. memory is 16.1GB. [2022-02-20 17:28:43,705 INFO L158 Benchmark]: Witness Printer took 37.53ms. Allocated memory is still 132.1MB. Free memory was 67.3MB in the beginning and 65.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 17:28:43,706 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.21ms. Allocated memory is still 88.1MB. Free memory was 58.1MB in the beginning and 58.1MB in the end (delta: 24.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 283.69ms. Allocated memory was 88.1MB in the beginning and 109.1MB in the end (delta: 21.0MB). Free memory was 53.6MB in the beginning and 84.7MB in the end (delta: -31.1MB). Peak memory consumption was 7.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 33.98ms. Allocated memory is still 109.1MB. Free memory was 84.4MB in the beginning and 82.9MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 25.17ms. Allocated memory is still 109.1MB. Free memory was 82.9MB in the beginning and 81.9MB in the end (delta: 1.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 323.05ms. Allocated memory is still 109.1MB. Free memory was 81.9MB in the beginning and 71.1MB in the end (delta: 10.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 9913.39ms. Allocated memory was 109.1MB in the beginning and 132.1MB in the end (delta: 23.1MB). Free memory was 70.8MB in the beginning and 67.3MB in the end (delta: 3.4MB). Peak memory consumption was 28.0MB. Max. memory is 16.1GB. * Witness Printer took 37.53ms. Allocated memory is still 132.1MB. Free memory was 67.3MB in the beginning and 65.2MB in the end (delta: 2.1MB). 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: 18]: 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, 25 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 9.8s, OverallIterations: 4, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 19 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 18 mSDsluCounter, 259 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 6 IncrementalHoareTripleChecker+Unchecked, 172 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 53 IncrementalHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 87 mSDtfsCounter, 53 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 98 GetRequests, 80 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=28occurred in iteration=2, InterpolantAutomatonStates: 17, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 2 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 8 LocationsWithAnnotation, 15 PreInvPairs, 22 NumberOfFragments, 32 HoareAnnotationTreeSize, 15 FomulaSimplifications, 37 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 8 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 7.9s InterpolantComputationTime, 84 NumberOfCodeBlocks, 84 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 105 ConstructedInterpolants, 1 QuantifiedInterpolants, 237 SizeOfPredicates, 4 NumberOfNonLiveVariables, 221 ConjunctsInSsa, 20 ConjunctsInUnsatCore, 5 InterpolantComputations, 3 PerfectInterpolantSequences, 22/24 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: x + y == x * z + 1 RESULT: Ultimate proved your program to be correct! [2022-02-20 17:28:43,724 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