./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/loop-invgen/fragtest_simple.i --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for termination 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/AutomizerTermination.xml -i ../sv-benchmarks/c/loop-invgen/fragtest_simple.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-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(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash be3b53cc5f9badbf5402cafcfa5766831674eb009261bc7c1bcbe9580aece38e --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-21 03:59:33,855 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-21 03:59:33,857 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-21 03:59:33,883 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-21 03:59:33,891 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-21 03:59:33,894 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-21 03:59:33,896 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-21 03:59:33,901 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-21 03:59:33,903 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-21 03:59:33,908 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-21 03:59:33,909 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-21 03:59:33,910 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-21 03:59:33,910 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-21 03:59:33,912 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-21 03:59:33,913 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-21 03:59:33,915 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-21 03:59:33,916 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-21 03:59:33,917 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-21 03:59:33,923 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-21 03:59:33,926 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-21 03:59:33,928 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-21 03:59:33,929 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-21 03:59:33,930 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-21 03:59:33,930 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-21 03:59:33,934 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-21 03:59:33,934 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-21 03:59:33,934 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-21 03:59:33,935 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-21 03:59:33,936 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-21 03:59:33,936 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-21 03:59:33,936 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-21 03:59:33,937 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-21 03:59:33,938 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-21 03:59:33,939 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-21 03:59:33,940 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-21 03:59:33,940 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-21 03:59:33,940 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-21 03:59:33,940 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-21 03:59:33,941 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-21 03:59:33,941 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-21 03:59:33,942 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-21 03:59:33,942 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2022-02-21 03:59:33,968 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-21 03:59:33,968 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-21 03:59:33,968 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-21 03:59:33,969 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-21 03:59:33,970 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-21 03:59:33,970 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-21 03:59:33,970 INFO L138 SettingsManager]: * Use SBE=true [2022-02-21 03:59:33,970 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-02-21 03:59:33,970 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-02-21 03:59:33,970 INFO L138 SettingsManager]: * Use old map elimination=false [2022-02-21 03:59:33,971 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-02-21 03:59:33,971 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-02-21 03:59:33,971 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-02-21 03:59:33,971 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-21 03:59:33,972 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-21 03:59:33,972 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-21 03:59:33,972 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-21 03:59:33,972 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-21 03:59:33,972 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-21 03:59:33,972 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-02-21 03:59:33,972 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-02-21 03:59:33,973 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-02-21 03:59:33,973 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-21 03:59:33,973 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-21 03:59:33,973 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-02-21 03:59:33,973 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-21 03:59:33,973 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-02-21 03:59:33,973 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-21 03:59:33,974 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-21 03:59:33,974 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-21 03:59:33,974 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-21 03:59:33,975 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-02-21 03:59:33,975 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR 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(F end) ) 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 -> be3b53cc5f9badbf5402cafcfa5766831674eb009261bc7c1bcbe9580aece38e [2022-02-21 03:59:34,209 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-21 03:59:34,228 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-21 03:59:34,230 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-21 03:59:34,231 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-21 03:59:34,231 INFO L275 PluginConnector]: CDTParser initialized [2022-02-21 03:59:34,232 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-invgen/fragtest_simple.i [2022-02-21 03:59:34,281 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/02414de3a/feef877c65234cf6bafba0103a5a5877/FLAG21dac716a [2022-02-21 03:59:34,688 INFO L306 CDTParser]: Found 1 translation units. [2022-02-21 03:59:34,689 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/fragtest_simple.i [2022-02-21 03:59:34,697 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/02414de3a/feef877c65234cf6bafba0103a5a5877/FLAG21dac716a [2022-02-21 03:59:34,710 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/02414de3a/feef877c65234cf6bafba0103a5a5877 [2022-02-21 03:59:34,712 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-21 03:59:34,714 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-21 03:59:34,715 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-21 03:59:34,715 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-21 03:59:34,717 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-21 03:59:34,721 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:59:34" (1/1) ... [2022-02-21 03:59:34,722 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27127923 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:59:34, skipping insertion in model container [2022-02-21 03:59:34,722 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:59:34" (1/1) ... [2022-02-21 03:59:34,727 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-21 03:59:34,738 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 03:59:34,854 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/loop-invgen/fragtest_simple.i[893,906] [2022-02-21 03:59:34,876 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:59:34,883 INFO L203 MainTranslator]: Completed pre-run [2022-02-21 03:59:34,894 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/loop-invgen/fragtest_simple.i[893,906] [2022-02-21 03:59:34,904 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:59:34,915 INFO L208 MainTranslator]: Completed translation [2022-02-21 03:59:34,916 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:59:34 WrapperNode [2022-02-21 03:59:34,916 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-21 03:59:34,917 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-21 03:59:34,917 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-21 03:59:34,917 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-21 03:59:34,922 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:59:34" (1/1) ... [2022-02-21 03:59:34,928 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:59:34" (1/1) ... [2022-02-21 03:59:34,946 INFO L137 Inliner]: procedures = 16, calls = 7, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 56 [2022-02-21 03:59:34,947 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-21 03:59:34,947 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-21 03:59:34,948 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-21 03:59:34,948 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-21 03:59:34,953 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:59:34" (1/1) ... [2022-02-21 03:59:34,953 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:59:34" (1/1) ... [2022-02-21 03:59:34,960 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:59:34" (1/1) ... [2022-02-21 03:59:34,961 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:59:34" (1/1) ... [2022-02-21 03:59:34,970 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:59:34" (1/1) ... [2022-02-21 03:59:34,974 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:59:34" (1/1) ... [2022-02-21 03:59:34,978 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:59:34" (1/1) ... [2022-02-21 03:59:34,979 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-21 03:59:34,980 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-21 03:59:34,981 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-21 03:59:34,981 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-21 03:59:34,982 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:59:34" (1/1) ... [2022-02-21 03:59:34,987 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:59:34,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:59:35,004 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:59:35,018 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2022-02-21 03:59:35,035 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-21 03:59:35,036 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-21 03:59:35,036 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-21 03:59:35,036 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-21 03:59:35,078 INFO L234 CfgBuilder]: Building ICFG [2022-02-21 03:59:35,079 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-21 03:59:35,200 INFO L275 CfgBuilder]: Performing block encoding [2022-02-21 03:59:35,204 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-21 03:59:35,210 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-02-21 03:59:35,211 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:59:35 BoogieIcfgContainer [2022-02-21 03:59:35,211 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-21 03:59:35,212 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-02-21 03:59:35,212 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-02-21 03:59:35,214 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-02-21 03:59:35,215 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:59:35,215 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 21.02 03:59:34" (1/3) ... [2022-02-21 03:59:35,216 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@61092d13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 03:59:35, skipping insertion in model container [2022-02-21 03:59:35,216 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:59:35,225 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:59:34" (2/3) ... [2022-02-21 03:59:35,225 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@61092d13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 03:59:35, skipping insertion in model container [2022-02-21 03:59:35,225 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:59:35,225 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:59:35" (3/3) ... [2022-02-21 03:59:35,227 INFO L388 chiAutomizerObserver]: Analyzing ICFG fragtest_simple.i [2022-02-21 03:59:35,273 INFO L359 BuchiCegarLoop]: Interprodecural is true [2022-02-21 03:59:35,274 INFO L360 BuchiCegarLoop]: Hoare is false [2022-02-21 03:59:35,274 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-02-21 03:59:35,274 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-02-21 03:59:35,274 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-02-21 03:59:35,274 INFO L364 BuchiCegarLoop]: Difference is false [2022-02-21 03:59:35,274 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-02-21 03:59:35,275 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2022-02-21 03:59:35,287 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 16 states, 15 states have (on average 1.6) internal successors, (24), 15 states have internal predecessors, (24), 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-21 03:59:35,302 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 7 [2022-02-21 03:59:35,303 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:59:35,303 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:59:35,306 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2022-02-21 03:59:35,306 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1] [2022-02-21 03:59:35,306 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2022-02-21 03:59:35,307 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 16 states, 15 states have (on average 1.6) internal successors, (24), 15 states have internal predecessors, (24), 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-21 03:59:35,310 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 7 [2022-02-21 03:59:35,310 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:59:35,310 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:59:35,311 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2022-02-21 03:59:35,311 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1] [2022-02-21 03:59:35,315 INFO L791 eck$LassoCheckResult]: Stem: 5#ULTIMATE.startENTRYtrue 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(9, 2); 7#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_~i~0#1, main_~pvlen~0#1, main_~tmp___1~0#1, main_~k~0#1, main_~n~0#1, main_~j~0#1;havoc main_~i~0#1;havoc main_~pvlen~0#1;havoc main_~tmp___1~0#1;main_~k~0#1 := 0;havoc main_~n~0#1;main_~i~0#1 := 0;main_~pvlen~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1; 16#L31-2true [2022-02-21 03:59:35,316 INFO L793 eck$LassoCheckResult]: Loop: 16#L31-2true assume !!(0 != main_#t~nondet2#1 && main_~i~0#1 <= 1000000);havoc main_#t~nondet2#1;main_~i~0#1 := 1 + main_~i~0#1; 16#L31-2true [2022-02-21 03:59:35,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:59:35,320 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2022-02-21 03:59:35,326 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:59:35,327 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174808342] [2022-02-21 03:59:35,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:59:35,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:59:35,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:59:35,389 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:59:35,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:59:35,429 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:59:35,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:59:35,432 INFO L85 PathProgramCache]: Analyzing trace with hash 42, now seen corresponding path program 1 times [2022-02-21 03:59:35,432 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:59:35,432 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92792597] [2022-02-21 03:59:35,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:59:35,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:59:35,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:59:35,442 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:59:35,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:59:35,446 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:59:35,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:59:35,447 INFO L85 PathProgramCache]: Analyzing trace with hash 29864, now seen corresponding path program 1 times [2022-02-21 03:59:35,447 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:59:35,448 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962697502] [2022-02-21 03:59:35,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:59:35,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:59:35,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:59:35,467 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:59:35,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:59:35,485 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:59:35,547 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:59:35,548 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:59:35,548 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:59:35,548 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:59:35,548 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-02-21 03:59:35,548 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:59:35,549 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:59:35,549 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:59:35,549 INFO L133 ssoRankerPreferences]: Filename of dumped script: fragtest_simple.i_Iteration1_Loop [2022-02-21 03:59:35,549 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:59:35,549 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:59:35,561 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:59:35,571 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:59:35,619 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:59:35,623 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-02-21 03:59:35,625 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:59:35,625 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:59:35,626 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:59:35,628 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2022-02-21 03:59:35,630 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:59:35,630 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:59:35,666 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2022-02-21 03:59:35,667 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:59:35,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:59:35,668 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:59:35,669 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2022-02-21 03:59:35,671 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-02-21 03:59:35,671 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:59:35,708 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-02-21 03:59:35,714 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2022-02-21 03:59:35,714 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:59:35,714 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:59:35,714 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:59:35,714 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:59:35,715 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:59:35,715 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:59:35,715 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:59:35,715 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:59:35,715 INFO L133 ssoRankerPreferences]: Filename of dumped script: fragtest_simple.i_Iteration1_Loop [2022-02-21 03:59:35,715 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:59:35,716 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:59:35,716 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:59:35,723 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:59:35,766 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:59:35,769 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:59:35,771 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:59:35,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:59:35,776 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:59:35,777 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2022-02-21 03:59:35,778 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:59:35,786 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:59:35,786 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:59:35,787 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:59:35,787 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:59:35,787 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:59:35,789 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:59:35,789 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:59:35,804 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:59:35,809 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-02-21 03:59:35,809 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-02-21 03:59:35,810 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:59:35,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:59:35,812 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:59:35,813 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2022-02-21 03:59:35,814 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:59:35,814 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-02-21 03:59:35,815 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:59:35,815 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = -2*ULTIMATE.start_main_~i~0#1 + 2000001 Supporting invariants [] [2022-02-21 03:59:35,835 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2022-02-21 03:59:35,843 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-02-21 03:59:35,847 INFO L390 LassoCheck]: Loop: "assume !!(0 != main_#t~nondet2#1 && main_~i~0#1 <= 1000000);havoc main_#t~nondet2#1;main_~i~0#1 := 1 + main_~i~0#1;" [2022-02-21 03:59:35,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:59:35,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:59:35,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:59:35,896 INFO L263 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:59:35,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:59:35,903 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:59:35,914 INFO L290 TraceCheckUtils]: 0: Hoare triple {26#unseeded} 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(9, 2); {26#unseeded} is VALID [2022-02-21 03:59:35,914 INFO L290 TraceCheckUtils]: 1: Hoare triple {26#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_~i~0#1, main_~pvlen~0#1, main_~tmp___1~0#1, main_~k~0#1, main_~n~0#1, main_~j~0#1;havoc main_~i~0#1;havoc main_~pvlen~0#1;havoc main_~tmp___1~0#1;main_~k~0#1 := 0;havoc main_~n~0#1;main_~i~0#1 := 0;main_~pvlen~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1; {26#unseeded} is VALID [2022-02-21 03:59:35,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:59:35,922 WARN L261 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 03:59:35,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:59:35,927 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:59:35,928 INFO L290 TraceCheckUtils]: 0: Hoare triple {29#(>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i~0#1|) 2000001))} assume !!(0 != main_#t~nondet2#1 && main_~i~0#1 <= 1000000);havoc main_#t~nondet2#1;main_~i~0#1 := 1 + main_~i~0#1; {39#(or unseeded (and (>= oldRank0 0) (> oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i~0#1|) 2000001))))} is VALID [2022-02-21 03:59:35,929 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:59:35,953 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 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-21 03:59:35,957 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 3 edges. 3 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:59:35,959 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 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) Stem has 2 letters. Loop has 1 letters. [2022-02-21 03:59:35,961 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:35,964 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2022-02-21 03:59:35,966 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 16 states, 15 states have (on average 1.6) internal successors, (24), 15 states have internal predecessors, (24), 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 has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 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-21 03:59:36,021 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 16 states, 15 states have (on average 1.6) internal successors, (24), 15 states have internal predecessors, (24), 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 has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 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) Result 32 states and 50 transitions. Complement of second has 6 states. [2022-02-21 03:59:36,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2022-02-21 03:59:36,021 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:59:36,022 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 16 states, 15 states have (on average 1.6) internal successors, (24), 15 states have internal predecessors, (24), 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-21 03:59:36,023 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 7 [2022-02-21 03:59:36,024 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:59:36,024 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:59:36,024 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 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-21 03:59:36,027 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 2 [2022-02-21 03:59:36,027 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:59:36,027 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:59:36,028 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 50 transitions. [2022-02-21 03:59:36,029 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2022-02-21 03:59:36,029 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:59:36,029 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:59:36,031 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 16 states, 15 states have (on average 1.6) internal successors, (24), 15 states have internal predecessors, (24), 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-21 03:59:36,032 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 7 [2022-02-21 03:59:36,034 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 7 examples of accepted words. [2022-02-21 03:59:36,034 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 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-21 03:59:36,035 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 2 [2022-02-21 03:59:36,035 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 03:59:36,036 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 32 states and 50 transitions. cyclomatic complexity: 23 [2022-02-21 03:59:36,037 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 6 examples of accepted words. [2022-02-21 03:59:36,037 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 16 states, 15 states have (on average 1.6) internal successors, (24), 15 states have internal predecessors, (24), 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) Stem has 2 letters. Loop has 1 letters. [2022-02-21 03:59:36,037 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:36,037 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 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) Stem has 2 letters. Loop has 1 letters. [2022-02-21 03:59:36,038 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:36,038 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 50 transitions. cyclomatic complexity: 23 Stem has 2 letters. Loop has 1 letters. [2022-02-21 03:59:36,038 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:36,038 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 16 states, 15 states have (on average 1.6) internal successors, (24), 15 states have internal predecessors, (24), 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) Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:59:36,038 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:36,038 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 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) Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:59:36,039 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:36,039 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 50 transitions. cyclomatic complexity: 23 Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:59:36,039 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:36,039 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 16 states, 15 states have (on average 1.6) internal successors, (24), 15 states have internal predecessors, (24), 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) Stem has 5 letters. Loop has 1 letters. [2022-02-21 03:59:36,039 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:36,040 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 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) Stem has 5 letters. Loop has 1 letters. [2022-02-21 03:59:36,040 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:36,040 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 50 transitions. cyclomatic complexity: 23 Stem has 5 letters. Loop has 1 letters. [2022-02-21 03:59:36,040 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:36,040 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 16 states, 15 states have (on average 1.6) internal successors, (24), 15 states have internal predecessors, (24), 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) Stem has 32 letters. Loop has 32 letters. [2022-02-21 03:59:36,041 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:36,041 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 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) Stem has 32 letters. Loop has 32 letters. [2022-02-21 03:59:36,041 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:36,041 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 50 transitions. cyclomatic complexity: 23 Stem has 32 letters. Loop has 32 letters. [2022-02-21 03:59:36,041 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:36,041 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 16 states, 15 states have (on average 1.6) internal successors, (24), 15 states have internal predecessors, (24), 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) Stem has 16 letters. Loop has 16 letters. [2022-02-21 03:59:36,042 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:36,042 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 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) Stem has 16 letters. Loop has 16 letters. [2022-02-21 03:59:36,042 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:36,042 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 50 transitions. cyclomatic complexity: 23 Stem has 16 letters. Loop has 16 letters. [2022-02-21 03:59:36,042 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:36,043 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 16 states, 15 states have (on average 1.6) internal successors, (24), 15 states have internal predecessors, (24), 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) Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:59:36,043 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:36,043 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 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) Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:59:36,043 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:36,043 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 50 transitions. cyclomatic complexity: 23 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:59:36,043 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:36,044 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 16 states, 15 states have (on average 1.6) internal successors, (24), 15 states have internal predecessors, (24), 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) Stem has 9 letters. Loop has 5 letters. [2022-02-21 03:59:36,044 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:36,044 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 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) Stem has 9 letters. Loop has 5 letters. [2022-02-21 03:59:36,044 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:36,045 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 50 transitions. cyclomatic complexity: 23 Stem has 9 letters. Loop has 5 letters. [2022-02-21 03:59:36,045 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:36,045 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 16 states, 15 states have (on average 1.6) internal successors, (24), 15 states have internal predecessors, (24), 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) Stem has 10 letters. Loop has 4 letters. [2022-02-21 03:59:36,045 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:36,046 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 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) Stem has 10 letters. Loop has 4 letters. [2022-02-21 03:59:36,046 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:36,046 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 50 transitions. cyclomatic complexity: 23 Stem has 10 letters. Loop has 4 letters. [2022-02-21 03:59:36,046 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:36,047 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 16 states, 15 states have (on average 1.6) internal successors, (24), 15 states have internal predecessors, (24), 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) Stem has 7 letters. Loop has 4 letters. [2022-02-21 03:59:36,047 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:36,047 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 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) Stem has 7 letters. Loop has 4 letters. [2022-02-21 03:59:36,048 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:36,048 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 50 transitions. cyclomatic complexity: 23 Stem has 7 letters. Loop has 4 letters. [2022-02-21 03:59:36,048 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:36,048 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 16 states, 15 states have (on average 1.6) internal successors, (24), 15 states have internal predecessors, (24), 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) Stem has 9 letters. Loop has 4 letters. [2022-02-21 03:59:36,049 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:36,049 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 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) Stem has 9 letters. Loop has 4 letters. [2022-02-21 03:59:36,049 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:36,049 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 50 transitions. cyclomatic complexity: 23 Stem has 9 letters. Loop has 4 letters. [2022-02-21 03:59:36,050 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:36,050 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 16 states, 15 states have (on average 1.6) internal successors, (24), 15 states have internal predecessors, (24), 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) Stem has 8 letters. Loop has 4 letters. [2022-02-21 03:59:36,050 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:36,050 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 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) Stem has 8 letters. Loop has 4 letters. [2022-02-21 03:59:36,050 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:36,051 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 50 transitions. cyclomatic complexity: 23 Stem has 8 letters. Loop has 4 letters. [2022-02-21 03:59:36,051 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:36,051 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 16 states, 15 states have (on average 1.6) internal successors, (24), 15 states have internal predecessors, (24), 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) Stem has 5 letters. Loop has 1 letters. [2022-02-21 03:59:36,051 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:36,051 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 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) Stem has 5 letters. Loop has 1 letters. [2022-02-21 03:59:36,051 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:36,052 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 50 transitions. cyclomatic complexity: 23 Stem has 5 letters. Loop has 1 letters. [2022-02-21 03:59:36,052 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:36,052 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 16 states, 15 states have (on average 1.6) internal successors, (24), 15 states have internal predecessors, (24), 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) Stem has 2 letters. Loop has 1 letters. [2022-02-21 03:59:36,052 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:36,052 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 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) Stem has 2 letters. Loop has 1 letters. [2022-02-21 03:59:36,052 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:36,053 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 50 transitions. cyclomatic complexity: 23 Stem has 2 letters. Loop has 1 letters. [2022-02-21 03:59:36,053 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:36,053 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 16 states, 15 states have (on average 1.6) internal successors, (24), 15 states have internal predecessors, (24), 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) Stem has 2 letters. Loop has 1 letters. [2022-02-21 03:59:36,053 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:36,053 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 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) Stem has 2 letters. Loop has 1 letters. [2022-02-21 03:59:36,054 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:36,054 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 50 transitions. cyclomatic complexity: 23 Stem has 2 letters. Loop has 1 letters. [2022-02-21 03:59:36,054 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:36,054 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 16 states, 15 states have (on average 1.6) internal successors, (24), 15 states have internal predecessors, (24), 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) Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:59:36,054 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:36,054 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 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) Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:59:36,055 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:36,055 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 50 transitions. cyclomatic complexity: 23 Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:59:36,055 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:36,055 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 16 states, 15 states have (on average 1.6) internal successors, (24), 15 states have internal predecessors, (24), 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) Stem has 10 letters. Loop has 4 letters. [2022-02-21 03:59:36,055 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:36,056 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 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) Stem has 10 letters. Loop has 4 letters. [2022-02-21 03:59:36,056 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:36,056 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 50 transitions. cyclomatic complexity: 23 Stem has 10 letters. Loop has 4 letters. [2022-02-21 03:59:36,056 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:36,056 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 16 states, 15 states have (on average 1.6) internal successors, (24), 15 states have internal predecessors, (24), 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) Stem has 7 letters. Loop has 4 letters. [2022-02-21 03:59:36,057 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:36,057 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 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) Stem has 7 letters. Loop has 4 letters. [2022-02-21 03:59:36,057 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:36,057 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 50 transitions. cyclomatic complexity: 23 Stem has 7 letters. Loop has 4 letters. [2022-02-21 03:59:36,057 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:36,057 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 16 states, 15 states have (on average 1.6) internal successors, (24), 15 states have internal predecessors, (24), 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) Stem has 8 letters. Loop has 4 letters. [2022-02-21 03:59:36,058 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:36,058 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 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) Stem has 8 letters. Loop has 4 letters. [2022-02-21 03:59:36,058 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:36,058 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 50 transitions. cyclomatic complexity: 23 Stem has 8 letters. Loop has 4 letters. [2022-02-21 03:59:36,058 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:36,058 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 16 states, 15 states have (on average 1.6) internal successors, (24), 15 states have internal predecessors, (24), 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) Stem has 9 letters. Loop has 4 letters. [2022-02-21 03:59:36,059 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:36,059 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 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) Stem has 9 letters. Loop has 4 letters. [2022-02-21 03:59:36,059 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:36,059 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 50 transitions. cyclomatic complexity: 23 Stem has 9 letters. Loop has 4 letters. [2022-02-21 03:59:36,059 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:36,059 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 16 states, 15 states have (on average 1.6) internal successors, (24), 15 states have internal predecessors, (24), 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) Stem has 9 letters. Loop has 5 letters. [2022-02-21 03:59:36,060 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:36,060 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 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) Stem has 9 letters. Loop has 5 letters. [2022-02-21 03:59:36,060 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:36,060 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 50 transitions. cyclomatic complexity: 23 Stem has 9 letters. Loop has 5 letters. [2022-02-21 03:59:36,060 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:36,060 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 16 states, 15 states have (on average 1.6) internal successors, (24), 15 states have internal predecessors, (24), 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) Stem has 5 letters. Loop has 1 letters. [2022-02-21 03:59:36,061 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:36,061 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 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) Stem has 5 letters. Loop has 1 letters. [2022-02-21 03:59:36,061 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:36,061 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 50 transitions. cyclomatic complexity: 23 Stem has 5 letters. Loop has 1 letters. [2022-02-21 03:59:36,061 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:36,061 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:59:36,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 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-21 03:59:36,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 26 transitions. [2022-02-21 03:59:36,067 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 26 transitions. Stem has 2 letters. Loop has 1 letters. [2022-02-21 03:59:36,067 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:36,067 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 26 transitions. Stem has 3 letters. Loop has 1 letters. [2022-02-21 03:59:36,067 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:36,067 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 26 transitions. Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:59:36,067 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:36,068 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 50 transitions. cyclomatic complexity: 23 [2022-02-21 03:59:36,070 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2022-02-21 03:59:36,073 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 13 states and 19 transitions. [2022-02-21 03:59:36,073 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2022-02-21 03:59:36,074 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2022-02-21 03:59:36,074 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 19 transitions. [2022-02-21 03:59:36,074 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:59:36,074 INFO L681 BuchiCegarLoop]: Abstraction has 13 states and 19 transitions. [2022-02-21 03:59:36,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 19 transitions. [2022-02-21 03:59:36,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2022-02-21 03:59:36,091 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:59:36,092 INFO L82 GeneralOperation]: Start isEquivalent. First operand 13 states and 19 transitions. Second operand has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 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-21 03:59:36,092 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states and 19 transitions. Second operand has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 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-21 03:59:36,094 INFO L87 Difference]: Start difference. First operand 13 states and 19 transitions. Second operand has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 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-21 03:59:36,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:59:36,096 INFO L93 Difference]: Finished difference Result 13 states and 19 transitions. [2022-02-21 03:59:36,096 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 19 transitions. [2022-02-21 03:59:36,097 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:59:36,097 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:59:36,097 INFO L74 IsIncluded]: Start isIncluded. First operand has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 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 13 states and 19 transitions. [2022-02-21 03:59:36,097 INFO L87 Difference]: Start difference. First operand has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 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 13 states and 19 transitions. [2022-02-21 03:59:36,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:59:36,098 INFO L93 Difference]: Finished difference Result 13 states and 19 transitions. [2022-02-21 03:59:36,098 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 19 transitions. [2022-02-21 03:59:36,098 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:59:36,098 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:59:36,099 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:59:36,099 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:59:36,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 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-21 03:59:36,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 19 transitions. [2022-02-21 03:59:36,100 INFO L704 BuchiCegarLoop]: Abstraction has 13 states and 19 transitions. [2022-02-21 03:59:36,100 INFO L587 BuchiCegarLoop]: Abstraction has 13 states and 19 transitions. [2022-02-21 03:59:36,100 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2022-02-21 03:59:36,101 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 19 transitions. [2022-02-21 03:59:36,101 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2022-02-21 03:59:36,101 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:59:36,101 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:59:36,102 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-02-21 03:59:36,102 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1] [2022-02-21 03:59:36,102 INFO L791 eck$LassoCheckResult]: Stem: 90#ULTIMATE.startENTRY 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(9, 2); 91#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_~i~0#1, main_~pvlen~0#1, main_~tmp___1~0#1, main_~k~0#1, main_~n~0#1, main_~j~0#1;havoc main_~i~0#1;havoc main_~pvlen~0#1;havoc main_~tmp___1~0#1;main_~k~0#1 := 0;havoc main_~n~0#1;main_~i~0#1 := 0;main_~pvlen~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1; 97#L31-2 assume !(0 != main_#t~nondet2#1 && main_~i~0#1 <= 1000000);havoc main_#t~nondet2#1; 98#L31-3 assume !(main_~i~0#1 > main_~pvlen~0#1); 95#L34-1 main_~i~0#1 := 0; 96#L38-2 [2022-02-21 03:59:36,102 INFO L793 eck$LassoCheckResult]: Loop: 96#L38-2 assume !!(0 != main_#t~nondet3#1 && main_~i~0#1 <= 1000000);havoc main_#t~nondet3#1;main_~tmp___1~0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~k~0#1 := 1 + main_~k~0#1; 96#L38-2 [2022-02-21 03:59:36,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:59:36,103 INFO L85 PathProgramCache]: Analyzing trace with hash 28697992, now seen corresponding path program 1 times [2022-02-21 03:59:36,103 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:59:36,103 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447423263] [2022-02-21 03:59:36,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:59:36,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:59:36,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:59:36,111 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:59:36,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:59:36,117 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:59:36,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:59:36,117 INFO L85 PathProgramCache]: Analyzing trace with hash 61, now seen corresponding path program 1 times [2022-02-21 03:59:36,117 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:59:36,118 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826099367] [2022-02-21 03:59:36,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:59:36,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:59:36,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:59:36,122 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:59:36,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:59:36,126 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:59:36,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:59:36,126 INFO L85 PathProgramCache]: Analyzing trace with hash 889637782, now seen corresponding path program 1 times [2022-02-21 03:59:36,127 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:59:36,127 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81955107] [2022-02-21 03:59:36,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:59:36,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:59:36,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:59:36,136 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:59:36,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:59:36,143 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:59:36,170 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:59:36,170 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:59:36,170 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:59:36,170 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:59:36,170 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-02-21 03:59:36,170 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:59:36,170 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:59:36,171 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:59:36,171 INFO L133 ssoRankerPreferences]: Filename of dumped script: fragtest_simple.i_Iteration2_Loop [2022-02-21 03:59:36,171 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:59:36,171 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:59:36,172 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:59:36,174 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:59:36,179 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:59:36,223 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:59:36,223 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-02-21 03:59:36,224 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:59:36,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:59:36,228 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:59:36,229 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2022-02-21 03:59:36,230 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:59:36,230 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:59:36,273 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2022-02-21 03:59:36,273 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:59:36,274 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:59:36,276 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:59:36,277 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2022-02-21 03:59:36,319 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-02-21 03:59:36,320 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:59:36,348 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:59:36,348 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~k~0#1=0} Honda state: {ULTIMATE.start_main_~k~0#1=0} Generalized eigenvectors: [{ULTIMATE.start_main_~k~0#1=-1}, {ULTIMATE.start_main_~k~0#1=-1}, {ULTIMATE.start_main_~k~0#1=3}] Lambdas: [0, 4, 1] Nus: [1, 1] [2022-02-21 03:59:36,366 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2022-02-21 03:59:36,366 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:59:36,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:59:36,367 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:59:36,368 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2022-02-21 03:59:36,370 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:59:36,370 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:59:36,429 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2022-02-21 03:59:36,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:59:36,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:59:36,430 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:59:36,431 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2022-02-21 03:59:36,432 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-02-21 03:59:36,432 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:59:36,462 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-02-21 03:59:36,468 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2022-02-21 03:59:36,468 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:59:36,468 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:59:36,468 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:59:36,468 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:59:36,468 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:59:36,468 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:59:36,468 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:59:36,468 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:59:36,468 INFO L133 ssoRankerPreferences]: Filename of dumped script: fragtest_simple.i_Iteration2_Loop [2022-02-21 03:59:36,468 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:59:36,469 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:59:36,469 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:59:36,473 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:59:36,478 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:59:36,528 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:59:36,529 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:59:36,529 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:59:36,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:59:36,544 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:59:36,545 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2022-02-21 03:59:36,546 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:59:36,552 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:59:36,553 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:59:36,553 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:59:36,553 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:59:36,553 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:59:36,554 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:59:36,554 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:59:36,575 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:59:36,591 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2022-02-21 03:59:36,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:59:36,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:59:36,593 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:59:36,594 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2022-02-21 03:59:36,595 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:59:36,601 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:59:36,601 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:59:36,601 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:59:36,601 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:59:36,601 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:59:36,602 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:59:36,602 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:59:36,607 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:59:36,608 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-02-21 03:59:36,608 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-02-21 03:59:36,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:59:36,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:59:36,610 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:59:36,613 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:59:36,614 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-02-21 03:59:36,614 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:59:36,614 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = -2*ULTIMATE.start_main_~i~0#1 + 2000001 Supporting invariants [] [2022-02-21 03:59:36,614 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2022-02-21 03:59:36,629 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2022-02-21 03:59:36,642 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-02-21 03:59:36,647 INFO L390 LassoCheck]: Loop: "assume !!(0 != main_#t~nondet3#1 && main_~i~0#1 <= 1000000);havoc main_#t~nondet3#1;main_~tmp___1~0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~k~0#1 := 1 + main_~k~0#1;" [2022-02-21 03:59:36,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:59:36,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:59:36,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:59:36,673 INFO L263 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:59:36,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:59:36,686 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:59:36,694 INFO L290 TraceCheckUtils]: 0: Hoare triple {135#unseeded} 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(9, 2); {135#unseeded} is VALID [2022-02-21 03:59:36,695 INFO L290 TraceCheckUtils]: 1: Hoare triple {135#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_~i~0#1, main_~pvlen~0#1, main_~tmp___1~0#1, main_~k~0#1, main_~n~0#1, main_~j~0#1;havoc main_~i~0#1;havoc main_~pvlen~0#1;havoc main_~tmp___1~0#1;main_~k~0#1 := 0;havoc main_~n~0#1;main_~i~0#1 := 0;main_~pvlen~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1; {135#unseeded} is VALID [2022-02-21 03:59:36,695 INFO L290 TraceCheckUtils]: 2: Hoare triple {135#unseeded} assume !(0 != main_#t~nondet2#1 && main_~i~0#1 <= 1000000);havoc main_#t~nondet2#1; {135#unseeded} is VALID [2022-02-21 03:59:36,695 INFO L290 TraceCheckUtils]: 3: Hoare triple {135#unseeded} assume !(main_~i~0#1 > main_~pvlen~0#1); {135#unseeded} is VALID [2022-02-21 03:59:36,696 INFO L290 TraceCheckUtils]: 4: Hoare triple {135#unseeded} main_~i~0#1 := 0; {135#unseeded} is VALID [2022-02-21 03:59:36,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:59:36,702 INFO L263 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 03:59:36,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:59:36,707 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:59:36,708 INFO L290 TraceCheckUtils]: 0: Hoare triple {138#(>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i~0#1|) 2000001))} assume !!(0 != main_#t~nondet3#1 && main_~i~0#1 <= 1000000);havoc main_#t~nondet3#1;main_~tmp___1~0#1 := main_~i~0#1;main_~i~0#1 := 1 + main_~i~0#1;main_~k~0#1 := 1 + main_~k~0#1; {148#(or unseeded (and (>= oldRank0 0) (> oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i~0#1|) 2000001))))} is VALID [2022-02-21 03:59:36,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:59:36,709 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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-21 03:59:36,713 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:59:36,713 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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) Stem has 5 letters. Loop has 1 letters. [2022-02-21 03:59:36,713 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:36,713 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2022-02-21 03:59:36,713 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 19 transitions. cyclomatic complexity: 9 Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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-21 03:59:36,767 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2022-02-21 03:59:36,777 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states and 19 transitions. cyclomatic complexity: 9. Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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) Result 29 states and 40 transitions. Complement of second has 6 states. [2022-02-21 03:59:36,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2022-02-21 03:59:36,778 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:59:36,778 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 19 transitions. cyclomatic complexity: 9 [2022-02-21 03:59:36,778 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:59:36,778 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:59:36,778 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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-21 03:59:36,779 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 2 [2022-02-21 03:59:36,779 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:59:36,779 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:59:36,779 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 40 transitions. [2022-02-21 03:59:36,780 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-02-21 03:59:36,780 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:59:36,780 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:59:36,780 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 13 states and 19 transitions. cyclomatic complexity: 9 [2022-02-21 03:59:36,781 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 6 examples of accepted words. [2022-02-21 03:59:36,781 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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-21 03:59:36,782 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 2 [2022-02-21 03:59:36,787 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 03:59:36,787 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 29 states and 40 transitions. cyclomatic complexity: 15 [2022-02-21 03:59:36,790 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 5 examples of accepted words. [2022-02-21 03:59:36,790 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 19 transitions. cyclomatic complexity: 9 Stem has 5 letters. Loop has 1 letters. [2022-02-21 03:59:36,790 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:36,790 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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) Stem has 5 letters. Loop has 1 letters. [2022-02-21 03:59:36,790 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:36,790 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 40 transitions. cyclomatic complexity: 15 Stem has 5 letters. Loop has 1 letters. [2022-02-21 03:59:36,790 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:36,790 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 19 transitions. cyclomatic complexity: 9 Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:59:36,790 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:36,790 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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) Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:59:36,790 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:36,790 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 40 transitions. cyclomatic complexity: 15 Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:59:36,790 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:36,790 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 19 transitions. cyclomatic complexity: 9 Stem has 10 letters. Loop has 4 letters. [2022-02-21 03:59:36,791 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:36,791 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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) Stem has 10 letters. Loop has 4 letters. [2022-02-21 03:59:36,791 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:36,791 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 40 transitions. cyclomatic complexity: 15 Stem has 10 letters. Loop has 4 letters. [2022-02-21 03:59:36,791 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:36,791 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 19 transitions. cyclomatic complexity: 9 Stem has 29 letters. Loop has 29 letters. [2022-02-21 03:59:36,791 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:36,791 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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) Stem has 29 letters. Loop has 29 letters. [2022-02-21 03:59:36,791 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:36,791 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 40 transitions. cyclomatic complexity: 15 Stem has 29 letters. Loop has 29 letters. [2022-02-21 03:59:36,791 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:36,791 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 19 transitions. cyclomatic complexity: 9 Stem has 13 letters. Loop has 13 letters. [2022-02-21 03:59:36,791 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:36,791 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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) Stem has 13 letters. Loop has 13 letters. [2022-02-21 03:59:36,791 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:36,791 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 40 transitions. cyclomatic complexity: 15 Stem has 13 letters. Loop has 13 letters. [2022-02-21 03:59:36,791 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:36,791 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 19 transitions. cyclomatic complexity: 9 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:59:36,792 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:36,792 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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) Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:59:36,792 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:36,792 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 40 transitions. cyclomatic complexity: 15 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:59:36,792 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:36,792 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 19 transitions. cyclomatic complexity: 9 Stem has 8 letters. Loop has 4 letters. [2022-02-21 03:59:36,792 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:36,792 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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) Stem has 8 letters. Loop has 4 letters. [2022-02-21 03:59:36,792 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:36,792 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 40 transitions. cyclomatic complexity: 15 Stem has 8 letters. Loop has 4 letters. [2022-02-21 03:59:36,792 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:36,792 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 19 transitions. cyclomatic complexity: 9 Stem has 9 letters. Loop has 4 letters. [2022-02-21 03:59:36,792 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:36,792 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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) Stem has 9 letters. Loop has 4 letters. [2022-02-21 03:59:36,792 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:36,792 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 40 transitions. cyclomatic complexity: 15 Stem has 9 letters. Loop has 4 letters. [2022-02-21 03:59:36,792 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:36,793 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 19 transitions. cyclomatic complexity: 9 Stem has 9 letters. Loop has 5 letters. [2022-02-21 03:59:36,793 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:36,793 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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) Stem has 9 letters. Loop has 5 letters. [2022-02-21 03:59:36,793 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:36,793 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 40 transitions. cyclomatic complexity: 15 Stem has 9 letters. Loop has 5 letters. [2022-02-21 03:59:36,795 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:36,795 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 19 transitions. cyclomatic complexity: 9 Stem has 7 letters. Loop has 4 letters. [2022-02-21 03:59:36,795 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:36,795 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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) Stem has 7 letters. Loop has 4 letters. [2022-02-21 03:59:36,796 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:36,796 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 40 transitions. cyclomatic complexity: 15 Stem has 7 letters. Loop has 4 letters. [2022-02-21 03:59:36,796 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:36,796 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 19 transitions. cyclomatic complexity: 9 Stem has 10 letters. Loop has 4 letters. [2022-02-21 03:59:36,796 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:36,796 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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) Stem has 10 letters. Loop has 4 letters. [2022-02-21 03:59:36,796 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:36,796 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 40 transitions. cyclomatic complexity: 15 Stem has 10 letters. Loop has 4 letters. [2022-02-21 03:59:36,796 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:36,796 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 19 transitions. cyclomatic complexity: 9 Stem has 5 letters. Loop has 1 letters. [2022-02-21 03:59:36,796 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:36,796 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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) Stem has 5 letters. Loop has 1 letters. [2022-02-21 03:59:36,797 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:36,797 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 40 transitions. cyclomatic complexity: 15 Stem has 5 letters. Loop has 1 letters. [2022-02-21 03:59:36,797 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:36,797 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 19 transitions. cyclomatic complexity: 9 Stem has 2 letters. Loop has 1 letters. [2022-02-21 03:59:36,797 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:36,797 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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) Stem has 2 letters. Loop has 1 letters. [2022-02-21 03:59:36,797 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:36,797 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 40 transitions. cyclomatic complexity: 15 Stem has 2 letters. Loop has 1 letters. [2022-02-21 03:59:36,797 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:36,797 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 19 transitions. cyclomatic complexity: 9 Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:59:36,797 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:36,797 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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) Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:59:36,797 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:36,797 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 40 transitions. cyclomatic complexity: 15 Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:59:36,797 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:36,797 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 19 transitions. cyclomatic complexity: 9 Stem has 10 letters. Loop has 4 letters. [2022-02-21 03:59:36,797 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:36,799 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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) Stem has 10 letters. Loop has 4 letters. [2022-02-21 03:59:36,799 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:36,799 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 40 transitions. cyclomatic complexity: 15 Stem has 10 letters. Loop has 4 letters. [2022-02-21 03:59:36,799 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:36,799 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 19 transitions. cyclomatic complexity: 9 Stem has 11 letters. Loop has 4 letters. [2022-02-21 03:59:36,799 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:36,799 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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) Stem has 11 letters. Loop has 4 letters. [2022-02-21 03:59:36,799 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:36,799 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 40 transitions. cyclomatic complexity: 15 Stem has 11 letters. Loop has 4 letters. [2022-02-21 03:59:36,799 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:36,799 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 19 transitions. cyclomatic complexity: 9 Stem has 12 letters. Loop has 4 letters. [2022-02-21 03:59:36,800 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:36,800 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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) Stem has 12 letters. Loop has 4 letters. [2022-02-21 03:59:36,800 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:36,800 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 40 transitions. cyclomatic complexity: 15 Stem has 12 letters. Loop has 4 letters. [2022-02-21 03:59:36,801 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:36,801 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 19 transitions. cyclomatic complexity: 9 Stem has 13 letters. Loop has 4 letters. [2022-02-21 03:59:36,801 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:36,801 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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) Stem has 13 letters. Loop has 4 letters. [2022-02-21 03:59:36,801 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:36,801 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 40 transitions. cyclomatic complexity: 15 Stem has 13 letters. Loop has 4 letters. [2022-02-21 03:59:36,801 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:36,801 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 19 transitions. cyclomatic complexity: 9 Stem has 13 letters. Loop has 5 letters. [2022-02-21 03:59:36,801 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:36,801 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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) Stem has 13 letters. Loop has 5 letters. [2022-02-21 03:59:36,801 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:36,801 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 40 transitions. cyclomatic complexity: 15 Stem has 13 letters. Loop has 5 letters. [2022-02-21 03:59:36,801 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:36,801 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:59:36,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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-21 03:59:36,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 22 transitions. [2022-02-21 03:59:36,803 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 5 letters. Loop has 1 letters. [2022-02-21 03:59:36,803 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:36,803 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 6 letters. Loop has 1 letters. [2022-02-21 03:59:36,803 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:36,803 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 5 letters. Loop has 2 letters. [2022-02-21 03:59:36,803 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:36,804 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 40 transitions. cyclomatic complexity: 15 [2022-02-21 03:59:36,809 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-02-21 03:59:36,811 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 17 states and 23 transitions. [2022-02-21 03:59:36,811 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2022-02-21 03:59:36,811 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2022-02-21 03:59:36,811 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 23 transitions. [2022-02-21 03:59:36,811 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:59:36,811 INFO L681 BuchiCegarLoop]: Abstraction has 17 states and 23 transitions. [2022-02-21 03:59:36,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 23 transitions. [2022-02-21 03:59:36,813 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2022-02-21 03:59:36,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2022-02-21 03:59:36,813 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:59:36,813 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states and 23 transitions. Second operand has 16 states, 16 states have (on average 1.375) internal successors, (22), 15 states have internal predecessors, (22), 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-21 03:59:36,814 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states and 23 transitions. Second operand has 16 states, 16 states have (on average 1.375) internal successors, (22), 15 states have internal predecessors, (22), 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-21 03:59:36,814 INFO L87 Difference]: Start difference. First operand 17 states and 23 transitions. Second operand has 16 states, 16 states have (on average 1.375) internal successors, (22), 15 states have internal predecessors, (22), 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-21 03:59:36,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:59:36,815 INFO L93 Difference]: Finished difference Result 17 states and 23 transitions. [2022-02-21 03:59:36,815 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 23 transitions. [2022-02-21 03:59:36,815 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:59:36,815 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:59:36,815 INFO L74 IsIncluded]: Start isIncluded. First operand has 16 states, 16 states have (on average 1.375) internal successors, (22), 15 states have internal predecessors, (22), 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 17 states and 23 transitions. [2022-02-21 03:59:36,815 INFO L87 Difference]: Start difference. First operand has 16 states, 16 states have (on average 1.375) internal successors, (22), 15 states have internal predecessors, (22), 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 17 states and 23 transitions. [2022-02-21 03:59:36,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:59:36,816 INFO L93 Difference]: Finished difference Result 17 states and 23 transitions. [2022-02-21 03:59:36,816 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 23 transitions. [2022-02-21 03:59:36,817 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:59:36,817 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:59:36,817 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:59:36,818 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:59:36,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.375) internal successors, (22), 15 states have internal predecessors, (22), 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-21 03:59:36,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 22 transitions. [2022-02-21 03:59:36,819 INFO L704 BuchiCegarLoop]: Abstraction has 16 states and 22 transitions. [2022-02-21 03:59:36,819 INFO L587 BuchiCegarLoop]: Abstraction has 16 states and 22 transitions. [2022-02-21 03:59:36,819 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2022-02-21 03:59:36,819 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 22 transitions. [2022-02-21 03:59:36,820 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-02-21 03:59:36,820 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:59:36,821 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:59:36,821 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:59:36,821 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2022-02-21 03:59:36,822 INFO L791 eck$LassoCheckResult]: Stem: 204#ULTIMATE.startENTRY 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(9, 2); 205#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_~i~0#1, main_~pvlen~0#1, main_~tmp___1~0#1, main_~k~0#1, main_~n~0#1, main_~j~0#1;havoc main_~i~0#1;havoc main_~pvlen~0#1;havoc main_~tmp___1~0#1;main_~k~0#1 := 0;havoc main_~n~0#1;main_~i~0#1 := 0;main_~pvlen~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1; 211#L31-2 assume !(0 != main_#t~nondet2#1 && main_~i~0#1 <= 1000000);havoc main_#t~nondet2#1; 213#L31-3 assume !(main_~i~0#1 > main_~pvlen~0#1); 209#L34-1 main_~i~0#1 := 0; 210#L38-2 assume !(0 != main_#t~nondet3#1 && main_~i~0#1 <= 1000000);havoc main_#t~nondet3#1; 207#L38-3 main_~j~0#1 := 0;main_~n~0#1 := main_~i~0#1; 208#L45-2 assume !false;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 >= 0 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 202#L18 assume !(0 == __VERIFIER_assert_~cond#1); 203#L18-2 [2022-02-21 03:59:36,822 INFO L793 eck$LassoCheckResult]: Loop: 203#L18-2 assume { :end_inline___VERIFIER_assert } true;main_~k~0#1 := main_~k~0#1 - 1;main_~i~0#1 := main_~i~0#1 - 1;main_~j~0#1 := 1 + main_~j~0#1; 206#L50 assume !(main_~j~0#1 >= main_~n~0#1); 212#L45-2 assume !false;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 >= 0 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; 217#L18 assume !(0 == __VERIFIER_assert_~cond#1); 203#L18-2 [2022-02-21 03:59:36,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:59:36,823 INFO L85 PathProgramCache]: Analyzing trace with hash -1044045579, now seen corresponding path program 1 times [2022-02-21 03:59:36,823 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:59:36,824 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175538839] [2022-02-21 03:59:36,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:59:36,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:59:36,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:59:36,854 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:59:36,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:59:36,861 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:59:36,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:59:36,862 INFO L85 PathProgramCache]: Analyzing trace with hash 2559565, now seen corresponding path program 1 times [2022-02-21 03:59:36,862 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:59:36,862 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347750476] [2022-02-21 03:59:36,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:59:36,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:59:36,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:59:36,867 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:59:36,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:59:36,872 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:59:36,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:59:36,872 INFO L85 PathProgramCache]: Analyzing trace with hash 667587905, now seen corresponding path program 1 times [2022-02-21 03:59:36,872 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:59:36,872 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117176318] [2022-02-21 03:59:36,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:59:36,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:59:36,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:59:36,930 INFO L290 TraceCheckUtils]: 0: Hoare triple {259#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(9, 2); {259#true} is VALID [2022-02-21 03:59:36,931 INFO L290 TraceCheckUtils]: 1: Hoare triple {259#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_~i~0#1, main_~pvlen~0#1, main_~tmp___1~0#1, main_~k~0#1, main_~n~0#1, main_~j~0#1;havoc main_~i~0#1;havoc main_~pvlen~0#1;havoc main_~tmp___1~0#1;main_~k~0#1 := 0;havoc main_~n~0#1;main_~i~0#1 := 0;main_~pvlen~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1; {259#true} is VALID [2022-02-21 03:59:36,931 INFO L290 TraceCheckUtils]: 2: Hoare triple {259#true} assume !(0 != main_#t~nondet2#1 && main_~i~0#1 <= 1000000);havoc main_#t~nondet2#1; {259#true} is VALID [2022-02-21 03:59:36,931 INFO L290 TraceCheckUtils]: 3: Hoare triple {259#true} assume !(main_~i~0#1 > main_~pvlen~0#1); {259#true} is VALID [2022-02-21 03:59:36,931 INFO L290 TraceCheckUtils]: 4: Hoare triple {259#true} main_~i~0#1 := 0; {261#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:59:36,932 INFO L290 TraceCheckUtils]: 5: Hoare triple {261#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !(0 != main_#t~nondet3#1 && main_~i~0#1 <= 1000000);havoc main_#t~nondet3#1; {261#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-21 03:59:36,932 INFO L290 TraceCheckUtils]: 6: Hoare triple {261#(= |ULTIMATE.start_main_~i~0#1| 0)} main_~j~0#1 := 0;main_~n~0#1 := main_~i~0#1; {262#(and (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-21 03:59:36,933 INFO L290 TraceCheckUtils]: 7: Hoare triple {262#(and (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~j~0#1| 0))} assume !false;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 >= 0 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {262#(and (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-21 03:59:36,933 INFO L290 TraceCheckUtils]: 8: Hoare triple {262#(and (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~j~0#1| 0))} assume !(0 == __VERIFIER_assert_~cond#1); {262#(and (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-21 03:59:36,933 INFO L290 TraceCheckUtils]: 9: Hoare triple {262#(and (= |ULTIMATE.start_main_~n~0#1| 0) (= |ULTIMATE.start_main_~j~0#1| 0))} assume { :end_inline___VERIFIER_assert } true;main_~k~0#1 := main_~k~0#1 - 1;main_~i~0#1 := main_~i~0#1 - 1;main_~j~0#1 := 1 + main_~j~0#1; {263#(and (<= 1 |ULTIMATE.start_main_~j~0#1|) (= |ULTIMATE.start_main_~n~0#1| 0))} is VALID [2022-02-21 03:59:36,934 INFO L290 TraceCheckUtils]: 10: Hoare triple {263#(and (<= 1 |ULTIMATE.start_main_~j~0#1|) (= |ULTIMATE.start_main_~n~0#1| 0))} assume !(main_~j~0#1 >= main_~n~0#1); {260#false} is VALID [2022-02-21 03:59:36,934 INFO L290 TraceCheckUtils]: 11: Hoare triple {260#false} assume !false;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 >= 0 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {260#false} is VALID [2022-02-21 03:59:36,934 INFO L290 TraceCheckUtils]: 12: Hoare triple {260#false} assume !(0 == __VERIFIER_assert_~cond#1); {260#false} is VALID [2022-02-21 03:59:36,935 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:59:36,935 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:59:36,935 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117176318] [2022-02-21 03:59:36,935 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [117176318] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:59:36,936 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:59:36,936 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-21 03:59:36,936 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752127708] [2022-02-21 03:59:36,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:59:36,994 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:59:36,994 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:59:36,994 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:59:36,994 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:59:36,994 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-02-21 03:59:36,994 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:59:36,994 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:59:36,995 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:59:36,995 INFO L133 ssoRankerPreferences]: Filename of dumped script: fragtest_simple.i_Iteration3_Loop [2022-02-21 03:59:36,995 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:59:36,995 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:59:36,997 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:59:37,000 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:59:37,004 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:59:37,008 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:59:37,073 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:59:37,073 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-02-21 03:59:37,074 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:59:37,074 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:59:37,075 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:59:37,076 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2022-02-21 03:59:37,087 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:59:37,087 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:59:37,122 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2022-02-21 03:59:37,124 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:59:37,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:59:37,125 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:59:37,126 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2022-02-21 03:59:37,127 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-02-21 03:59:37,127 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:59:37,148 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:59:37,148 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~i~0#1=0} Honda state: {ULTIMATE.start_main_~i~0#1=0} Generalized eigenvectors: [{ULTIMATE.start_main_~i~0#1=-1}, {ULTIMATE.start_main_~i~0#1=-1}, {ULTIMATE.start_main_~i~0#1=1}] Lambdas: [0, 2, 1] Nus: [1, 1] [2022-02-21 03:59:37,164 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2022-02-21 03:59:37,164 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:59:37,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:59:37,166 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:59:37,166 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2022-02-21 03:59:37,168 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:59:37,168 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:59:37,236 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2022-02-21 03:59:37,237 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:59:37,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:59:37,238 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:59:37,238 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2022-02-21 03:59:37,240 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-02-21 03:59:37,240 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:59:37,491 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-02-21 03:59:37,494 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2022-02-21 03:59:37,495 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:59:37,495 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:59:37,495 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:59:37,495 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:59:37,495 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:59:37,495 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:59:37,495 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:59:37,495 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:59:37,495 INFO L133 ssoRankerPreferences]: Filename of dumped script: fragtest_simple.i_Iteration3_Loop [2022-02-21 03:59:37,495 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:59:37,495 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:59:37,496 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:59:37,515 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:59:37,519 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:59:37,523 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:59:37,587 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:59:37,587 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:59:37,588 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:59:37,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:59:37,589 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:59:37,590 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2022-02-21 03:59:37,591 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:59:37,598 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:59:37,598 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:59:37,598 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:59:37,598 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:59:37,598 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:59:37,599 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:59:37,599 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:59:37,613 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:59:37,630 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2022-02-21 03:59:37,630 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:59:37,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:59:37,631 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:59:37,632 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2022-02-21 03:59:37,633 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:59:37,640 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:59:37,640 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:59:37,640 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:59:37,640 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:59:37,640 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:59:37,641 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:59:37,641 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:59:37,655 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:59:37,670 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2022-02-21 03:59:37,670 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:59:37,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:59:37,671 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:59:37,672 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2022-02-21 03:59:37,674 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:59:37,680 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:59:37,680 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:59:37,680 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:59:37,680 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:59:37,680 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:59:37,684 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:59:37,684 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:59:37,688 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:59:37,690 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2022-02-21 03:59:37,690 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2022-02-21 03:59:37,691 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:59:37,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:59:37,692 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:59:37,694 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2022-02-21 03:59:37,695 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:59:37,695 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-02-21 03:59:37,695 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:59:37,695 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0#1, ULTIMATE.start_main_~n~0#1) = -1*ULTIMATE.start_main_~j~0#1 + 1*ULTIMATE.start_main_~n~0#1 Supporting invariants [] [2022-02-21 03:59:37,710 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2022-02-21 03:59:37,724 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-02-21 03:59:37,728 INFO L390 LassoCheck]: Loop: "assume { :end_inline___VERIFIER_assert } true;main_~k~0#1 := main_~k~0#1 - 1;main_~i~0#1 := main_~i~0#1 - 1;main_~j~0#1 := 1 + main_~j~0#1;" "assume !(main_~j~0#1 >= main_~n~0#1);" "assume !false;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 >= 0 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1;" "assume !(0 == __VERIFIER_assert_~cond#1);" [2022-02-21 03:59:37,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:59:37,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:59:37,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:59:37,755 INFO L263 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:59:37,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:59:37,759 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:59:37,777 INFO L290 TraceCheckUtils]: 0: Hoare triple {264#unseeded} 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(9, 2); {264#unseeded} is VALID [2022-02-21 03:59:37,777 INFO L290 TraceCheckUtils]: 1: Hoare triple {264#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_~i~0#1, main_~pvlen~0#1, main_~tmp___1~0#1, main_~k~0#1, main_~n~0#1, main_~j~0#1;havoc main_~i~0#1;havoc main_~pvlen~0#1;havoc main_~tmp___1~0#1;main_~k~0#1 := 0;havoc main_~n~0#1;main_~i~0#1 := 0;main_~pvlen~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1; {264#unseeded} is VALID [2022-02-21 03:59:37,778 INFO L290 TraceCheckUtils]: 2: Hoare triple {264#unseeded} assume !(0 != main_#t~nondet2#1 && main_~i~0#1 <= 1000000);havoc main_#t~nondet2#1; {264#unseeded} is VALID [2022-02-21 03:59:37,779 INFO L290 TraceCheckUtils]: 3: Hoare triple {264#unseeded} assume !(main_~i~0#1 > main_~pvlen~0#1); {264#unseeded} is VALID [2022-02-21 03:59:37,779 INFO L290 TraceCheckUtils]: 4: Hoare triple {264#unseeded} main_~i~0#1 := 0; {264#unseeded} is VALID [2022-02-21 03:59:37,780 INFO L290 TraceCheckUtils]: 5: Hoare triple {264#unseeded} assume !(0 != main_#t~nondet3#1 && main_~i~0#1 <= 1000000);havoc main_#t~nondet3#1; {264#unseeded} is VALID [2022-02-21 03:59:37,780 INFO L290 TraceCheckUtils]: 6: Hoare triple {264#unseeded} main_~j~0#1 := 0;main_~n~0#1 := main_~i~0#1; {264#unseeded} is VALID [2022-02-21 03:59:37,780 INFO L290 TraceCheckUtils]: 7: Hoare triple {264#unseeded} assume !false;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 >= 0 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {264#unseeded} is VALID [2022-02-21 03:59:37,780 INFO L290 TraceCheckUtils]: 8: Hoare triple {264#unseeded} assume !(0 == __VERIFIER_assert_~cond#1); {264#unseeded} is VALID [2022-02-21 03:59:37,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:59:37,785 INFO L263 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 03:59:37,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:59:37,789 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:59:37,870 INFO L290 TraceCheckUtils]: 0: Hoare triple {267#(>= oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~n~0#1|))} assume { :end_inline___VERIFIER_assert } true;main_~k~0#1 := main_~k~0#1 - 1;main_~i~0#1 := main_~i~0#1 - 1;main_~j~0#1 := 1 + main_~j~0#1; {306#(<= (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~j~0#1| oldRank0))} is VALID [2022-02-21 03:59:37,871 INFO L290 TraceCheckUtils]: 1: Hoare triple {306#(<= (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~j~0#1| oldRank0))} assume !(main_~j~0#1 >= main_~n~0#1); {310#(and (<= (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~j~0#1| oldRank0)) (not (<= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~j~0#1|)))} is VALID [2022-02-21 03:59:37,871 INFO L290 TraceCheckUtils]: 2: Hoare triple {310#(and (<= (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~j~0#1| oldRank0)) (not (<= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~j~0#1|)))} assume !false;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_~k~0#1 >= 0 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {310#(and (<= (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~j~0#1| oldRank0)) (not (<= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~j~0#1|)))} is VALID [2022-02-21 03:59:37,872 INFO L290 TraceCheckUtils]: 3: Hoare triple {310#(and (<= (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~j~0#1| oldRank0)) (not (<= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_main_~j~0#1|)))} assume !(0 == __VERIFIER_assert_~cond#1); {277#(or unseeded (and (>= oldRank0 0) (> oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~n~0#1|))))} is VALID [2022-02-21 03:59:37,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:59:37,872 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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-21 03:59:37,880 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:59:37,881 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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) Stem has 9 letters. Loop has 4 letters. [2022-02-21 03:59:37,881 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:37,881 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2022-02-21 03:59:37,881 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states and 22 transitions. cyclomatic complexity: 9 Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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-21 03:59:37,906 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 16 states and 22 transitions. cyclomatic complexity: 9. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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) Result 27 states and 34 transitions. Complement of second has 7 states. [2022-02-21 03:59:37,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2022-02-21 03:59:37,906 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:59:37,906 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 22 transitions. cyclomatic complexity: 9 [2022-02-21 03:59:37,906 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:59:37,906 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:59:37,906 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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-21 03:59:37,907 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2022-02-21 03:59:37,907 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:59:37,907 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:59:37,907 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 34 transitions. [2022-02-21 03:59:37,907 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:59:37,907 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:59:37,907 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 16 states and 22 transitions. cyclomatic complexity: 9 [2022-02-21 03:59:37,908 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 5 examples of accepted words. [2022-02-21 03:59:37,908 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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-21 03:59:37,908 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2022-02-21 03:59:37,908 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 03:59:37,909 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 27 states and 34 transitions. cyclomatic complexity: 11 [2022-02-21 03:59:37,909 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 34 transitions. cyclomatic complexity: 11 [2022-02-21 03:59:37,909 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:59:37,909 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2022-02-21 03:59:37,909 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 22 transitions. cyclomatic complexity: 9 Stem has 9 letters. Loop has 4 letters. [2022-02-21 03:59:37,909 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:37,909 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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) Stem has 9 letters. Loop has 4 letters. [2022-02-21 03:59:37,909 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:37,909 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 34 transitions. cyclomatic complexity: 11 Stem has 9 letters. Loop has 4 letters. [2022-02-21 03:59:37,909 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:37,909 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 22 transitions. cyclomatic complexity: 9 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:59:37,909 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:37,909 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:59:37,909 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:37,909 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 34 transitions. cyclomatic complexity: 11 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:59:37,909 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:37,909 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 22 transitions. cyclomatic complexity: 9 Stem has 27 letters. Loop has 27 letters. [2022-02-21 03:59:37,909 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:37,909 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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) Stem has 27 letters. Loop has 27 letters. [2022-02-21 03:59:37,910 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:37,910 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 34 transitions. cyclomatic complexity: 11 Stem has 27 letters. Loop has 27 letters. [2022-02-21 03:59:37,910 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:37,910 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 22 transitions. cyclomatic complexity: 9 Stem has 16 letters. Loop has 16 letters. [2022-02-21 03:59:37,910 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:37,910 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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) Stem has 16 letters. Loop has 16 letters. [2022-02-21 03:59:37,910 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:37,910 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 34 transitions. cyclomatic complexity: 11 Stem has 16 letters. Loop has 16 letters. [2022-02-21 03:59:37,910 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:37,910 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 22 transitions. cyclomatic complexity: 9 Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:59:37,910 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:37,910 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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) Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:59:37,910 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:37,910 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 34 transitions. cyclomatic complexity: 11 Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:59:37,910 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:37,911 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 22 transitions. cyclomatic complexity: 9 Stem has 11 letters. Loop has 4 letters. [2022-02-21 03:59:37,911 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:37,911 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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) Stem has 11 letters. Loop has 4 letters. [2022-02-21 03:59:37,911 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:37,911 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 34 transitions. cyclomatic complexity: 11 Stem has 11 letters. Loop has 4 letters. [2022-02-21 03:59:37,911 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:37,911 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 22 transitions. cyclomatic complexity: 9 Stem has 13 letters. Loop has 5 letters. [2022-02-21 03:59:37,911 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:37,911 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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) Stem has 13 letters. Loop has 5 letters. [2022-02-21 03:59:37,911 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:37,911 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 34 transitions. cyclomatic complexity: 11 Stem has 13 letters. Loop has 5 letters. [2022-02-21 03:59:37,911 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:37,911 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 22 transitions. cyclomatic complexity: 9 Stem has 12 letters. Loop has 4 letters. [2022-02-21 03:59:37,911 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:37,911 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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) Stem has 12 letters. Loop has 4 letters. [2022-02-21 03:59:37,912 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:37,912 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 34 transitions. cyclomatic complexity: 11 Stem has 12 letters. Loop has 4 letters. [2022-02-21 03:59:37,912 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:37,912 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 22 transitions. cyclomatic complexity: 9 Stem has 9 letters. Loop has 4 letters. [2022-02-21 03:59:37,912 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:37,912 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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) Stem has 9 letters. Loop has 4 letters. [2022-02-21 03:59:37,912 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:37,912 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 34 transitions. cyclomatic complexity: 11 Stem has 9 letters. Loop has 4 letters. [2022-02-21 03:59:37,912 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:37,912 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 22 transitions. cyclomatic complexity: 9 Stem has 10 letters. Loop has 4 letters. [2022-02-21 03:59:37,912 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:37,912 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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) Stem has 10 letters. Loop has 4 letters. [2022-02-21 03:59:37,912 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:37,912 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 34 transitions. cyclomatic complexity: 11 Stem has 10 letters. Loop has 4 letters. [2022-02-21 03:59:37,912 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:37,912 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 22 transitions. cyclomatic complexity: 9 Stem has 3 letters. Loop has 1 letters. [2022-02-21 03:59:37,912 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:37,913 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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) Stem has 3 letters. Loop has 1 letters. [2022-02-21 03:59:37,913 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:37,913 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 34 transitions. cyclomatic complexity: 11 Stem has 3 letters. Loop has 1 letters. [2022-02-21 03:59:37,913 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:37,913 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 22 transitions. cyclomatic complexity: 9 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:59:37,913 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:37,913 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:59:37,913 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:37,913 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 34 transitions. cyclomatic complexity: 11 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:59:37,913 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:37,913 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:59:37,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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-21 03:59:37,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 25 transitions. [2022-02-21 03:59:37,914 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 25 transitions. Stem has 9 letters. Loop has 4 letters. [2022-02-21 03:59:37,914 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:37,914 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 25 transitions. Stem has 13 letters. Loop has 4 letters. [2022-02-21 03:59:37,914 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:37,914 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 25 transitions. Stem has 9 letters. Loop has 8 letters. [2022-02-21 03:59:37,914 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:59:37,915 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 34 transitions. cyclomatic complexity: 11 [2022-02-21 03:59:37,915 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:59:37,915 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 0 states and 0 transitions. [2022-02-21 03:59:37,915 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2022-02-21 03:59:37,915 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2022-02-21 03:59:37,916 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2022-02-21 03:59:37,916 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:59:37,916 INFO L681 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 03:59:37,916 INFO L704 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 03:59:37,916 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:59:37,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-21 03:59:37,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-21 03:59:37,919 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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-21 03:59:37,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:59:37,919 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-21 03:59:37,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-21 03:59:37,919 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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-21 03:59:37,928 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:59:37,928 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2022-02-21 03:59:37,928 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:59:37,928 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2022-02-21 03:59:37,928 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2022-02-21 03:59:37,928 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2022-02-21 03:59:37,929 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2022-02-21 03:59:37,929 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:59:37,929 INFO L681 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 03:59:37,929 INFO L704 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 03:59:37,929 INFO L587 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 03:59:37,929 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2022-02-21 03:59:37,929 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2022-02-21 03:59:37,929 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:59:37,929 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:59:37,933 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 21.02 03:59:37 BoogieIcfgContainer [2022-02-21 03:59:37,933 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-02-21 03:59:37,934 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-21 03:59:37,934 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-21 03:59:37,934 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-21 03:59:37,934 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:59:35" (3/4) ... [2022-02-21 03:59:37,936 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-02-21 03:59:37,936 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-21 03:59:37,937 INFO L158 Benchmark]: Toolchain (without parser) took 3222.98ms. Allocated memory was 98.6MB in the beginning and 136.3MB in the end (delta: 37.7MB). Free memory was 59.6MB in the beginning and 41.4MB in the end (delta: 18.1MB). Peak memory consumption was 57.1MB. Max. memory is 16.1GB. [2022-02-21 03:59:37,937 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 98.6MB. Free memory was 76.7MB in the beginning and 76.6MB in the end (delta: 88.8kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:59:37,937 INFO L158 Benchmark]: CACSL2BoogieTranslator took 201.53ms. Allocated memory is still 98.6MB. Free memory was 59.4MB in the beginning and 49.1MB in the end (delta: 10.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-02-21 03:59:37,937 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.90ms. Allocated memory is still 98.6MB. Free memory was 49.0MB in the beginning and 47.4MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:59:37,938 INFO L158 Benchmark]: Boogie Preprocessor took 32.04ms. Allocated memory is still 98.6MB. Free memory was 47.4MB in the beginning and 46.4MB in the end (delta: 1.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 03:59:37,938 INFO L158 Benchmark]: RCFGBuilder took 231.31ms. Allocated memory was 98.6MB in the beginning and 136.3MB in the end (delta: 37.7MB). Free memory was 46.3MB in the beginning and 113.0MB in the end (delta: -66.7MB). Peak memory consumption was 15.0MB. Max. memory is 16.1GB. [2022-02-21 03:59:37,938 INFO L158 Benchmark]: BuchiAutomizer took 2721.44ms. Allocated memory is still 136.3MB. Free memory was 113.0MB in the beginning and 41.4MB in the end (delta: 71.6MB). Peak memory consumption was 71.4MB. Max. memory is 16.1GB. [2022-02-21 03:59:37,938 INFO L158 Benchmark]: Witness Printer took 2.13ms. Allocated memory is still 136.3MB. Free memory is still 41.4MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:59:37,940 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.17ms. Allocated memory is still 98.6MB. Free memory was 76.7MB in the beginning and 76.6MB in the end (delta: 88.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 201.53ms. Allocated memory is still 98.6MB. Free memory was 59.4MB in the beginning and 49.1MB in the end (delta: 10.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 29.90ms. Allocated memory is still 98.6MB. Free memory was 49.0MB in the beginning and 47.4MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 32.04ms. Allocated memory is still 98.6MB. Free memory was 47.4MB in the beginning and 46.4MB in the end (delta: 1.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 231.31ms. Allocated memory was 98.6MB in the beginning and 136.3MB in the end (delta: 37.7MB). Free memory was 46.3MB in the beginning and 113.0MB in the end (delta: -66.7MB). Peak memory consumption was 15.0MB. Max. memory is 16.1GB. * BuchiAutomizer took 2721.44ms. Allocated memory is still 136.3MB. Free memory was 113.0MB in the beginning and 41.4MB in the end (delta: 71.6MB). Peak memory consumption was 71.4MB. Max. memory is 16.1GB. * Witness Printer took 2.13ms. Allocated memory is still 136.3MB. Free memory is still 41.4MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 4 terminating modules (1 trivial, 3 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -2 * i + 2000001 and consists of 4 locations. One deterministic module has affine ranking function -2 * i + 2000001 and consists of 4 locations. One deterministic module has affine ranking function -1 * j + n and consists of 5 locations. 1 modules have a trivial ranking function, the largest among these consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.6s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 2.0s. Construction of modules took 0.0s. Büchi inclusion checks took 0.5s. Highest rank in rank-based complementation 3. Minimization of det autom 4. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 16 states and ocurred in iteration 2. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 34 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 34 mSDsluCounter, 37 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 9 mSDsCounter, 6 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 20 IncrementalHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6 mSolverCounterUnsat, 28 mSDtfsCounter, 20 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT2 conc0 concLT1 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital21 mio100 ax100 hnf100 lsp55 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq165 hnf92 smp100 dnf100 smp100 tf112 neg100 sie103 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 43ms VariablesStem: 0 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 2 LassoNonterminationAnalysisUnsat: 3 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.7s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2022-02-21 03:59:37,961 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2022-02-21 03:59:38,175 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE