./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-restricted-15/Narrowing.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 6b4ec56b Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91a165d0-ab4c-4573-9f37-beaecc793f82/bin/uautomizer-ug76WZFUDN/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91a165d0-ab4c-4573-9f37-beaecc793f82/bin/uautomizer-ug76WZFUDN/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91a165d0-ab4c-4573-9f37-beaecc793f82/bin/uautomizer-ug76WZFUDN/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91a165d0-ab4c-4573-9f37-beaecc793f82/bin/uautomizer-ug76WZFUDN/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-restricted-15/Narrowing.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91a165d0-ab4c-4573-9f37-beaecc793f82/bin/uautomizer-ug76WZFUDN/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91a165d0-ab4c-4573-9f37-beaecc793f82/bin/uautomizer-ug76WZFUDN --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 64bit --witnessprinter.graph.data.programhash 65d96571ae692dc892a607d17412b050d92bd8365fc1d6c09a627f6750d6e1ac --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-6b4ec56 [2022-11-20 12:07:43,844 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-20 12:07:43,847 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-20 12:07:43,889 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-20 12:07:43,893 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-20 12:07:43,895 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-20 12:07:43,897 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-20 12:07:43,903 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-20 12:07:43,905 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-20 12:07:43,907 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-20 12:07:43,908 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-20 12:07:43,910 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-20 12:07:43,912 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-20 12:07:43,915 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-20 12:07:43,917 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-20 12:07:43,919 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-20 12:07:43,921 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-20 12:07:43,928 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-20 12:07:43,930 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-20 12:07:43,932 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-20 12:07:43,934 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-20 12:07:43,935 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-20 12:07:43,936 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-20 12:07:43,937 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-20 12:07:43,941 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-20 12:07:43,941 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-20 12:07:43,942 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-20 12:07:43,943 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-20 12:07:43,943 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-20 12:07:43,944 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-20 12:07:43,945 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-20 12:07:43,946 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-20 12:07:43,947 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-20 12:07:43,947 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-20 12:07:43,949 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-20 12:07:43,949 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-20 12:07:43,950 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-20 12:07:43,950 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-20 12:07:43,951 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-20 12:07:43,952 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-20 12:07:43,953 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-20 12:07:43,954 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91a165d0-ab4c-4573-9f37-beaecc793f82/bin/uautomizer-ug76WZFUDN/config/svcomp-Termination-64bit-Automizer_Default.epf [2022-11-20 12:07:43,976 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-20 12:07:43,976 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-20 12:07:43,977 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-20 12:07:43,977 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-20 12:07:43,978 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-20 12:07:43,978 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-20 12:07:43,979 INFO L138 SettingsManager]: * Use SBE=true [2022-11-20 12:07:43,979 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-11-20 12:07:43,979 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-11-20 12:07:43,979 INFO L138 SettingsManager]: * Use old map elimination=false [2022-11-20 12:07:43,980 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-11-20 12:07:43,980 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-11-20 12:07:43,980 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-11-20 12:07:43,980 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-20 12:07:43,981 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-20 12:07:43,981 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-20 12:07:43,981 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-20 12:07:43,981 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-11-20 12:07:43,982 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-11-20 12:07:43,982 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-11-20 12:07:43,982 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-20 12:07:43,982 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-11-20 12:07:43,983 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-20 12:07:43,983 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-11-20 12:07:43,983 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-20 12:07:43,983 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-20 12:07:43,984 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-20 12:07:43,984 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-20 12:07:43,985 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-11-20 12:07:43,985 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:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91a165d0-ab4c-4573-9f37-beaecc793f82/bin/uautomizer-ug76WZFUDN/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91a165d0-ab4c-4573-9f37-beaecc793f82/bin/uautomizer-ug76WZFUDN 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 65d96571ae692dc892a607d17412b050d92bd8365fc1d6c09a627f6750d6e1ac [2022-11-20 12:07:44,250 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-20 12:07:44,289 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-20 12:07:44,293 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-20 12:07:44,294 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-20 12:07:44,296 INFO L275 PluginConnector]: CDTParser initialized [2022-11-20 12:07:44,297 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91a165d0-ab4c-4573-9f37-beaecc793f82/bin/uautomizer-ug76WZFUDN/../../sv-benchmarks/c/termination-restricted-15/Narrowing.c [2022-11-20 12:07:47,420 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-20 12:07:47,638 INFO L351 CDTParser]: Found 1 translation units. [2022-11-20 12:07:47,640 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91a165d0-ab4c-4573-9f37-beaecc793f82/sv-benchmarks/c/termination-restricted-15/Narrowing.c [2022-11-20 12:07:47,646 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91a165d0-ab4c-4573-9f37-beaecc793f82/bin/uautomizer-ug76WZFUDN/data/38b5d00e0/6ff4854abc7749318c9e8bf45c528caf/FLAG5455510dd [2022-11-20 12:07:47,664 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91a165d0-ab4c-4573-9f37-beaecc793f82/bin/uautomizer-ug76WZFUDN/data/38b5d00e0/6ff4854abc7749318c9e8bf45c528caf [2022-11-20 12:07:47,670 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-20 12:07:47,671 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-20 12:07:47,674 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-20 12:07:47,674 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-20 12:07:47,678 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-20 12:07:47,679 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 12:07:47" (1/1) ... [2022-11-20 12:07:47,680 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@62a58e77 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:07:47, skipping insertion in model container [2022-11-20 12:07:47,680 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 12:07:47" (1/1) ... [2022-11-20 12:07:47,687 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-20 12:07:47,702 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-20 12:07:47,873 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 12:07:47,879 INFO L203 MainTranslator]: Completed pre-run [2022-11-20 12:07:47,890 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 12:07:47,901 INFO L208 MainTranslator]: Completed translation [2022-11-20 12:07:47,902 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:07:47 WrapperNode [2022-11-20 12:07:47,902 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-20 12:07:47,903 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-20 12:07:47,903 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-20 12:07:47,904 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-20 12:07:47,911 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:07:47" (1/1) ... [2022-11-20 12:07:47,916 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:07:47" (1/1) ... [2022-11-20 12:07:47,934 INFO L138 Inliner]: procedures = 4, calls = 2, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 25 [2022-11-20 12:07:47,935 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-20 12:07:47,938 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-20 12:07:47,938 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-20 12:07:47,938 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-20 12:07:47,948 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:07:47" (1/1) ... [2022-11-20 12:07:47,949 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:07:47" (1/1) ... [2022-11-20 12:07:47,950 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:07:47" (1/1) ... [2022-11-20 12:07:47,950 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:07:47" (1/1) ... [2022-11-20 12:07:47,953 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:07:47" (1/1) ... [2022-11-20 12:07:47,956 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:07:47" (1/1) ... [2022-11-20 12:07:47,957 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:07:47" (1/1) ... [2022-11-20 12:07:47,957 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:07:47" (1/1) ... [2022-11-20 12:07:47,958 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-20 12:07:47,959 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-20 12:07:47,959 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-20 12:07:47,960 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-20 12:07:47,960 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:07:47" (1/1) ... [2022-11-20 12:07:47,967 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 12:07:47,983 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91a165d0-ab4c-4573-9f37-beaecc793f82/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:07:47,997 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91a165d0-ab4c-4573-9f37-beaecc793f82/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 12:07:48,021 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91a165d0-ab4c-4573-9f37-beaecc793f82/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2022-11-20 12:07:48,049 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-20 12:07:48,049 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-20 12:07:48,112 INFO L235 CfgBuilder]: Building ICFG [2022-11-20 12:07:48,114 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-20 12:07:48,183 INFO L276 CfgBuilder]: Performing block encoding [2022-11-20 12:07:48,189 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-20 12:07:48,189 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-20 12:07:48,191 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 12:07:48 BoogieIcfgContainer [2022-11-20 12:07:48,191 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-20 12:07:48,193 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-11-20 12:07:48,193 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-11-20 12:07:48,197 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-11-20 12:07:48,197 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-11-20 12:07:48,198 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 20.11 12:07:47" (1/3) ... [2022-11-20 12:07:48,199 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@47781b50 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 20.11 12:07:48, skipping insertion in model container [2022-11-20 12:07:48,199 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-11-20 12:07:48,199 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:07:47" (2/3) ... [2022-11-20 12:07:48,199 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@47781b50 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 20.11 12:07:48, skipping insertion in model container [2022-11-20 12:07:48,200 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-11-20 12:07:48,200 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 12:07:48" (3/3) ... [2022-11-20 12:07:48,201 INFO L332 chiAutomizerObserver]: Analyzing ICFG Narrowing.c [2022-11-20 12:07:48,256 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2022-11-20 12:07:48,256 INFO L304 stractBuchiCegarLoop]: Hoare is false [2022-11-20 12:07:48,256 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-11-20 12:07:48,257 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-11-20 12:07:48,257 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-11-20 12:07:48,257 INFO L308 stractBuchiCegarLoop]: Difference is false [2022-11-20 12:07:48,257 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-11-20 12:07:48,257 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-11-20 12:07:48,262 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 12 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 11 states have internal predecessors, (18), 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-11-20 12:07:48,278 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2022-11-20 12:07:48,278 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-20 12:07:48,279 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-20 12:07:48,283 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-11-20 12:07:48,283 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2022-11-20 12:07:48,283 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-11-20 12:07:48,284 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 12 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 11 states have internal predecessors, (18), 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-11-20 12:07:48,284 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2022-11-20 12:07:48,285 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-20 12:07:48,285 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-20 12:07:48,285 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-11-20 12:07:48,285 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2022-11-20 12:07:48,292 INFO L748 eck$LassoCheckResult]: Stem: 3#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true; 8#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~range~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~range~0#1;havoc main_~up~0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~range~0#1 := 20;main_~up~0#1 := 0; 4#L26-1true [2022-11-20 12:07:48,292 INFO L750 eck$LassoCheckResult]: Loop: 4#L26-1true assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 11#L14true assume !(0 == main_~i~0#1); 12#L14-2true assume main_~i~0#1 == main_~range~0#1;main_~up~0#1 := 0; 9#L17-1true assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 6#L20-1true assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 10#L23-1true assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 4#L26-1true [2022-11-20 12:07:48,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:07:48,298 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2022-11-20 12:07:48,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:07:48,307 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791381893] [2022-11-20 12:07:48,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:07:48,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:07:48,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 12:07:48,386 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 12:07:48,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 12:07:48,405 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-20 12:07:48,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:07:48,408 INFO L85 PathProgramCache]: Analyzing trace with hash 1217822514, now seen corresponding path program 1 times [2022-11-20 12:07:48,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:07:48,409 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127998310] [2022-11-20 12:07:48,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:07:48,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:07:48,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:07:48,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:07:48,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:07:48,548 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127998310] [2022-11-20 12:07:48,549 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1127998310] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:07:48,549 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:07:48,549 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 12:07:48,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806985243] [2022-11-20 12:07:48,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:07:48,554 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-20 12:07:48,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:07:48,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 12:07:48,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 12:07:48,639 INFO L87 Difference]: Start difference. First operand has 12 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 11 states have internal predecessors, (18), 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 3 states, 3 states have (on average 2.0) internal successors, (6), 3 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-11-20 12:07:48,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:07:48,700 INFO L93 Difference]: Finished difference Result 22 states and 31 transitions. [2022-11-20 12:07:48,701 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 31 transitions. [2022-11-20 12:07:48,702 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2022-11-20 12:07:48,705 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 14 states and 23 transitions. [2022-11-20 12:07:48,706 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2022-11-20 12:07:48,706 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2022-11-20 12:07:48,707 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 23 transitions. [2022-11-20 12:07:48,707 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:07:48,707 INFO L218 hiAutomatonCegarLoop]: Abstraction has 14 states and 23 transitions. [2022-11-20 12:07:48,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 23 transitions. [2022-11-20 12:07:48,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2022-11-20 12:07:48,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 13 states have internal predecessors, (23), 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-11-20 12:07:48,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 23 transitions. [2022-11-20 12:07:48,758 INFO L240 hiAutomatonCegarLoop]: Abstraction has 14 states and 23 transitions. [2022-11-20 12:07:48,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 12:07:48,762 INFO L428 stractBuchiCegarLoop]: Abstraction has 14 states and 23 transitions. [2022-11-20 12:07:48,763 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-11-20 12:07:48,763 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 23 transitions. [2022-11-20 12:07:48,764 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2022-11-20 12:07:48,764 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-20 12:07:48,764 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-20 12:07:48,764 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-11-20 12:07:48,764 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2022-11-20 12:07:48,765 INFO L748 eck$LassoCheckResult]: Stem: 43#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 44#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~range~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~range~0#1;havoc main_~up~0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~range~0#1 := 20;main_~up~0#1 := 0; 50#L26-1 [2022-11-20 12:07:48,765 INFO L750 eck$LassoCheckResult]: Loop: 50#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 56#L14 assume 0 == main_~i~0#1;main_~up~0#1 := 1; 53#L14-2 assume main_~i~0#1 == main_~range~0#1;main_~up~0#1 := 0; 51#L17-1 assume !(1 == main_~up~0#1); 52#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 48#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 50#L26-1 [2022-11-20 12:07:48,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:07:48,766 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2022-11-20 12:07:48,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:07:48,766 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742338430] [2022-11-20 12:07:48,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:07:48,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:07:48,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 12:07:48,771 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 12:07:48,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 12:07:48,775 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-20 12:07:48,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:07:48,775 INFO L85 PathProgramCache]: Analyzing trace with hash 1215977394, now seen corresponding path program 1 times [2022-11-20 12:07:48,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:07:48,776 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456461460] [2022-11-20 12:07:48,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:07:48,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:07:48,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:07:48,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:07:48,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:07:48,827 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456461460] [2022-11-20 12:07:48,827 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1456461460] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:07:48,827 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:07:48,828 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 12:07:48,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858725148] [2022-11-20 12:07:48,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:07:48,828 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-20 12:07:48,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:07:48,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-20 12:07:48,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-20 12:07:48,830 INFO L87 Difference]: Start difference. First operand 14 states and 23 transitions. cyclomatic complexity: 10 Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 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-11-20 12:07:48,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:07:48,886 INFO L93 Difference]: Finished difference Result 38 states and 61 transitions. [2022-11-20 12:07:48,886 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 61 transitions. [2022-11-20 12:07:48,887 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 36 [2022-11-20 12:07:48,890 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 38 states and 61 transitions. [2022-11-20 12:07:48,890 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 38 [2022-11-20 12:07:48,890 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 38 [2022-11-20 12:07:48,890 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 61 transitions. [2022-11-20 12:07:48,891 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:07:48,891 INFO L218 hiAutomatonCegarLoop]: Abstraction has 38 states and 61 transitions. [2022-11-20 12:07:48,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states and 61 transitions. [2022-11-20 12:07:48,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2022-11-20 12:07:48,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 38 states have (on average 1.605263157894737) internal successors, (61), 37 states have internal predecessors, (61), 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-11-20 12:07:48,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 61 transitions. [2022-11-20 12:07:48,896 INFO L240 hiAutomatonCegarLoop]: Abstraction has 38 states and 61 transitions. [2022-11-20 12:07:48,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-20 12:07:48,897 INFO L428 stractBuchiCegarLoop]: Abstraction has 38 states and 61 transitions. [2022-11-20 12:07:48,897 INFO L335 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-11-20 12:07:48,898 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 61 transitions. [2022-11-20 12:07:48,899 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 36 [2022-11-20 12:07:48,899 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-20 12:07:48,899 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-20 12:07:48,899 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-11-20 12:07:48,900 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2022-11-20 12:07:48,900 INFO L748 eck$LassoCheckResult]: Stem: 102#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 103#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~range~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~range~0#1;havoc main_~up~0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~range~0#1 := 20;main_~up~0#1 := 0; 109#L26-1 [2022-11-20 12:07:48,900 INFO L750 eck$LassoCheckResult]: Loop: 109#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 126#L14 assume 0 == main_~i~0#1;main_~up~0#1 := 1; 123#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 120#L17-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 121#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 118#L23-1 assume !(main_~i~0#1 == main_~range~0#1 - 2); 109#L26-1 [2022-11-20 12:07:48,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:07:48,901 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2022-11-20 12:07:48,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:07:48,901 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631530058] [2022-11-20 12:07:48,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:07:48,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:07:48,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 12:07:48,909 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 12:07:48,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 12:07:48,915 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-20 12:07:48,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:07:48,918 INFO L85 PathProgramCache]: Analyzing trace with hash 1216035056, now seen corresponding path program 1 times [2022-11-20 12:07:48,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:07:48,918 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744404535] [2022-11-20 12:07:48,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:07:48,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:07:48,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:07:48,950 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:07:48,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:07:48,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744404535] [2022-11-20 12:07:48,951 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1744404535] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:07:48,951 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:07:48,951 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 12:07:48,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778424615] [2022-11-20 12:07:48,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:07:48,952 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-20 12:07:48,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:07:48,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 12:07:48,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 12:07:48,953 INFO L87 Difference]: Start difference. First operand 38 states and 61 transitions. cyclomatic complexity: 24 Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 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-11-20 12:07:48,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:07:48,969 INFO L93 Difference]: Finished difference Result 38 states and 58 transitions. [2022-11-20 12:07:48,970 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 58 transitions. [2022-11-20 12:07:48,971 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 36 [2022-11-20 12:07:48,972 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 38 states and 58 transitions. [2022-11-20 12:07:48,972 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 38 [2022-11-20 12:07:48,973 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 38 [2022-11-20 12:07:48,973 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 58 transitions. [2022-11-20 12:07:48,973 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 12:07:48,973 INFO L218 hiAutomatonCegarLoop]: Abstraction has 38 states and 58 transitions. [2022-11-20 12:07:48,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states and 58 transitions. [2022-11-20 12:07:48,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 32. [2022-11-20 12:07:48,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 32 states have (on average 1.53125) internal successors, (49), 31 states have internal predecessors, (49), 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-11-20 12:07:48,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 49 transitions. [2022-11-20 12:07:48,978 INFO L240 hiAutomatonCegarLoop]: Abstraction has 32 states and 49 transitions. [2022-11-20 12:07:48,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 12:07:48,979 INFO L428 stractBuchiCegarLoop]: Abstraction has 32 states and 49 transitions. [2022-11-20 12:07:48,979 INFO L335 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-11-20 12:07:48,980 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 49 transitions. [2022-11-20 12:07:48,980 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 30 [2022-11-20 12:07:48,981 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-20 12:07:48,981 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-20 12:07:48,981 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-11-20 12:07:48,981 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2022-11-20 12:07:48,981 INFO L748 eck$LassoCheckResult]: Stem: 184#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 185#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~range~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~range~0#1;havoc main_~up~0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~range~0#1 := 20;main_~up~0#1 := 0; 190#L26-1 [2022-11-20 12:07:48,982 INFO L750 eck$LassoCheckResult]: Loop: 190#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 201#L14 assume !(0 == main_~i~0#1); 207#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 205#L17-1 assume !(1 == main_~up~0#1); 204#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 202#L23-1 assume !(main_~i~0#1 == main_~range~0#1 - 2); 190#L26-1 [2022-11-20 12:07:48,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:07:48,982 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2022-11-20 12:07:48,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:07:48,983 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3204737] [2022-11-20 12:07:48,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:07:48,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:07:48,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 12:07:48,987 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 12:07:48,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 12:07:48,990 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-20 12:07:48,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:07:48,990 INFO L85 PathProgramCache]: Analyzing trace with hash 1217884020, now seen corresponding path program 1 times [2022-11-20 12:07:48,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:07:48,991 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141585892] [2022-11-20 12:07:48,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:07:48,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:07:48,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 12:07:48,998 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 12:07:49,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 12:07:49,003 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-20 12:07:49,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:07:49,004 INFO L85 PathProgramCache]: Analyzing trace with hash 297933238, now seen corresponding path program 1 times [2022-11-20 12:07:49,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:07:49,004 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028199183] [2022-11-20 12:07:49,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:07:49,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:07:49,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 12:07:49,030 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 12:07:49,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 12:07:49,041 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-20 12:07:49,153 INFO L210 LassoAnalysis]: Preferences: [2022-11-20 12:07:49,153 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-11-20 12:07:49,153 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-11-20 12:07:49,154 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-11-20 12:07:49,154 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-11-20 12:07:49,154 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 12:07:49,154 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-11-20 12:07:49,154 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-11-20 12:07:49,154 INFO L133 ssoRankerPreferences]: Filename of dumped script: Narrowing.c_Iteration4_Loop [2022-11-20 12:07:49,154 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-11-20 12:07:49,155 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-11-20 12:07:49,180 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 12:07:49,193 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 12:07:49,197 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 12:07:49,214 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 12:07:49,323 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-11-20 12:07:49,324 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-11-20 12:07:49,332 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 12:07:49,333 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91a165d0-ab4c-4573-9f37-beaecc793f82/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:07:49,340 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91a165d0-ab4c-4573-9f37-beaecc793f82/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 12:07:49,346 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-11-20 12:07:49,346 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-11-20 12:07:49,360 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91a165d0-ab4c-4573-9f37-beaecc793f82/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2022-11-20 12:07:49,371 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-11-20 12:07:49,371 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_1=1} Honda state: {v_rep~unnamed0~0~true_1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-11-20 12:07:49,376 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91a165d0-ab4c-4573-9f37-beaecc793f82/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2022-11-20 12:07:49,377 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 12:07:49,377 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91a165d0-ab4c-4573-9f37-beaecc793f82/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:07:49,378 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91a165d0-ab4c-4573-9f37-beaecc793f82/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 12:07:49,381 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91a165d0-ab4c-4573-9f37-beaecc793f82/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2022-11-20 12:07:49,383 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-11-20 12:07:49,383 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-11-20 12:07:49,406 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-11-20 12:07:49,406 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_1=0} Honda state: {v_rep~unnamed0~0~false_1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-11-20 12:07:49,410 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91a165d0-ab4c-4573-9f37-beaecc793f82/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2022-11-20 12:07:49,410 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 12:07:49,410 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91a165d0-ab4c-4573-9f37-beaecc793f82/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:07:49,412 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91a165d0-ab4c-4573-9f37-beaecc793f82/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 12:07:49,416 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91a165d0-ab4c-4573-9f37-beaecc793f82/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2022-11-20 12:07:49,417 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-11-20 12:07:49,417 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-11-20 12:07:49,447 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91a165d0-ab4c-4573-9f37-beaecc793f82/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2022-11-20 12:07:49,448 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 12:07:49,448 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91a165d0-ab4c-4573-9f37-beaecc793f82/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:07:49,449 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91a165d0-ab4c-4573-9f37-beaecc793f82/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 12:07:49,465 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91a165d0-ab4c-4573-9f37-beaecc793f82/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2022-11-20 12:07:49,469 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-11-20 12:07:49,472 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-11-20 12:07:49,516 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-11-20 12:07:49,529 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91a165d0-ab4c-4573-9f37-beaecc793f82/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2022-11-20 12:07:49,530 INFO L210 LassoAnalysis]: Preferences: [2022-11-20 12:07:49,530 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-11-20 12:07:49,530 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-11-20 12:07:49,530 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-11-20 12:07:49,530 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-11-20 12:07:49,530 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 12:07:49,530 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-11-20 12:07:49,530 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-11-20 12:07:49,531 INFO L133 ssoRankerPreferences]: Filename of dumped script: Narrowing.c_Iteration4_Loop [2022-11-20 12:07:49,531 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-11-20 12:07:49,531 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-11-20 12:07:49,533 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 12:07:49,537 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 12:07:49,557 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 12:07:49,563 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 12:07:49,665 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-11-20 12:07:49,670 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-11-20 12:07:49,671 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 12:07:49,672 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91a165d0-ab4c-4573-9f37-beaecc793f82/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:07:49,676 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91a165d0-ab4c-4573-9f37-beaecc793f82/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 12:07:49,684 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91a165d0-ab4c-4573-9f37-beaecc793f82/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2022-11-20 12:07:49,685 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-11-20 12:07:49,698 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-20 12:07:49,699 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-20 12:07:49,699 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-20 12:07:49,699 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-20 12:07:49,703 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-20 12:07:49,704 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-20 12:07:49,720 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-20 12:07:49,724 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91a165d0-ab4c-4573-9f37-beaecc793f82/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2022-11-20 12:07:49,725 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 12:07:49,725 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91a165d0-ab4c-4573-9f37-beaecc793f82/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:07:49,726 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91a165d0-ab4c-4573-9f37-beaecc793f82/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 12:07:49,733 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91a165d0-ab4c-4573-9f37-beaecc793f82/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2022-11-20 12:07:49,734 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-11-20 12:07:49,744 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-20 12:07:49,744 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-20 12:07:49,744 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-20 12:07:49,745 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-20 12:07:49,745 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-20 12:07:49,746 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-20 12:07:49,747 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-20 12:07:49,761 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-11-20 12:07:49,767 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-11-20 12:07:49,768 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2022-11-20 12:07:49,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 12:07:49,769 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91a165d0-ab4c-4573-9f37-beaecc793f82/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:07:49,799 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91a165d0-ab4c-4573-9f37-beaecc793f82/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 12:07:49,801 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-11-20 12:07:49,801 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-11-20 12:07:49,801 INFO L513 LassoAnalysis]: Proved termination. [2022-11-20 12:07:49,802 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = 1*ULTIMATE.start_main_~i~0#1 Supporting invariants [] [2022-11-20 12:07:49,805 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91a165d0-ab4c-4573-9f37-beaecc793f82/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2022-11-20 12:07:49,807 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91a165d0-ab4c-4573-9f37-beaecc793f82/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2022-11-20 12:07:49,810 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-11-20 12:07:49,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:07:49,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:07:49,843 INFO L263 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-20 12:07:49,845 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:07:49,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:07:49,865 INFO L263 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-20 12:07:49,867 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:07:49,956 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:07:49,960 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2022-11-20 12:07:49,961 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 32 states and 49 transitions. cyclomatic complexity: 18 Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 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-11-20 12:07:50,037 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 32 states and 49 transitions. cyclomatic complexity: 18. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 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 100 states and 152 transitions. Complement of second has 7 states. [2022-11-20 12:07:50,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2022-11-20 12:07:50,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 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-11-20 12:07:50,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2022-11-20 12:07:50,041 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 2 letters. Loop has 6 letters. [2022-11-20 12:07:50,042 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-20 12:07:50,042 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 8 letters. Loop has 6 letters. [2022-11-20 12:07:50,043 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-20 12:07:50,043 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 2 letters. Loop has 12 letters. [2022-11-20 12:07:50,043 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-20 12:07:50,043 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 100 states and 152 transitions. [2022-11-20 12:07:50,047 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 60 [2022-11-20 12:07:50,048 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 100 states to 100 states and 152 transitions. [2022-11-20 12:07:50,049 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 63 [2022-11-20 12:07:50,049 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 66 [2022-11-20 12:07:50,049 INFO L73 IsDeterministic]: Start isDeterministic. Operand 100 states and 152 transitions. [2022-11-20 12:07:50,049 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-20 12:07:50,049 INFO L218 hiAutomatonCegarLoop]: Abstraction has 100 states and 152 transitions. [2022-11-20 12:07:50,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states and 152 transitions. [2022-11-20 12:07:50,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 89. [2022-11-20 12:07:50,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 89 states have (on average 1.550561797752809) internal successors, (138), 88 states have internal predecessors, (138), 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-11-20 12:07:50,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 138 transitions. [2022-11-20 12:07:50,067 INFO L240 hiAutomatonCegarLoop]: Abstraction has 89 states and 138 transitions. [2022-11-20 12:07:50,067 INFO L428 stractBuchiCegarLoop]: Abstraction has 89 states and 138 transitions. [2022-11-20 12:07:50,067 INFO L335 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2022-11-20 12:07:50,067 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 89 states and 138 transitions. [2022-11-20 12:07:50,069 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 54 [2022-11-20 12:07:50,069 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-20 12:07:50,069 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-20 12:07:50,069 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2022-11-20 12:07:50,070 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2022-11-20 12:07:50,070 INFO L748 eck$LassoCheckResult]: Stem: 363#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 364#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~range~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~range~0#1;havoc main_~up~0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~range~0#1 := 20;main_~up~0#1 := 0; 378#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 386#L14 [2022-11-20 12:07:50,070 INFO L750 eck$LassoCheckResult]: Loop: 386#L14 assume !(0 == main_~i~0#1); 437#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 433#L17-1 assume !(1 == main_~up~0#1); 430#L20-1 assume !(0 == main_~up~0#1); 426#L23-1 assume !(main_~i~0#1 == main_~range~0#1 - 2); 425#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 386#L14 [2022-11-20 12:07:50,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:07:50,071 INFO L85 PathProgramCache]: Analyzing trace with hash 29864, now seen corresponding path program 1 times [2022-11-20 12:07:50,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:07:50,071 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211963125] [2022-11-20 12:07:50,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:07:50,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:07:50,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 12:07:50,091 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 12:07:50,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 12:07:50,098 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-20 12:07:50,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:07:50,098 INFO L85 PathProgramCache]: Analyzing trace with hash 1366755632, now seen corresponding path program 1 times [2022-11-20 12:07:50,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:07:50,099 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415538772] [2022-11-20 12:07:50,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:07:50,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:07:50,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 12:07:50,104 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 12:07:50,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 12:07:50,121 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-20 12:07:50,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:07:50,122 INFO L85 PathProgramCache]: Analyzing trace with hash 645997719, now seen corresponding path program 1 times [2022-11-20 12:07:50,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:07:50,122 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239465660] [2022-11-20 12:07:50,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:07:50,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:07:50,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:07:50,163 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:07:50,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:07:50,164 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239465660] [2022-11-20 12:07:50,164 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1239465660] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:07:50,164 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:07:50,164 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 12:07:50,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582701281] [2022-11-20 12:07:50,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:07:50,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:07:50,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 12:07:50,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 12:07:50,211 INFO L87 Difference]: Start difference. First operand 89 states and 138 transitions. cyclomatic complexity: 54 Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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-11-20 12:07:50,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:07:50,223 INFO L93 Difference]: Finished difference Result 77 states and 112 transitions. [2022-11-20 12:07:50,223 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 77 states and 112 transitions. [2022-11-20 12:07:50,225 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 38 [2022-11-20 12:07:50,226 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 77 states to 71 states and 102 transitions. [2022-11-20 12:07:50,226 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 45 [2022-11-20 12:07:50,226 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 45 [2022-11-20 12:07:50,226 INFO L73 IsDeterministic]: Start isDeterministic. Operand 71 states and 102 transitions. [2022-11-20 12:07:50,227 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-20 12:07:50,227 INFO L218 hiAutomatonCegarLoop]: Abstraction has 71 states and 102 transitions. [2022-11-20 12:07:50,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states and 102 transitions. [2022-11-20 12:07:50,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 65. [2022-11-20 12:07:50,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 65 states have (on average 1.4461538461538461) internal successors, (94), 64 states have internal predecessors, (94), 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-11-20 12:07:50,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 94 transitions. [2022-11-20 12:07:50,233 INFO L240 hiAutomatonCegarLoop]: Abstraction has 65 states and 94 transitions. [2022-11-20 12:07:50,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 12:07:50,234 INFO L428 stractBuchiCegarLoop]: Abstraction has 65 states and 94 transitions. [2022-11-20 12:07:50,234 INFO L335 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2022-11-20 12:07:50,234 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 65 states and 94 transitions. [2022-11-20 12:07:50,235 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 35 [2022-11-20 12:07:50,235 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-20 12:07:50,236 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-20 12:07:50,236 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2022-11-20 12:07:50,236 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2022-11-20 12:07:50,236 INFO L748 eck$LassoCheckResult]: Stem: 537#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 538#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~range~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~range~0#1;havoc main_~up~0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~range~0#1 := 20;main_~up~0#1 := 0; 552#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 570#L14 assume 0 == main_~i~0#1;main_~up~0#1 := 1; 584#L14-2 [2022-11-20 12:07:50,236 INFO L750 eck$LassoCheckResult]: Loop: 584#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 595#L17-1 assume !(1 == main_~up~0#1); 593#L20-1 assume !(0 == main_~up~0#1); 590#L23-1 assume !(main_~i~0#1 == main_~range~0#1 - 2); 539#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 540#L14 assume !(0 == main_~i~0#1); 584#L14-2 [2022-11-20 12:07:50,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:07:50,237 INFO L85 PathProgramCache]: Analyzing trace with hash 925798, now seen corresponding path program 1 times [2022-11-20 12:07:50,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:07:50,237 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106182289] [2022-11-20 12:07:50,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:07:50,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:07:50,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 12:07:50,242 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 12:07:50,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 12:07:50,246 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-20 12:07:50,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:07:50,247 INFO L85 PathProgramCache]: Analyzing trace with hash 1544255282, now seen corresponding path program 2 times [2022-11-20 12:07:50,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:07:50,247 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897212564] [2022-11-20 12:07:50,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:07:50,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:07:50,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 12:07:50,252 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 12:07:50,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 12:07:50,255 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-20 12:07:50,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:07:50,256 INFO L85 PathProgramCache]: Analyzing trace with hash 1071052759, now seen corresponding path program 1 times [2022-11-20 12:07:50,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:07:50,257 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60050049] [2022-11-20 12:07:50,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:07:50,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:07:50,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:07:50,301 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:07:50,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:07:50,302 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60050049] [2022-11-20 12:07:50,302 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [60050049] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:07:50,303 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:07:50,305 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-20 12:07:50,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056962866] [2022-11-20 12:07:50,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:07:50,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:07:50,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-20 12:07:50,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-20 12:07:50,364 INFO L87 Difference]: Start difference. First operand 65 states and 94 transitions. cyclomatic complexity: 33 Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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-11-20 12:07:50,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:07:50,379 INFO L93 Difference]: Finished difference Result 49 states and 66 transitions. [2022-11-20 12:07:50,379 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 66 transitions. [2022-11-20 12:07:50,383 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2022-11-20 12:07:50,383 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 47 states and 64 transitions. [2022-11-20 12:07:50,384 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 34 [2022-11-20 12:07:50,384 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 34 [2022-11-20 12:07:50,384 INFO L73 IsDeterministic]: Start isDeterministic. Operand 47 states and 64 transitions. [2022-11-20 12:07:50,385 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-20 12:07:50,385 INFO L218 hiAutomatonCegarLoop]: Abstraction has 47 states and 64 transitions. [2022-11-20 12:07:50,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states and 64 transitions. [2022-11-20 12:07:50,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 42. [2022-11-20 12:07:50,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 42 states have (on average 1.380952380952381) internal successors, (58), 41 states have internal predecessors, (58), 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-11-20 12:07:50,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 58 transitions. [2022-11-20 12:07:50,404 INFO L240 hiAutomatonCegarLoop]: Abstraction has 42 states and 58 transitions. [2022-11-20 12:07:50,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-20 12:07:50,405 INFO L428 stractBuchiCegarLoop]: Abstraction has 42 states and 58 transitions. [2022-11-20 12:07:50,405 INFO L335 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2022-11-20 12:07:50,406 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 42 states and 58 transitions. [2022-11-20 12:07:50,407 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2022-11-20 12:07:50,407 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-20 12:07:50,408 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-20 12:07:50,408 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-11-20 12:07:50,410 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2022-11-20 12:07:50,410 INFO L748 eck$LassoCheckResult]: Stem: 659#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 660#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~range~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~range~0#1;havoc main_~up~0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~range~0#1 := 20;main_~up~0#1 := 0; 676#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 677#L14 assume 0 == main_~i~0#1;main_~up~0#1 := 1; 678#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 685#L17-1 [2022-11-20 12:07:50,410 INFO L750 eck$LassoCheckResult]: Loop: 685#L17-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 665#L20-1 assume !(0 == main_~up~0#1); 666#L23-1 assume !(main_~i~0#1 == main_~range~0#1 - 2); 691#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 689#L14 assume !(0 == main_~i~0#1); 687#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 685#L17-1 [2022-11-20 12:07:50,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:07:50,411 INFO L85 PathProgramCache]: Analyzing trace with hash 28699760, now seen corresponding path program 1 times [2022-11-20 12:07:50,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:07:50,411 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404897328] [2022-11-20 12:07:50,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:07:50,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:07:50,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 12:07:50,420 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 12:07:50,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 12:07:50,429 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-20 12:07:50,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:07:50,430 INFO L85 PathProgramCache]: Analyzing trace with hash 1664464050, now seen corresponding path program 1 times [2022-11-20 12:07:50,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:07:50,431 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513113839] [2022-11-20 12:07:50,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:07:50,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:07:50,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 12:07:50,443 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 12:07:50,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 12:07:50,446 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-20 12:07:50,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:07:50,453 INFO L85 PathProgramCache]: Analyzing trace with hash -1214361119, now seen corresponding path program 1 times [2022-11-20 12:07:50,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:07:50,454 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262121073] [2022-11-20 12:07:50,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:07:50,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:07:50,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 12:07:50,463 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 12:07:50,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 12:07:50,472 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-20 12:07:50,544 INFO L210 LassoAnalysis]: Preferences: [2022-11-20 12:07:50,544 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-11-20 12:07:50,544 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-11-20 12:07:50,544 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-11-20 12:07:50,544 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-11-20 12:07:50,544 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 12:07:50,545 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-11-20 12:07:50,545 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-11-20 12:07:50,545 INFO L133 ssoRankerPreferences]: Filename of dumped script: Narrowing.c_Iteration7_Loop [2022-11-20 12:07:50,545 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-11-20 12:07:50,545 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-11-20 12:07:50,552 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 12:07:50,556 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 12:07:50,560 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 12:07:50,563 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 12:07:50,667 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91a165d0-ab4c-4573-9f37-beaecc793f82/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2022-11-20 12:07:50,735 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-11-20 12:07:50,735 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-11-20 12:07:50,736 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 12:07:50,736 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91a165d0-ab4c-4573-9f37-beaecc793f82/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:07:50,737 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91a165d0-ab4c-4573-9f37-beaecc793f82/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 12:07:50,747 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-11-20 12:07:50,747 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-11-20 12:07:50,759 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91a165d0-ab4c-4573-9f37-beaecc793f82/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2022-11-20 12:07:50,769 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-11-20 12:07:50,769 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_3=0} Honda state: {v_rep~unnamed0~0~false_3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-11-20 12:07:50,777 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91a165d0-ab4c-4573-9f37-beaecc793f82/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2022-11-20 12:07:50,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 12:07:50,778 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91a165d0-ab4c-4573-9f37-beaecc793f82/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:07:50,780 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91a165d0-ab4c-4573-9f37-beaecc793f82/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 12:07:50,789 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-11-20 12:07:50,789 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-11-20 12:07:50,800 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91a165d0-ab4c-4573-9f37-beaecc793f82/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2022-11-20 12:07:50,811 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-11-20 12:07:50,811 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_3=1} Honda state: {v_rep~unnamed0~0~true_3=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-11-20 12:07:50,816 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91a165d0-ab4c-4573-9f37-beaecc793f82/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2022-11-20 12:07:50,817 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 12:07:50,817 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91a165d0-ab4c-4573-9f37-beaecc793f82/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:07:50,818 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91a165d0-ab4c-4573-9f37-beaecc793f82/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 12:07:50,829 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-11-20 12:07:50,829 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-11-20 12:07:50,829 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91a165d0-ab4c-4573-9f37-beaecc793f82/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2022-11-20 12:07:50,842 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-11-20 12:07:50,842 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~up~0#1=1} Honda state: {ULTIMATE.start_main_~up~0#1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-11-20 12:07:50,849 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91a165d0-ab4c-4573-9f37-beaecc793f82/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2022-11-20 12:07:50,849 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 12:07:50,849 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91a165d0-ab4c-4573-9f37-beaecc793f82/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:07:50,850 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91a165d0-ab4c-4573-9f37-beaecc793f82/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 12:07:50,853 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91a165d0-ab4c-4573-9f37-beaecc793f82/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2022-11-20 12:07:50,853 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-11-20 12:07:50,853 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-11-20 12:07:50,895 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91a165d0-ab4c-4573-9f37-beaecc793f82/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2022-11-20 12:07:50,895 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 12:07:50,896 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91a165d0-ab4c-4573-9f37-beaecc793f82/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:07:50,897 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91a165d0-ab4c-4573-9f37-beaecc793f82/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 12:07:50,904 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-11-20 12:07:50,905 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-11-20 12:07:50,920 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91a165d0-ab4c-4573-9f37-beaecc793f82/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2022-11-20 12:07:51,151 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-11-20 12:07:51,154 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91a165d0-ab4c-4573-9f37-beaecc793f82/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2022-11-20 12:07:51,154 INFO L210 LassoAnalysis]: Preferences: [2022-11-20 12:07:51,154 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-11-20 12:07:51,155 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-11-20 12:07:51,155 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-11-20 12:07:51,155 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-11-20 12:07:51,155 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 12:07:51,155 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-11-20 12:07:51,155 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-11-20 12:07:51,155 INFO L133 ssoRankerPreferences]: Filename of dumped script: Narrowing.c_Iteration7_Loop [2022-11-20 12:07:51,155 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-11-20 12:07:51,155 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-11-20 12:07:51,160 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 12:07:51,165 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 12:07:51,170 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 12:07:51,173 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 12:07:51,300 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-11-20 12:07:51,300 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-11-20 12:07:51,300 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 12:07:51,300 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91a165d0-ab4c-4573-9f37-beaecc793f82/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:07:51,302 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91a165d0-ab4c-4573-9f37-beaecc793f82/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 12:07:51,312 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-11-20 12:07:51,325 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-20 12:07:51,325 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-20 12:07:51,325 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-20 12:07:51,325 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-20 12:07:51,327 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-20 12:07:51,328 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-20 12:07:51,328 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91a165d0-ab4c-4573-9f37-beaecc793f82/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2022-11-20 12:07:51,339 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-20 12:07:51,347 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91a165d0-ab4c-4573-9f37-beaecc793f82/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2022-11-20 12:07:51,348 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 12:07:51,348 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91a165d0-ab4c-4573-9f37-beaecc793f82/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:07:51,350 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91a165d0-ab4c-4573-9f37-beaecc793f82/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 12:07:51,361 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-11-20 12:07:51,362 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91a165d0-ab4c-4573-9f37-beaecc793f82/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2022-11-20 12:07:51,374 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-20 12:07:51,374 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-20 12:07:51,374 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-20 12:07:51,374 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-20 12:07:51,377 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-20 12:07:51,377 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-20 12:07:51,388 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-20 12:07:51,396 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91a165d0-ab4c-4573-9f37-beaecc793f82/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2022-11-20 12:07:51,396 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 12:07:51,396 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91a165d0-ab4c-4573-9f37-beaecc793f82/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:07:51,397 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91a165d0-ab4c-4573-9f37-beaecc793f82/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 12:07:51,409 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-11-20 12:07:51,424 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-20 12:07:51,424 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-20 12:07:51,424 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-20 12:07:51,424 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-20 12:07:51,425 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-20 12:07:51,426 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-20 12:07:51,426 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-20 12:07:51,431 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91a165d0-ab4c-4573-9f37-beaecc793f82/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2022-11-20 12:07:51,434 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-20 12:07:51,437 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91a165d0-ab4c-4573-9f37-beaecc793f82/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2022-11-20 12:07:51,437 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 12:07:51,437 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91a165d0-ab4c-4573-9f37-beaecc793f82/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:07:51,438 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91a165d0-ab4c-4573-9f37-beaecc793f82/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 12:07:51,440 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91a165d0-ab4c-4573-9f37-beaecc793f82/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2022-11-20 12:07:51,441 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-11-20 12:07:51,451 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-20 12:07:51,451 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-20 12:07:51,451 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-20 12:07:51,451 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2022-11-20 12:07:51,451 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-20 12:07:51,454 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-11-20 12:07:51,454 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-20 12:07:51,466 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-11-20 12:07:51,472 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2022-11-20 12:07:51,472 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2022-11-20 12:07:51,472 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 12:07:51,472 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91a165d0-ab4c-4573-9f37-beaecc793f82/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:07:51,473 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91a165d0-ab4c-4573-9f37-beaecc793f82/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 12:07:51,478 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91a165d0-ab4c-4573-9f37-beaecc793f82/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2022-11-20 12:07:51,478 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-11-20 12:07:51,479 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-11-20 12:07:51,479 INFO L513 LassoAnalysis]: Proved termination. [2022-11-20 12:07:51,479 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~range~0#1, ULTIMATE.start_main_~i~0#1) = 1*ULTIMATE.start_main_~range~0#1 - 1*ULTIMATE.start_main_~i~0#1 Supporting invariants [] [2022-11-20 12:07:51,492 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91a165d0-ab4c-4573-9f37-beaecc793f82/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2022-11-20 12:07:51,493 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-11-20 12:07:51,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:07:51,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:07:51,518 INFO L263 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-20 12:07:51,519 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:07:51,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:07:51,539 INFO L263 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-20 12:07:51,539 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:07:51,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:07:51,592 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2022-11-20 12:07:51,592 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 42 states and 58 transitions. cyclomatic complexity: 18 Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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-11-20 12:07:51,653 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 42 states and 58 transitions. cyclomatic complexity: 18. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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 91 states and 124 transitions. Complement of second has 7 states. [2022-11-20 12:07:51,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2022-11-20 12:07:51,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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-11-20 12:07:51,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 25 transitions. [2022-11-20 12:07:51,657 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 5 letters. Loop has 6 letters. [2022-11-20 12:07:51,658 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-20 12:07:51,658 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 11 letters. Loop has 6 letters. [2022-11-20 12:07:51,658 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-20 12:07:51,658 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 5 letters. Loop has 12 letters. [2022-11-20 12:07:51,658 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-20 12:07:51,659 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 91 states and 124 transitions. [2022-11-20 12:07:51,660 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2022-11-20 12:07:51,661 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 91 states to 78 states and 107 transitions. [2022-11-20 12:07:51,661 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 42 [2022-11-20 12:07:51,661 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 45 [2022-11-20 12:07:51,661 INFO L73 IsDeterministic]: Start isDeterministic. Operand 78 states and 107 transitions. [2022-11-20 12:07:51,661 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-20 12:07:51,662 INFO L218 hiAutomatonCegarLoop]: Abstraction has 78 states and 107 transitions. [2022-11-20 12:07:51,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states and 107 transitions. [2022-11-20 12:07:51,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 72. [2022-11-20 12:07:51,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 72 states have (on average 1.4027777777777777) internal successors, (101), 71 states have internal predecessors, (101), 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-11-20 12:07:51,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 101 transitions. [2022-11-20 12:07:51,666 INFO L240 hiAutomatonCegarLoop]: Abstraction has 72 states and 101 transitions. [2022-11-20 12:07:51,666 INFO L428 stractBuchiCegarLoop]: Abstraction has 72 states and 101 transitions. [2022-11-20 12:07:51,666 INFO L335 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2022-11-20 12:07:51,666 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 72 states and 101 transitions. [2022-11-20 12:07:51,667 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2022-11-20 12:07:51,667 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-20 12:07:51,667 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-20 12:07:51,667 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:07:51,667 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2022-11-20 12:07:51,673 INFO L748 eck$LassoCheckResult]: Stem: 849#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 850#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~range~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~range~0#1;havoc main_~up~0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~range~0#1 := 20;main_~up~0#1 := 0; 865#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 905#L14 assume !(0 == main_~i~0#1); 906#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 863#L17-1 assume !(1 == main_~up~0#1); 864#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 896#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 898#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 919#L14 assume 0 == main_~i~0#1;main_~up~0#1 := 1; 918#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 917#L17-1 [2022-11-20 12:07:51,673 INFO L750 eck$LassoCheckResult]: Loop: 917#L17-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 916#L20-1 assume !(0 == main_~up~0#1); 859#L23-1 assume !(main_~i~0#1 == main_~range~0#1 - 2); 860#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 884#L14 assume !(0 == main_~i~0#1); 882#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 917#L17-1 [2022-11-20 12:07:51,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:07:51,673 INFO L85 PathProgramCache]: Analyzing trace with hash -1968356129, now seen corresponding path program 1 times [2022-11-20 12:07:51,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:07:51,674 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533186359] [2022-11-20 12:07:51,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:07:51,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:07:51,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:07:51,716 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:07:51,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:07:51,717 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533186359] [2022-11-20 12:07:51,717 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1533186359] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 12:07:51,717 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [25780101] [2022-11-20 12:07:51,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:07:51,717 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:07:51,717 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91a165d0-ab4c-4573-9f37-beaecc793f82/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:07:51,718 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91a165d0-ab4c-4573-9f37-beaecc793f82/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 12:07:51,749 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91a165d0-ab4c-4573-9f37-beaecc793f82/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-11-20 12:07:51,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:07:51,764 INFO L263 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-20 12:07:51,764 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:07:51,787 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:07:51,788 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 12:07:51,819 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:07:51,820 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [25780101] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 12:07:51,820 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 12:07:51,820 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2022-11-20 12:07:51,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190245908] [2022-11-20 12:07:51,821 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 12:07:51,821 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-11-20 12:07:51,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:07:51,821 INFO L85 PathProgramCache]: Analyzing trace with hash 1664464050, now seen corresponding path program 2 times [2022-11-20 12:07:51,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:07:51,822 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330255653] [2022-11-20 12:07:51,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:07:51,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:07:51,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 12:07:51,826 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 12:07:51,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 12:07:51,829 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-20 12:07:51,885 INFO L210 LassoAnalysis]: Preferences: [2022-11-20 12:07:51,885 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-11-20 12:07:51,885 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-11-20 12:07:51,885 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-11-20 12:07:51,885 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-11-20 12:07:51,885 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 12:07:51,885 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-11-20 12:07:51,885 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-11-20 12:07:51,885 INFO L133 ssoRankerPreferences]: Filename of dumped script: Narrowing.c_Iteration8_Loop [2022-11-20 12:07:51,886 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-11-20 12:07:51,886 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-11-20 12:07:51,895 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 12:07:51,909 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 12:07:51,912 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 12:07:51,915 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 12:07:52,034 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-11-20 12:07:52,034 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-11-20 12:07:52,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 12:07:52,035 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91a165d0-ab4c-4573-9f37-beaecc793f82/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:07:52,040 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91a165d0-ab4c-4573-9f37-beaecc793f82/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 12:07:52,049 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-11-20 12:07:52,049 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-11-20 12:07:52,065 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91a165d0-ab4c-4573-9f37-beaecc793f82/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2022-11-20 12:07:52,082 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91a165d0-ab4c-4573-9f37-beaecc793f82/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2022-11-20 12:07:52,082 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 12:07:52,082 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91a165d0-ab4c-4573-9f37-beaecc793f82/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:07:52,083 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91a165d0-ab4c-4573-9f37-beaecc793f82/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 12:07:52,092 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-11-20 12:07:52,092 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-11-20 12:07:52,093 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91a165d0-ab4c-4573-9f37-beaecc793f82/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2022-11-20 12:07:52,339 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-11-20 12:07:52,343 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91a165d0-ab4c-4573-9f37-beaecc793f82/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2022-11-20 12:07:52,343 INFO L210 LassoAnalysis]: Preferences: [2022-11-20 12:07:52,343 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-11-20 12:07:52,343 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-11-20 12:07:52,343 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-11-20 12:07:52,343 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-11-20 12:07:52,343 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 12:07:52,343 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-11-20 12:07:52,344 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-11-20 12:07:52,344 INFO L133 ssoRankerPreferences]: Filename of dumped script: Narrowing.c_Iteration8_Loop [2022-11-20 12:07:52,344 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-11-20 12:07:52,344 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-11-20 12:07:52,345 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 12:07:52,369 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 12:07:52,373 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 12:07:52,376 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-20 12:07:52,498 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-11-20 12:07:52,498 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-11-20 12:07:52,499 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 12:07:52,499 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91a165d0-ab4c-4573-9f37-beaecc793f82/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:07:52,500 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91a165d0-ab4c-4573-9f37-beaecc793f82/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 12:07:52,512 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91a165d0-ab4c-4573-9f37-beaecc793f82/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2022-11-20 12:07:52,513 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-11-20 12:07:52,528 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-20 12:07:52,528 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-20 12:07:52,529 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-20 12:07:52,529 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2022-11-20 12:07:52,529 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-20 12:07:52,532 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-11-20 12:07:52,533 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-20 12:07:52,548 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-11-20 12:07:52,553 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2022-11-20 12:07:52,553 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2022-11-20 12:07:52,553 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-20 12:07:52,554 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91a165d0-ab4c-4573-9f37-beaecc793f82/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:07:52,559 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91a165d0-ab4c-4573-9f37-beaecc793f82/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-20 12:07:52,563 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91a165d0-ab4c-4573-9f37-beaecc793f82/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2022-11-20 12:07:52,563 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-11-20 12:07:52,565 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-11-20 12:07:52,565 INFO L513 LassoAnalysis]: Proved termination. [2022-11-20 12:07:52,565 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1, ULTIMATE.start_main_~range~0#1) = -1*ULTIMATE.start_main_~i~0#1 + 1*ULTIMATE.start_main_~range~0#1 Supporting invariants [] [2022-11-20 12:07:52,572 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91a165d0-ab4c-4573-9f37-beaecc793f82/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2022-11-20 12:07:52,573 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-11-20 12:07:52,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:07:52,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:07:52,595 INFO L263 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-20 12:07:52,596 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:07:52,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:07:52,618 INFO L263 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-20 12:07:52,619 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:07:52,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:07:52,655 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2022-11-20 12:07:52,655 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 72 states and 101 transitions. cyclomatic complexity: 34 Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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-11-20 12:07:52,692 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 72 states and 101 transitions. cyclomatic complexity: 34. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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 96 states and 136 transitions. Complement of second has 7 states. [2022-11-20 12:07:52,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2022-11-20 12:07:52,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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-11-20 12:07:52,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 25 transitions. [2022-11-20 12:07:52,694 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 11 letters. Loop has 6 letters. [2022-11-20 12:07:52,694 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-20 12:07:52,694 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2022-11-20 12:07:52,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:07:52,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:07:52,713 INFO L263 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-20 12:07:52,714 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:07:52,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:07:52,734 INFO L263 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-20 12:07:52,734 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:07:52,766 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:07:52,766 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 3 loop predicates [2022-11-20 12:07:52,767 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 72 states and 101 transitions. cyclomatic complexity: 34 Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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-11-20 12:07:52,814 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 72 states and 101 transitions. cyclomatic complexity: 34. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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 125 states and 174 transitions. Complement of second has 9 states. [2022-11-20 12:07:52,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2022-11-20 12:07:52,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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-11-20 12:07:52,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 31 transitions. [2022-11-20 12:07:52,816 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 31 transitions. Stem has 11 letters. Loop has 6 letters. [2022-11-20 12:07:52,816 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-20 12:07:52,816 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2022-11-20 12:07:52,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:07:52,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:07:52,835 INFO L263 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-20 12:07:52,836 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:07:52,864 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91a165d0-ab4c-4573-9f37-beaecc793f82/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2022-11-20 12:07:52,868 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91a165d0-ab4c-4573-9f37-beaecc793f82/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2022-11-20 12:07:52,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:07:52,886 INFO L263 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-20 12:07:52,887 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:07:52,922 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:07:52,922 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2022-11-20 12:07:52,923 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 72 states and 101 transitions. cyclomatic complexity: 34 Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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-11-20 12:07:52,955 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 72 states and 101 transitions. cyclomatic complexity: 34. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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 113 states and 165 transitions. Complement of second has 8 states. [2022-11-20 12:07:52,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2022-11-20 12:07:52,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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-11-20 12:07:52,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 29 transitions. [2022-11-20 12:07:52,957 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 29 transitions. Stem has 11 letters. Loop has 6 letters. [2022-11-20 12:07:52,957 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-20 12:07:52,957 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 29 transitions. Stem has 17 letters. Loop has 6 letters. [2022-11-20 12:07:52,958 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-20 12:07:52,958 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 29 transitions. Stem has 11 letters. Loop has 12 letters. [2022-11-20 12:07:52,959 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-20 12:07:52,959 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 113 states and 165 transitions. [2022-11-20 12:07:52,960 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 35 [2022-11-20 12:07:52,961 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 113 states to 85 states and 121 transitions. [2022-11-20 12:07:52,962 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 34 [2022-11-20 12:07:52,962 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 40 [2022-11-20 12:07:52,962 INFO L73 IsDeterministic]: Start isDeterministic. Operand 85 states and 121 transitions. [2022-11-20 12:07:52,962 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-20 12:07:52,962 INFO L218 hiAutomatonCegarLoop]: Abstraction has 85 states and 121 transitions. [2022-11-20 12:07:52,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states and 121 transitions. [2022-11-20 12:07:52,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 50. [2022-11-20 12:07:52,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 50 states have (on average 1.46) internal successors, (73), 49 states have internal predecessors, (73), 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-11-20 12:07:52,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 73 transitions. [2022-11-20 12:07:52,966 INFO L240 hiAutomatonCegarLoop]: Abstraction has 50 states and 73 transitions. [2022-11-20 12:07:52,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:07:52,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 12:07:52,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-20 12:07:52,967 INFO L87 Difference]: Start difference. First operand 50 states and 73 transitions. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 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-11-20 12:07:53,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:07:53,067 INFO L93 Difference]: Finished difference Result 209 states and 277 transitions. [2022-11-20 12:07:53,067 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 209 states and 277 transitions. [2022-11-20 12:07:53,071 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 82 [2022-11-20 12:07:53,075 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 209 states to 199 states and 266 transitions. [2022-11-20 12:07:53,075 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 95 [2022-11-20 12:07:53,077 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 95 [2022-11-20 12:07:53,077 INFO L73 IsDeterministic]: Start isDeterministic. Operand 199 states and 266 transitions. [2022-11-20 12:07:53,077 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-20 12:07:53,077 INFO L218 hiAutomatonCegarLoop]: Abstraction has 199 states and 266 transitions. [2022-11-20 12:07:53,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states and 266 transitions. [2022-11-20 12:07:53,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 174. [2022-11-20 12:07:53,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 174 states have (on average 1.3505747126436782) internal successors, (235), 173 states have internal predecessors, (235), 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-11-20 12:07:53,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 235 transitions. [2022-11-20 12:07:53,094 INFO L240 hiAutomatonCegarLoop]: Abstraction has 174 states and 235 transitions. [2022-11-20 12:07:53,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-20 12:07:53,099 INFO L428 stractBuchiCegarLoop]: Abstraction has 174 states and 235 transitions. [2022-11-20 12:07:53,099 INFO L335 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2022-11-20 12:07:53,099 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 174 states and 235 transitions. [2022-11-20 12:07:53,100 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 79 [2022-11-20 12:07:53,100 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-20 12:07:53,101 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-20 12:07:53,101 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-11-20 12:07:53,101 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1] [2022-11-20 12:07:53,101 INFO L748 eck$LassoCheckResult]: Stem: 1783#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 1784#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~range~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~range~0#1;havoc main_~up~0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~range~0#1 := 20;main_~up~0#1 := 0; 1793#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 1871#L14 assume 0 == main_~i~0#1;main_~up~0#1 := 1; 1870#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 1853#L17-1 [2022-11-20 12:07:53,101 INFO L750 eck$LassoCheckResult]: Loop: 1853#L17-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 1866#L20-1 assume !(0 == main_~up~0#1); 1864#L23-1 assume !(main_~i~0#1 == main_~range~0#1 - 2); 1860#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 1855#L14 assume !(0 == main_~i~0#1); 1852#L14-2 assume main_~i~0#1 == main_~range~0#1;main_~up~0#1 := 0; 1842#L17-1 assume !(1 == main_~up~0#1); 1850#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 1851#L23-1 assume !(main_~i~0#1 == main_~range~0#1 - 2); 1849#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 1847#L14 assume !(0 == main_~i~0#1); 1841#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 1838#L17-1 assume !(1 == main_~up~0#1); 1836#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 1833#L23-1 assume !(main_~i~0#1 == main_~range~0#1 - 2); 1834#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 1845#L14 assume 0 == main_~i~0#1;main_~up~0#1 := 1; 1846#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 1853#L17-1 [2022-11-20 12:07:53,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:07:53,102 INFO L85 PathProgramCache]: Analyzing trace with hash 28699760, now seen corresponding path program 2 times [2022-11-20 12:07:53,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:07:53,102 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963397622] [2022-11-20 12:07:53,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:07:53,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:07:53,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 12:07:53,110 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 12:07:53,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 12:07:53,112 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-20 12:07:53,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:07:53,113 INFO L85 PathProgramCache]: Analyzing trace with hash -1874596340, now seen corresponding path program 1 times [2022-11-20 12:07:53,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:07:53,113 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297882938] [2022-11-20 12:07:53,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:07:53,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:07:53,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:07:53,291 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 11 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:07:53,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:07:53,291 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297882938] [2022-11-20 12:07:53,292 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1297882938] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 12:07:53,292 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [642105595] [2022-11-20 12:07:53,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:07:53,292 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:07:53,292 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91a165d0-ab4c-4573-9f37-beaecc793f82/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:07:53,293 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91a165d0-ab4c-4573-9f37-beaecc793f82/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 12:07:53,325 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91a165d0-ab4c-4573-9f37-beaecc793f82/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-11-20 12:07:53,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:07:53,335 INFO L263 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-20 12:07:53,336 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:07:53,427 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 15 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:07:53,427 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 12:07:53,478 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 15 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:07:53,478 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [642105595] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 12:07:53,478 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 12:07:53,478 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 6] total 11 [2022-11-20 12:07:53,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051184787] [2022-11-20 12:07:53,479 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 12:07:53,479 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-20 12:07:53,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:07:53,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-20 12:07:53,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2022-11-20 12:07:53,480 INFO L87 Difference]: Start difference. First operand 174 states and 235 transitions. cyclomatic complexity: 69 Second operand has 11 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 11 states have internal predecessors, (28), 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-11-20 12:07:53,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:07:53,704 INFO L93 Difference]: Finished difference Result 114 states and 126 transitions. [2022-11-20 12:07:53,704 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 114 states and 126 transitions. [2022-11-20 12:07:53,705 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 19 [2022-11-20 12:07:53,706 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 114 states to 108 states and 120 transitions. [2022-11-20 12:07:53,706 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 56 [2022-11-20 12:07:53,706 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 68 [2022-11-20 12:07:53,706 INFO L73 IsDeterministic]: Start isDeterministic. Operand 108 states and 120 transitions. [2022-11-20 12:07:53,706 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-20 12:07:53,706 INFO L218 hiAutomatonCegarLoop]: Abstraction has 108 states and 120 transitions. [2022-11-20 12:07:53,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states and 120 transitions. [2022-11-20 12:07:53,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 89. [2022-11-20 12:07:53,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 89 states have (on average 1.1348314606741574) internal successors, (101), 88 states have internal predecessors, (101), 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-11-20 12:07:53,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 101 transitions. [2022-11-20 12:07:53,709 INFO L240 hiAutomatonCegarLoop]: Abstraction has 89 states and 101 transitions. [2022-11-20 12:07:53,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-20 12:07:53,713 INFO L428 stractBuchiCegarLoop]: Abstraction has 89 states and 101 transitions. [2022-11-20 12:07:53,713 INFO L335 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2022-11-20 12:07:53,714 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 89 states and 101 transitions. [2022-11-20 12:07:53,714 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2022-11-20 12:07:53,714 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-20 12:07:53,714 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-20 12:07:53,715 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 3, 3, 3, 3, 3, 1, 1, 1] [2022-11-20 12:07:53,715 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:07:53,715 INFO L748 eck$LassoCheckResult]: Stem: 2196#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 2197#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~range~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~range~0#1;havoc main_~up~0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~range~0#1 := 20;main_~up~0#1 := 0; 2206#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 2231#L14 assume !(0 == main_~i~0#1); 2229#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 2227#L17-1 assume !(1 == main_~up~0#1); 2225#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 2220#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 2219#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 2213#L14 assume !(0 == main_~i~0#1); 2214#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 2267#L17-1 assume !(1 == main_~up~0#1); 2266#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 2265#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 2250#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 2260#L14 assume !(0 == main_~i~0#1); 2258#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 2256#L17-1 assume !(1 == main_~up~0#1); 2253#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 2248#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 2249#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 2243#L14 assume 0 == main_~i~0#1;main_~up~0#1 := 1; 2244#L14-2 [2022-11-20 12:07:53,715 INFO L750 eck$LassoCheckResult]: Loop: 2244#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 2207#L17-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 2208#L20-1 assume !(0 == main_~up~0#1); 2273#L23-1 assume !(main_~i~0#1 == main_~range~0#1 - 2); 2272#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 2271#L14 assume !(0 == main_~i~0#1); 2269#L14-2 assume main_~i~0#1 == main_~range~0#1;main_~up~0#1 := 0; 2268#L17-1 assume !(1 == main_~up~0#1); 2254#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 2251#L23-1 assume !(main_~i~0#1 == main_~range~0#1 - 2); 2245#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 2246#L14 assume 0 == main_~i~0#1;main_~up~0#1 := 1; 2244#L14-2 [2022-11-20 12:07:53,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:07:53,716 INFO L85 PathProgramCache]: Analyzing trace with hash 2020896569, now seen corresponding path program 2 times [2022-11-20 12:07:53,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:07:53,716 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304192992] [2022-11-20 12:07:53,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:07:53,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:07:53,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:07:53,799 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:07:53,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:07:53,799 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304192992] [2022-11-20 12:07:53,799 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1304192992] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 12:07:53,799 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [944161697] [2022-11-20 12:07:53,800 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-20 12:07:53,800 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:07:53,800 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91a165d0-ab4c-4573-9f37-beaecc793f82/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:07:53,804 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91a165d0-ab4c-4573-9f37-beaecc793f82/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 12:07:53,832 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91a165d0-ab4c-4573-9f37-beaecc793f82/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-11-20 12:07:53,858 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-20 12:07:53,858 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 12:07:53,859 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-20 12:07:53,860 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:07:53,907 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:07:53,907 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 12:07:53,969 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:07:53,970 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [944161697] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 12:07:53,970 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 12:07:53,970 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-11-20 12:07:53,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070437207] [2022-11-20 12:07:53,970 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 12:07:53,971 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-11-20 12:07:53,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:07:53,971 INFO L85 PathProgramCache]: Analyzing trace with hash 1010763299, now seen corresponding path program 2 times [2022-11-20 12:07:53,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:07:53,971 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780878923] [2022-11-20 12:07:53,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:07:53,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:07:53,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 12:07:53,976 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 12:07:53,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 12:07:53,980 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-20 12:07:54,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:07:54,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-20 12:07:54,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2022-11-20 12:07:54,042 INFO L87 Difference]: Start difference. First operand 89 states and 101 transitions. cyclomatic complexity: 16 Second operand has 11 states, 10 states have (on average 5.0) internal successors, (50), 11 states have internal predecessors, (50), 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-11-20 12:07:54,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:07:54,238 INFO L93 Difference]: Finished difference Result 159 states and 171 transitions. [2022-11-20 12:07:54,239 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 159 states and 171 transitions. [2022-11-20 12:07:54,240 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2022-11-20 12:07:54,241 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 159 states to 151 states and 163 transitions. [2022-11-20 12:07:54,242 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 88 [2022-11-20 12:07:54,242 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 88 [2022-11-20 12:07:54,242 INFO L73 IsDeterministic]: Start isDeterministic. Operand 151 states and 163 transitions. [2022-11-20 12:07:54,242 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-20 12:07:54,242 INFO L218 hiAutomatonCegarLoop]: Abstraction has 151 states and 163 transitions. [2022-11-20 12:07:54,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states and 163 transitions. [2022-11-20 12:07:54,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 137. [2022-11-20 12:07:54,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 137 states have (on average 1.0875912408759123) internal successors, (149), 136 states have internal predecessors, (149), 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-11-20 12:07:54,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 149 transitions. [2022-11-20 12:07:54,247 INFO L240 hiAutomatonCegarLoop]: Abstraction has 137 states and 149 transitions. [2022-11-20 12:07:54,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-20 12:07:54,257 INFO L428 stractBuchiCegarLoop]: Abstraction has 137 states and 149 transitions. [2022-11-20 12:07:54,257 INFO L335 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2022-11-20 12:07:54,258 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 137 states and 149 transitions. [2022-11-20 12:07:54,259 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2022-11-20 12:07:54,259 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-20 12:07:54,259 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-20 12:07:54,262 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [8, 7, 7, 7, 7, 7, 1, 1, 1] [2022-11-20 12:07:54,262 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:07:54,263 INFO L748 eck$LassoCheckResult]: Stem: 2602#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 2603#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~range~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~range~0#1;havoc main_~up~0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~range~0#1 := 20;main_~up~0#1 := 0; 2618#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 2641#L14 assume !(0 == main_~i~0#1); 2638#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 2635#L17-1 assume !(1 == main_~up~0#1); 2632#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 2627#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 2626#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 2728#L14 assume !(0 == main_~i~0#1); 2623#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 2614#L17-1 assume !(1 == main_~up~0#1); 2615#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 2624#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 2725#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 2724#L14 assume !(0 == main_~i~0#1); 2723#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 2722#L17-1 assume !(1 == main_~up~0#1); 2721#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 2720#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 2719#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 2718#L14 assume !(0 == main_~i~0#1); 2717#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 2716#L17-1 assume !(1 == main_~up~0#1); 2715#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 2714#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 2713#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 2712#L14 assume !(0 == main_~i~0#1); 2711#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 2710#L17-1 assume !(1 == main_~up~0#1); 2709#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 2708#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 2707#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 2706#L14 assume !(0 == main_~i~0#1); 2705#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 2704#L17-1 assume !(1 == main_~up~0#1); 2703#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 2702#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 2658#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 2699#L14 assume !(0 == main_~i~0#1); 2671#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 2669#L17-1 assume !(1 == main_~up~0#1); 2661#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 2656#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 2657#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 2651#L14 assume 0 == main_~i~0#1;main_~up~0#1 := 1; 2652#L14-2 [2022-11-20 12:07:54,263 INFO L750 eck$LassoCheckResult]: Loop: 2652#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 2612#L17-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 2613#L20-1 assume !(0 == main_~up~0#1); 2667#L23-1 assume !(main_~i~0#1 == main_~range~0#1 - 2); 2666#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 2665#L14 assume !(0 == main_~i~0#1); 2664#L14-2 assume main_~i~0#1 == main_~range~0#1;main_~up~0#1 := 0; 2663#L17-1 assume !(1 == main_~up~0#1); 2662#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 2659#L23-1 assume !(main_~i~0#1 == main_~range~0#1 - 2); 2653#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 2654#L14 assume 0 == main_~i~0#1;main_~up~0#1 := 1; 2652#L14-2 [2022-11-20 12:07:54,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:07:54,264 INFO L85 PathProgramCache]: Analyzing trace with hash 1325721725, now seen corresponding path program 3 times [2022-11-20 12:07:54,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:07:54,264 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351682865] [2022-11-20 12:07:54,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:07:54,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:07:54,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:07:54,498 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 0 proven. 140 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:07:54,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:07:54,499 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351682865] [2022-11-20 12:07:54,499 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [351682865] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 12:07:54,499 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1764919753] [2022-11-20 12:07:54,499 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-20 12:07:54,500 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:07:54,500 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91a165d0-ab4c-4573-9f37-beaecc793f82/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:07:54,504 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91a165d0-ab4c-4573-9f37-beaecc793f82/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 12:07:54,528 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91a165d0-ab4c-4573-9f37-beaecc793f82/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-11-20 12:07:54,567 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2022-11-20 12:07:54,567 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 12:07:54,568 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-20 12:07:54,570 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:07:54,660 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 0 proven. 140 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:07:54,660 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 12:07:54,832 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 0 proven. 140 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:07:54,832 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1764919753] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 12:07:54,832 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 12:07:54,832 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2022-11-20 12:07:54,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458700963] [2022-11-20 12:07:54,833 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 12:07:54,834 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-11-20 12:07:54,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:07:54,835 INFO L85 PathProgramCache]: Analyzing trace with hash 1010763299, now seen corresponding path program 3 times [2022-11-20 12:07:54,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:07:54,835 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797582895] [2022-11-20 12:07:54,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:07:54,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:07:54,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 12:07:54,842 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 12:07:54,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 12:07:54,851 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-20 12:07:54,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:07:54,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-11-20 12:07:54,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=213, Unknown=0, NotChecked=0, Total=342 [2022-11-20 12:07:54,913 INFO L87 Difference]: Start difference. First operand 137 states and 149 transitions. cyclomatic complexity: 16 Second operand has 19 states, 18 states have (on average 5.444444444444445) internal successors, (98), 19 states have internal predecessors, (98), 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-11-20 12:07:55,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:07:55,179 INFO L93 Difference]: Finished difference Result 263 states and 275 transitions. [2022-11-20 12:07:55,179 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 263 states and 275 transitions. [2022-11-20 12:07:55,181 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2022-11-20 12:07:55,182 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 263 states to 247 states and 259 transitions. [2022-11-20 12:07:55,183 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 136 [2022-11-20 12:07:55,183 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 136 [2022-11-20 12:07:55,183 INFO L73 IsDeterministic]: Start isDeterministic. Operand 247 states and 259 transitions. [2022-11-20 12:07:55,187 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-20 12:07:55,188 INFO L218 hiAutomatonCegarLoop]: Abstraction has 247 states and 259 transitions. [2022-11-20 12:07:55,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states and 259 transitions. [2022-11-20 12:07:55,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 233. [2022-11-20 12:07:55,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 233 states have (on average 1.0515021459227467) internal successors, (245), 232 states have internal predecessors, (245), 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-11-20 12:07:55,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 245 transitions. [2022-11-20 12:07:55,192 INFO L240 hiAutomatonCegarLoop]: Abstraction has 233 states and 245 transitions. [2022-11-20 12:07:55,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-20 12:07:55,194 INFO L428 stractBuchiCegarLoop]: Abstraction has 233 states and 245 transitions. [2022-11-20 12:07:55,194 INFO L335 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2022-11-20 12:07:55,194 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 233 states and 245 transitions. [2022-11-20 12:07:55,195 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2022-11-20 12:07:55,195 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-20 12:07:55,195 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-20 12:07:55,199 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [16, 15, 15, 15, 15, 15, 1, 1, 1] [2022-11-20 12:07:55,199 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:07:55,202 INFO L748 eck$LassoCheckResult]: Stem: 3320#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 3321#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~range~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~range~0#1;havoc main_~up~0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~range~0#1 := 20;main_~up~0#1 := 0; 3337#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 3361#L14 assume !(0 == main_~i~0#1); 3357#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 3353#L17-1 assume !(1 == main_~up~0#1); 3350#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 3345#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 3324#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 3325#L14 assume !(0 == main_~i~0#1); 3340#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 3332#L17-1 assume !(1 == main_~up~0#1); 3333#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 3343#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 3542#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 3541#L14 assume !(0 == main_~i~0#1); 3540#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 3539#L17-1 assume !(1 == main_~up~0#1); 3538#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 3537#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 3536#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 3535#L14 assume !(0 == main_~i~0#1); 3534#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 3533#L17-1 assume !(1 == main_~up~0#1); 3532#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 3531#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 3530#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 3529#L14 assume !(0 == main_~i~0#1); 3528#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 3527#L17-1 assume !(1 == main_~up~0#1); 3526#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 3525#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 3524#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 3523#L14 assume !(0 == main_~i~0#1); 3522#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 3521#L17-1 assume !(1 == main_~up~0#1); 3520#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 3519#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 3518#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 3517#L14 assume !(0 == main_~i~0#1); 3516#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 3515#L17-1 assume !(1 == main_~up~0#1); 3514#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 3513#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 3512#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 3511#L14 assume !(0 == main_~i~0#1); 3510#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 3509#L17-1 assume !(1 == main_~up~0#1); 3508#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 3507#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 3506#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 3505#L14 assume !(0 == main_~i~0#1); 3504#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 3503#L17-1 assume !(1 == main_~up~0#1); 3502#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 3501#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 3500#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 3499#L14 assume !(0 == main_~i~0#1); 3498#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 3497#L17-1 assume !(1 == main_~up~0#1); 3496#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 3495#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 3494#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 3493#L14 assume !(0 == main_~i~0#1); 3492#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 3491#L17-1 assume !(1 == main_~up~0#1); 3490#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 3489#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 3488#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 3487#L14 assume !(0 == main_~i~0#1); 3486#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 3485#L17-1 assume !(1 == main_~up~0#1); 3484#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 3483#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 3482#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 3481#L14 assume !(0 == main_~i~0#1); 3480#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 3479#L17-1 assume !(1 == main_~up~0#1); 3478#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 3477#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 3476#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 3475#L14 assume !(0 == main_~i~0#1); 3474#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 3473#L17-1 assume !(1 == main_~up~0#1); 3472#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 3471#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 3377#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 3468#L14 assume !(0 == main_~i~0#1); 3392#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 3388#L17-1 assume !(1 == main_~up~0#1); 3380#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 3375#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 3376#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 3370#L14 assume 0 == main_~i~0#1;main_~up~0#1 := 1; 3371#L14-2 [2022-11-20 12:07:55,203 INFO L750 eck$LassoCheckResult]: Loop: 3371#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 3330#L17-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 3331#L20-1 assume !(0 == main_~up~0#1); 3386#L23-1 assume !(main_~i~0#1 == main_~range~0#1 - 2); 3385#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 3384#L14 assume !(0 == main_~i~0#1); 3383#L14-2 assume main_~i~0#1 == main_~range~0#1;main_~up~0#1 := 0; 3382#L17-1 assume !(1 == main_~up~0#1); 3381#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 3378#L23-1 assume !(main_~i~0#1 == main_~range~0#1 - 2); 3372#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 3373#L14 assume 0 == main_~i~0#1;main_~up~0#1 := 1; 3371#L14-2 [2022-11-20 12:07:55,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:07:55,203 INFO L85 PathProgramCache]: Analyzing trace with hash -944359675, now seen corresponding path program 4 times [2022-11-20 12:07:55,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:07:55,203 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628396194] [2022-11-20 12:07:55,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:07:55,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:07:55,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:07:55,635 INFO L134 CoverageAnalysis]: Checked inductivity of 660 backedges. 0 proven. 660 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:07:55,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:07:55,635 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628396194] [2022-11-20 12:07:55,635 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1628396194] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 12:07:55,635 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1650772007] [2022-11-20 12:07:55,635 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-20 12:07:55,635 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 12:07:55,636 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91a165d0-ab4c-4573-9f37-beaecc793f82/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 12:07:55,639 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91a165d0-ab4c-4573-9f37-beaecc793f82/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 12:07:55,660 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91a165d0-ab4c-4573-9f37-beaecc793f82/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-11-20 12:07:55,710 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-20 12:07:55,710 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 12:07:55,712 INFO L263 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 17 conjunts are in the unsatisfiable core [2022-11-20 12:07:55,714 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 12:07:55,867 INFO L134 CoverageAnalysis]: Checked inductivity of 660 backedges. 0 proven. 660 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:07:55,868 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 12:07:56,228 INFO L134 CoverageAnalysis]: Checked inductivity of 660 backedges. 0 proven. 660 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 12:07:56,228 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1650772007] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 12:07:56,229 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 12:07:56,229 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 22 [2022-11-20 12:07:56,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940641436] [2022-11-20 12:07:56,229 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 12:07:56,230 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-11-20 12:07:56,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:07:56,230 INFO L85 PathProgramCache]: Analyzing trace with hash 1010763299, now seen corresponding path program 4 times [2022-11-20 12:07:56,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:07:56,230 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121141515] [2022-11-20 12:07:56,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:07:56,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:07:56,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 12:07:56,234 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 12:07:56,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 12:07:56,237 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-20 12:07:56,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:07:56,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-11-20 12:07:56,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=199, Invalid=307, Unknown=0, NotChecked=0, Total=506 [2022-11-20 12:07:56,301 INFO L87 Difference]: Start difference. First operand 233 states and 245 transitions. cyclomatic complexity: 16 Second operand has 23 states, 22 states have (on average 5.7727272727272725) internal successors, (127), 23 states have internal predecessors, (127), 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-11-20 12:07:56,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:07:56,537 INFO L93 Difference]: Finished difference Result 303 states and 315 transitions. [2022-11-20 12:07:56,537 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 303 states and 315 transitions. [2022-11-20 12:07:56,539 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2022-11-20 12:07:56,541 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 303 states to 295 states and 307 transitions. [2022-11-20 12:07:56,541 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 160 [2022-11-20 12:07:56,541 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 160 [2022-11-20 12:07:56,541 INFO L73 IsDeterministic]: Start isDeterministic. Operand 295 states and 307 transitions. [2022-11-20 12:07:56,541 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-20 12:07:56,541 INFO L218 hiAutomatonCegarLoop]: Abstraction has 295 states and 307 transitions. [2022-11-20 12:07:56,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states and 307 transitions. [2022-11-20 12:07:56,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 281. [2022-11-20 12:07:56,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 281 states, 281 states have (on average 1.0427046263345197) internal successors, (293), 280 states have internal predecessors, (293), 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-11-20 12:07:56,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 293 transitions. [2022-11-20 12:07:56,546 INFO L240 hiAutomatonCegarLoop]: Abstraction has 281 states and 293 transitions. [2022-11-20 12:07:56,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-11-20 12:07:56,547 INFO L428 stractBuchiCegarLoop]: Abstraction has 281 states and 293 transitions. [2022-11-20 12:07:56,547 INFO L335 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2022-11-20 12:07:56,547 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 281 states and 293 transitions. [2022-11-20 12:07:56,549 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2022-11-20 12:07:56,549 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-20 12:07:56,549 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-20 12:07:56,550 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [20, 19, 19, 19, 19, 19, 1, 1, 1] [2022-11-20 12:07:56,551 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:07:56,551 INFO L748 eck$LassoCheckResult]: Stem: 4458#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 4459#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~range~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~range~0#1;havoc main_~up~0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~range~0#1 := 20;main_~up~0#1 := 0; 4468#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4488#L14 assume !(0 == main_~i~0#1); 4486#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 4485#L17-1 assume !(1 == main_~up~0#1); 4484#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 4481#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 4480#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4476#L14 assume !(0 == main_~i~0#1); 4477#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 4471#L17-1 assume !(1 == main_~up~0#1); 4472#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 4478#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 4623#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4622#L14 assume !(0 == main_~i~0#1); 4621#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 4620#L17-1 assume !(1 == main_~up~0#1); 4619#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 4618#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 4617#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4616#L14 assume !(0 == main_~i~0#1); 4615#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 4614#L17-1 assume !(1 == main_~up~0#1); 4613#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 4612#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 4611#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4610#L14 assume !(0 == main_~i~0#1); 4609#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 4608#L17-1 assume !(1 == main_~up~0#1); 4607#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 4606#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 4605#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4604#L14 assume !(0 == main_~i~0#1); 4603#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 4602#L17-1 assume !(1 == main_~up~0#1); 4601#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 4600#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 4599#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4598#L14 assume !(0 == main_~i~0#1); 4597#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 4596#L17-1 assume !(1 == main_~up~0#1); 4595#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 4594#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 4593#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4592#L14 assume !(0 == main_~i~0#1); 4591#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 4590#L17-1 assume !(1 == main_~up~0#1); 4589#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 4588#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 4587#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4586#L14 assume !(0 == main_~i~0#1); 4585#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 4584#L17-1 assume !(1 == main_~up~0#1); 4583#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 4582#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 4581#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4580#L14 assume !(0 == main_~i~0#1); 4579#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 4578#L17-1 assume !(1 == main_~up~0#1); 4577#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 4576#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 4575#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4574#L14 assume !(0 == main_~i~0#1); 4573#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 4572#L17-1 assume !(1 == main_~up~0#1); 4571#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 4570#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 4569#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4568#L14 assume !(0 == main_~i~0#1); 4567#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 4566#L17-1 assume !(1 == main_~up~0#1); 4565#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 4564#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 4563#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4562#L14 assume !(0 == main_~i~0#1); 4561#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 4560#L17-1 assume !(1 == main_~up~0#1); 4559#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 4558#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 4557#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4556#L14 assume !(0 == main_~i~0#1); 4555#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 4554#L17-1 assume !(1 == main_~up~0#1); 4553#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 4552#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 4551#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4550#L14 assume !(0 == main_~i~0#1); 4549#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 4548#L17-1 assume !(1 == main_~up~0#1); 4547#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 4546#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 4545#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4544#L14 assume !(0 == main_~i~0#1); 4543#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 4542#L17-1 assume !(1 == main_~up~0#1); 4541#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 4540#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 4539#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4538#L14 assume !(0 == main_~i~0#1); 4537#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 4536#L17-1 assume !(1 == main_~up~0#1); 4535#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 4534#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 4533#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4532#L14 assume !(0 == main_~i~0#1); 4531#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 4530#L17-1 assume !(1 == main_~up~0#1); 4529#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 4528#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 4504#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4515#L14 assume !(0 == main_~i~0#1); 4511#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 4508#L17-1 assume !(1 == main_~up~0#1); 4505#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 4502#L23-1 assume main_~i~0#1 == main_~range~0#1 - 2;main_~range~0#1 := main_~range~0#1 - 1; 4503#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4513#L14 assume 0 == main_~i~0#1;main_~up~0#1 := 1; 4514#L14-2 [2022-11-20 12:07:56,551 INFO L750 eck$LassoCheckResult]: Loop: 4514#L14-2 assume !(main_~i~0#1 == main_~range~0#1); 4506#L17-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 4507#L20-1 assume !(0 == main_~up~0#1); 4526#L23-1 assume !(main_~i~0#1 == main_~range~0#1 - 2); 4525#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4524#L14 assume !(0 == main_~i~0#1); 4523#L14-2 assume main_~i~0#1 == main_~range~0#1;main_~up~0#1 := 0; 4522#L17-1 assume !(1 == main_~up~0#1); 4521#L20-1 assume 0 == main_~up~0#1;main_~i~0#1 := main_~i~0#1 - 1; 4519#L23-1 assume !(main_~i~0#1 == main_~range~0#1 - 2); 4516#L26-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= main_~range~0#1); 4517#L14 assume 0 == main_~i~0#1;main_~up~0#1 := 1; 4514#L14-2 [2022-11-20 12:07:56,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:07:56,552 INFO L85 PathProgramCache]: Analyzing trace with hash 228527177, now seen corresponding path program 5 times [2022-11-20 12:07:56,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:07:56,552 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764548834] [2022-11-20 12:07:56,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:07:56,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:07:56,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 12:07:56,575 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 12:07:56,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 12:07:56,595 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-20 12:07:56,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:07:56,596 INFO L85 PathProgramCache]: Analyzing trace with hash 1010763299, now seen corresponding path program 5 times [2022-11-20 12:07:56,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:07:56,596 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583294730] [2022-11-20 12:07:56,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:07:56,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:07:56,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 12:07:56,599 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 12:07:56,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 12:07:56,602 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-20 12:07:56,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:07:56,603 INFO L85 PathProgramCache]: Analyzing trace with hash 210101867, now seen corresponding path program 1 times [2022-11-20 12:07:56,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:07:56,603 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760886050] [2022-11-20 12:07:56,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:07:56,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:07:56,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 12:07:56,624 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 12:07:56,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 12:07:56,645 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-20 12:07:57,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 12:07:57,845 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-20 12:07:57,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-20 12:07:57,936 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 20.11 12:07:57 BoogieIcfgContainer [2022-11-20 12:07:57,936 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-11-20 12:07:57,937 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-20 12:07:57,937 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-20 12:07:57,937 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-20 12:07:57,937 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 12:07:48" (3/4) ... [2022-11-20 12:07:57,940 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2022-11-20 12:07:58,029 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91a165d0-ab4c-4573-9f37-beaecc793f82/bin/uautomizer-ug76WZFUDN/witness.graphml [2022-11-20 12:07:58,029 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-20 12:07:58,031 INFO L158 Benchmark]: Toolchain (without parser) took 10359.01ms. Allocated memory was 176.2MB in the beginning and 211.8MB in the end (delta: 35.7MB). Free memory was 133.1MB in the beginning and 76.8MB in the end (delta: 56.3MB). Peak memory consumption was 93.4MB. Max. memory is 16.1GB. [2022-11-20 12:07:58,031 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 130.0MB. Free memory is still 74.1MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-20 12:07:58,031 INFO L158 Benchmark]: CACSL2BoogieTranslator took 228.16ms. Allocated memory is still 176.2MB. Free memory was 133.1MB in the beginning and 124.2MB in the end (delta: 8.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-11-20 12:07:58,032 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.08ms. Allocated memory is still 176.2MB. Free memory was 124.0MB in the beginning and 122.6MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-20 12:07:58,032 INFO L158 Benchmark]: Boogie Preprocessor took 20.81ms. Allocated memory is still 176.2MB. Free memory was 122.6MB in the beginning and 121.4MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-20 12:07:58,033 INFO L158 Benchmark]: RCFGBuilder took 232.37ms. Allocated memory is still 176.2MB. Free memory was 121.4MB in the beginning and 112.6MB in the end (delta: 8.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-11-20 12:07:58,036 INFO L158 Benchmark]: BuchiAutomizer took 9743.64ms. Allocated memory was 176.2MB in the beginning and 211.8MB in the end (delta: 35.7MB). Free memory was 112.1MB in the beginning and 82.0MB in the end (delta: 30.1MB). Peak memory consumption was 68.2MB. Max. memory is 16.1GB. [2022-11-20 12:07:58,037 INFO L158 Benchmark]: Witness Printer took 92.79ms. Allocated memory is still 211.8MB. Free memory was 82.0MB in the beginning and 76.8MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-20 12:07:58,040 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.28ms. Allocated memory is still 130.0MB. Free memory is still 74.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 228.16ms. Allocated memory is still 176.2MB. Free memory was 133.1MB in the beginning and 124.2MB in the end (delta: 8.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 32.08ms. Allocated memory is still 176.2MB. Free memory was 124.0MB in the beginning and 122.6MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 20.81ms. Allocated memory is still 176.2MB. Free memory was 122.6MB in the beginning and 121.4MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 232.37ms. Allocated memory is still 176.2MB. Free memory was 121.4MB in the beginning and 112.6MB in the end (delta: 8.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * BuchiAutomizer took 9743.64ms. Allocated memory was 176.2MB in the beginning and 211.8MB in the end (delta: 35.7MB). Free memory was 112.1MB in the beginning and 82.0MB in the end (delta: 30.1MB). Peak memory consumption was 68.2MB. Max. memory is 16.1GB. * Witness Printer took 92.79ms. Allocated memory is still 211.8MB. Free memory was 82.0MB in the beginning and 76.8MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. 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 13 terminating modules (10 trivial, 2 deterministic, 1 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function i and consists of 4 locations. One deterministic module has affine ranking function -1 * i + range and consists of 4 locations. One nondeterministic module has affine ranking function -1 * i + range and consists of 4 locations. 10 modules have a trivial ranking function, the largest among these consists of 23 locations. The remainder module has 281 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 9.6s and 13 iterations. TraceHistogramMax:20. Analysis of lassos took 7.2s. Construction of modules took 0.6s. Büchi inclusion checks took 1.5s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 10. Automata minimization 0.1s AutomataMinimizationTime, 13 MinimizatonAttempts, 155 StatesRemovedByMinimization, 11 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 458 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 453 mSDsluCounter, 360 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 191 mSDsCounter, 105 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 822 IncrementalHoareTripleChecker+Invalid, 927 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 105 mSolverCounterUnsat, 169 mSDtfsCounter, 822 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI4 SFLT2 conc2 concLT0 SILN3 SILU0 SILI0 SILT1 lasso0 LassoPreprocessingBenchmarks: Lassos: inital30 mio100 ax139 hnf100 lsp64 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq174 hnf97 smp62 dnf141 smp94 tf105 neg90 sie120 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 49ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 5 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 3 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.8s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - LassoShapedNonTerminationArgument [Line: 17]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite program execution. Stem: [L6] int i; [L7] int range; [L8] int up; [L9] i = __VERIFIER_nondet_int() [L10] range = 20 [L11] up = 0 VAL [range=20, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=19, range=20, up=0] [L14] COND FALSE !(i == 0) VAL [i=19, range=20, up=0] [L17] COND FALSE !(i == range) VAL [i=19, range=20, up=0] [L20] COND FALSE !(up == 1) VAL [i=19, range=20, up=0] [L23] COND TRUE up == 0 [L24] i = i-1 VAL [i=18, range=20, up=0] [L26] COND TRUE i == range-2 [L27] range = range-1 VAL [i=18, range=19, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=18, range=19, up=0] [L14] COND FALSE !(i == 0) VAL [i=18, range=19, up=0] [L17] COND FALSE !(i == range) VAL [i=18, range=19, up=0] [L20] COND FALSE !(up == 1) VAL [i=18, range=19, up=0] [L23] COND TRUE up == 0 [L24] i = i-1 VAL [i=17, range=19, up=0] [L26] COND TRUE i == range-2 [L27] range = range-1 VAL [i=17, range=18, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=17, range=18, up=0] [L14] COND FALSE !(i == 0) VAL [i=17, range=18, up=0] [L17] COND FALSE !(i == range) VAL [i=17, range=18, up=0] [L20] COND FALSE !(up == 1) VAL [i=17, range=18, up=0] [L23] COND TRUE up == 0 [L24] i = i-1 VAL [i=16, range=18, up=0] [L26] COND TRUE i == range-2 [L27] range = range-1 VAL [i=16, range=17, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=16, range=17, up=0] [L14] COND FALSE !(i == 0) VAL [i=16, range=17, up=0] [L17] COND FALSE !(i == range) VAL [i=16, range=17, up=0] [L20] COND FALSE !(up == 1) VAL [i=16, range=17, up=0] [L23] COND TRUE up == 0 [L24] i = i-1 VAL [i=15, range=17, up=0] [L26] COND TRUE i == range-2 [L27] range = range-1 VAL [i=15, range=16, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=15, range=16, up=0] [L14] COND FALSE !(i == 0) VAL [i=15, range=16, up=0] [L17] COND FALSE !(i == range) VAL [i=15, range=16, up=0] [L20] COND FALSE !(up == 1) VAL [i=15, range=16, up=0] [L23] COND TRUE up == 0 [L24] i = i-1 VAL [i=14, range=16, up=0] [L26] COND TRUE i == range-2 [L27] range = range-1 VAL [i=14, range=15, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=14, range=15, up=0] [L14] COND FALSE !(i == 0) VAL [i=14, range=15, up=0] [L17] COND FALSE !(i == range) VAL [i=14, range=15, up=0] [L20] COND FALSE !(up == 1) VAL [i=14, range=15, up=0] [L23] COND TRUE up == 0 [L24] i = i-1 VAL [i=13, range=15, up=0] [L26] COND TRUE i == range-2 [L27] range = range-1 VAL [i=13, range=14, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=13, range=14, up=0] [L14] COND FALSE !(i == 0) VAL [i=13, range=14, up=0] [L17] COND FALSE !(i == range) VAL [i=13, range=14, up=0] [L20] COND FALSE !(up == 1) VAL [i=13, range=14, up=0] [L23] COND TRUE up == 0 [L24] i = i-1 VAL [i=12, range=14, up=0] [L26] COND TRUE i == range-2 [L27] range = range-1 VAL [i=12, range=13, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=12, range=13, up=0] [L14] COND FALSE !(i == 0) VAL [i=12, range=13, up=0] [L17] COND FALSE !(i == range) VAL [i=12, range=13, up=0] [L20] COND FALSE !(up == 1) VAL [i=12, range=13, up=0] [L23] COND TRUE up == 0 [L24] i = i-1 VAL [i=11, range=13, up=0] [L26] COND TRUE i == range-2 [L27] range = range-1 VAL [i=11, range=12, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=11, range=12, up=0] [L14] COND FALSE !(i == 0) VAL [i=11, range=12, up=0] [L17] COND FALSE !(i == range) VAL [i=11, range=12, up=0] [L20] COND FALSE !(up == 1) VAL [i=11, range=12, up=0] [L23] COND TRUE up == 0 [L24] i = i-1 VAL [i=10, range=12, up=0] [L26] COND TRUE i == range-2 [L27] range = range-1 VAL [i=10, range=11, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=10, range=11, up=0] [L14] COND FALSE !(i == 0) VAL [i=10, range=11, up=0] [L17] COND FALSE !(i == range) VAL [i=10, range=11, up=0] [L20] COND FALSE !(up == 1) VAL [i=10, range=11, up=0] [L23] COND TRUE up == 0 [L24] i = i-1 VAL [i=9, range=11, up=0] [L26] COND TRUE i == range-2 [L27] range = range-1 VAL [i=9, range=10, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=9, range=10, up=0] [L14] COND FALSE !(i == 0) VAL [i=9, range=10, up=0] [L17] COND FALSE !(i == range) VAL [i=9, range=10, up=0] [L20] COND FALSE !(up == 1) VAL [i=9, range=10, up=0] [L23] COND TRUE up == 0 [L24] i = i-1 VAL [i=8, range=10, up=0] [L26] COND TRUE i == range-2 [L27] range = range-1 VAL [i=8, range=9, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=8, range=9, up=0] [L14] COND FALSE !(i == 0) VAL [i=8, range=9, up=0] [L17] COND FALSE !(i == range) VAL [i=8, range=9, up=0] [L20] COND FALSE !(up == 1) VAL [i=8, range=9, up=0] [L23] COND TRUE up == 0 [L24] i = i-1 VAL [i=7, range=9, up=0] [L26] COND TRUE i == range-2 [L27] range = range-1 VAL [i=7, range=8, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=7, range=8, up=0] [L14] COND FALSE !(i == 0) VAL [i=7, range=8, up=0] [L17] COND FALSE !(i == range) VAL [i=7, range=8, up=0] [L20] COND FALSE !(up == 1) VAL [i=7, range=8, up=0] [L23] COND TRUE up == 0 [L24] i = i-1 VAL [i=6, range=8, up=0] [L26] COND TRUE i == range-2 [L27] range = range-1 VAL [i=6, range=7, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=6, range=7, up=0] [L14] COND FALSE !(i == 0) VAL [i=6, range=7, up=0] [L17] COND FALSE !(i == range) VAL [i=6, range=7, up=0] [L20] COND FALSE !(up == 1) VAL [i=6, range=7, up=0] [L23] COND TRUE up == 0 [L24] i = i-1 VAL [i=5, range=7, up=0] [L26] COND TRUE i == range-2 [L27] range = range-1 VAL [i=5, range=6, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=5, range=6, up=0] [L14] COND FALSE !(i == 0) VAL [i=5, range=6, up=0] [L17] COND FALSE !(i == range) VAL [i=5, range=6, up=0] [L20] COND FALSE !(up == 1) VAL [i=5, range=6, up=0] [L23] COND TRUE up == 0 [L24] i = i-1 VAL [i=4, range=6, up=0] [L26] COND TRUE i == range-2 [L27] range = range-1 VAL [i=4, range=5, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=4, range=5, up=0] [L14] COND FALSE !(i == 0) VAL [i=4, range=5, up=0] [L17] COND FALSE !(i == range) VAL [i=4, range=5, up=0] [L20] COND FALSE !(up == 1) VAL [i=4, range=5, up=0] [L23] COND TRUE up == 0 [L24] i = i-1 VAL [i=3, range=5, up=0] [L26] COND TRUE i == range-2 [L27] range = range-1 VAL [i=3, range=4, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=3, range=4, up=0] [L14] COND FALSE !(i == 0) VAL [i=3, range=4, up=0] [L17] COND FALSE !(i == range) VAL [i=3, range=4, up=0] [L20] COND FALSE !(up == 1) VAL [i=3, range=4, up=0] [L23] COND TRUE up == 0 [L24] i = i-1 VAL [i=2, range=4, up=0] [L26] COND TRUE i == range-2 [L27] range = range-1 VAL [i=2, range=3, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=2, range=3, up=0] [L14] COND FALSE !(i == 0) VAL [i=2, range=3, up=0] [L17] COND FALSE !(i == range) VAL [i=2, range=3, up=0] [L20] COND FALSE !(up == 1) VAL [i=2, range=3, up=0] [L23] COND TRUE up == 0 [L24] i = i-1 VAL [i=1, range=3, up=0] [L26] COND TRUE i == range-2 [L27] range = range-1 VAL [i=1, range=2, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=1, range=2, up=0] [L14] COND FALSE !(i == 0) VAL [i=1, range=2, up=0] [L17] COND FALSE !(i == range) VAL [i=1, range=2, up=0] [L20] COND FALSE !(up == 1) VAL [i=1, range=2, up=0] [L23] COND TRUE up == 0 [L24] i = i-1 VAL [i=0, range=2, up=0] [L26] COND TRUE i == range-2 [L27] range = range-1 VAL [i=0, range=1, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=0, range=1, up=0] [L14] COND TRUE i == 0 [L15] up = 1 VAL [i=0, range=1, up=1] Loop: [L17] COND FALSE !(i == range) [L20] COND TRUE up == 1 [L21] i = i+1 [L23] COND FALSE !(up == 0) [L26] COND FALSE !(i == range-2) [L13] COND TRUE 0 <= i && i <= range [L14] COND FALSE !(i == 0) [L17] COND TRUE i == range [L18] up = 0 [L20] COND FALSE !(up == 1) [L23] COND TRUE up == 0 [L24] i = i-1 [L26] COND FALSE !(i == range-2) [L13] COND TRUE 0 <= i && i <= range [L14] COND TRUE i == 0 [L15] up = 1 End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 17]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L6] int i; [L7] int range; [L8] int up; [L9] i = __VERIFIER_nondet_int() [L10] range = 20 [L11] up = 0 VAL [range=20, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=19, range=20, up=0] [L14] COND FALSE !(i == 0) VAL [i=19, range=20, up=0] [L17] COND FALSE !(i == range) VAL [i=19, range=20, up=0] [L20] COND FALSE !(up == 1) VAL [i=19, range=20, up=0] [L23] COND TRUE up == 0 [L24] i = i-1 VAL [i=18, range=20, up=0] [L26] COND TRUE i == range-2 [L27] range = range-1 VAL [i=18, range=19, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=18, range=19, up=0] [L14] COND FALSE !(i == 0) VAL [i=18, range=19, up=0] [L17] COND FALSE !(i == range) VAL [i=18, range=19, up=0] [L20] COND FALSE !(up == 1) VAL [i=18, range=19, up=0] [L23] COND TRUE up == 0 [L24] i = i-1 VAL [i=17, range=19, up=0] [L26] COND TRUE i == range-2 [L27] range = range-1 VAL [i=17, range=18, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=17, range=18, up=0] [L14] COND FALSE !(i == 0) VAL [i=17, range=18, up=0] [L17] COND FALSE !(i == range) VAL [i=17, range=18, up=0] [L20] COND FALSE !(up == 1) VAL [i=17, range=18, up=0] [L23] COND TRUE up == 0 [L24] i = i-1 VAL [i=16, range=18, up=0] [L26] COND TRUE i == range-2 [L27] range = range-1 VAL [i=16, range=17, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=16, range=17, up=0] [L14] COND FALSE !(i == 0) VAL [i=16, range=17, up=0] [L17] COND FALSE !(i == range) VAL [i=16, range=17, up=0] [L20] COND FALSE !(up == 1) VAL [i=16, range=17, up=0] [L23] COND TRUE up == 0 [L24] i = i-1 VAL [i=15, range=17, up=0] [L26] COND TRUE i == range-2 [L27] range = range-1 VAL [i=15, range=16, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=15, range=16, up=0] [L14] COND FALSE !(i == 0) VAL [i=15, range=16, up=0] [L17] COND FALSE !(i == range) VAL [i=15, range=16, up=0] [L20] COND FALSE !(up == 1) VAL [i=15, range=16, up=0] [L23] COND TRUE up == 0 [L24] i = i-1 VAL [i=14, range=16, up=0] [L26] COND TRUE i == range-2 [L27] range = range-1 VAL [i=14, range=15, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=14, range=15, up=0] [L14] COND FALSE !(i == 0) VAL [i=14, range=15, up=0] [L17] COND FALSE !(i == range) VAL [i=14, range=15, up=0] [L20] COND FALSE !(up == 1) VAL [i=14, range=15, up=0] [L23] COND TRUE up == 0 [L24] i = i-1 VAL [i=13, range=15, up=0] [L26] COND TRUE i == range-2 [L27] range = range-1 VAL [i=13, range=14, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=13, range=14, up=0] [L14] COND FALSE !(i == 0) VAL [i=13, range=14, up=0] [L17] COND FALSE !(i == range) VAL [i=13, range=14, up=0] [L20] COND FALSE !(up == 1) VAL [i=13, range=14, up=0] [L23] COND TRUE up == 0 [L24] i = i-1 VAL [i=12, range=14, up=0] [L26] COND TRUE i == range-2 [L27] range = range-1 VAL [i=12, range=13, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=12, range=13, up=0] [L14] COND FALSE !(i == 0) VAL [i=12, range=13, up=0] [L17] COND FALSE !(i == range) VAL [i=12, range=13, up=0] [L20] COND FALSE !(up == 1) VAL [i=12, range=13, up=0] [L23] COND TRUE up == 0 [L24] i = i-1 VAL [i=11, range=13, up=0] [L26] COND TRUE i == range-2 [L27] range = range-1 VAL [i=11, range=12, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=11, range=12, up=0] [L14] COND FALSE !(i == 0) VAL [i=11, range=12, up=0] [L17] COND FALSE !(i == range) VAL [i=11, range=12, up=0] [L20] COND FALSE !(up == 1) VAL [i=11, range=12, up=0] [L23] COND TRUE up == 0 [L24] i = i-1 VAL [i=10, range=12, up=0] [L26] COND TRUE i == range-2 [L27] range = range-1 VAL [i=10, range=11, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=10, range=11, up=0] [L14] COND FALSE !(i == 0) VAL [i=10, range=11, up=0] [L17] COND FALSE !(i == range) VAL [i=10, range=11, up=0] [L20] COND FALSE !(up == 1) VAL [i=10, range=11, up=0] [L23] COND TRUE up == 0 [L24] i = i-1 VAL [i=9, range=11, up=0] [L26] COND TRUE i == range-2 [L27] range = range-1 VAL [i=9, range=10, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=9, range=10, up=0] [L14] COND FALSE !(i == 0) VAL [i=9, range=10, up=0] [L17] COND FALSE !(i == range) VAL [i=9, range=10, up=0] [L20] COND FALSE !(up == 1) VAL [i=9, range=10, up=0] [L23] COND TRUE up == 0 [L24] i = i-1 VAL [i=8, range=10, up=0] [L26] COND TRUE i == range-2 [L27] range = range-1 VAL [i=8, range=9, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=8, range=9, up=0] [L14] COND FALSE !(i == 0) VAL [i=8, range=9, up=0] [L17] COND FALSE !(i == range) VAL [i=8, range=9, up=0] [L20] COND FALSE !(up == 1) VAL [i=8, range=9, up=0] [L23] COND TRUE up == 0 [L24] i = i-1 VAL [i=7, range=9, up=0] [L26] COND TRUE i == range-2 [L27] range = range-1 VAL [i=7, range=8, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=7, range=8, up=0] [L14] COND FALSE !(i == 0) VAL [i=7, range=8, up=0] [L17] COND FALSE !(i == range) VAL [i=7, range=8, up=0] [L20] COND FALSE !(up == 1) VAL [i=7, range=8, up=0] [L23] COND TRUE up == 0 [L24] i = i-1 VAL [i=6, range=8, up=0] [L26] COND TRUE i == range-2 [L27] range = range-1 VAL [i=6, range=7, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=6, range=7, up=0] [L14] COND FALSE !(i == 0) VAL [i=6, range=7, up=0] [L17] COND FALSE !(i == range) VAL [i=6, range=7, up=0] [L20] COND FALSE !(up == 1) VAL [i=6, range=7, up=0] [L23] COND TRUE up == 0 [L24] i = i-1 VAL [i=5, range=7, up=0] [L26] COND TRUE i == range-2 [L27] range = range-1 VAL [i=5, range=6, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=5, range=6, up=0] [L14] COND FALSE !(i == 0) VAL [i=5, range=6, up=0] [L17] COND FALSE !(i == range) VAL [i=5, range=6, up=0] [L20] COND FALSE !(up == 1) VAL [i=5, range=6, up=0] [L23] COND TRUE up == 0 [L24] i = i-1 VAL [i=4, range=6, up=0] [L26] COND TRUE i == range-2 [L27] range = range-1 VAL [i=4, range=5, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=4, range=5, up=0] [L14] COND FALSE !(i == 0) VAL [i=4, range=5, up=0] [L17] COND FALSE !(i == range) VAL [i=4, range=5, up=0] [L20] COND FALSE !(up == 1) VAL [i=4, range=5, up=0] [L23] COND TRUE up == 0 [L24] i = i-1 VAL [i=3, range=5, up=0] [L26] COND TRUE i == range-2 [L27] range = range-1 VAL [i=3, range=4, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=3, range=4, up=0] [L14] COND FALSE !(i == 0) VAL [i=3, range=4, up=0] [L17] COND FALSE !(i == range) VAL [i=3, range=4, up=0] [L20] COND FALSE !(up == 1) VAL [i=3, range=4, up=0] [L23] COND TRUE up == 0 [L24] i = i-1 VAL [i=2, range=4, up=0] [L26] COND TRUE i == range-2 [L27] range = range-1 VAL [i=2, range=3, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=2, range=3, up=0] [L14] COND FALSE !(i == 0) VAL [i=2, range=3, up=0] [L17] COND FALSE !(i == range) VAL [i=2, range=3, up=0] [L20] COND FALSE !(up == 1) VAL [i=2, range=3, up=0] [L23] COND TRUE up == 0 [L24] i = i-1 VAL [i=1, range=3, up=0] [L26] COND TRUE i == range-2 [L27] range = range-1 VAL [i=1, range=2, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=1, range=2, up=0] [L14] COND FALSE !(i == 0) VAL [i=1, range=2, up=0] [L17] COND FALSE !(i == range) VAL [i=1, range=2, up=0] [L20] COND FALSE !(up == 1) VAL [i=1, range=2, up=0] [L23] COND TRUE up == 0 [L24] i = i-1 VAL [i=0, range=2, up=0] [L26] COND TRUE i == range-2 [L27] range = range-1 VAL [i=0, range=1, up=0] [L13] COND TRUE 0 <= i && i <= range VAL [i=0, range=1, up=0] [L14] COND TRUE i == 0 [L15] up = 1 VAL [i=0, range=1, up=1] Loop: [L17] COND FALSE !(i == range) [L20] COND TRUE up == 1 [L21] i = i+1 [L23] COND FALSE !(up == 0) [L26] COND FALSE !(i == range-2) [L13] COND TRUE 0 <= i && i <= range [L14] COND FALSE !(i == 0) [L17] COND TRUE i == range [L18] up = 0 [L20] COND FALSE !(up == 1) [L23] COND TRUE up == 0 [L24] i = i-1 [L26] COND FALSE !(i == range-2) [L13] COND TRUE 0 <= i && i <= range [L14] COND TRUE i == 0 [L15] up = 1 End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2022-11-20 12:07:58,134 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91a165d0-ab4c-4573-9f37-beaecc793f82/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2022-11-20 12:07:58,337 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91a165d0-ab4c-4573-9f37-beaecc793f82/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0 [2022-11-20 12:07:58,538 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91a165d0-ab4c-4573-9f37-beaecc793f82/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Ended with exit code 0 [2022-11-20 12:07:58,737 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91a165d0-ab4c-4573-9f37-beaecc793f82/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2022-11-20 12:07:58,938 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91a165d0-ab4c-4573-9f37-beaecc793f82/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2022-11-20 12:07:59,139 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_91a165d0-ab4c-4573-9f37-beaecc793f82/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM)