./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 e04fb08f 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_7035803f-cbf2-4243-a7b4-85d954559161/bin/uautomizer-tPACEb0tL8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7035803f-cbf2-4243-a7b4-85d954559161/bin/uautomizer-tPACEb0tL8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7035803f-cbf2-4243-a7b4-85d954559161/bin/uautomizer-tPACEb0tL8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7035803f-cbf2-4243-a7b4-85d954559161/bin/uautomizer-tPACEb0tL8/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-restricted-15/Narrowing.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7035803f-cbf2-4243-a7b4-85d954559161/bin/uautomizer-tPACEb0tL8/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7035803f-cbf2-4243-a7b4-85d954559161/bin/uautomizer-tPACEb0tL8 --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-e04fb08 [2022-11-16 11:20:54,275 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-16 11:20:54,280 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-16 11:20:54,306 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-16 11:20:54,309 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-16 11:20:54,312 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-16 11:20:54,315 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-16 11:20:54,316 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-16 11:20:54,321 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-16 11:20:54,327 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-16 11:20:54,328 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-16 11:20:54,332 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-16 11:20:54,332 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-16 11:20:54,335 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-16 11:20:54,337 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-16 11:20:54,340 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-16 11:20:54,342 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-16 11:20:54,343 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-16 11:20:54,345 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-16 11:20:54,350 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-16 11:20:54,351 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-16 11:20:54,353 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-16 11:20:54,355 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-16 11:20:54,357 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-16 11:20:54,363 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-16 11:20:54,366 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-16 11:20:54,367 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-16 11:20:54,368 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-16 11:20:54,370 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-16 11:20:54,371 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-16 11:20:54,372 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-16 11:20:54,373 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-16 11:20:54,374 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-16 11:20:54,376 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-16 11:20:54,379 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-16 11:20:54,379 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-16 11:20:54,380 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-16 11:20:54,380 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-16 11:20:54,381 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-16 11:20:54,382 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-16 11:20:54,382 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-16 11:20:54,383 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7035803f-cbf2-4243-a7b4-85d954559161/bin/uautomizer-tPACEb0tL8/config/svcomp-Termination-64bit-Automizer_Default.epf [2022-11-16 11:20:54,422 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-16 11:20:54,422 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-16 11:20:54,423 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-16 11:20:54,423 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-16 11:20:54,425 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-16 11:20:54,425 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-16 11:20:54,426 INFO L138 SettingsManager]: * Use SBE=true [2022-11-16 11:20:54,426 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-11-16 11:20:54,426 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-11-16 11:20:54,426 INFO L138 SettingsManager]: * Use old map elimination=false [2022-11-16 11:20:54,427 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-11-16 11:20:54,428 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-11-16 11:20:54,428 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-11-16 11:20:54,428 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-16 11:20:54,428 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-16 11:20:54,429 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-16 11:20:54,429 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-16 11:20:54,429 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-11-16 11:20:54,429 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-11-16 11:20:54,429 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-11-16 11:20:54,430 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-16 11:20:54,430 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-11-16 11:20:54,430 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-16 11:20:54,432 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-11-16 11:20:54,432 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-16 11:20:54,432 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-16 11:20:54,432 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-16 11:20:54,433 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-16 11:20:54,434 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-11-16 11:20:54,434 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_7035803f-cbf2-4243-a7b4-85d954559161/bin/uautomizer-tPACEb0tL8/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_7035803f-cbf2-4243-a7b4-85d954559161/bin/uautomizer-tPACEb0tL8 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-16 11:20:54,802 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-16 11:20:54,840 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-16 11:20:54,844 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-16 11:20:54,846 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-16 11:20:54,847 INFO L275 PluginConnector]: CDTParser initialized [2022-11-16 11:20:54,849 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7035803f-cbf2-4243-a7b4-85d954559161/bin/uautomizer-tPACEb0tL8/../../sv-benchmarks/c/termination-restricted-15/Narrowing.c [2022-11-16 11:20:54,932 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7035803f-cbf2-4243-a7b4-85d954559161/bin/uautomizer-tPACEb0tL8/data/bba2681db/5fb61a1a05d64f638cb79ee6dfc636de/FLAG011974e4b [2022-11-16 11:20:55,360 INFO L306 CDTParser]: Found 1 translation units. [2022-11-16 11:20:55,361 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7035803f-cbf2-4243-a7b4-85d954559161/sv-benchmarks/c/termination-restricted-15/Narrowing.c [2022-11-16 11:20:55,373 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7035803f-cbf2-4243-a7b4-85d954559161/bin/uautomizer-tPACEb0tL8/data/bba2681db/5fb61a1a05d64f638cb79ee6dfc636de/FLAG011974e4b [2022-11-16 11:20:55,763 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7035803f-cbf2-4243-a7b4-85d954559161/bin/uautomizer-tPACEb0tL8/data/bba2681db/5fb61a1a05d64f638cb79ee6dfc636de [2022-11-16 11:20:55,766 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-16 11:20:55,769 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-16 11:20:55,774 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-16 11:20:55,775 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-16 11:20:55,779 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-16 11:20:55,780 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:20:55" (1/1) ... [2022-11-16 11:20:55,782 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@62bab3bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:20:55, skipping insertion in model container [2022-11-16 11:20:55,783 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:20:55" (1/1) ... [2022-11-16 11:20:55,791 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-16 11:20:55,806 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-16 11:20:55,983 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 11:20:55,988 INFO L203 MainTranslator]: Completed pre-run [2022-11-16 11:20:56,019 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 11:20:56,032 INFO L208 MainTranslator]: Completed translation [2022-11-16 11:20:56,033 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:20:56 WrapperNode [2022-11-16 11:20:56,033 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-16 11:20:56,035 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-16 11:20:56,035 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-16 11:20:56,035 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-16 11:20:56,043 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:20:56" (1/1) ... [2022-11-16 11:20:56,049 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:20:56" (1/1) ... [2022-11-16 11:20:56,067 INFO L138 Inliner]: procedures = 4, calls = 2, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 25 [2022-11-16 11:20:56,068 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-16 11:20:56,069 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-16 11:20:56,070 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-16 11:20:56,070 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-16 11:20:56,079 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:20:56" (1/1) ... [2022-11-16 11:20:56,079 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:20:56" (1/1) ... [2022-11-16 11:20:56,080 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:20:56" (1/1) ... [2022-11-16 11:20:56,081 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:20:56" (1/1) ... [2022-11-16 11:20:56,083 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:20:56" (1/1) ... [2022-11-16 11:20:56,087 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:20:56" (1/1) ... [2022-11-16 11:20:56,088 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:20:56" (1/1) ... [2022-11-16 11:20:56,089 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:20:56" (1/1) ... [2022-11-16 11:20:56,094 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-16 11:20:56,095 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-16 11:20:56,095 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-16 11:20:56,096 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-16 11:20:56,097 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:20:56" (1/1) ... [2022-11-16 11:20:56,104 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-16 11:20:56,114 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7035803f-cbf2-4243-a7b4-85d954559161/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:20:56,129 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7035803f-cbf2-4243-a7b4-85d954559161/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-16 11:20:56,143 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7035803f-cbf2-4243-a7b4-85d954559161/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2022-11-16 11:20:56,185 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-16 11:20:56,185 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-16 11:20:56,270 INFO L235 CfgBuilder]: Building ICFG [2022-11-16 11:20:56,273 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-16 11:20:56,411 INFO L276 CfgBuilder]: Performing block encoding [2022-11-16 11:20:56,417 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-16 11:20:56,417 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-16 11:20:56,419 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 11:20:56 BoogieIcfgContainer [2022-11-16 11:20:56,420 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-16 11:20:56,421 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-11-16 11:20:56,421 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-11-16 11:20:56,436 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-11-16 11:20:56,437 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-11-16 11:20:56,437 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 16.11 11:20:55" (1/3) ... [2022-11-16 11:20:56,438 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@12a743c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 16.11 11:20:56, skipping insertion in model container [2022-11-16 11:20:56,438 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-11-16 11:20:56,438 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:20:56" (2/3) ... [2022-11-16 11:20:56,439 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@12a743c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 16.11 11:20:56, skipping insertion in model container [2022-11-16 11:20:56,439 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-11-16 11:20:56,439 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 11:20:56" (3/3) ... [2022-11-16 11:20:56,441 INFO L332 chiAutomizerObserver]: Analyzing ICFG Narrowing.c [2022-11-16 11:20:56,491 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2022-11-16 11:20:56,491 INFO L304 stractBuchiCegarLoop]: Hoare is false [2022-11-16 11:20:56,491 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-11-16 11:20:56,491 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-11-16 11:20:56,492 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-11-16 11:20:56,492 INFO L308 stractBuchiCegarLoop]: Difference is false [2022-11-16 11:20:56,492 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-11-16 11:20:56,492 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-11-16 11:20:56,497 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-16 11:20:56,515 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2022-11-16 11:20:56,515 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-16 11:20:56,515 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-16 11:20:56,520 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-11-16 11:20:56,521 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2022-11-16 11:20:56,521 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-11-16 11:20:56,521 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-16 11:20:56,523 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2022-11-16 11:20:56,523 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-16 11:20:56,523 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-16 11:20:56,524 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-11-16 11:20:56,524 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2022-11-16 11:20:56,531 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-16 11:20:56,532 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-16 11:20:56,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:20:56,538 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2022-11-16 11:20:56,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:20:56,554 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589482756] [2022-11-16 11:20:56,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:20:56,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:20:56,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:20:56,645 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-16 11:20:56,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:20:56,680 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-16 11:20:56,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:20:56,685 INFO L85 PathProgramCache]: Analyzing trace with hash 1217822514, now seen corresponding path program 1 times [2022-11-16 11:20:56,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:20:56,686 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641978888] [2022-11-16 11:20:56,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:20:56,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:20:56,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:20:56,814 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-16 11:20:56,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:20:56,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641978888] [2022-11-16 11:20:56,816 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1641978888] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:20:56,816 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:20:56,817 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 11:20:56,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822381036] [2022-11-16 11:20:56,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:20:56,823 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-16 11:20:56,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:20:56,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:20:56,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:20:56,867 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-16 11:20:56,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:20:56,899 INFO L93 Difference]: Finished difference Result 22 states and 31 transitions. [2022-11-16 11:20:56,901 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 31 transitions. [2022-11-16 11:20:56,902 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2022-11-16 11:20:56,906 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 14 states and 23 transitions. [2022-11-16 11:20:56,907 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2022-11-16 11:20:56,907 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2022-11-16 11:20:56,908 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 23 transitions. [2022-11-16 11:20:56,908 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:20:56,909 INFO L218 hiAutomatonCegarLoop]: Abstraction has 14 states and 23 transitions. [2022-11-16 11:20:56,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 23 transitions. [2022-11-16 11:20:56,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2022-11-16 11:20:56,936 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-16 11:20:56,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 23 transitions. [2022-11-16 11:20:56,938 INFO L240 hiAutomatonCegarLoop]: Abstraction has 14 states and 23 transitions. [2022-11-16 11:20:56,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:20:56,943 INFO L428 stractBuchiCegarLoop]: Abstraction has 14 states and 23 transitions. [2022-11-16 11:20:56,943 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-11-16 11:20:56,943 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 23 transitions. [2022-11-16 11:20:56,944 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2022-11-16 11:20:56,944 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-16 11:20:56,944 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-16 11:20:56,945 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-11-16 11:20:56,945 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2022-11-16 11:20:56,945 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-16 11:20:56,946 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-16 11:20:56,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:20:56,947 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2022-11-16 11:20:56,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:20:56,947 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099254778] [2022-11-16 11:20:56,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:20:56,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:20:56,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:20:56,952 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-16 11:20:56,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:20:56,956 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-16 11:20:56,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:20:56,957 INFO L85 PathProgramCache]: Analyzing trace with hash 1215977394, now seen corresponding path program 1 times [2022-11-16 11:20:56,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:20:56,958 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622545028] [2022-11-16 11:20:56,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:20:56,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:20:56,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:20:57,010 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-16 11:20:57,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:20:57,011 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622545028] [2022-11-16 11:20:57,011 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [622545028] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:20:57,012 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:20:57,012 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 11:20:57,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921639486] [2022-11-16 11:20:57,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:20:57,013 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-16 11:20:57,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:20:57,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 11:20:57,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-16 11:20:57,014 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-16 11:20:57,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:20:57,100 INFO L93 Difference]: Finished difference Result 38 states and 61 transitions. [2022-11-16 11:20:57,100 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 61 transitions. [2022-11-16 11:20:57,104 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 36 [2022-11-16 11:20:57,109 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 38 states and 61 transitions. [2022-11-16 11:20:57,109 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 38 [2022-11-16 11:20:57,109 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 38 [2022-11-16 11:20:57,112 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 61 transitions. [2022-11-16 11:20:57,112 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:20:57,112 INFO L218 hiAutomatonCegarLoop]: Abstraction has 38 states and 61 transitions. [2022-11-16 11:20:57,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states and 61 transitions. [2022-11-16 11:20:57,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2022-11-16 11:20:57,116 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-16 11:20:57,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 61 transitions. [2022-11-16 11:20:57,117 INFO L240 hiAutomatonCegarLoop]: Abstraction has 38 states and 61 transitions. [2022-11-16 11:20:57,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 11:20:57,124 INFO L428 stractBuchiCegarLoop]: Abstraction has 38 states and 61 transitions. [2022-11-16 11:20:57,124 INFO L335 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-11-16 11:20:57,124 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 61 transitions. [2022-11-16 11:20:57,125 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 36 [2022-11-16 11:20:57,125 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-16 11:20:57,126 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-16 11:20:57,126 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-11-16 11:20:57,126 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2022-11-16 11:20:57,126 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-16 11:20:57,127 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-16 11:20:57,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:20:57,127 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2022-11-16 11:20:57,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:20:57,128 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087843803] [2022-11-16 11:20:57,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:20:57,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:20:57,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:20:57,132 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-16 11:20:57,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:20:57,136 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-16 11:20:57,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:20:57,137 INFO L85 PathProgramCache]: Analyzing trace with hash 1216035056, now seen corresponding path program 1 times [2022-11-16 11:20:57,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:20:57,137 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474424464] [2022-11-16 11:20:57,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:20:57,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:20:57,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:20:57,168 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-16 11:20:57,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:20:57,168 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474424464] [2022-11-16 11:20:57,169 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [474424464] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:20:57,171 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:20:57,171 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 11:20:57,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762981180] [2022-11-16 11:20:57,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:20:57,172 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-16 11:20:57,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:20:57,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:20:57,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:20:57,173 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-16 11:20:57,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:20:57,191 INFO L93 Difference]: Finished difference Result 38 states and 58 transitions. [2022-11-16 11:20:57,191 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 58 transitions. [2022-11-16 11:20:57,193 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 36 [2022-11-16 11:20:57,194 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 38 states and 58 transitions. [2022-11-16 11:20:57,194 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 38 [2022-11-16 11:20:57,195 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 38 [2022-11-16 11:20:57,195 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 58 transitions. [2022-11-16 11:20:57,195 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:20:57,195 INFO L218 hiAutomatonCegarLoop]: Abstraction has 38 states and 58 transitions. [2022-11-16 11:20:57,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states and 58 transitions. [2022-11-16 11:20:57,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 32. [2022-11-16 11:20:57,200 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-16 11:20:57,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 49 transitions. [2022-11-16 11:20:57,201 INFO L240 hiAutomatonCegarLoop]: Abstraction has 32 states and 49 transitions. [2022-11-16 11:20:57,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:20:57,203 INFO L428 stractBuchiCegarLoop]: Abstraction has 32 states and 49 transitions. [2022-11-16 11:20:57,203 INFO L335 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-11-16 11:20:57,203 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 49 transitions. [2022-11-16 11:20:57,204 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 30 [2022-11-16 11:20:57,206 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-16 11:20:57,206 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-16 11:20:57,206 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-11-16 11:20:57,206 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2022-11-16 11:20:57,207 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-16 11:20:57,207 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-16 11:20:57,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:20:57,208 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2022-11-16 11:20:57,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:20:57,208 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275981743] [2022-11-16 11:20:57,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:20:57,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:20:57,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:20:57,214 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-16 11:20:57,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:20:57,226 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-16 11:20:57,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:20:57,227 INFO L85 PathProgramCache]: Analyzing trace with hash 1217884020, now seen corresponding path program 1 times [2022-11-16 11:20:57,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:20:57,228 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638168551] [2022-11-16 11:20:57,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:20:57,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:20:57,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:20:57,237 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-16 11:20:57,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:20:57,245 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-16 11:20:57,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:20:57,246 INFO L85 PathProgramCache]: Analyzing trace with hash 297933238, now seen corresponding path program 1 times [2022-11-16 11:20:57,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:20:57,246 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134748551] [2022-11-16 11:20:57,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:20:57,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:20:57,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:20:57,253 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-16 11:20:57,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:20:57,275 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-16 11:20:57,407 INFO L210 LassoAnalysis]: Preferences: [2022-11-16 11:20:57,408 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-11-16 11:20:57,408 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-11-16 11:20:57,408 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-11-16 11:20:57,408 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-11-16 11:20:57,409 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-16 11:20:57,409 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-11-16 11:20:57,409 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-11-16 11:20:57,409 INFO L133 ssoRankerPreferences]: Filename of dumped script: Narrowing.c_Iteration4_Loop [2022-11-16 11:20:57,409 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-11-16 11:20:57,409 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-11-16 11:20:57,428 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-16 11:20:57,440 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-16 11:20:57,444 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-16 11:20:57,460 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-16 11:20:57,626 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-11-16 11:20:57,627 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-11-16 11:20:57,629 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-16 11:20:57,630 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7035803f-cbf2-4243-a7b4-85d954559161/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:20:57,634 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7035803f-cbf2-4243-a7b4-85d954559161/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-16 11:20:57,645 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-11-16 11:20:57,645 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-11-16 11:20:57,658 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7035803f-cbf2-4243-a7b4-85d954559161/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2022-11-16 11:20:57,679 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-11-16 11:20:57,679 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-16 11:20:57,689 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7035803f-cbf2-4243-a7b4-85d954559161/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2022-11-16 11:20:57,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-16 11:20:57,689 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7035803f-cbf2-4243-a7b4-85d954559161/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:20:57,695 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7035803f-cbf2-4243-a7b4-85d954559161/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-16 11:20:57,700 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-11-16 11:20:57,700 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-11-16 11:20:57,713 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7035803f-cbf2-4243-a7b4-85d954559161/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2022-11-16 11:20:57,723 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-11-16 11:20:57,723 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-16 11:20:57,732 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7035803f-cbf2-4243-a7b4-85d954559161/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2022-11-16 11:20:57,733 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-16 11:20:57,733 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7035803f-cbf2-4243-a7b4-85d954559161/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:20:57,735 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7035803f-cbf2-4243-a7b4-85d954559161/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-16 11:20:57,744 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-11-16 11:20:57,744 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-11-16 11:20:57,757 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7035803f-cbf2-4243-a7b4-85d954559161/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2022-11-16 11:20:57,783 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7035803f-cbf2-4243-a7b4-85d954559161/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2022-11-16 11:20:57,783 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-16 11:20:57,783 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7035803f-cbf2-4243-a7b4-85d954559161/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:20:57,785 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7035803f-cbf2-4243-a7b4-85d954559161/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-16 11:20:57,794 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-11-16 11:20:57,794 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-11-16 11:20:57,794 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7035803f-cbf2-4243-a7b4-85d954559161/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2022-11-16 11:20:57,835 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-11-16 11:20:57,847 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7035803f-cbf2-4243-a7b4-85d954559161/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2022-11-16 11:20:57,848 INFO L210 LassoAnalysis]: Preferences: [2022-11-16 11:20:57,848 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-11-16 11:20:57,848 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-11-16 11:20:57,848 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-11-16 11:20:57,849 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-11-16 11:20:57,849 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-16 11:20:57,849 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-11-16 11:20:57,849 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-11-16 11:20:57,849 INFO L133 ssoRankerPreferences]: Filename of dumped script: Narrowing.c_Iteration4_Loop [2022-11-16 11:20:57,849 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-11-16 11:20:57,849 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-11-16 11:20:57,851 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-16 11:20:57,860 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-16 11:20:57,878 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-16 11:20:57,883 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-16 11:20:57,974 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-11-16 11:20:57,978 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-11-16 11:20:57,980 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-16 11:20:57,980 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7035803f-cbf2-4243-a7b4-85d954559161/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:20:57,983 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7035803f-cbf2-4243-a7b4-85d954559161/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-16 11:20:57,996 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7035803f-cbf2-4243-a7b4-85d954559161/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2022-11-16 11:20:57,996 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-16 11:20:58,009 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-16 11:20:58,010 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-16 11:20:58,010 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-16 11:20:58,010 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-16 11:20:58,016 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-16 11:20:58,017 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-16 11:20:58,039 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-16 11:20:58,048 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7035803f-cbf2-4243-a7b4-85d954559161/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2022-11-16 11:20:58,048 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-16 11:20:58,048 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7035803f-cbf2-4243-a7b4-85d954559161/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:20:58,050 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7035803f-cbf2-4243-a7b4-85d954559161/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-16 11:20:58,064 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7035803f-cbf2-4243-a7b4-85d954559161/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2022-11-16 11:20:58,065 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-16 11:20:58,077 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-16 11:20:58,077 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-16 11:20:58,078 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-16 11:20:58,078 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-16 11:20:58,078 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-16 11:20:58,081 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-16 11:20:58,081 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-16 11:20:58,091 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-11-16 11:20:58,096 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-11-16 11:20:58,097 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2022-11-16 11:20:58,098 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-16 11:20:58,098 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7035803f-cbf2-4243-a7b4-85d954559161/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:20:58,103 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7035803f-cbf2-4243-a7b4-85d954559161/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-16 11:20:58,108 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7035803f-cbf2-4243-a7b4-85d954559161/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2022-11-16 11:20:58,109 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-11-16 11:20:58,109 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-11-16 11:20:58,109 INFO L513 LassoAnalysis]: Proved termination. [2022-11-16 11:20:58,109 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-16 11:20:58,117 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7035803f-cbf2-4243-a7b4-85d954559161/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2022-11-16 11:20:58,121 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-11-16 11:20:58,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:20:58,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:20:58,156 INFO L263 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-16 11:20:58,157 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:20:58,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:20:58,173 INFO L263 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-16 11:20:58,173 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:20:58,246 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-16 11:20:58,251 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-16 11:20:58,252 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-16 11:20:58,311 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-16 11:20:58,312 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-16 11:20:58,313 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-16 11:20:58,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2022-11-16 11:20:58,315 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 2 letters. Loop has 6 letters. [2022-11-16 11:20:58,316 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-16 11:20:58,316 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 8 letters. Loop has 6 letters. [2022-11-16 11:20:58,316 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-16 11:20:58,316 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 2 letters. Loop has 12 letters. [2022-11-16 11:20:58,317 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-16 11:20:58,317 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 100 states and 152 transitions. [2022-11-16 11:20:58,320 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 60 [2022-11-16 11:20:58,322 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 100 states to 100 states and 152 transitions. [2022-11-16 11:20:58,322 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 63 [2022-11-16 11:20:58,322 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 66 [2022-11-16 11:20:58,323 INFO L73 IsDeterministic]: Start isDeterministic. Operand 100 states and 152 transitions. [2022-11-16 11:20:58,323 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-16 11:20:58,323 INFO L218 hiAutomatonCegarLoop]: Abstraction has 100 states and 152 transitions. [2022-11-16 11:20:58,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states and 152 transitions. [2022-11-16 11:20:58,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 89. [2022-11-16 11:20:58,330 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-16 11:20:58,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 138 transitions. [2022-11-16 11:20:58,332 INFO L240 hiAutomatonCegarLoop]: Abstraction has 89 states and 138 transitions. [2022-11-16 11:20:58,332 INFO L428 stractBuchiCegarLoop]: Abstraction has 89 states and 138 transitions. [2022-11-16 11:20:58,332 INFO L335 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2022-11-16 11:20:58,332 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 89 states and 138 transitions. [2022-11-16 11:20:58,334 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 54 [2022-11-16 11:20:58,334 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-16 11:20:58,334 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-16 11:20:58,335 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2022-11-16 11:20:58,335 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2022-11-16 11:20:58,335 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-16 11:20:58,335 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-16 11:20:58,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:20:58,336 INFO L85 PathProgramCache]: Analyzing trace with hash 29864, now seen corresponding path program 1 times [2022-11-16 11:20:58,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:20:58,336 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506881587] [2022-11-16 11:20:58,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:20:58,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:20:58,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:20:58,341 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-16 11:20:58,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:20:58,344 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-16 11:20:58,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:20:58,345 INFO L85 PathProgramCache]: Analyzing trace with hash 1366755632, now seen corresponding path program 1 times [2022-11-16 11:20:58,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:20:58,345 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879258690] [2022-11-16 11:20:58,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:20:58,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:20:58,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:20:58,354 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-16 11:20:58,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:20:58,358 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-16 11:20:58,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:20:58,359 INFO L85 PathProgramCache]: Analyzing trace with hash 645997719, now seen corresponding path program 1 times [2022-11-16 11:20:58,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:20:58,360 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817746735] [2022-11-16 11:20:58,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:20:58,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:20:58,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:20:58,385 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-16 11:20:58,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:20:58,385 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817746735] [2022-11-16 11:20:58,385 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1817746735] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:20:58,386 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:20:58,386 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 11:20:58,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663931792] [2022-11-16 11:20:58,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:20:58,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:20:58,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:20:58,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:20:58,432 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-16 11:20:58,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:20:58,445 INFO L93 Difference]: Finished difference Result 77 states and 112 transitions. [2022-11-16 11:20:58,445 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 77 states and 112 transitions. [2022-11-16 11:20:58,447 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 38 [2022-11-16 11:20:58,447 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 77 states to 71 states and 102 transitions. [2022-11-16 11:20:58,448 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 45 [2022-11-16 11:20:58,448 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 45 [2022-11-16 11:20:58,448 INFO L73 IsDeterministic]: Start isDeterministic. Operand 71 states and 102 transitions. [2022-11-16 11:20:58,448 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-16 11:20:58,448 INFO L218 hiAutomatonCegarLoop]: Abstraction has 71 states and 102 transitions. [2022-11-16 11:20:58,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states and 102 transitions. [2022-11-16 11:20:58,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 65. [2022-11-16 11:20:58,453 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-16 11:20:58,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 94 transitions. [2022-11-16 11:20:58,454 INFO L240 hiAutomatonCegarLoop]: Abstraction has 65 states and 94 transitions. [2022-11-16 11:20:58,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:20:58,455 INFO L428 stractBuchiCegarLoop]: Abstraction has 65 states and 94 transitions. [2022-11-16 11:20:58,456 INFO L335 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2022-11-16 11:20:58,456 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 65 states and 94 transitions. [2022-11-16 11:20:58,457 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 35 [2022-11-16 11:20:58,457 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-16 11:20:58,457 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-16 11:20:58,457 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2022-11-16 11:20:58,457 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2022-11-16 11:20:58,458 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-16 11:20:58,458 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-16 11:20:58,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:20:58,458 INFO L85 PathProgramCache]: Analyzing trace with hash 925798, now seen corresponding path program 1 times [2022-11-16 11:20:58,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:20:58,459 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727748968] [2022-11-16 11:20:58,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:20:58,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:20:58,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:20:58,463 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-16 11:20:58,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:20:58,467 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-16 11:20:58,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:20:58,468 INFO L85 PathProgramCache]: Analyzing trace with hash 1544255282, now seen corresponding path program 2 times [2022-11-16 11:20:58,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:20:58,468 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190405549] [2022-11-16 11:20:58,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:20:58,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:20:58,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:20:58,473 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-16 11:20:58,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:20:58,477 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-16 11:20:58,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:20:58,478 INFO L85 PathProgramCache]: Analyzing trace with hash 1071052759, now seen corresponding path program 1 times [2022-11-16 11:20:58,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:20:58,478 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315716720] [2022-11-16 11:20:58,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:20:58,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:20:58,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:20:58,502 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-16 11:20:58,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:20:58,503 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315716720] [2022-11-16 11:20:58,503 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [315716720] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:20:58,503 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:20:58,503 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 11:20:58,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961441077] [2022-11-16 11:20:58,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:20:58,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:20:58,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:20:58,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:20:58,557 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-16 11:20:58,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:20:58,573 INFO L93 Difference]: Finished difference Result 49 states and 66 transitions. [2022-11-16 11:20:58,574 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 66 transitions. [2022-11-16 11:20:58,574 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2022-11-16 11:20:58,575 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 47 states and 64 transitions. [2022-11-16 11:20:58,575 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 34 [2022-11-16 11:20:58,575 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 34 [2022-11-16 11:20:58,576 INFO L73 IsDeterministic]: Start isDeterministic. Operand 47 states and 64 transitions. [2022-11-16 11:20:58,576 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-16 11:20:58,576 INFO L218 hiAutomatonCegarLoop]: Abstraction has 47 states and 64 transitions. [2022-11-16 11:20:58,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states and 64 transitions. [2022-11-16 11:20:58,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 42. [2022-11-16 11:20:58,591 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-16 11:20:58,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 58 transitions. [2022-11-16 11:20:58,592 INFO L240 hiAutomatonCegarLoop]: Abstraction has 42 states and 58 transitions. [2022-11-16 11:20:58,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:20:58,597 INFO L428 stractBuchiCegarLoop]: Abstraction has 42 states and 58 transitions. [2022-11-16 11:20:58,597 INFO L335 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2022-11-16 11:20:58,597 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 42 states and 58 transitions. [2022-11-16 11:20:58,599 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2022-11-16 11:20:58,600 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-16 11:20:58,600 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-16 11:20:58,600 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-11-16 11:20:58,600 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2022-11-16 11:20:58,601 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-16 11:20:58,601 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-16 11:20:58,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:20:58,601 INFO L85 PathProgramCache]: Analyzing trace with hash 28699760, now seen corresponding path program 1 times [2022-11-16 11:20:58,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:20:58,602 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701079169] [2022-11-16 11:20:58,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:20:58,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:20:58,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:20:58,606 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-16 11:20:58,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:20:58,609 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-16 11:20:58,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:20:58,610 INFO L85 PathProgramCache]: Analyzing trace with hash 1664464050, now seen corresponding path program 1 times [2022-11-16 11:20:58,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:20:58,610 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221448373] [2022-11-16 11:20:58,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:20:58,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:20:58,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:20:58,628 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-16 11:20:58,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:20:58,637 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-16 11:20:58,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:20:58,637 INFO L85 PathProgramCache]: Analyzing trace with hash -1214361119, now seen corresponding path program 1 times [2022-11-16 11:20:58,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:20:58,638 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690205194] [2022-11-16 11:20:58,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:20:58,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:20:58,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:20:58,643 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-16 11:20:58,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:20:58,660 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-16 11:20:58,735 INFO L210 LassoAnalysis]: Preferences: [2022-11-16 11:20:58,735 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-11-16 11:20:58,735 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-11-16 11:20:58,735 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-11-16 11:20:58,735 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-11-16 11:20:58,735 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-16 11:20:58,735 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-11-16 11:20:58,735 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-11-16 11:20:58,736 INFO L133 ssoRankerPreferences]: Filename of dumped script: Narrowing.c_Iteration7_Loop [2022-11-16 11:20:58,736 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-11-16 11:20:58,736 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-11-16 11:20:58,744 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-16 11:20:58,748 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-16 11:20:58,751 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-16 11:20:58,754 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-16 11:20:58,906 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-11-16 11:20:58,906 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-11-16 11:20:58,906 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-16 11:20:58,906 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7035803f-cbf2-4243-a7b4-85d954559161/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:20:58,907 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7035803f-cbf2-4243-a7b4-85d954559161/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-16 11:20:58,917 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-11-16 11:20:58,917 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-11-16 11:20:58,947 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7035803f-cbf2-4243-a7b4-85d954559161/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2022-11-16 11:20:58,963 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7035803f-cbf2-4243-a7b4-85d954559161/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2022-11-16 11:20:58,964 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-11-16 11:20:58,965 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-16 11:20:58,971 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7035803f-cbf2-4243-a7b4-85d954559161/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2022-11-16 11:20:58,972 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-16 11:20:58,972 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7035803f-cbf2-4243-a7b4-85d954559161/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:20:58,973 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7035803f-cbf2-4243-a7b4-85d954559161/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-16 11:20:58,988 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-11-16 11:20:58,988 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-11-16 11:20:58,989 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7035803f-cbf2-4243-a7b4-85d954559161/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2022-11-16 11:20:59,023 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-11-16 11:20:59,023 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-16 11:20:59,033 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7035803f-cbf2-4243-a7b4-85d954559161/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2022-11-16 11:20:59,033 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-16 11:20:59,033 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7035803f-cbf2-4243-a7b4-85d954559161/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:20:59,034 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7035803f-cbf2-4243-a7b4-85d954559161/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-16 11:20:59,038 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7035803f-cbf2-4243-a7b4-85d954559161/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2022-11-16 11:20:59,040 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-11-16 11:20:59,040 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-11-16 11:20:59,067 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-11-16 11:20:59,067 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-16 11:20:59,076 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7035803f-cbf2-4243-a7b4-85d954559161/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2022-11-16 11:20:59,076 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-16 11:20:59,077 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7035803f-cbf2-4243-a7b4-85d954559161/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:20:59,078 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7035803f-cbf2-4243-a7b4-85d954559161/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-16 11:20:59,089 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-11-16 11:20:59,089 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-11-16 11:20:59,101 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7035803f-cbf2-4243-a7b4-85d954559161/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2022-11-16 11:20:59,120 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7035803f-cbf2-4243-a7b4-85d954559161/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2022-11-16 11:20:59,121 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-16 11:20:59,121 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7035803f-cbf2-4243-a7b4-85d954559161/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:20:59,123 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7035803f-cbf2-4243-a7b4-85d954559161/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-16 11:20:59,132 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-11-16 11:20:59,133 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-11-16 11:20:59,143 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7035803f-cbf2-4243-a7b4-85d954559161/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2022-11-16 11:20:59,442 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-11-16 11:20:59,447 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7035803f-cbf2-4243-a7b4-85d954559161/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2022-11-16 11:20:59,448 INFO L210 LassoAnalysis]: Preferences: [2022-11-16 11:20:59,448 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-11-16 11:20:59,448 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-11-16 11:20:59,448 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-11-16 11:20:59,448 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-11-16 11:20:59,448 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-16 11:20:59,448 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-11-16 11:20:59,448 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-11-16 11:20:59,448 INFO L133 ssoRankerPreferences]: Filename of dumped script: Narrowing.c_Iteration7_Loop [2022-11-16 11:20:59,449 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-11-16 11:20:59,449 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-11-16 11:20:59,451 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-16 11:20:59,462 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-16 11:20:59,469 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-16 11:20:59,472 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-16 11:20:59,621 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-11-16 11:20:59,621 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-11-16 11:20:59,621 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-16 11:20:59,622 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7035803f-cbf2-4243-a7b4-85d954559161/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:20:59,623 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7035803f-cbf2-4243-a7b4-85d954559161/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-16 11:20:59,632 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-16 11:20:59,644 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-16 11:20:59,644 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-16 11:20:59,644 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-16 11:20:59,645 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-16 11:20:59,647 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7035803f-cbf2-4243-a7b4-85d954559161/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2022-11-16 11:20:59,648 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-16 11:20:59,648 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-16 11:20:59,659 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-16 11:20:59,668 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7035803f-cbf2-4243-a7b4-85d954559161/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2022-11-16 11:20:59,668 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-16 11:20:59,669 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7035803f-cbf2-4243-a7b4-85d954559161/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:20:59,670 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7035803f-cbf2-4243-a7b4-85d954559161/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-16 11:20:59,678 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-16 11:20:59,691 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7035803f-cbf2-4243-a7b4-85d954559161/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2022-11-16 11:20:59,692 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-16 11:20:59,692 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-16 11:20:59,692 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-16 11:20:59,692 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-16 11:20:59,695 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-16 11:20:59,695 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-11-16 11:20:59,715 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-16 11:20:59,724 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7035803f-cbf2-4243-a7b4-85d954559161/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2022-11-16 11:20:59,724 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-16 11:20:59,724 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7035803f-cbf2-4243-a7b4-85d954559161/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:20:59,725 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7035803f-cbf2-4243-a7b4-85d954559161/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-16 11:20:59,731 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-16 11:20:59,744 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-16 11:20:59,745 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-16 11:20:59,745 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-16 11:20:59,745 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-16 11:20:59,745 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-16 11:20:59,746 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7035803f-cbf2-4243-a7b4-85d954559161/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2022-11-16 11:20:59,746 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-16 11:20:59,746 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-16 11:20:59,767 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-16 11:20:59,771 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7035803f-cbf2-4243-a7b4-85d954559161/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2022-11-16 11:20:59,772 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-16 11:20:59,772 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7035803f-cbf2-4243-a7b4-85d954559161/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:20:59,773 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7035803f-cbf2-4243-a7b4-85d954559161/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-16 11:20:59,783 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7035803f-cbf2-4243-a7b4-85d954559161/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2022-11-16 11:20:59,784 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-16 11:20:59,798 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-16 11:20:59,798 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-16 11:20:59,798 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-16 11:20:59,798 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2022-11-16 11:20:59,798 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-16 11:20:59,801 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-11-16 11:20:59,801 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-16 11:20:59,812 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-11-16 11:20:59,817 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2022-11-16 11:20:59,817 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2022-11-16 11:20:59,818 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-16 11:20:59,818 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7035803f-cbf2-4243-a7b4-85d954559161/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:20:59,819 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7035803f-cbf2-4243-a7b4-85d954559161/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-16 11:20:59,828 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-11-16 11:20:59,828 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-11-16 11:20:59,828 INFO L513 LassoAnalysis]: Proved termination. [2022-11-16 11:20:59,828 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-16 11:20:59,832 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7035803f-cbf2-4243-a7b4-85d954559161/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2022-11-16 11:20:59,832 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7035803f-cbf2-4243-a7b4-85d954559161/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2022-11-16 11:20:59,834 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-11-16 11:20:59,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:20:59,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:20:59,863 INFO L263 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-16 11:20:59,864 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:20:59,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:20:59,889 INFO L263 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-16 11:20:59,890 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:20:59,952 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-16 11:20:59,954 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-16 11:20:59,954 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-16 11:21:00,020 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-16 11:21:00,022 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-16 11:21:00,023 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-16 11:21:00,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 25 transitions. [2022-11-16 11:21:00,028 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 5 letters. Loop has 6 letters. [2022-11-16 11:21:00,029 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-16 11:21:00,029 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 11 letters. Loop has 6 letters. [2022-11-16 11:21:00,029 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-16 11:21:00,030 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 5 letters. Loop has 12 letters. [2022-11-16 11:21:00,030 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-16 11:21:00,032 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 91 states and 124 transitions. [2022-11-16 11:21:00,035 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2022-11-16 11:21:00,039 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 91 states to 78 states and 107 transitions. [2022-11-16 11:21:00,039 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 42 [2022-11-16 11:21:00,039 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 45 [2022-11-16 11:21:00,043 INFO L73 IsDeterministic]: Start isDeterministic. Operand 78 states and 107 transitions. [2022-11-16 11:21:00,043 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-16 11:21:00,043 INFO L218 hiAutomatonCegarLoop]: Abstraction has 78 states and 107 transitions. [2022-11-16 11:21:00,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states and 107 transitions. [2022-11-16 11:21:00,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 72. [2022-11-16 11:21:00,049 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-16 11:21:00,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 101 transitions. [2022-11-16 11:21:00,050 INFO L240 hiAutomatonCegarLoop]: Abstraction has 72 states and 101 transitions. [2022-11-16 11:21:00,050 INFO L428 stractBuchiCegarLoop]: Abstraction has 72 states and 101 transitions. [2022-11-16 11:21:00,050 INFO L335 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2022-11-16 11:21:00,050 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 72 states and 101 transitions. [2022-11-16 11:21:00,051 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2022-11-16 11:21:00,051 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-16 11:21:00,051 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-16 11:21:00,052 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:21:00,052 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2022-11-16 11:21:00,052 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-16 11:21:00,052 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-16 11:21:00,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:21:00,053 INFO L85 PathProgramCache]: Analyzing trace with hash -1968356129, now seen corresponding path program 1 times [2022-11-16 11:21:00,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:21:00,053 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154837129] [2022-11-16 11:21:00,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:21:00,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:21:00,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:21:00,134 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-16 11:21:00,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:21:00,135 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154837129] [2022-11-16 11:21:00,135 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1154837129] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:21:00,135 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1529391742] [2022-11-16 11:21:00,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:21:00,136 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:21:00,136 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7035803f-cbf2-4243-a7b4-85d954559161/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:21:00,137 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7035803f-cbf2-4243-a7b4-85d954559161/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:21:00,141 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7035803f-cbf2-4243-a7b4-85d954559161/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-11-16 11:21:00,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:21:00,171 INFO L263 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-16 11:21:00,172 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:21:00,201 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-16 11:21:00,202 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:21:00,250 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-16 11:21:00,251 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1529391742] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 11:21:00,251 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 11:21:00,251 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2022-11-16 11:21:00,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607532204] [2022-11-16 11:21:00,252 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 11:21:00,252 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-11-16 11:21:00,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:21:00,253 INFO L85 PathProgramCache]: Analyzing trace with hash 1664464050, now seen corresponding path program 2 times [2022-11-16 11:21:00,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:21:00,253 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715994518] [2022-11-16 11:21:00,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:21:00,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:21:00,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:21:00,258 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-16 11:21:00,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:21:00,262 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-16 11:21:00,328 INFO L210 LassoAnalysis]: Preferences: [2022-11-16 11:21:00,328 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-11-16 11:21:00,329 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-11-16 11:21:00,329 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-11-16 11:21:00,329 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-11-16 11:21:00,329 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-16 11:21:00,329 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-11-16 11:21:00,329 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-11-16 11:21:00,329 INFO L133 ssoRankerPreferences]: Filename of dumped script: Narrowing.c_Iteration8_Loop [2022-11-16 11:21:00,330 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-11-16 11:21:00,330 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-11-16 11:21:00,331 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-16 11:21:00,350 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-16 11:21:00,353 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-16 11:21:00,357 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-16 11:21:00,492 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-11-16 11:21:00,492 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-11-16 11:21:00,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-16 11:21:00,493 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7035803f-cbf2-4243-a7b4-85d954559161/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:21:00,534 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7035803f-cbf2-4243-a7b4-85d954559161/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-16 11:21:00,546 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-11-16 11:21:00,546 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-11-16 11:21:00,559 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7035803f-cbf2-4243-a7b4-85d954559161/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2022-11-16 11:21:00,578 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7035803f-cbf2-4243-a7b4-85d954559161/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2022-11-16 11:21:00,578 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-16 11:21:00,579 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7035803f-cbf2-4243-a7b4-85d954559161/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:21:00,580 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7035803f-cbf2-4243-a7b4-85d954559161/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-16 11:21:00,588 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-11-16 11:21:00,588 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-11-16 11:21:00,601 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7035803f-cbf2-4243-a7b4-85d954559161/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2022-11-16 11:21:00,836 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-11-16 11:21:00,840 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7035803f-cbf2-4243-a7b4-85d954559161/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2022-11-16 11:21:00,840 INFO L210 LassoAnalysis]: Preferences: [2022-11-16 11:21:00,840 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-11-16 11:21:00,840 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-11-16 11:21:00,840 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-11-16 11:21:00,841 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-11-16 11:21:00,841 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-16 11:21:00,841 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-11-16 11:21:00,841 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-11-16 11:21:00,841 INFO L133 ssoRankerPreferences]: Filename of dumped script: Narrowing.c_Iteration8_Loop [2022-11-16 11:21:00,841 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-11-16 11:21:00,841 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-11-16 11:21:00,842 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-16 11:21:00,868 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-16 11:21:00,872 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-16 11:21:00,876 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-16 11:21:00,999 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-11-16 11:21:00,999 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-11-16 11:21:01,000 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-16 11:21:01,000 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7035803f-cbf2-4243-a7b4-85d954559161/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:21:01,010 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7035803f-cbf2-4243-a7b4-85d954559161/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-16 11:21:01,014 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-16 11:21:01,015 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7035803f-cbf2-4243-a7b4-85d954559161/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2022-11-16 11:21:01,027 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-16 11:21:01,027 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-16 11:21:01,027 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-16 11:21:01,028 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2022-11-16 11:21:01,028 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-16 11:21:01,030 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-11-16 11:21:01,030 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-16 11:21:01,047 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-11-16 11:21:01,061 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2022-11-16 11:21:01,062 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2022-11-16 11:21:01,062 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-16 11:21:01,062 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7035803f-cbf2-4243-a7b4-85d954559161/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:21:01,067 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7035803f-cbf2-4243-a7b4-85d954559161/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-16 11:21:01,080 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-11-16 11:21:01,080 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-11-16 11:21:01,080 INFO L513 LassoAnalysis]: Proved termination. [2022-11-16 11:21:01,080 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-16 11:21:01,080 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7035803f-cbf2-4243-a7b4-85d954559161/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2022-11-16 11:21:01,088 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7035803f-cbf2-4243-a7b4-85d954559161/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2022-11-16 11:21:01,089 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-11-16 11:21:01,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:21:01,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:21:01,117 INFO L263 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-16 11:21:01,117 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:21:01,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:21:01,138 INFO L263 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-16 11:21:01,139 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:21:01,179 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-16 11:21:01,179 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-16 11:21:01,180 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-16 11:21:01,225 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-16 11:21:01,226 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-16 11:21:01,227 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-16 11:21:01,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 25 transitions. [2022-11-16 11:21:01,227 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 11 letters. Loop has 6 letters. [2022-11-16 11:21:01,227 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-16 11:21:01,227 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2022-11-16 11:21:01,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:21:01,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:21:01,249 INFO L263 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-16 11:21:01,249 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:21:01,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:21:01,277 INFO L263 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-16 11:21:01,278 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:21:01,318 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-16 11:21:01,319 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-16 11:21:01,319 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-16 11:21:01,405 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7035803f-cbf2-4243-a7b4-85d954559161/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2022-11-16 11:21:01,413 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7035803f-cbf2-4243-a7b4-85d954559161/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2022-11-16 11:21:01,418 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-16 11:21:01,422 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-16 11:21:01,422 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-16 11:21:01,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 31 transitions. [2022-11-16 11:21:01,423 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 31 transitions. Stem has 11 letters. Loop has 6 letters. [2022-11-16 11:21:01,423 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-16 11:21:01,423 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2022-11-16 11:21:01,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:21:01,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:21:01,449 INFO L263 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-16 11:21:01,450 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:21:01,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:21:01,472 INFO L263 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-16 11:21:01,473 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:21:01,509 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-16 11:21:01,510 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-16 11:21:01,511 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-16 11:21:01,550 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-16 11:21:01,551 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-16 11:21:01,552 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-16 11:21:01,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 29 transitions. [2022-11-16 11:21:01,553 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 29 transitions. Stem has 11 letters. Loop has 6 letters. [2022-11-16 11:21:01,555 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-16 11:21:01,556 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 29 transitions. Stem has 17 letters. Loop has 6 letters. [2022-11-16 11:21:01,557 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-16 11:21:01,557 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 29 transitions. Stem has 11 letters. Loop has 12 letters. [2022-11-16 11:21:01,560 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-16 11:21:01,560 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 113 states and 165 transitions. [2022-11-16 11:21:01,562 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 35 [2022-11-16 11:21:01,563 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 113 states to 85 states and 121 transitions. [2022-11-16 11:21:01,564 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 34 [2022-11-16 11:21:01,564 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 40 [2022-11-16 11:21:01,564 INFO L73 IsDeterministic]: Start isDeterministic. Operand 85 states and 121 transitions. [2022-11-16 11:21:01,564 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-16 11:21:01,564 INFO L218 hiAutomatonCegarLoop]: Abstraction has 85 states and 121 transitions. [2022-11-16 11:21:01,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states and 121 transitions. [2022-11-16 11:21:01,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 50. [2022-11-16 11:21:01,576 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-16 11:21:01,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 73 transitions. [2022-11-16 11:21:01,576 INFO L240 hiAutomatonCegarLoop]: Abstraction has 50 states and 73 transitions. [2022-11-16 11:21:01,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:21:01,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 11:21:01,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-16 11:21:01,580 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-16 11:21:01,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:21:01,689 INFO L93 Difference]: Finished difference Result 209 states and 277 transitions. [2022-11-16 11:21:01,690 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 209 states and 277 transitions. [2022-11-16 11:21:01,692 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 82 [2022-11-16 11:21:01,694 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 209 states to 199 states and 266 transitions. [2022-11-16 11:21:01,694 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 95 [2022-11-16 11:21:01,695 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 95 [2022-11-16 11:21:01,695 INFO L73 IsDeterministic]: Start isDeterministic. Operand 199 states and 266 transitions. [2022-11-16 11:21:01,695 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-16 11:21:01,695 INFO L218 hiAutomatonCegarLoop]: Abstraction has 199 states and 266 transitions. [2022-11-16 11:21:01,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states and 266 transitions. [2022-11-16 11:21:01,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 174. [2022-11-16 11:21:01,701 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-16 11:21:01,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 235 transitions. [2022-11-16 11:21:01,702 INFO L240 hiAutomatonCegarLoop]: Abstraction has 174 states and 235 transitions. [2022-11-16 11:21:01,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 11:21:01,703 INFO L428 stractBuchiCegarLoop]: Abstraction has 174 states and 235 transitions. [2022-11-16 11:21:01,703 INFO L335 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2022-11-16 11:21:01,704 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 174 states and 235 transitions. [2022-11-16 11:21:01,705 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 79 [2022-11-16 11:21:01,705 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-16 11:21:01,705 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-16 11:21:01,706 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-11-16 11:21:01,706 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1] [2022-11-16 11:21:01,706 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-16 11:21:01,706 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-16 11:21:01,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:21:01,707 INFO L85 PathProgramCache]: Analyzing trace with hash 28699760, now seen corresponding path program 2 times [2022-11-16 11:21:01,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:21:01,708 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655408702] [2022-11-16 11:21:01,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:21:01,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:21:01,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:21:01,711 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-16 11:21:01,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:21:01,714 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-16 11:21:01,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:21:01,714 INFO L85 PathProgramCache]: Analyzing trace with hash -1874596340, now seen corresponding path program 1 times [2022-11-16 11:21:01,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:21:01,715 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722672638] [2022-11-16 11:21:01,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:21:01,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:21:01,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:21:01,962 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-16 11:21:01,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:21:01,963 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722672638] [2022-11-16 11:21:01,963 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722672638] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:21:01,963 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1696637815] [2022-11-16 11:21:01,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:21:01,963 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:21:01,963 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7035803f-cbf2-4243-a7b4-85d954559161/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:21:01,975 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7035803f-cbf2-4243-a7b4-85d954559161/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:21:02,035 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7035803f-cbf2-4243-a7b4-85d954559161/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-11-16 11:21:02,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:21:02,070 INFO L263 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-16 11:21:02,071 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:21:02,152 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-16 11:21:02,152 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:21:02,204 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-16 11:21:02,204 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1696637815] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 11:21:02,205 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 11:21:02,205 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 6] total 11 [2022-11-16 11:21:02,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528889722] [2022-11-16 11:21:02,205 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 11:21:02,206 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-16 11:21:02,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:21:02,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-16 11:21:02,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2022-11-16 11:21:02,207 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-16 11:21:02,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:21:02,440 INFO L93 Difference]: Finished difference Result 114 states and 126 transitions. [2022-11-16 11:21:02,440 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 114 states and 126 transitions. [2022-11-16 11:21:02,441 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 19 [2022-11-16 11:21:02,442 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 114 states to 108 states and 120 transitions. [2022-11-16 11:21:02,442 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 56 [2022-11-16 11:21:02,442 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 68 [2022-11-16 11:21:02,442 INFO L73 IsDeterministic]: Start isDeterministic. Operand 108 states and 120 transitions. [2022-11-16 11:21:02,443 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-16 11:21:02,443 INFO L218 hiAutomatonCegarLoop]: Abstraction has 108 states and 120 transitions. [2022-11-16 11:21:02,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states and 120 transitions. [2022-11-16 11:21:02,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 89. [2022-11-16 11:21:02,445 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-16 11:21:02,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 101 transitions. [2022-11-16 11:21:02,445 INFO L240 hiAutomatonCegarLoop]: Abstraction has 89 states and 101 transitions. [2022-11-16 11:21:02,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-16 11:21:02,449 INFO L428 stractBuchiCegarLoop]: Abstraction has 89 states and 101 transitions. [2022-11-16 11:21:02,449 INFO L335 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2022-11-16 11:21:02,449 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 89 states and 101 transitions. [2022-11-16 11:21:02,450 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2022-11-16 11:21:02,450 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-16 11:21:02,450 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-16 11:21:02,451 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 3, 3, 3, 3, 3, 1, 1, 1] [2022-11-16 11:21:02,451 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:21:02,452 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-16 11:21:02,452 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-16 11:21:02,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:21:02,452 INFO L85 PathProgramCache]: Analyzing trace with hash 2020896569, now seen corresponding path program 2 times [2022-11-16 11:21:02,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:21:02,453 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379943788] [2022-11-16 11:21:02,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:21:02,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:21:02,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:21:02,510 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-16 11:21:02,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:21:02,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379943788] [2022-11-16 11:21:02,511 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [379943788] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:21:02,511 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [841341926] [2022-11-16 11:21:02,511 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-16 11:21:02,511 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:21:02,511 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7035803f-cbf2-4243-a7b4-85d954559161/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:21:02,512 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7035803f-cbf2-4243-a7b4-85d954559161/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:21:02,531 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7035803f-cbf2-4243-a7b4-85d954559161/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-11-16 11:21:02,553 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-16 11:21:02,553 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 11:21:02,554 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-16 11:21:02,555 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:21:02,594 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-16 11:21:02,594 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:21:02,659 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-16 11:21:02,659 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [841341926] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 11:21:02,659 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 11:21:02,660 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-11-16 11:21:02,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113004703] [2022-11-16 11:21:02,660 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 11:21:02,660 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-11-16 11:21:02,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:21:02,661 INFO L85 PathProgramCache]: Analyzing trace with hash 1010763299, now seen corresponding path program 2 times [2022-11-16 11:21:02,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:21:02,661 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135134896] [2022-11-16 11:21:02,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:21:02,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:21:02,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:21:02,666 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-16 11:21:02,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:21:02,669 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-16 11:21:02,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:21:02,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-16 11:21:02,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2022-11-16 11:21:02,736 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-16 11:21:02,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:21:02,910 INFO L93 Difference]: Finished difference Result 159 states and 171 transitions. [2022-11-16 11:21:02,910 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 159 states and 171 transitions. [2022-11-16 11:21:02,912 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2022-11-16 11:21:02,913 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 159 states to 151 states and 163 transitions. [2022-11-16 11:21:02,913 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 88 [2022-11-16 11:21:02,913 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 88 [2022-11-16 11:21:02,913 INFO L73 IsDeterministic]: Start isDeterministic. Operand 151 states and 163 transitions. [2022-11-16 11:21:02,913 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-16 11:21:02,913 INFO L218 hiAutomatonCegarLoop]: Abstraction has 151 states and 163 transitions. [2022-11-16 11:21:02,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states and 163 transitions. [2022-11-16 11:21:02,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 137. [2022-11-16 11:21:02,916 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-16 11:21:02,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 149 transitions. [2022-11-16 11:21:02,932 INFO L240 hiAutomatonCegarLoop]: Abstraction has 137 states and 149 transitions. [2022-11-16 11:21:02,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-16 11:21:02,934 INFO L428 stractBuchiCegarLoop]: Abstraction has 137 states and 149 transitions. [2022-11-16 11:21:02,934 INFO L335 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2022-11-16 11:21:02,934 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 137 states and 149 transitions. [2022-11-16 11:21:02,935 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2022-11-16 11:21:02,935 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-16 11:21:02,935 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-16 11:21:02,936 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [8, 7, 7, 7, 7, 7, 1, 1, 1] [2022-11-16 11:21:02,936 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:21:02,937 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-16 11:21:02,937 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-16 11:21:02,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:21:02,938 INFO L85 PathProgramCache]: Analyzing trace with hash 1325721725, now seen corresponding path program 3 times [2022-11-16 11:21:02,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:21:02,938 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026071848] [2022-11-16 11:21:02,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:21:02,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:21:02,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:21:03,125 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-16 11:21:03,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:21:03,125 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026071848] [2022-11-16 11:21:03,126 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2026071848] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:21:03,126 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1415290265] [2022-11-16 11:21:03,126 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-16 11:21:03,126 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:21:03,126 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7035803f-cbf2-4243-a7b4-85d954559161/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:21:03,128 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7035803f-cbf2-4243-a7b4-85d954559161/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:21:03,151 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7035803f-cbf2-4243-a7b4-85d954559161/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-11-16 11:21:03,177 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2022-11-16 11:21:03,177 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 11:21:03,179 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-16 11:21:03,180 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:21:03,262 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-16 11:21:03,262 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:21:03,449 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-16 11:21:03,450 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1415290265] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 11:21:03,450 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 11:21:03,450 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2022-11-16 11:21:03,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568423309] [2022-11-16 11:21:03,450 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 11:21:03,451 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-11-16 11:21:03,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:21:03,451 INFO L85 PathProgramCache]: Analyzing trace with hash 1010763299, now seen corresponding path program 3 times [2022-11-16 11:21:03,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:21:03,451 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47803394] [2022-11-16 11:21:03,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:21:03,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:21:03,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:21:03,456 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-16 11:21:03,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:21:03,459 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-16 11:21:03,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:21:03,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-11-16 11:21:03,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=213, Unknown=0, NotChecked=0, Total=342 [2022-11-16 11:21:03,528 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-16 11:21:03,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:21:03,849 INFO L93 Difference]: Finished difference Result 263 states and 275 transitions. [2022-11-16 11:21:03,849 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 263 states and 275 transitions. [2022-11-16 11:21:03,851 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2022-11-16 11:21:03,853 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 263 states to 247 states and 259 transitions. [2022-11-16 11:21:03,853 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 136 [2022-11-16 11:21:03,853 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 136 [2022-11-16 11:21:03,853 INFO L73 IsDeterministic]: Start isDeterministic. Operand 247 states and 259 transitions. [2022-11-16 11:21:03,854 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-16 11:21:03,854 INFO L218 hiAutomatonCegarLoop]: Abstraction has 247 states and 259 transitions. [2022-11-16 11:21:03,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states and 259 transitions. [2022-11-16 11:21:03,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 233. [2022-11-16 11:21:03,858 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-16 11:21:03,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 245 transitions. [2022-11-16 11:21:03,859 INFO L240 hiAutomatonCegarLoop]: Abstraction has 233 states and 245 transitions. [2022-11-16 11:21:03,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-16 11:21:03,860 INFO L428 stractBuchiCegarLoop]: Abstraction has 233 states and 245 transitions. [2022-11-16 11:21:03,860 INFO L335 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2022-11-16 11:21:03,861 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 233 states and 245 transitions. [2022-11-16 11:21:03,862 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2022-11-16 11:21:03,862 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-16 11:21:03,862 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-16 11:21:03,864 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [16, 15, 15, 15, 15, 15, 1, 1, 1] [2022-11-16 11:21:03,864 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:21:03,865 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-16 11:21:03,865 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-16 11:21:03,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:21:03,866 INFO L85 PathProgramCache]: Analyzing trace with hash -944359675, now seen corresponding path program 4 times [2022-11-16 11:21:03,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:21:03,866 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588399874] [2022-11-16 11:21:03,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:21:03,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:21:03,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:21:04,304 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-16 11:21:04,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:21:04,304 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588399874] [2022-11-16 11:21:04,305 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1588399874] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:21:04,305 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [806481065] [2022-11-16 11:21:04,305 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-16 11:21:04,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:21:04,306 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7035803f-cbf2-4243-a7b4-85d954559161/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:21:04,311 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7035803f-cbf2-4243-a7b4-85d954559161/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:21:04,330 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7035803f-cbf2-4243-a7b4-85d954559161/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-11-16 11:21:04,377 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-16 11:21:04,378 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 11:21:04,379 INFO L263 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 17 conjunts are in the unsatisfiable core [2022-11-16 11:21:04,382 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:21:04,552 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-16 11:21:04,553 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:21:04,896 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-16 11:21:04,896 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [806481065] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 11:21:04,896 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 11:21:04,897 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 22 [2022-11-16 11:21:04,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313590067] [2022-11-16 11:21:04,897 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 11:21:04,897 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-11-16 11:21:04,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:21:04,898 INFO L85 PathProgramCache]: Analyzing trace with hash 1010763299, now seen corresponding path program 4 times [2022-11-16 11:21:04,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:21:04,898 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706017326] [2022-11-16 11:21:04,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:21:04,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:21:04,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:21:04,902 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-16 11:21:04,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:21:04,905 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-16 11:21:04,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:21:04,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-11-16 11:21:04,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=199, Invalid=307, Unknown=0, NotChecked=0, Total=506 [2022-11-16 11:21:04,968 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-16 11:21:05,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:21:05,215 INFO L93 Difference]: Finished difference Result 303 states and 315 transitions. [2022-11-16 11:21:05,215 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 303 states and 315 transitions. [2022-11-16 11:21:05,217 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2022-11-16 11:21:05,219 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 303 states to 295 states and 307 transitions. [2022-11-16 11:21:05,219 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 160 [2022-11-16 11:21:05,219 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 160 [2022-11-16 11:21:05,219 INFO L73 IsDeterministic]: Start isDeterministic. Operand 295 states and 307 transitions. [2022-11-16 11:21:05,220 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-16 11:21:05,220 INFO L218 hiAutomatonCegarLoop]: Abstraction has 295 states and 307 transitions. [2022-11-16 11:21:05,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states and 307 transitions. [2022-11-16 11:21:05,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 281. [2022-11-16 11:21:05,225 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-16 11:21:05,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 293 transitions. [2022-11-16 11:21:05,226 INFO L240 hiAutomatonCegarLoop]: Abstraction has 281 states and 293 transitions. [2022-11-16 11:21:05,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-11-16 11:21:05,227 INFO L428 stractBuchiCegarLoop]: Abstraction has 281 states and 293 transitions. [2022-11-16 11:21:05,227 INFO L335 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2022-11-16 11:21:05,227 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 281 states and 293 transitions. [2022-11-16 11:21:05,229 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2022-11-16 11:21:05,229 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-16 11:21:05,229 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-16 11:21:05,231 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [20, 19, 19, 19, 19, 19, 1, 1, 1] [2022-11-16 11:21:05,231 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:21:05,231 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-16 11:21:05,232 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-16 11:21:05,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:21:05,232 INFO L85 PathProgramCache]: Analyzing trace with hash 228527177, now seen corresponding path program 5 times [2022-11-16 11:21:05,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:21:05,232 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614289827] [2022-11-16 11:21:05,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:21:05,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:21:05,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:21:05,295 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-16 11:21:05,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:21:05,329 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-16 11:21:05,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:21:05,330 INFO L85 PathProgramCache]: Analyzing trace with hash 1010763299, now seen corresponding path program 5 times [2022-11-16 11:21:05,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:21:05,331 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431476706] [2022-11-16 11:21:05,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:21:05,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:21:05,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:21:05,335 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-16 11:21:05,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:21:05,342 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-16 11:21:05,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:21:05,343 INFO L85 PathProgramCache]: Analyzing trace with hash 210101867, now seen corresponding path program 1 times [2022-11-16 11:21:05,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:21:05,344 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564608880] [2022-11-16 11:21:05,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:21:05,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:21:05,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:21:05,383 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-16 11:21:05,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:21:05,427 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-16 11:21:06,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:21:06,642 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-16 11:21:06,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:21:06,734 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 16.11 11:21:06 BoogieIcfgContainer [2022-11-16 11:21:06,735 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-11-16 11:21:06,735 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-16 11:21:06,735 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-16 11:21:06,736 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-16 11:21:06,736 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 11:20:56" (3/4) ... [2022-11-16 11:21:06,739 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2022-11-16 11:21:06,798 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7035803f-cbf2-4243-a7b4-85d954559161/bin/uautomizer-tPACEb0tL8/witness.graphml [2022-11-16 11:21:06,799 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-16 11:21:06,799 INFO L158 Benchmark]: Toolchain (without parser) took 11030.69ms. Allocated memory was 125.8MB in the beginning and 211.8MB in the end (delta: 86.0MB). Free memory was 86.8MB in the beginning and 165.7MB in the end (delta: -78.9MB). Peak memory consumption was 6.5MB. Max. memory is 16.1GB. [2022-11-16 11:21:06,800 INFO L158 Benchmark]: CDTParser took 0.37ms. Allocated memory is still 125.8MB. Free memory was 103.0MB in the beginning and 102.9MB in the end (delta: 128.0kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-16 11:21:06,800 INFO L158 Benchmark]: CACSL2BoogieTranslator took 259.49ms. Allocated memory is still 125.8MB. Free memory was 86.6MB in the beginning and 102.0MB in the end (delta: -15.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-16 11:21:06,801 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.82ms. Allocated memory is still 125.8MB. Free memory was 102.0MB in the beginning and 100.5MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-16 11:21:06,801 INFO L158 Benchmark]: Boogie Preprocessor took 24.96ms. Allocated memory is still 125.8MB. Free memory was 100.5MB in the beginning and 99.3MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-16 11:21:06,801 INFO L158 Benchmark]: RCFGBuilder took 324.56ms. Allocated memory is still 125.8MB. Free memory was 99.3MB in the beginning and 90.6MB in the end (delta: 8.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-11-16 11:21:06,802 INFO L158 Benchmark]: BuchiAutomizer took 10314.21ms. Allocated memory was 125.8MB in the beginning and 211.8MB in the end (delta: 86.0MB). Free memory was 90.0MB in the beginning and 170.9MB in the end (delta: -81.0MB). Peak memory consumption was 6.6MB. Max. memory is 16.1GB. [2022-11-16 11:21:06,802 INFO L158 Benchmark]: Witness Printer took 63.56ms. Allocated memory is still 211.8MB. Free memory was 170.9MB in the beginning and 165.7MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-16 11:21:06,804 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.37ms. Allocated memory is still 125.8MB. Free memory was 103.0MB in the beginning and 102.9MB in the end (delta: 128.0kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 259.49ms. Allocated memory is still 125.8MB. Free memory was 86.6MB in the beginning and 102.0MB in the end (delta: -15.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 33.82ms. Allocated memory is still 125.8MB. Free memory was 102.0MB in the beginning and 100.5MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 24.96ms. Allocated memory is still 125.8MB. Free memory was 100.5MB in the beginning and 99.3MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 324.56ms. Allocated memory is still 125.8MB. Free memory was 99.3MB in the beginning and 90.6MB in the end (delta: 8.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * BuchiAutomizer took 10314.21ms. Allocated memory was 125.8MB in the beginning and 211.8MB in the end (delta: 86.0MB). Free memory was 90.0MB in the beginning and 170.9MB in the end (delta: -81.0MB). Peak memory consumption was 6.6MB. Max. memory is 16.1GB. * Witness Printer took 63.56ms. Allocated memory is still 211.8MB. Free memory was 170.9MB in the beginning and 165.7MB 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 10.2s and 13 iterations. TraceHistogramMax:20. Analysis of lassos took 7.7s. Construction of modules took 0.7s. 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.8s 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: 59ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 5 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 3 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 1.0s 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-16 11:21:06,864 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7035803f-cbf2-4243-a7b4-85d954559161/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2022-11-16 11:21:07,062 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7035803f-cbf2-4243-a7b4-85d954559161/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2022-11-16 11:21:07,262 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7035803f-cbf2-4243-a7b4-85d954559161/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2022-11-16 11:21:07,461 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7035803f-cbf2-4243-a7b4-85d954559161/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2022-11-16 11:21:07,662 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7035803f-cbf2-4243-a7b4-85d954559161/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2022-11-16 11:21:07,863 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7035803f-cbf2-4243-a7b4-85d954559161/bin/uautomizer-tPACEb0tL8/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)