./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.4.ufo.BOUNDED-6.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version f4b24e32 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.4.ufo.BOUNDED-6.pals.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5a61d3db55f61e1c69c316c83f1e37b4c9c56a755bd5e8fcd2da0d467aefc9f7 --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-14 16:22:48,805 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-14 16:22:48,807 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-14 16:22:48,840 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-14 16:22:48,842 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-14 16:22:48,844 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-14 16:22:48,847 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-14 16:22:48,852 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-14 16:22:48,855 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-14 16:22:48,859 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-14 16:22:48,860 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-14 16:22:48,862 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-14 16:22:48,862 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-14 16:22:48,864 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-14 16:22:48,866 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-14 16:22:48,868 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-14 16:22:48,869 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-14 16:22:48,871 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-14 16:22:48,874 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-14 16:22:48,880 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-14 16:22:48,881 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-14 16:22:48,882 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-14 16:22:48,883 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-14 16:22:48,884 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-14 16:22:48,885 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-14 16:22:48,892 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-14 16:22:48,893 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-14 16:22:48,893 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-14 16:22:48,895 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-14 16:22:48,895 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-14 16:22:48,896 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-14 16:22:48,896 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-14 16:22:48,898 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-14 16:22:48,898 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-14 16:22:48,899 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-14 16:22:48,901 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-14 16:22:48,901 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-14 16:22:48,901 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-14 16:22:48,902 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-14 16:22:48,902 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-14 16:22:48,903 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-14 16:22:48,904 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-14 16:22:48,905 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2022-07-14 16:22:48,938 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-14 16:22:48,938 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-14 16:22:48,939 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-14 16:22:48,939 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-14 16:22:48,940 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-14 16:22:48,940 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-14 16:22:48,941 INFO L138 SettingsManager]: * Use SBE=true [2022-07-14 16:22:48,941 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-07-14 16:22:48,941 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-07-14 16:22:48,942 INFO L138 SettingsManager]: * Use old map elimination=false [2022-07-14 16:22:48,942 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-07-14 16:22:48,942 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-07-14 16:22:48,942 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-07-14 16:22:48,943 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-14 16:22:48,943 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-14 16:22:48,943 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-14 16:22:48,943 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-14 16:22:48,943 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-14 16:22:48,943 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-14 16:22:48,944 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-07-14 16:22:48,944 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-07-14 16:22:48,944 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-07-14 16:22:48,944 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-14 16:22:48,944 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-14 16:22:48,945 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-07-14 16:22:48,945 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-14 16:22:48,945 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-07-14 16:22:48,945 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-14 16:22:48,946 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-14 16:22:48,946 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-14 16:22:48,946 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-14 16:22:48,947 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-07-14 16:22:48,947 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 5a61d3db55f61e1c69c316c83f1e37b4c9c56a755bd5e8fcd2da0d467aefc9f7 [2022-07-14 16:22:49,184 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-14 16:22:49,205 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-14 16:22:49,207 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-14 16:22:49,208 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-14 16:22:49,209 INFO L275 PluginConnector]: CDTParser initialized [2022-07-14 16:22:49,210 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.4.ufo.BOUNDED-6.pals.c [2022-07-14 16:22:49,268 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d21864ec7/0ce52c1eba044e78a9c04a35a7721bca/FLAG80cca83ca [2022-07-14 16:22:49,763 INFO L306 CDTParser]: Found 1 translation units. [2022-07-14 16:22:49,767 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.4.ufo.BOUNDED-6.pals.c [2022-07-14 16:22:49,776 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d21864ec7/0ce52c1eba044e78a9c04a35a7721bca/FLAG80cca83ca [2022-07-14 16:22:50,124 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d21864ec7/0ce52c1eba044e78a9c04a35a7721bca [2022-07-14 16:22:50,126 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-14 16:22:50,127 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-14 16:22:50,129 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-14 16:22:50,129 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-14 16:22:50,134 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-14 16:22:50,134 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 04:22:50" (1/1) ... [2022-07-14 16:22:50,135 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4718b0e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:22:50, skipping insertion in model container [2022-07-14 16:22:50,136 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 04:22:50" (1/1) ... [2022-07-14 16:22:50,142 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-14 16:22:50,186 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-14 16:22:50,381 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.4.ufo.BOUNDED-6.pals.c[14373,14386] [2022-07-14 16:22:50,385 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 16:22:50,393 INFO L203 MainTranslator]: Completed pre-run [2022-07-14 16:22:50,438 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.4.ufo.BOUNDED-6.pals.c[14373,14386] [2022-07-14 16:22:50,438 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 16:22:50,451 INFO L208 MainTranslator]: Completed translation [2022-07-14 16:22:50,451 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:22:50 WrapperNode [2022-07-14 16:22:50,452 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-14 16:22:50,453 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-14 16:22:50,453 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-14 16:22:50,453 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-14 16:22:50,459 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:22:50" (1/1) ... [2022-07-14 16:22:50,469 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:22:50" (1/1) ... [2022-07-14 16:22:50,494 INFO L137 Inliner]: procedures = 22, calls = 14, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 459 [2022-07-14 16:22:50,495 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-14 16:22:50,496 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-14 16:22:50,496 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-14 16:22:50,496 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-14 16:22:50,503 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:22:50" (1/1) ... [2022-07-14 16:22:50,504 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:22:50" (1/1) ... [2022-07-14 16:22:50,507 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:22:50" (1/1) ... [2022-07-14 16:22:50,508 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:22:50" (1/1) ... [2022-07-14 16:22:50,517 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:22:50" (1/1) ... [2022-07-14 16:22:50,537 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:22:50" (1/1) ... [2022-07-14 16:22:50,540 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:22:50" (1/1) ... [2022-07-14 16:22:50,544 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-14 16:22:50,545 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-14 16:22:50,545 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-14 16:22:50,545 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-14 16:22:50,548 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:22:50" (1/1) ... [2022-07-14 16:22:50,555 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 16:22:50,566 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 16:22:50,579 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 16:22:50,588 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2022-07-14 16:22:50,618 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-14 16:22:50,619 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-14 16:22:50,619 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-14 16:22:50,619 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-14 16:22:50,746 INFO L234 CfgBuilder]: Building ICFG [2022-07-14 16:22:50,753 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-14 16:22:51,187 INFO L275 CfgBuilder]: Performing block encoding [2022-07-14 16:22:51,194 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-14 16:22:51,195 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-14 16:22:51,197 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 04:22:51 BoogieIcfgContainer [2022-07-14 16:22:51,197 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-14 16:22:51,198 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-07-14 16:22:51,198 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-07-14 16:22:51,201 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-07-14 16:22:51,201 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-14 16:22:51,202 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.07 04:22:50" (1/3) ... [2022-07-14 16:22:51,203 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@28b66fbc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.07 04:22:51, skipping insertion in model container [2022-07-14 16:22:51,203 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-14 16:22:51,203 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:22:50" (2/3) ... [2022-07-14 16:22:51,203 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@28b66fbc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.07 04:22:51, skipping insertion in model container [2022-07-14 16:22:51,203 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-14 16:22:51,204 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 04:22:51" (3/3) ... [2022-07-14 16:22:51,205 INFO L354 chiAutomizerObserver]: Analyzing ICFG pals_opt-floodmax.3.4.ufo.BOUNDED-6.pals.c [2022-07-14 16:22:51,254 INFO L255 stractBuchiCegarLoop]: Interprodecural is true [2022-07-14 16:22:51,254 INFO L256 stractBuchiCegarLoop]: Hoare is false [2022-07-14 16:22:51,254 INFO L257 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-07-14 16:22:51,255 INFO L258 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-07-14 16:22:51,255 INFO L259 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-07-14 16:22:51,255 INFO L260 stractBuchiCegarLoop]: Difference is false [2022-07-14 16:22:51,255 INFO L261 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-07-14 16:22:51,255 INFO L265 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-07-14 16:22:51,264 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 142 states, 141 states have (on average 1.75177304964539) internal successors, (247), 141 states have internal predecessors, (247), 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-07-14 16:22:51,302 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 78 [2022-07-14 16:22:51,302 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 16:22:51,303 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 16:22:51,323 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 16:22:51,323 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 16:22:51,323 INFO L287 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-07-14 16:22:51,326 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 142 states, 141 states have (on average 1.75177304964539) internal successors, (247), 141 states have internal predecessors, (247), 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-07-14 16:22:51,335 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 78 [2022-07-14 16:22:51,336 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 16:22:51,337 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 16:22:51,340 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 16:22:51,340 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 16:22:51,349 INFO L752 eck$LassoCheckResult]: Stem: 120#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(43, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~newmax1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~newmax2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~newmax3~0 := 0; 38#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~ret40#1, main_#t~ret41#1, main_#t~post42#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~ep12~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~ep13~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~ep21~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~ep23~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~ep31~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~ep32~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~id1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~r1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~st1~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~nl1~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~m1~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~max1~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~mode1~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~newmax1~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~id2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~r2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~st2~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~nl2~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~m2~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~max2~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode2~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~newmax2~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~id3~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~r3~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~st3~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;~nl3~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~m3~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;~max3~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~mode3~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~newmax3~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r211~0#1, init_~r231~0#1, init_~r311~0#1, init_~r321~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r212~0#1, init_~tmp___1~0#1, init_~r232~0#1, init_~tmp___2~0#1, init_~r312~0#1, init_~tmp___3~0#1, init_~r322~0#1, init_~tmp___4~0#1, init_~tmp___5~0#1;havoc init_~r121~0#1;havoc init_~r131~0#1;havoc init_~r211~0#1;havoc init_~r231~0#1;havoc init_~r311~0#1;havoc init_~r321~0#1;havoc init_~r122~0#1;havoc init_~tmp~0#1;havoc init_~r132~0#1;havoc init_~tmp___0~0#1;havoc init_~r212~0#1;havoc init_~tmp___1~0#1;havoc init_~r232~0#1;havoc init_~tmp___2~0#1;havoc init_~r312~0#1;havoc init_~tmp___3~0#1;havoc init_~r322~0#1;havoc init_~tmp___4~0#1;havoc init_~tmp___5~0#1;init_~r121~0#1 := ~ep12~0;init_~r131~0#1 := ~ep13~0;init_~r211~0#1 := ~ep21~0;init_~r231~0#1 := ~ep23~0;init_~r311~0#1 := ~ep31~0;init_~r321~0#1 := ~ep32~0; 30#L258true assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; 74#L261-1true init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); 32#L271true assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; 76#L274-1true init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); 57#L284true assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; 133#L287-1true init_~r212~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); 33#L297true assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; 41#L300-1true init_~r232~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); 67#L310true assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; 123#L313-1true init_~r312~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); 3#L323true assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; 20#L326-1true init_~r322~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); 75#L336true assume !(~id1~0 != ~id2~0);init_~tmp___5~0#1 := 0; 5#L336-1true init_#res#1 := init_~tmp___5~0#1; 14#L457true main_#t~ret40#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret40#1;havoc main_#t~ret40#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; 95#L21true assume !(0 == assume_abort_if_not_~cond#1); 13#L20true assume { :end_inline_assume_abort_if_not } true;~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~i2~0#1 := 0; 31#L568-2true [2022-07-14 16:22:51,354 INFO L754 eck$LassoCheckResult]: Loop: 31#L568-2true assume !!(main_~i2~0#1 < 6);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1, node1_~newmax~0#1;havoc node1_~newmax~0#1;node1_~newmax~0#1 := 0; 89#L82true assume !(0 != ~mode1~0 % 256); 64#L110true assume !(~r1~0 < 1); 16#L110-1true ~mode1~0 := 1; 132#L82-2true assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1, node2_~newmax~1#1;havoc node2_~newmax~1#1;node2_~newmax~1#1 := 0; 109#L133true assume !(0 != ~mode2~0 % 256); 8#L161true assume !(~r2~0 < 2); 66#L161-1true ~mode2~0 := 1; 22#L133-2true assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1, node3_~newmax~2#1;havoc node3_~newmax~2#1;node3_~newmax~2#1 := 0; 79#L184true assume !(0 != ~mode3~0 % 256); 68#L212true assume !(~r3~0 < 2); 98#L212-1true ~mode3~0 := 1; 78#L184-2true assume { :end_inline_node3 } true;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 136#L465true assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; 131#L465-1true check_#res#1 := check_~tmp~1#1; 96#L513true main_#t~ret41#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret41#1;havoc main_#t~ret41#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; 117#L598true assume !(0 == assert_~arg#1 % 256); 73#L593true assume { :end_inline_assert } true;main_#t~post42#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post42#1;havoc main_#t~post42#1; 31#L568-2true [2022-07-14 16:22:51,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 16:22:51,362 INFO L85 PathProgramCache]: Analyzing trace with hash 1744745224, now seen corresponding path program 1 times [2022-07-14 16:22:51,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 16:22:51,371 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625029644] [2022-07-14 16:22:51,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 16:22:51,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 16:22:51,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 16:22:51,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 16:22:51,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 16:22:51,653 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625029644] [2022-07-14 16:22:51,654 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625029644] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 16:22:51,654 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 16:22:51,655 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-14 16:22:51,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074455706] [2022-07-14 16:22:51,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 16:22:51,664 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-14 16:22:51,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 16:22:51,667 INFO L85 PathProgramCache]: Analyzing trace with hash 339208114, now seen corresponding path program 1 times [2022-07-14 16:22:51,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 16:22:51,668 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521640148] [2022-07-14 16:22:51,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 16:22:51,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 16:22:51,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 16:22:51,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 16:22:51,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 16:22:51,829 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521640148] [2022-07-14 16:22:51,829 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1521640148] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 16:22:51,829 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 16:22:51,829 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-14 16:22:51,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340128148] [2022-07-14 16:22:51,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 16:22:51,831 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-14 16:22:51,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 16:22:51,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 16:22:51,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-14 16:22:51,867 INFO L87 Difference]: Start difference. First operand has 142 states, 141 states have (on average 1.75177304964539) internal successors, (247), 141 states have internal predecessors, (247), 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 5 states, 5 states have (on average 3.6) internal successors, (18), 5 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-07-14 16:22:51,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 16:22:51,964 INFO L93 Difference]: Finished difference Result 146 states and 247 transitions. [2022-07-14 16:22:51,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-14 16:22:51,970 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 146 states and 247 transitions. [2022-07-14 16:22:51,977 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 77 [2022-07-14 16:22:51,981 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 146 states to 137 states and 231 transitions. [2022-07-14 16:22:51,981 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 137 [2022-07-14 16:22:51,982 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 137 [2022-07-14 16:22:51,982 INFO L73 IsDeterministic]: Start isDeterministic. Operand 137 states and 231 transitions. [2022-07-14 16:22:51,983 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-14 16:22:51,983 INFO L369 hiAutomatonCegarLoop]: Abstraction has 137 states and 231 transitions. [2022-07-14 16:22:51,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states and 231 transitions. [2022-07-14 16:22:52,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2022-07-14 16:22:52,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 137 states have (on average 1.686131386861314) internal successors, (231), 136 states have internal predecessors, (231), 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-07-14 16:22:52,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 231 transitions. [2022-07-14 16:22:52,010 INFO L392 hiAutomatonCegarLoop]: Abstraction has 137 states and 231 transitions. [2022-07-14 16:22:52,011 INFO L374 stractBuchiCegarLoop]: Abstraction has 137 states and 231 transitions. [2022-07-14 16:22:52,011 INFO L287 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-07-14 16:22:52,011 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 137 states and 231 transitions. [2022-07-14 16:22:52,013 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 77 [2022-07-14 16:22:52,013 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 16:22:52,013 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 16:22:52,014 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 16:22:52,014 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 16:22:52,015 INFO L752 eck$LassoCheckResult]: Stem: 434#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(43, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~newmax1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~newmax2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~newmax3~0 := 0; 377#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~ret40#1, main_#t~ret41#1, main_#t~post42#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~ep12~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~ep13~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~ep21~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~ep23~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~ep31~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~ep32~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~id1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~r1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~st1~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~nl1~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~m1~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~max1~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~mode1~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~newmax1~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~id2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~r2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~st2~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~nl2~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~m2~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~max2~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode2~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~newmax2~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~id3~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~r3~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~st3~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;~nl3~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~m3~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;~max3~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~mode3~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~newmax3~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r211~0#1, init_~r231~0#1, init_~r311~0#1, init_~r321~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r212~0#1, init_~tmp___1~0#1, init_~r232~0#1, init_~tmp___2~0#1, init_~r312~0#1, init_~tmp___3~0#1, init_~r322~0#1, init_~tmp___4~0#1, init_~tmp___5~0#1;havoc init_~r121~0#1;havoc init_~r131~0#1;havoc init_~r211~0#1;havoc init_~r231~0#1;havoc init_~r311~0#1;havoc init_~r321~0#1;havoc init_~r122~0#1;havoc init_~tmp~0#1;havoc init_~r132~0#1;havoc init_~tmp___0~0#1;havoc init_~r212~0#1;havoc init_~tmp___1~0#1;havoc init_~r232~0#1;havoc init_~tmp___2~0#1;havoc init_~r312~0#1;havoc init_~tmp___3~0#1;havoc init_~r322~0#1;havoc init_~tmp___4~0#1;havoc init_~tmp___5~0#1;init_~r121~0#1 := ~ep12~0;init_~r131~0#1 := ~ep13~0;init_~r211~0#1 := ~ep21~0;init_~r231~0#1 := ~ep23~0;init_~r311~0#1 := ~ep31~0;init_~r321~0#1 := ~ep32~0; 361#L258 assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; 362#L261-1 init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); 365#L271 assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; 366#L274-1 init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); 400#L284 assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; 355#L287-1 init_~r212~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); 368#L297 assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; 369#L300-1 init_~r232~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); 381#L310 assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; 345#L313-1 init_~r312~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); 306#L323 assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; 308#L326-1 init_~r322~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); 342#L336 assume !(~id1~0 != ~id2~0);init_~tmp___5~0#1 := 0; 312#L336-1 init_#res#1 := init_~tmp___5~0#1; 313#L457 main_#t~ret40#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret40#1;havoc main_#t~ret40#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; 335#L21 assume !(0 == assume_abort_if_not_~cond#1); 331#L20 assume { :end_inline_assume_abort_if_not } true;~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~i2~0#1 := 0; 332#L568-2 [2022-07-14 16:22:52,015 INFO L754 eck$LassoCheckResult]: Loop: 332#L568-2 assume !!(main_~i2~0#1 < 6);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1, node1_~newmax~0#1;havoc node1_~newmax~0#1;node1_~newmax~0#1 := 0; 364#L82 assume !(0 != ~mode1~0 % 256); 407#L110 assume !(~r1~0 < 1); 315#L110-1 ~mode1~0 := 1; 336#L82-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1, node2_~newmax~1#1;havoc node2_~newmax~1#1;node2_~newmax~1#1 := 0; 429#L133 assume !(0 != ~mode2~0 % 256); 319#L161 assume !(~r2~0 < 2); 310#L161-1 ~mode2~0 := 1; 346#L133-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1, node3_~newmax~2#1;havoc node3_~newmax~2#1;node3_~newmax~2#1 := 0; 347#L184 assume !(0 != ~mode3~0 % 256); 410#L212 assume !(~r3~0 < 2); 384#L212-1 ~mode3~0 := 1; 415#L184-2 assume { :end_inline_node3 } true;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 416#L465 assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; 441#L466 assume ~st1~0 + ~nl1~0 <= 1; 442#L467 assume ~st2~0 + ~nl2~0 <= 1; 435#L468 assume ~st3~0 + ~nl3~0 <= 1; 321#L469 assume ~r1~0 >= 2; 322#L473 assume ~r1~0 < 2; 357#L478 assume ~r1~0 >= 2; 399#L483 assume ~r1~0 < 2;check_~tmp~1#1 := 1; 330#L465-1 check_#res#1 := check_~tmp~1#1; 425#L513 main_#t~ret41#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret41#1;havoc main_#t~ret41#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; 426#L598 assume !(0 == assert_~arg#1 % 256); 414#L593 assume { :end_inline_assert } true;main_#t~post42#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post42#1;havoc main_#t~post42#1; 332#L568-2 [2022-07-14 16:22:52,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 16:22:52,016 INFO L85 PathProgramCache]: Analyzing trace with hash 1744745224, now seen corresponding path program 2 times [2022-07-14 16:22:52,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 16:22:52,016 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410443114] [2022-07-14 16:22:52,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 16:22:52,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 16:22:52,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 16:22:52,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 16:22:52,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 16:22:52,064 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410443114] [2022-07-14 16:22:52,065 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [410443114] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 16:22:52,065 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 16:22:52,065 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-14 16:22:52,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411459346] [2022-07-14 16:22:52,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 16:22:52,066 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-14 16:22:52,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 16:22:52,066 INFO L85 PathProgramCache]: Analyzing trace with hash -191058054, now seen corresponding path program 1 times [2022-07-14 16:22:52,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 16:22:52,067 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289971595] [2022-07-14 16:22:52,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 16:22:52,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 16:22:52,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 16:22:52,089 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 16:22:52,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 16:22:52,089 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289971595] [2022-07-14 16:22:52,090 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1289971595] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 16:22:52,090 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 16:22:52,090 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 16:22:52,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470691287] [2022-07-14 16:22:52,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 16:22:52,091 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-14 16:22:52,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 16:22:52,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 16:22:52,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-14 16:22:52,092 INFO L87 Difference]: Start difference. First operand 137 states and 231 transitions. cyclomatic complexity: 95 Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 16:22:52,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 16:22:52,146 INFO L93 Difference]: Finished difference Result 140 states and 233 transitions. [2022-07-14 16:22:52,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-14 16:22:52,147 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 140 states and 233 transitions. [2022-07-14 16:22:52,149 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 77 [2022-07-14 16:22:52,150 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 140 states to 137 states and 201 transitions. [2022-07-14 16:22:52,151 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 137 [2022-07-14 16:22:52,151 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 137 [2022-07-14 16:22:52,151 INFO L73 IsDeterministic]: Start isDeterministic. Operand 137 states and 201 transitions. [2022-07-14 16:22:52,152 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-14 16:22:52,152 INFO L369 hiAutomatonCegarLoop]: Abstraction has 137 states and 201 transitions. [2022-07-14 16:22:52,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states and 201 transitions. [2022-07-14 16:22:52,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2022-07-14 16:22:52,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 137 states have (on average 1.467153284671533) internal successors, (201), 136 states have internal predecessors, (201), 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-07-14 16:22:52,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 201 transitions. [2022-07-14 16:22:52,159 INFO L392 hiAutomatonCegarLoop]: Abstraction has 137 states and 201 transitions. [2022-07-14 16:22:52,159 INFO L374 stractBuchiCegarLoop]: Abstraction has 137 states and 201 transitions. [2022-07-14 16:22:52,159 INFO L287 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-07-14 16:22:52,160 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 137 states and 201 transitions. [2022-07-14 16:22:52,161 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 77 [2022-07-14 16:22:52,161 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 16:22:52,161 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 16:22:52,162 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 16:22:52,162 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 16:22:52,163 INFO L752 eck$LassoCheckResult]: Stem: 724#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(43, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~newmax1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~newmax2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~newmax3~0 := 0; 667#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~ret40#1, main_#t~ret41#1, main_#t~post42#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~ep12~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~ep13~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~ep21~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~ep23~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~ep31~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~ep32~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~id1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~r1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~st1~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~nl1~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~m1~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~max1~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~mode1~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~newmax1~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~id2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~r2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~st2~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~nl2~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~m2~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~max2~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode2~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~newmax2~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~id3~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~r3~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~st3~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;~nl3~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~m3~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;~max3~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~mode3~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~newmax3~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r211~0#1, init_~r231~0#1, init_~r311~0#1, init_~r321~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r212~0#1, init_~tmp___1~0#1, init_~r232~0#1, init_~tmp___2~0#1, init_~r312~0#1, init_~tmp___3~0#1, init_~r322~0#1, init_~tmp___4~0#1, init_~tmp___5~0#1;havoc init_~r121~0#1;havoc init_~r131~0#1;havoc init_~r211~0#1;havoc init_~r231~0#1;havoc init_~r311~0#1;havoc init_~r321~0#1;havoc init_~r122~0#1;havoc init_~tmp~0#1;havoc init_~r132~0#1;havoc init_~tmp___0~0#1;havoc init_~r212~0#1;havoc init_~tmp___1~0#1;havoc init_~r232~0#1;havoc init_~tmp___2~0#1;havoc init_~r312~0#1;havoc init_~tmp___3~0#1;havoc init_~r322~0#1;havoc init_~tmp___4~0#1;havoc init_~tmp___5~0#1;init_~r121~0#1 := ~ep12~0;init_~r131~0#1 := ~ep13~0;init_~r211~0#1 := ~ep21~0;init_~r231~0#1 := ~ep23~0;init_~r311~0#1 := ~ep31~0;init_~r321~0#1 := ~ep32~0; 651#L258 assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; 652#L261-1 init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); 655#L271 assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; 656#L274-1 init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); 690#L284 assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; 645#L287-1 init_~r212~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); 658#L297 assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; 659#L300-1 init_~r232~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); 671#L310 assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; 635#L313-1 init_~r312~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); 596#L323 assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; 598#L326-1 init_~r322~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); 632#L336 assume ~id1~0 != ~id2~0; 703#L337 assume ~id1~0 != ~id3~0; 675#L338 assume ~id2~0 != ~id3~0; 676#L339 assume ~id1~0 >= 0; 717#L340 assume ~id2~0 >= 0; 712#L341 assume ~id3~0 >= 0; 663#L342 assume 0 == ~r1~0; 664#L343 assume 0 == ~r2~0; 648#L344 assume 0 == ~r3~0; 649#L345 assume 0 != init_~r122~0#1 % 256; 668#L346 assume 0 != init_~r132~0#1 % 256; 669#L347 assume 0 != init_~r212~0#1 % 256; 721#L348 assume 0 != init_~r232~0#1 % 256; 707#L349 assume 0 != init_~r312~0#1 % 256; 708#L350 assume 0 != init_~r322~0#1 % 256; 698#L351 assume ~max1~0 == ~id1~0; 699#L352 assume ~max2~0 == ~id2~0; 714#L353 assume ~max3~0 == ~id3~0; 684#L354 assume 0 == ~st1~0; 665#L355 assume 0 == ~st2~0; 666#L356 assume 0 == ~st3~0; 682#L357 assume 0 == ~nl1~0; 617#L358 assume 0 == ~nl2~0; 618#L359 assume 0 == ~nl3~0; 624#L360 assume 0 == ~mode1~0 % 256; 625#L361 assume 0 == ~mode2~0 % 256; 702#L362 assume 0 == ~mode3~0 % 256; 729#L363 assume 0 != ~newmax1~0 % 256; 730#L364 assume 0 != ~newmax2~0 % 256; 679#L365 assume 0 != ~newmax3~0 % 256;init_~tmp___5~0#1 := 1; 602#L336-1 init_#res#1 := init_~tmp___5~0#1; 603#L457 main_#t~ret40#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret40#1;havoc main_#t~ret40#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; 623#L21 assume !(0 == assume_abort_if_not_~cond#1); 621#L20 assume { :end_inline_assume_abort_if_not } true;~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~i2~0#1 := 0; 622#L568-2 [2022-07-14 16:22:52,163 INFO L754 eck$LassoCheckResult]: Loop: 622#L568-2 assume !!(main_~i2~0#1 < 6);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1, node1_~newmax~0#1;havoc node1_~newmax~0#1;node1_~newmax~0#1 := 0; 654#L82 assume !(0 != ~mode1~0 % 256); 697#L110 assume !(~r1~0 < 1); 605#L110-1 ~mode1~0 := 1; 626#L82-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1, node2_~newmax~1#1;havoc node2_~newmax~1#1;node2_~newmax~1#1 := 0; 719#L133 assume !(0 != ~mode2~0 % 256); 609#L161 assume !(~r2~0 < 2); 600#L161-1 ~mode2~0 := 1; 636#L133-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1, node3_~newmax~2#1;havoc node3_~newmax~2#1;node3_~newmax~2#1 := 0; 637#L184 assume !(0 != ~mode3~0 % 256); 700#L212 assume !(~r3~0 < 2); 674#L212-1 ~mode3~0 := 1; 705#L184-2 assume { :end_inline_node3 } true;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 706#L465 assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; 731#L466 assume ~st1~0 + ~nl1~0 <= 1; 732#L467 assume ~st2~0 + ~nl2~0 <= 1; 725#L468 assume ~st3~0 + ~nl3~0 <= 1; 611#L469 assume ~r1~0 >= 2; 612#L473 assume ~r1~0 < 2; 647#L478 assume ~r1~0 >= 2; 689#L483 assume ~r1~0 < 2;check_~tmp~1#1 := 1; 620#L465-1 check_#res#1 := check_~tmp~1#1; 715#L513 main_#t~ret41#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret41#1;havoc main_#t~ret41#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; 716#L598 assume !(0 == assert_~arg#1 % 256); 704#L593 assume { :end_inline_assert } true;main_#t~post42#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post42#1;havoc main_#t~post42#1; 622#L568-2 [2022-07-14 16:22:52,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 16:22:52,164 INFO L85 PathProgramCache]: Analyzing trace with hash 431062094, now seen corresponding path program 1 times [2022-07-14 16:22:52,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 16:22:52,164 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408718515] [2022-07-14 16:22:52,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 16:22:52,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 16:22:52,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 16:22:52,201 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 16:22:52,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 16:22:52,266 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 16:22:52,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 16:22:52,267 INFO L85 PathProgramCache]: Analyzing trace with hash -191058054, now seen corresponding path program 2 times [2022-07-14 16:22:52,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 16:22:52,267 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246107039] [2022-07-14 16:22:52,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 16:22:52,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 16:22:52,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 16:22:52,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 16:22:52,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 16:22:52,288 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246107039] [2022-07-14 16:22:52,288 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1246107039] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 16:22:52,288 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 16:22:52,288 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 16:22:52,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290697001] [2022-07-14 16:22:52,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 16:22:52,289 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-14 16:22:52,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 16:22:52,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 16:22:52,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 16:22:52,290 INFO L87 Difference]: Start difference. First operand 137 states and 201 transitions. cyclomatic complexity: 65 Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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-07-14 16:22:52,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 16:22:52,322 INFO L93 Difference]: Finished difference Result 195 states and 288 transitions. [2022-07-14 16:22:52,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 16:22:52,323 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 195 states and 288 transitions. [2022-07-14 16:22:52,325 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 135 [2022-07-14 16:22:52,326 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 195 states to 195 states and 288 transitions. [2022-07-14 16:22:52,326 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 195 [2022-07-14 16:22:52,327 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 195 [2022-07-14 16:22:52,327 INFO L73 IsDeterministic]: Start isDeterministic. Operand 195 states and 288 transitions. [2022-07-14 16:22:52,328 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-14 16:22:52,328 INFO L369 hiAutomatonCegarLoop]: Abstraction has 195 states and 288 transitions. [2022-07-14 16:22:52,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states and 288 transitions. [2022-07-14 16:22:52,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 195. [2022-07-14 16:22:52,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 195 states have (on average 1.476923076923077) internal successors, (288), 194 states have internal predecessors, (288), 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-07-14 16:22:52,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 288 transitions. [2022-07-14 16:22:52,336 INFO L392 hiAutomatonCegarLoop]: Abstraction has 195 states and 288 transitions. [2022-07-14 16:22:52,336 INFO L374 stractBuchiCegarLoop]: Abstraction has 195 states and 288 transitions. [2022-07-14 16:22:52,337 INFO L287 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-07-14 16:22:52,337 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 195 states and 288 transitions. [2022-07-14 16:22:52,338 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 135 [2022-07-14 16:22:52,338 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 16:22:52,338 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 16:22:52,340 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 16:22:52,340 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 16:22:52,340 INFO L752 eck$LassoCheckResult]: Stem: 1066#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(43, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~newmax1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~newmax2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~newmax3~0 := 0; 1008#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~ret40#1, main_#t~ret41#1, main_#t~post42#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~ep12~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~ep13~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~ep21~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~ep23~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~ep31~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~ep32~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~id1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~r1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~st1~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~nl1~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~m1~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~max1~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~mode1~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~newmax1~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~id2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~r2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~st2~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~nl2~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~m2~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~max2~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode2~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~newmax2~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~id3~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~r3~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~st3~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;~nl3~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~m3~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;~max3~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~mode3~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~newmax3~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r211~0#1, init_~r231~0#1, init_~r311~0#1, init_~r321~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r212~0#1, init_~tmp___1~0#1, init_~r232~0#1, init_~tmp___2~0#1, init_~r312~0#1, init_~tmp___3~0#1, init_~r322~0#1, init_~tmp___4~0#1, init_~tmp___5~0#1;havoc init_~r121~0#1;havoc init_~r131~0#1;havoc init_~r211~0#1;havoc init_~r231~0#1;havoc init_~r311~0#1;havoc init_~r321~0#1;havoc init_~r122~0#1;havoc init_~tmp~0#1;havoc init_~r132~0#1;havoc init_~tmp___0~0#1;havoc init_~r212~0#1;havoc init_~tmp___1~0#1;havoc init_~r232~0#1;havoc init_~tmp___2~0#1;havoc init_~r312~0#1;havoc init_~tmp___3~0#1;havoc init_~r322~0#1;havoc init_~tmp___4~0#1;havoc init_~tmp___5~0#1;init_~r121~0#1 := ~ep12~0;init_~r131~0#1 := ~ep13~0;init_~r211~0#1 := ~ep21~0;init_~r231~0#1 := ~ep23~0;init_~r311~0#1 := ~ep31~0;init_~r321~0#1 := ~ep32~0; 989#L258 assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; 990#L261-1 init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); 994#L271 assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; 995#L274-1 init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); 1031#L284 assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; 980#L287-1 init_~r212~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); 997#L297 assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; 998#L300-1 init_~r232~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); 1012#L310 assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; 973#L313-1 init_~r312~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); 934#L323 assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; 936#L326-1 init_~r322~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); 970#L336 assume ~id1~0 != ~id2~0; 1044#L337 assume ~id1~0 != ~id3~0; 1016#L338 assume ~id2~0 != ~id3~0; 1017#L339 assume ~id1~0 >= 0; 1059#L340 assume ~id2~0 >= 0; 1053#L341 assume ~id3~0 >= 0; 1002#L342 assume 0 == ~r1~0; 1003#L343 assume 0 == ~r2~0; 986#L344 assume 0 == ~r3~0; 987#L345 assume 0 != init_~r122~0#1 % 256; 1009#L346 assume 0 != init_~r132~0#1 % 256; 1010#L347 assume 0 != init_~r212~0#1 % 256; 1063#L348 assume 0 != init_~r232~0#1 % 256; 1048#L349 assume 0 != init_~r312~0#1 % 256; 1049#L350 assume 0 != init_~r322~0#1 % 256; 1038#L351 assume ~max1~0 == ~id1~0; 1039#L352 assume ~max2~0 == ~id2~0; 1055#L353 assume ~max3~0 == ~id3~0; 1025#L354 assume 0 == ~st1~0; 1006#L355 assume 0 == ~st2~0; 1007#L356 assume 0 == ~st3~0; 1023#L357 assume 0 == ~nl1~0; 951#L358 assume 0 == ~nl2~0; 952#L359 assume 0 == ~nl3~0; 960#L360 assume 0 == ~mode1~0 % 256; 961#L361 assume 0 == ~mode2~0 % 256; 1043#L362 assume 0 == ~mode3~0 % 256; 1072#L363 assume 0 != ~newmax1~0 % 256; 1073#L364 assume 0 != ~newmax2~0 % 256; 1020#L365 assume 0 != ~newmax3~0 % 256;init_~tmp___5~0#1 := 1; 940#L336-1 init_#res#1 := init_~tmp___5~0#1; 941#L457 main_#t~ret40#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret40#1;havoc main_#t~ret40#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; 962#L21 assume !(0 == assume_abort_if_not_~cond#1); 958#L20 assume { :end_inline_assume_abort_if_not } true;~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~i2~0#1 := 0; 959#L568-2 [2022-07-14 16:22:52,340 INFO L754 eck$LassoCheckResult]: Loop: 959#L568-2 assume !!(main_~i2~0#1 < 6);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1, node1_~newmax~0#1;havoc node1_~newmax~0#1;node1_~newmax~0#1 := 0; 1077#L82 assume !(0 != ~mode1~0 % 256); 1076#L110 assume !(~r1~0 < 1); 943#L110-1 ~mode1~0 := 1; 1119#L82-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1, node2_~newmax~1#1;havoc node2_~newmax~1#1;node2_~newmax~1#1 := 0; 1117#L133 assume !(0 != ~mode2~0 % 256); 1118#L161 assume !(~r2~0 < 2); 1107#L161-1 ~mode2~0 := 1; 1104#L133-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1, node3_~newmax~2#1;havoc node3_~newmax~2#1;node3_~newmax~2#1 := 0; 1101#L184 assume !(0 != ~mode3~0 % 256); 1092#L212 assume !(~r3~0 < 2); 1088#L212-1 ~mode3~0 := 1; 1087#L184-2 assume { :end_inline_node3 } true;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 1085#L465 assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; 1083#L466 assume ~st1~0 + ~nl1~0 <= 1; 1081#L467 assume ~st2~0 + ~nl2~0 <= 1; 1079#L468 assume ~st3~0 + ~nl3~0 <= 1; 1078#L469 assume !(~r1~0 >= 2); 1004#L472 assume 0 == ~st1~0 + ~st2~0 + ~st3~0; 1005#L473 assume ~r1~0 < 2; 1128#L478 assume !(~r1~0 >= 2); 1029#L482 assume 0 == ~nl1~0 + ~nl2~0 + ~nl3~0; 1030#L483 assume ~r1~0 < 2;check_~tmp~1#1 := 1; 1086#L465-1 check_#res#1 := check_~tmp~1#1; 1084#L513 main_#t~ret41#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret41#1;havoc main_#t~ret41#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; 1082#L598 assume !(0 == assert_~arg#1 % 256); 1080#L593 assume { :end_inline_assert } true;main_#t~post42#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post42#1;havoc main_#t~post42#1; 959#L568-2 [2022-07-14 16:22:52,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 16:22:52,341 INFO L85 PathProgramCache]: Analyzing trace with hash 431062094, now seen corresponding path program 2 times [2022-07-14 16:22:52,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 16:22:52,342 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678427588] [2022-07-14 16:22:52,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 16:22:52,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 16:22:52,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 16:22:52,384 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 16:22:52,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 16:22:52,420 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 16:22:52,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 16:22:52,421 INFO L85 PathProgramCache]: Analyzing trace with hash -2102521574, now seen corresponding path program 1 times [2022-07-14 16:22:52,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 16:22:52,421 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623277522] [2022-07-14 16:22:52,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 16:22:52,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 16:22:52,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 16:22:52,430 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 16:22:52,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 16:22:52,442 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 16:22:52,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 16:22:52,443 INFO L85 PathProgramCache]: Analyzing trace with hash -1865528147, now seen corresponding path program 1 times [2022-07-14 16:22:52,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 16:22:52,443 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921300417] [2022-07-14 16:22:52,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 16:22:52,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 16:22:52,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 16:22:52,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 16:22:52,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 16:22:52,542 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921300417] [2022-07-14 16:22:52,542 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1921300417] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 16:22:52,545 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 16:22:52,546 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 16:22:52,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205544105] [2022-07-14 16:22:52,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 16:22:53,145 INFO L210 LassoAnalysis]: Preferences: [2022-07-14 16:22:53,145 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-14 16:22:53,146 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-14 16:22:53,146 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-14 16:22:53,147 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-07-14 16:22:53,147 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 16:22:53,147 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-14 16:22:53,147 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-14 16:22:53,147 INFO L133 ssoRankerPreferences]: Filename of dumped script: pals_opt-floodmax.3.4.ufo.BOUNDED-6.pals.c_Iteration4_Loop [2022-07-14 16:22:53,147 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-14 16:22:53,147 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-14 16:22:53,167 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:22:53,174 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:22:53,178 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:22:53,181 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:22:53,190 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:22:53,193 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:22:53,195 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:22:53,197 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:22:53,199 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:22:53,204 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:22:53,207 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:22:53,209 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:22:53,214 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:22:53,216 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:22:53,222 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:22:53,226 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:22:53,250 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:22:53,252 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:22:53,257 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:22:53,262 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:22:53,266 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:22:53,268 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:22:53,619 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-14 16:22:53,620 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-07-14 16:22:53,621 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 16:22:53,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 16:22:53,623 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 16:22:53,624 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2022-07-14 16:22:53,626 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-14 16:22:53,626 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-14 16:22:53,637 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-14 16:22:53,637 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_node2_~newmax~1#1=0} Honda state: {ULTIMATE.start_node2_~newmax~1#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-14 16:22:53,654 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2022-07-14 16:22:53,654 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 16:22:53,655 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 16:22:53,656 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 16:22:53,659 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2022-07-14 16:22:53,663 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-14 16:22:53,663 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-14 16:22:53,703 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2022-07-14 16:22:53,704 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 16:22:53,704 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 16:22:53,707 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 16:22:53,711 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2022-07-14 16:22:53,723 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-07-14 16:22:53,725 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-14 16:22:53,942 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-07-14 16:22:53,945 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2022-07-14 16:22:53,945 INFO L210 LassoAnalysis]: Preferences: [2022-07-14 16:22:53,945 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-14 16:22:53,946 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-14 16:22:53,946 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-14 16:22:53,946 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-14 16:22:53,946 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 16:22:53,946 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-14 16:22:53,946 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-14 16:22:53,946 INFO L133 ssoRankerPreferences]: Filename of dumped script: pals_opt-floodmax.3.4.ufo.BOUNDED-6.pals.c_Iteration4_Loop [2022-07-14 16:22:53,946 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-14 16:22:53,946 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-14 16:22:53,948 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:22:53,951 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:22:53,956 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:22:53,958 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:22:53,968 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:22:53,971 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:22:53,973 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:22:53,975 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:22:53,980 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:22:53,983 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:22:53,985 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:22:53,990 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:22:53,992 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:22:53,995 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:22:54,000 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:22:54,003 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:22:54,009 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:22:54,014 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:22:54,019 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:22:54,021 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:22:54,037 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:22:54,056 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 16:22:54,396 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-14 16:22:54,400 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-14 16:22:54,401 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 16:22:54,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 16:22:54,403 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 16:22:54,414 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-07-14 16:22:54,421 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 16:22:54,421 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 16:22:54,422 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 16:22:54,422 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 16:22:54,422 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 16:22:54,424 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 16:22:54,424 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2022-07-14 16:22:54,424 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 16:22:54,440 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 16:22:54,466 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2022-07-14 16:22:54,466 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 16:22:54,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 16:22:54,468 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 16:22:54,472 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-07-14 16:22:54,482 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 16:22:54,482 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 16:22:54,482 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 16:22:54,483 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 16:22:54,483 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 16:22:54,485 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 16:22:54,485 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 16:22:54,486 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2022-07-14 16:22:54,499 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 16:22:54,526 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2022-07-14 16:22:54,527 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 16:22:54,527 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 16:22:54,532 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 16:22:54,533 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2022-07-14 16:22:54,537 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-07-14 16:22:54,544 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 16:22:54,544 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 16:22:54,545 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 16:22:54,545 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 16:22:54,545 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 16:22:54,546 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 16:22:54,546 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 16:22:54,567 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 16:22:54,592 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2022-07-14 16:22:54,593 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 16:22:54,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 16:22:54,595 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 16:22:54,596 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2022-07-14 16:22:54,599 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-07-14 16:22:54,607 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 16:22:54,607 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 16:22:54,607 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 16:22:54,607 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 16:22:54,607 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 16:22:54,609 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 16:22:54,609 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 16:22:54,631 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 16:22:54,657 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2022-07-14 16:22:54,657 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 16:22:54,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 16:22:54,659 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 16:22:54,660 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2022-07-14 16:22:54,661 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-07-14 16:22:54,668 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 16:22:54,669 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 16:22:54,669 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 16:22:54,669 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 16:22:54,669 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 16:22:54,670 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 16:22:54,671 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 16:22:54,683 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 16:22:54,709 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2022-07-14 16:22:54,709 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 16:22:54,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 16:22:54,711 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 16:22:54,712 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2022-07-14 16:22:54,713 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-07-14 16:22:54,720 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 16:22:54,720 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 16:22:54,720 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 16:22:54,720 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 16:22:54,720 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 16:22:54,721 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 16:22:54,721 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 16:22:54,735 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 16:22:54,759 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2022-07-14 16:22:54,759 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 16:22:54,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 16:22:54,761 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 16:22:54,774 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-07-14 16:22:54,782 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 16:22:54,782 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 16:22:54,782 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 16:22:54,783 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 16:22:54,783 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 16:22:54,784 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 16:22:54,784 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 16:22:54,788 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2022-07-14 16:22:54,796 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 16:22:54,817 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2022-07-14 16:22:54,818 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 16:22:54,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 16:22:54,819 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 16:22:54,826 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-07-14 16:22:54,833 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 16:22:54,833 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 16:22:54,833 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 16:22:54,833 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 16:22:54,833 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 16:22:54,835 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 16:22:54,835 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 16:22:54,839 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2022-07-14 16:22:54,850 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 16:22:54,875 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2022-07-14 16:22:54,875 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 16:22:54,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 16:22:54,877 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 16:22:54,880 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-07-14 16:22:54,881 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2022-07-14 16:22:54,886 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 16:22:54,886 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 16:22:54,886 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 16:22:54,886 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 16:22:54,886 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 16:22:54,887 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 16:22:54,887 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 16:22:54,902 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 16:22:54,952 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2022-07-14 16:22:54,953 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 16:22:54,953 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 16:22:54,955 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 16:22:54,958 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2022-07-14 16:22:54,961 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-07-14 16:22:54,968 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 16:22:54,968 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 16:22:54,968 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 16:22:54,968 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 16:22:54,968 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 16:22:54,969 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 16:22:54,969 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 16:22:54,983 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 16:22:55,004 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2022-07-14 16:22:55,004 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 16:22:55,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 16:22:55,006 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 16:22:55,008 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2022-07-14 16:22:55,009 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-07-14 16:22:55,015 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 16:22:55,015 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 16:22:55,015 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 16:22:55,015 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 16:22:55,015 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 16:22:55,017 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 16:22:55,017 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 16:22:55,039 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 16:22:55,065 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2022-07-14 16:22:55,065 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 16:22:55,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 16:22:55,066 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 16:22:55,067 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2022-07-14 16:22:55,072 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-07-14 16:22:55,078 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 16:22:55,078 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 16:22:55,078 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 16:22:55,078 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 16:22:55,078 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 16:22:55,079 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 16:22:55,079 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 16:22:55,080 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 16:22:55,094 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2022-07-14 16:22:55,095 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 16:22:55,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 16:22:55,096 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 16:22:55,104 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-07-14 16:22:55,111 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 16:22:55,111 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 16:22:55,111 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 16:22:55,111 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 16:22:55,111 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 16:22:55,112 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 16:22:55,112 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 16:22:55,114 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2022-07-14 16:22:55,127 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 16:22:55,155 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2022-07-14 16:22:55,155 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 16:22:55,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 16:22:55,156 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 16:22:55,157 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2022-07-14 16:22:55,159 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-07-14 16:22:55,165 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 16:22:55,166 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 16:22:55,166 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 16:22:55,166 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 16:22:55,166 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 16:22:55,172 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 16:22:55,172 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 16:22:55,175 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-14 16:22:55,200 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-07-14 16:22:55,200 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-07-14 16:22:55,202 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 16:22:55,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 16:22:55,207 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 16:22:55,212 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2022-07-14 16:22:55,213 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-14 16:22:55,213 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-07-14 16:22:55,213 INFO L513 LassoAnalysis]: Proved termination. [2022-07-14 16:22:55,214 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i2~0#1) = -2*ULTIMATE.start_main_~i2~0#1 + 11 Supporting invariants [] [2022-07-14 16:22:55,240 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2022-07-14 16:22:55,242 INFO L293 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-07-14 16:22:55,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 16:22:55,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 16:22:55,329 INFO L263 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-14 16:22:55,338 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 16:22:55,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 16:22:55,436 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-14 16:22:55,438 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 16:22:55,553 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2022-07-14 16:22:55,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 16:22:55,592 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2022-07-14 16:22:55,593 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 195 states and 288 transitions. cyclomatic complexity: 94 Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 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-07-14 16:22:55,656 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 195 states and 288 transitions. cyclomatic complexity: 94. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 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 329 states and 498 transitions. Complement of second has 4 states. [2022-07-14 16:22:55,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2022-07-14 16:22:55,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 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-07-14 16:22:55,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 201 transitions. [2022-07-14 16:22:55,661 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 201 transitions. Stem has 48 letters. Loop has 27 letters. [2022-07-14 16:22:55,662 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 16:22:55,662 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 201 transitions. Stem has 75 letters. Loop has 27 letters. [2022-07-14 16:22:55,664 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 16:22:55,664 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 201 transitions. Stem has 48 letters. Loop has 54 letters. [2022-07-14 16:22:55,667 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 16:22:55,667 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 329 states and 498 transitions. [2022-07-14 16:22:55,672 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-07-14 16:22:55,672 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 329 states to 0 states and 0 transitions. [2022-07-14 16:22:55,672 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2022-07-14 16:22:55,672 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2022-07-14 16:22:55,672 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2022-07-14 16:22:55,673 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-14 16:22:55,673 INFO L369 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-14 16:22:55,673 INFO L392 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-14 16:22:55,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 16:22:55,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 16:22:55,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 16:22:55,674 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 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-07-14 16:22:55,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 16:22:55,674 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-07-14 16:22:55,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-14 16:22:55,676 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2022-07-14 16:22:55,676 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-07-14 16:22:55,676 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2022-07-14 16:22:55,677 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2022-07-14 16:22:55,677 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2022-07-14 16:22:55,677 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2022-07-14 16:22:55,677 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-14 16:22:55,677 INFO L369 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-14 16:22:55,677 INFO L392 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-14 16:22:55,677 INFO L374 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-14 16:22:55,677 INFO L287 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2022-07-14 16:22:55,677 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2022-07-14 16:22:55,678 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-07-14 16:22:55,678 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-07-14 16:22:55,685 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 14.07 04:22:55 BoogieIcfgContainer [2022-07-14 16:22:55,685 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-07-14 16:22:55,686 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-14 16:22:55,686 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-14 16:22:55,686 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-14 16:22:55,687 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 04:22:51" (3/4) ... [2022-07-14 16:22:55,689 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-07-14 16:22:55,689 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-14 16:22:55,694 INFO L158 Benchmark]: Toolchain (without parser) took 5562.60ms. Allocated memory was 100.7MB in the beginning and 148.9MB in the end (delta: 48.2MB). Free memory was 71.4MB in the beginning and 101.4MB in the end (delta: -30.1MB). Peak memory consumption was 18.0MB. Max. memory is 16.1GB. [2022-07-14 16:22:55,694 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 100.7MB. Free memory is still 55.8MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-14 16:22:55,695 INFO L158 Benchmark]: CACSL2BoogieTranslator took 323.16ms. Allocated memory is still 100.7MB. Free memory was 71.2MB in the beginning and 71.1MB in the end (delta: 109.0kB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-14 16:22:55,695 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.74ms. Allocated memory is still 100.7MB. Free memory was 71.1MB in the beginning and 68.3MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-14 16:22:55,696 INFO L158 Benchmark]: Boogie Preprocessor took 48.05ms. Allocated memory is still 100.7MB. Free memory was 68.3MB in the beginning and 65.9MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-14 16:22:55,696 INFO L158 Benchmark]: RCFGBuilder took 652.44ms. Allocated memory was 100.7MB in the beginning and 121.6MB in the end (delta: 21.0MB). Free memory was 65.9MB in the beginning and 88.9MB in the end (delta: -23.0MB). Peak memory consumption was 22.5MB. Max. memory is 16.1GB. [2022-07-14 16:22:55,696 INFO L158 Benchmark]: BuchiAutomizer took 4487.14ms. Allocated memory was 121.6MB in the beginning and 148.9MB in the end (delta: 27.3MB). Free memory was 88.3MB in the beginning and 102.5MB in the end (delta: -14.2MB). Peak memory consumption was 15.4MB. Max. memory is 16.1GB. [2022-07-14 16:22:55,696 INFO L158 Benchmark]: Witness Printer took 3.44ms. Allocated memory is still 148.9MB. Free memory was 102.5MB in the beginning and 101.4MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-14 16:22:55,698 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.18ms. Allocated memory is still 100.7MB. Free memory is still 55.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 323.16ms. Allocated memory is still 100.7MB. Free memory was 71.2MB in the beginning and 71.1MB in the end (delta: 109.0kB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 42.74ms. Allocated memory is still 100.7MB. Free memory was 71.1MB in the beginning and 68.3MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 48.05ms. Allocated memory is still 100.7MB. Free memory was 68.3MB in the beginning and 65.9MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 652.44ms. Allocated memory was 100.7MB in the beginning and 121.6MB in the end (delta: 21.0MB). Free memory was 65.9MB in the beginning and 88.9MB in the end (delta: -23.0MB). Peak memory consumption was 22.5MB. Max. memory is 16.1GB. * BuchiAutomizer took 4487.14ms. Allocated memory was 121.6MB in the beginning and 148.9MB in the end (delta: 27.3MB). Free memory was 88.3MB in the beginning and 102.5MB in the end (delta: -14.2MB). Peak memory consumption was 15.4MB. Max. memory is 16.1GB. * Witness Printer took 3.44ms. Allocated memory is still 148.9MB. Free memory was 102.5MB in the beginning and 101.4MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (4 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -2 * i2 + 11 and consists of 3 locations. 4 modules have a trivial ranking function, the largest among these consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 4.4s and 5 iterations. TraceHistogramMax:1. Analysis of lassos took 3.6s. Construction of modules took 0.0s. Büchi inclusion checks took 0.5s. Highest rank in rank-based complementation 3. Minimization of det autom 5. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 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 [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 419 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 418 mSDsluCounter, 2613 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1669 mSDsCounter, 46 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 46 IncrementalHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 46 mSolverCounterUnsat, 944 mSDtfsCounter, 46 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT1 SILN0 SILU0 SILI2 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital136 mio100 ax100 hnf100 lsp27 ukn100 mio100 lsp100 div123 bol100 ite100 ukn100 eq182 hnf86 smp100 dnf100 smp100 tf102 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 38ms VariablesStem: 0 VariablesLoop: 1 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 1 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 1 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.3s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2022-07-14 16:22:55,738 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 Result: TRUE