./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_lcr.7.1.ufo.BOUNDED-14.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 791161d1 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_lcr.7.1.ufo.BOUNDED-14.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 252cd4a0f8e1adbe16c63dba2a525d461eb83ddbfd931d93e6b7ef83b52daaf7 --- Real Ultimate output --- This is Ultimate 0.2.2-?-791161d [2022-07-23 15:49:12,648 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-23 15:49:12,650 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-23 15:49:12,668 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-23 15:49:12,668 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-23 15:49:12,669 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-23 15:49:12,670 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-23 15:49:12,671 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-23 15:49:12,673 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-23 15:49:12,674 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-23 15:49:12,675 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-23 15:49:12,676 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-23 15:49:12,677 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-23 15:49:12,678 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-23 15:49:12,680 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-23 15:49:12,681 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-23 15:49:12,682 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-23 15:49:12,685 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-23 15:49:12,686 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-23 15:49:12,689 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-23 15:49:12,692 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-23 15:49:12,701 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-23 15:49:12,702 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-23 15:49:12,703 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-23 15:49:12,703 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-23 15:49:12,705 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-23 15:49:12,709 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-23 15:49:12,709 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-23 15:49:12,709 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-23 15:49:12,710 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-23 15:49:12,711 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-23 15:49:12,711 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-23 15:49:12,712 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-23 15:49:12,712 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-23 15:49:12,713 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-23 15:49:12,714 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-23 15:49:12,714 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-23 15:49:12,715 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-23 15:49:12,715 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-23 15:49:12,715 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-23 15:49:12,716 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-23 15:49:12,716 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-23 15:49:12,717 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2022-07-23 15:49:12,737 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-23 15:49:12,739 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-23 15:49:12,739 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-23 15:49:12,740 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-23 15:49:12,741 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-23 15:49:12,742 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-23 15:49:12,742 INFO L138 SettingsManager]: * Use SBE=true [2022-07-23 15:49:12,742 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-07-23 15:49:12,742 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-07-23 15:49:12,743 INFO L138 SettingsManager]: * Use old map elimination=false [2022-07-23 15:49:12,743 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-07-23 15:49:12,743 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-07-23 15:49:12,744 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-07-23 15:49:12,744 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-23 15:49:12,744 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-23 15:49:12,744 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-23 15:49:12,744 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-23 15:49:12,744 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-23 15:49:12,744 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-23 15:49:12,745 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-07-23 15:49:12,745 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-07-23 15:49:12,745 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-07-23 15:49:12,745 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-23 15:49:12,746 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-23 15:49:12,746 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-07-23 15:49:12,746 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-23 15:49:12,746 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-07-23 15:49:12,746 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-23 15:49:12,746 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-23 15:49:12,747 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-23 15:49:12,747 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-23 15:49:12,748 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-07-23 15:49:12,748 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 -> 252cd4a0f8e1adbe16c63dba2a525d461eb83ddbfd931d93e6b7ef83b52daaf7 [2022-07-23 15:49:12,977 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-23 15:49:13,010 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-23 15:49:13,012 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-23 15:49:13,013 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-23 15:49:13,023 INFO L275 PluginConnector]: CDTParser initialized [2022-07-23 15:49:13,025 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_lcr.7.1.ufo.BOUNDED-14.pals.c [2022-07-23 15:49:13,105 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8df376eb2/9f3960ae658f47a99ee1af81ad700b0c/FLAGbee38549e [2022-07-23 15:49:13,471 INFO L306 CDTParser]: Found 1 translation units. [2022-07-23 15:49:13,472 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr.7.1.ufo.BOUNDED-14.pals.c [2022-07-23 15:49:13,481 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8df376eb2/9f3960ae658f47a99ee1af81ad700b0c/FLAGbee38549e [2022-07-23 15:49:13,888 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8df376eb2/9f3960ae658f47a99ee1af81ad700b0c [2022-07-23 15:49:13,890 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-23 15:49:13,892 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-23 15:49:13,893 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-23 15:49:13,893 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-23 15:49:13,896 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-23 15:49:13,897 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.07 03:49:13" (1/1) ... [2022-07-23 15:49:13,897 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e044b83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 03:49:13, skipping insertion in model container [2022-07-23 15:49:13,898 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.07 03:49:13" (1/1) ... [2022-07-23 15:49:13,903 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-23 15:49:13,923 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-23 15:49:14,146 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_lcr.7.1.ufo.BOUNDED-14.pals.c[20056,20069] [2022-07-23 15:49:14,146 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-23 15:49:14,154 INFO L203 MainTranslator]: Completed pre-run [2022-07-23 15:49:14,188 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_lcr.7.1.ufo.BOUNDED-14.pals.c[20056,20069] [2022-07-23 15:49:14,189 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-23 15:49:14,200 INFO L208 MainTranslator]: Completed translation [2022-07-23 15:49:14,200 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 03:49:14 WrapperNode [2022-07-23 15:49:14,201 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-23 15:49:14,202 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-23 15:49:14,202 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-23 15:49:14,202 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-23 15:49:14,210 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 03:49:14" (1/1) ... [2022-07-23 15:49:14,217 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 03:49:14" (1/1) ... [2022-07-23 15:49:14,243 INFO L137 Inliner]: procedures = 26, calls = 18, calls flagged for inlining = 13, calls inlined = 13, statements flattened = 430 [2022-07-23 15:49:14,244 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-23 15:49:14,244 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-23 15:49:14,245 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-23 15:49:14,245 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-23 15:49:14,252 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 03:49:14" (1/1) ... [2022-07-23 15:49:14,252 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 03:49:14" (1/1) ... [2022-07-23 15:49:14,255 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 03:49:14" (1/1) ... [2022-07-23 15:49:14,255 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 03:49:14" (1/1) ... [2022-07-23 15:49:14,261 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 03:49:14" (1/1) ... [2022-07-23 15:49:14,266 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 03:49:14" (1/1) ... [2022-07-23 15:49:14,268 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 03:49:14" (1/1) ... [2022-07-23 15:49:14,271 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-23 15:49:14,272 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-23 15:49:14,272 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-23 15:49:14,272 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-23 15:49:14,273 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 03:49:14" (1/1) ... [2022-07-23 15:49:14,279 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 15:49:14,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 15:49:14,300 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-23 15:49:14,360 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-23 15:49:14,385 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-23 15:49:14,385 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-23 15:49:14,385 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-23 15:49:14,386 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-23 15:49:14,449 INFO L234 CfgBuilder]: Building ICFG [2022-07-23 15:49:14,450 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-23 15:49:14,865 INFO L275 CfgBuilder]: Performing block encoding [2022-07-23 15:49:14,871 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-23 15:49:14,871 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-23 15:49:14,873 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 03:49:14 BoogieIcfgContainer [2022-07-23 15:49:14,873 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-23 15:49:14,874 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-07-23 15:49:14,874 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-07-23 15:49:14,877 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-07-23 15:49:14,878 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-23 15:49:14,878 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 23.07 03:49:13" (1/3) ... [2022-07-23 15:49:14,879 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@48964895 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.07 03:49:14, skipping insertion in model container [2022-07-23 15:49:14,879 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-23 15:49:14,879 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 03:49:14" (2/3) ... [2022-07-23 15:49:14,880 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@48964895 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.07 03:49:14, skipping insertion in model container [2022-07-23 15:49:14,880 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-23 15:49:14,880 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 03:49:14" (3/3) ... [2022-07-23 15:49:14,881 INFO L354 chiAutomizerObserver]: Analyzing ICFG pals_lcr.7.1.ufo.BOUNDED-14.pals.c [2022-07-23 15:49:14,921 INFO L255 stractBuchiCegarLoop]: Interprodecural is true [2022-07-23 15:49:14,922 INFO L256 stractBuchiCegarLoop]: Hoare is false [2022-07-23 15:49:14,922 INFO L257 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-07-23 15:49:14,922 INFO L258 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-07-23 15:49:14,922 INFO L259 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-07-23 15:49:14,922 INFO L260 stractBuchiCegarLoop]: Difference is false [2022-07-23 15:49:14,922 INFO L261 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-07-23 15:49:14,923 INFO L265 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-07-23 15:49:14,926 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 127 states, 126 states have (on average 1.746031746031746) internal successors, (220), 126 states have internal predecessors, (220), 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-23 15:49:14,953 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 67 [2022-07-23 15:49:14,953 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-23 15:49:14,953 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-23 15:49:14,971 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-23 15:49:14,972 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, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 15:49:14,972 INFO L287 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-07-23 15:49:14,974 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 127 states, 126 states have (on average 1.746031746031746) internal successors, (220), 126 states have internal predecessors, (220), 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-23 15:49:14,982 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 67 [2022-07-23 15:49:14,984 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-23 15:49:14,984 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-23 15:49:14,987 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-23 15:49:14,987 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, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 15:49:14,993 INFO L752 eck$LassoCheckResult]: Stem: 115#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(35, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~p7~0 := 0;~p7_old~0 := 0;~p7_new~0 := 0;~id7~0 := 0;~st7~0 := 0;~send7~0 := 0;~mode7~0 := 0; 38#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc 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;~r1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~id1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~st1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~send1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~mode1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~id2~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~st2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~send2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~mode2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~id3~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~st3~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~send3~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~mode3~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~id4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~st4~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~send4~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~mode4~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~id5~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~st5~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~send5~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~mode5~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~id6~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~st6~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~send6~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;~mode6~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~id7~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;~st7~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~send7~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~mode7~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; 57#L262true assume !(0 == ~r1~0);init_~tmp~0#1 := 0; 23#L262-1true init_#res#1 := init_~tmp~0#1; 39#L463true 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; 40#L22true assume !(0 == assume_abort_if_not_~cond#1); 100#L21true assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;~p7_old~0 := ~nomsg~0;~p7_new~0 := ~nomsg~0;main_~i2~0#1 := 0; 53#L547-2true [2022-07-23 15:49:14,999 INFO L754 eck$LassoCheckResult]: Loop: 53#L547-2true assume !!(main_~i2~0#1 < 14);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; 35#L85true assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0#1 := ~p7_old~0;~p7_old~0 := ~nomsg~0; 75#L89true assume !(node1_~m1~0#1 != ~nomsg~0); 50#L89-1true ~mode1~0 := 0; 5#L85-2true assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; 109#L113true assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 27#L116true assume !(node2_~m2~0#1 != ~nomsg~0); 101#L116-1true ~mode2~0 := 0; 47#L113-2true assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; 65#L138true assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 44#L141true assume !(node3_~m3~0#1 != ~nomsg~0); 112#L141-1true ~mode3~0 := 0; 93#L138-2true assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite7#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; 54#L163true assume !(0 != ~mode4~0 % 256); 43#L176true assume !(~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0);node4_#t~ite7#1 := ~p4_new~0; 121#L176-2true ~p4_new~0 := (if node4_#t~ite7#1 % 256 <= 127 then node4_#t~ite7#1 % 256 else node4_#t~ite7#1 % 256 - 256);havoc node4_#t~ite7#1;~mode4~0 := 1; 48#L163-2true assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite8#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; 16#L188true assume !(0 != ~mode5~0 % 256); 66#L201true assume !(~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0);node5_#t~ite8#1 := ~p5_new~0; 110#L201-2true ~p5_new~0 := (if node5_#t~ite8#1 % 256 <= 127 then node5_#t~ite8#1 % 256 else node5_#t~ite8#1 % 256 - 256);havoc node5_#t~ite8#1;~mode5~0 := 1; 9#L188-2true assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite9#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; 119#L213true assume 0 != ~mode6~0 % 256;node6_~m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; 104#L216true assume !(node6_~m6~0#1 != ~nomsg~0); 60#L216-1true ~mode6~0 := 0; 14#L213-2true assume { :end_inline_node6 } true;assume { :begin_inline_node7 } true;havoc node7_#t~ite10#1, node7_~m7~0#1;havoc node7_~m7~0#1;node7_~m7~0#1 := ~nomsg~0; 24#L238true assume !(0 != ~mode7~0 % 256); 83#L251true assume ~send7~0 != ~nomsg~0 && ~p7_new~0 == ~nomsg~0;node7_#t~ite10#1 := ~send7~0; 52#L251-2true ~p7_new~0 := (if node7_#t~ite10#1 % 256 <= 127 then node7_#t~ite10#1 % 256 else node7_#t~ite10#1 % 256 - 256);havoc node7_#t~ite10#1;~mode7~0 := 1; 99#L238-2true assume { :end_inline_node7 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;~p7_old~0 := ~p7_new~0;~p7_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 22#L471true assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 <= 1);check_~tmp~1#1 := 0; 106#L471-1true check_#res#1 := check_~tmp~1#1; 6#L491true 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; 97#L583true assume !(0 == assert_~arg#1 % 256); 45#L578true 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; 53#L547-2true [2022-07-23 15:49:15,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 15:49:15,006 INFO L85 PathProgramCache]: Analyzing trace with hash 2087378158, now seen corresponding path program 1 times [2022-07-23 15:49:15,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 15:49:15,013 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549220734] [2022-07-23 15:49:15,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 15:49:15,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 15:49:15,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 15:49:15,195 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-23 15:49:15,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 15:49:15,197 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549220734] [2022-07-23 15:49:15,198 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1549220734] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 15:49:15,198 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 15:49:15,199 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-23 15:49:15,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147443877] [2022-07-23 15:49:15,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 15:49:15,206 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-23 15:49:15,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 15:49:15,208 INFO L85 PathProgramCache]: Analyzing trace with hash 692611234, now seen corresponding path program 1 times [2022-07-23 15:49:15,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 15:49:15,209 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104413427] [2022-07-23 15:49:15,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 15:49:15,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 15:49:15,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 15:49:15,400 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-23 15:49:15,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 15:49:15,401 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104413427] [2022-07-23 15:49:15,401 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [104413427] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 15:49:15,401 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 15:49:15,402 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-23 15:49:15,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523244690] [2022-07-23 15:49:15,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 15:49:15,404 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-23 15:49:15,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 15:49:15,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-23 15:49:15,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-23 15:49:15,431 INFO L87 Difference]: Start difference. First operand has 127 states, 126 states have (on average 1.746031746031746) internal successors, (220), 126 states have internal predecessors, (220), 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 1.4) internal successors, (7), 5 states have internal predecessors, (7), 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-23 15:49:15,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 15:49:15,523 INFO L93 Difference]: Finished difference Result 130 states and 219 transitions. [2022-07-23 15:49:15,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-23 15:49:15,528 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 130 states and 219 transitions. [2022-07-23 15:49:15,531 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 66 [2022-07-23 15:49:15,535 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 130 states to 122 states and 162 transitions. [2022-07-23 15:49:15,536 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 122 [2022-07-23 15:49:15,536 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 122 [2022-07-23 15:49:15,537 INFO L73 IsDeterministic]: Start isDeterministic. Operand 122 states and 162 transitions. [2022-07-23 15:49:15,537 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-23 15:49:15,538 INFO L369 hiAutomatonCegarLoop]: Abstraction has 122 states and 162 transitions. [2022-07-23 15:49:15,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states and 162 transitions. [2022-07-23 15:49:15,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2022-07-23 15:49:15,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 122 states have (on average 1.3278688524590163) internal successors, (162), 121 states have internal predecessors, (162), 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-23 15:49:15,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 162 transitions. [2022-07-23 15:49:15,561 INFO L392 hiAutomatonCegarLoop]: Abstraction has 122 states and 162 transitions. [2022-07-23 15:49:15,561 INFO L374 stractBuchiCegarLoop]: Abstraction has 122 states and 162 transitions. [2022-07-23 15:49:15,561 INFO L287 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-07-23 15:49:15,561 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 122 states and 162 transitions. [2022-07-23 15:49:15,563 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 66 [2022-07-23 15:49:15,563 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-23 15:49:15,563 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-23 15:49:15,564 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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 15:49:15,565 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, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 15:49:15,565 INFO L752 eck$LassoCheckResult]: Stem: 395#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(35, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~p7~0 := 0;~p7_old~0 := 0;~p7_new~0 := 0;~id7~0 := 0;~st7~0 := 0;~send7~0 := 0;~mode7~0 := 0; 340#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc 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;~r1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~id1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~st1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~send1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~mode1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~id2~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~st2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~send2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~mode2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~id3~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~st3~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~send3~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~mode3~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~id4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~st4~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~send4~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~mode4~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~id5~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~st5~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~send5~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~mode5~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~id6~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~st6~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~send6~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;~mode6~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~id7~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;~st7~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~send7~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~mode7~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; 341#L262 assume 0 == ~r1~0; 363#L263 assume ~id1~0 >= 0; 366#L264 assume 0 == ~st1~0; 367#L265 assume ~send1~0 == ~id1~0; 296#L266 assume 0 == ~mode1~0 % 256; 297#L267 assume ~id2~0 >= 0; 307#L268 assume 0 == ~st2~0; 308#L269 assume ~send2~0 == ~id2~0; 290#L270 assume 0 == ~mode2~0 % 256; 291#L271 assume ~id3~0 >= 0; 329#L272 assume 0 == ~st3~0; 345#L273 assume ~send3~0 == ~id3~0; 365#L274 assume 0 == ~mode3~0 % 256; 389#L275 assume ~id4~0 >= 0; 275#L276 assume 0 == ~st4~0; 276#L277 assume ~send4~0 == ~id4~0; 396#L278 assume 0 == ~mode4~0 % 256; 361#L279 assume ~id5~0 >= 0; 362#L280 assume 0 == ~st5~0; 300#L281 assume ~send5~0 == ~id5~0; 277#L282 assume 0 == ~mode5~0 % 256; 278#L283 assume ~id6~0 >= 0; 368#L284 assume 0 == ~st6~0; 369#L285 assume ~send6~0 == ~id6~0; 387#L286 assume 0 == ~mode6~0 % 256; 374#L287 assume ~id7~0 >= 0; 321#L288 assume 0 == ~st7~0; 322#L289 assume ~send7~0 == ~id7~0; 333#L290 assume 0 == ~mode7~0 % 256; 381#L291 assume ~id1~0 != ~id2~0; 382#L292 assume ~id1~0 != ~id3~0; 390#L293 assume ~id1~0 != ~id4~0; 394#L294 assume ~id1~0 != ~id5~0; 283#L295 assume ~id1~0 != ~id6~0; 284#L296 assume ~id1~0 != ~id7~0; 330#L297 assume ~id2~0 != ~id3~0; 327#L298 assume ~id2~0 != ~id4~0; 328#L299 assume ~id2~0 != ~id5~0; 339#L300 assume ~id2~0 != ~id6~0; 375#L301 assume ~id2~0 != ~id7~0; 385#L302 assume ~id3~0 != ~id4~0; 386#L303 assume ~id3~0 != ~id5~0; 392#L304 assume ~id3~0 != ~id6~0; 370#L305 assume ~id3~0 != ~id7~0; 371#L306 assume ~id4~0 != ~id5~0; 380#L307 assume ~id4~0 != ~id6~0; 292#L308 assume ~id4~0 != ~id7~0; 293#L309 assume ~id5~0 != ~id6~0; 379#L310 assume ~id5~0 != ~id7~0; 356#L311 assume ~id6~0 != ~id7~0;init_~tmp~0#1 := 1; 319#L262-1 init_#res#1 := init_~tmp~0#1; 320#L463 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; 342#L22 assume !(0 == assume_abort_if_not_~cond#1); 344#L21 assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;~p7_old~0 := ~nomsg~0;~p7_new~0 := ~nomsg~0;main_~i2~0#1 := 0; 352#L547-2 [2022-07-23 15:49:15,565 INFO L754 eck$LassoCheckResult]: Loop: 352#L547-2 assume !!(main_~i2~0#1 < 14);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; 336#L85 assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0#1 := ~p7_old~0;~p7_old~0 := ~nomsg~0; 337#L89 assume !(node1_~m1~0#1 != ~nomsg~0); 335#L89-1 ~mode1~0 := 0; 281#L85-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; 282#L113 assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 326#L116 assume !(node2_~m2~0#1 != ~nomsg~0); 286#L116-1 ~mode2~0 := 0; 353#L113-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; 354#L138 assume !(0 != ~mode3~0 % 256); 372#L151 assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite6#1 := ~send3~0; 312#L151-2 ~p3_new~0 := (if node3_#t~ite6#1 % 256 <= 127 then node3_#t~ite6#1 % 256 else node3_#t~ite6#1 % 256 - 256);havoc node3_#t~ite6#1;~mode3~0 := 1; 313#L138-2 assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite7#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; 359#L163 assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 360#L166 assume !(node4_~m4~0#1 != ~nomsg~0); 305#L166-1 ~mode4~0 := 0; 355#L163-2 assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite8#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; 301#L188 assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 302#L191 assume !(node5_~m5~0#1 != ~nomsg~0); 383#L191-1 ~mode5~0 := 0; 288#L188-2 assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite9#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; 289#L213 assume !(0 != ~mode6~0 % 256); 294#L226 assume ~send6~0 != ~nomsg~0 && ~p6_new~0 == ~nomsg~0;node6_#t~ite9#1 := ~send6~0; 295#L226-2 ~p6_new~0 := (if node6_#t~ite9#1 % 256 <= 127 then node6_#t~ite9#1 % 256 else node6_#t~ite9#1 % 256 - 256);havoc node6_#t~ite9#1;~mode6~0 := 1; 298#L213-2 assume { :end_inline_node6 } true;assume { :begin_inline_node7 } true;havoc node7_#t~ite10#1, node7_~m7~0#1;havoc node7_~m7~0#1;node7_~m7~0#1 := ~nomsg~0; 299#L238 assume 0 != ~mode7~0 % 256;node7_~m7~0#1 := ~p6_old~0;~p6_old~0 := ~nomsg~0; 317#L241 assume !(node7_~m7~0#1 != ~nomsg~0); 324#L241-1 ~mode7~0 := 0; 358#L238-2 assume { :end_inline_node7 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;~p7_old~0 := ~p7_new~0;~p7_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 314#L471 assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 <= 1);check_~tmp~1#1 := 0; 315#L471-1 check_#res#1 := check_~tmp~1#1; 279#L491 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; 280#L583 assume !(0 == assert_~arg#1 % 256); 351#L578 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; 352#L547-2 [2022-07-23 15:49:15,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 15:49:15,566 INFO L85 PathProgramCache]: Analyzing trace with hash 292839954, now seen corresponding path program 1 times [2022-07-23 15:49:15,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 15:49:15,566 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257898100] [2022-07-23 15:49:15,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 15:49:15,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 15:49:15,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 15:49:15,590 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 15:49:15,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 15:49:15,637 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 15:49:15,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 15:49:15,638 INFO L85 PathProgramCache]: Analyzing trace with hash 144901296, now seen corresponding path program 1 times [2022-07-23 15:49:15,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 15:49:15,638 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223836035] [2022-07-23 15:49:15,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 15:49:15,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 15:49:15,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 15:49:15,721 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-23 15:49:15,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 15:49:15,722 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223836035] [2022-07-23 15:49:15,722 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1223836035] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 15:49:15,722 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 15:49:15,722 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-23 15:49:15,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510396341] [2022-07-23 15:49:15,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 15:49:15,723 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-23 15:49:15,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 15:49:15,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-23 15:49:15,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-23 15:49:15,724 INFO L87 Difference]: Start difference. First operand 122 states and 162 transitions. cyclomatic complexity: 41 Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 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-23 15:49:15,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 15:49:15,759 INFO L93 Difference]: Finished difference Result 125 states and 164 transitions. [2022-07-23 15:49:15,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-23 15:49:15,760 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 125 states and 164 transitions. [2022-07-23 15:49:15,761 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 66 [2022-07-23 15:49:15,762 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 125 states to 122 states and 159 transitions. [2022-07-23 15:49:15,762 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 122 [2022-07-23 15:49:15,762 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 122 [2022-07-23 15:49:15,762 INFO L73 IsDeterministic]: Start isDeterministic. Operand 122 states and 159 transitions. [2022-07-23 15:49:15,763 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-23 15:49:15,763 INFO L369 hiAutomatonCegarLoop]: Abstraction has 122 states and 159 transitions. [2022-07-23 15:49:15,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states and 159 transitions. [2022-07-23 15:49:15,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2022-07-23 15:49:15,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 122 states have (on average 1.3032786885245902) internal successors, (159), 121 states have internal predecessors, (159), 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-23 15:49:15,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 159 transitions. [2022-07-23 15:49:15,768 INFO L392 hiAutomatonCegarLoop]: Abstraction has 122 states and 159 transitions. [2022-07-23 15:49:15,768 INFO L374 stractBuchiCegarLoop]: Abstraction has 122 states and 159 transitions. [2022-07-23 15:49:15,768 INFO L287 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-07-23 15:49:15,768 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 122 states and 159 transitions. [2022-07-23 15:49:15,769 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 66 [2022-07-23 15:49:15,769 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-23 15:49:15,769 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-23 15:49:15,771 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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 15:49:15,771 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 15:49:15,771 INFO L752 eck$LassoCheckResult]: Stem: 654#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(35, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~p7~0 := 0;~p7_old~0 := 0;~p7_new~0 := 0;~id7~0 := 0;~st7~0 := 0;~send7~0 := 0;~mode7~0 := 0; 598#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc 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;~r1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~id1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~st1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~send1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~mode1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~id2~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~st2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~send2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~mode2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~id3~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~st3~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~send3~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~mode3~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~id4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~st4~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~send4~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~mode4~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~id5~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~st5~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~send5~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~mode5~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~id6~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~st6~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~send6~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;~mode6~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~id7~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;~st7~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~send7~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~mode7~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; 599#L262 assume 0 == ~r1~0; 622#L263 assume ~id1~0 >= 0; 625#L264 assume 0 == ~st1~0; 626#L265 assume ~send1~0 == ~id1~0; 555#L266 assume 0 == ~mode1~0 % 256; 556#L267 assume ~id2~0 >= 0; 566#L268 assume 0 == ~st2~0; 567#L269 assume ~send2~0 == ~id2~0; 549#L270 assume 0 == ~mode2~0 % 256; 550#L271 assume ~id3~0 >= 0; 587#L272 assume 0 == ~st3~0; 604#L273 assume ~send3~0 == ~id3~0; 624#L274 assume 0 == ~mode3~0 % 256; 648#L275 assume ~id4~0 >= 0; 534#L276 assume 0 == ~st4~0; 535#L277 assume ~send4~0 == ~id4~0; 655#L278 assume 0 == ~mode4~0 % 256; 620#L279 assume ~id5~0 >= 0; 621#L280 assume 0 == ~st5~0; 559#L281 assume ~send5~0 == ~id5~0; 536#L282 assume 0 == ~mode5~0 % 256; 537#L283 assume ~id6~0 >= 0; 627#L284 assume 0 == ~st6~0; 628#L285 assume ~send6~0 == ~id6~0; 646#L286 assume 0 == ~mode6~0 % 256; 633#L287 assume ~id7~0 >= 0; 579#L288 assume 0 == ~st7~0; 580#L289 assume ~send7~0 == ~id7~0; 591#L290 assume 0 == ~mode7~0 % 256; 640#L291 assume ~id1~0 != ~id2~0; 641#L292 assume ~id1~0 != ~id3~0; 649#L293 assume ~id1~0 != ~id4~0; 653#L294 assume ~id1~0 != ~id5~0; 542#L295 assume ~id1~0 != ~id6~0; 543#L296 assume ~id1~0 != ~id7~0; 588#L297 assume ~id2~0 != ~id3~0; 585#L298 assume ~id2~0 != ~id4~0; 586#L299 assume ~id2~0 != ~id5~0; 597#L300 assume ~id2~0 != ~id6~0; 634#L301 assume ~id2~0 != ~id7~0; 644#L302 assume ~id3~0 != ~id4~0; 645#L303 assume ~id3~0 != ~id5~0; 651#L304 assume ~id3~0 != ~id6~0; 629#L305 assume ~id3~0 != ~id7~0; 630#L306 assume ~id4~0 != ~id5~0; 639#L307 assume ~id4~0 != ~id6~0; 551#L308 assume ~id4~0 != ~id7~0; 552#L309 assume ~id5~0 != ~id6~0; 638#L310 assume ~id5~0 != ~id7~0; 615#L311 assume ~id6~0 != ~id7~0;init_~tmp~0#1 := 1; 575#L262-1 init_#res#1 := init_~tmp~0#1; 576#L463 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; 600#L22 assume !(0 == assume_abort_if_not_~cond#1); 603#L21 assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;~p7_old~0 := ~nomsg~0;~p7_new~0 := ~nomsg~0;main_~i2~0#1 := 0; 611#L547-2 [2022-07-23 15:49:15,772 INFO L754 eck$LassoCheckResult]: Loop: 611#L547-2 assume !!(main_~i2~0#1 < 14);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; 594#L85 assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0#1 := ~p7_old~0;~p7_old~0 := ~nomsg~0; 595#L89 assume !(node1_~m1~0#1 != ~nomsg~0); 593#L89-1 ~mode1~0 := 0; 540#L85-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; 541#L113 assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 583#L116 assume !(node2_~m2~0#1 != ~nomsg~0); 545#L116-1 ~mode2~0 := 0; 612#L113-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; 613#L138 assume !(0 != ~mode3~0 % 256); 631#L151 assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite6#1 := ~send3~0; 571#L151-2 ~p3_new~0 := (if node3_#t~ite6#1 % 256 <= 127 then node3_#t~ite6#1 % 256 else node3_#t~ite6#1 % 256 - 256);havoc node3_#t~ite6#1;~mode3~0 := 1; 572#L138-2 assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite7#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; 618#L163 assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 619#L166 assume !(node4_~m4~0#1 != ~nomsg~0); 564#L166-1 ~mode4~0 := 0; 614#L163-2 assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite8#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; 560#L188 assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 561#L191 assume !(node5_~m5~0#1 != ~nomsg~0); 642#L191-1 ~mode5~0 := 0; 547#L188-2 assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite9#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; 548#L213 assume !(0 != ~mode6~0 % 256); 553#L226 assume ~send6~0 != ~nomsg~0 && ~p6_new~0 == ~nomsg~0;node6_#t~ite9#1 := ~send6~0; 554#L226-2 ~p6_new~0 := (if node6_#t~ite9#1 % 256 <= 127 then node6_#t~ite9#1 % 256 else node6_#t~ite9#1 % 256 - 256);havoc node6_#t~ite9#1;~mode6~0 := 1; 557#L213-2 assume { :end_inline_node6 } true;assume { :begin_inline_node7 } true;havoc node7_#t~ite10#1, node7_~m7~0#1;havoc node7_~m7~0#1;node7_~m7~0#1 := ~nomsg~0; 558#L238 assume 0 != ~mode7~0 % 256;node7_~m7~0#1 := ~p6_old~0;~p6_old~0 := ~nomsg~0; 577#L241 assume !(node7_~m7~0#1 != ~nomsg~0); 582#L241-1 ~mode7~0 := 0; 617#L238-2 assume { :end_inline_node7 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;~p7_old~0 := ~p7_new~0;~p7_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 573#L471 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 <= 1; 574#L472 assume ~r1~0 >= 7; 590#L476 assume ~r1~0 < 7;check_~tmp~1#1 := 1; 601#L471-1 check_#res#1 := check_~tmp~1#1; 538#L491 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; 539#L583 assume !(0 == assert_~arg#1 % 256); 610#L578 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; 611#L547-2 [2022-07-23 15:49:15,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 15:49:15,772 INFO L85 PathProgramCache]: Analyzing trace with hash 292839954, now seen corresponding path program 2 times [2022-07-23 15:49:15,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 15:49:15,773 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222083258] [2022-07-23 15:49:15,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 15:49:15,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 15:49:15,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 15:49:15,790 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 15:49:15,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 15:49:15,812 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 15:49:15,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 15:49:15,813 INFO L85 PathProgramCache]: Analyzing trace with hash 395379104, now seen corresponding path program 1 times [2022-07-23 15:49:15,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 15:49:15,814 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445676937] [2022-07-23 15:49:15,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 15:49:15,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 15:49:15,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 15:49:15,835 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-23 15:49:15,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 15:49:15,836 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445676937] [2022-07-23 15:49:15,836 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [445676937] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 15:49:15,836 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 15:49:15,836 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-23 15:49:15,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012116882] [2022-07-23 15:49:15,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 15:49:15,837 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-23 15:49:15,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 15:49:15,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 15:49:15,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 15:49:15,838 INFO L87 Difference]: Start difference. First operand 122 states and 159 transitions. cyclomatic complexity: 38 Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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-23 15:49:15,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 15:49:15,854 INFO L93 Difference]: Finished difference Result 182 states and 251 transitions. [2022-07-23 15:49:15,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 15:49:15,855 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 182 states and 251 transitions. [2022-07-23 15:49:15,856 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 126 [2022-07-23 15:49:15,857 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 182 states to 182 states and 251 transitions. [2022-07-23 15:49:15,857 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 182 [2022-07-23 15:49:15,858 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 182 [2022-07-23 15:49:15,858 INFO L73 IsDeterministic]: Start isDeterministic. Operand 182 states and 251 transitions. [2022-07-23 15:49:15,859 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-23 15:49:15,859 INFO L369 hiAutomatonCegarLoop]: Abstraction has 182 states and 251 transitions. [2022-07-23 15:49:15,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states and 251 transitions. [2022-07-23 15:49:15,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 182. [2022-07-23 15:49:15,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 182 states have (on average 1.379120879120879) internal successors, (251), 181 states have internal predecessors, (251), 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-23 15:49:15,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 251 transitions. [2022-07-23 15:49:15,864 INFO L392 hiAutomatonCegarLoop]: Abstraction has 182 states and 251 transitions. [2022-07-23 15:49:15,864 INFO L374 stractBuchiCegarLoop]: Abstraction has 182 states and 251 transitions. [2022-07-23 15:49:15,864 INFO L287 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-07-23 15:49:15,864 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 182 states and 251 transitions. [2022-07-23 15:49:15,865 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 126 [2022-07-23 15:49:15,865 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-23 15:49:15,866 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-23 15:49:15,867 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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 15:49:15,867 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 15:49:15,867 INFO L752 eck$LassoCheckResult]: Stem: 970#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(35, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~p7~0 := 0;~p7_old~0 := 0;~p7_new~0 := 0;~id7~0 := 0;~st7~0 := 0;~send7~0 := 0;~mode7~0 := 0; 907#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc 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;~r1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~id1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~st1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~send1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~mode1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~id2~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~st2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~send2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~mode2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~id3~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~st3~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~send3~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~mode3~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~id4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~st4~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~send4~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~mode4~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~id5~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~st5~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~send5~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~mode5~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~id6~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~st6~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~send6~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;~mode6~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~id7~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;~st7~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~send7~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~mode7~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; 908#L262 assume 0 == ~r1~0; 932#L263 assume ~id1~0 >= 0; 935#L264 assume 0 == ~st1~0; 936#L265 assume ~send1~0 == ~id1~0; 867#L266 assume 0 == ~mode1~0 % 256; 868#L267 assume ~id2~0 >= 0; 879#L268 assume 0 == ~st2~0; 880#L269 assume ~send2~0 == ~id2~0; 859#L270 assume 0 == ~mode2~0 % 256; 860#L271 assume ~id3~0 >= 0; 897#L272 assume 0 == ~st3~0; 912#L273 assume ~send3~0 == ~id3~0; 934#L274 assume 0 == ~mode3~0 % 256; 961#L275 assume ~id4~0 >= 0; 844#L276 assume 0 == ~st4~0; 845#L277 assume ~send4~0 == ~id4~0; 971#L278 assume 0 == ~mode4~0 % 256; 930#L279 assume ~id5~0 >= 0; 931#L280 assume 0 == ~st5~0; 869#L281 assume ~send5~0 == ~id5~0; 846#L282 assume 0 == ~mode5~0 % 256; 847#L283 assume ~id6~0 >= 0; 937#L284 assume 0 == ~st6~0; 938#L285 assume ~send6~0 == ~id6~0; 959#L286 assume 0 == ~mode6~0 % 256; 943#L287 assume ~id7~0 >= 0; 889#L288 assume 0 == ~st7~0; 890#L289 assume ~send7~0 == ~id7~0; 900#L290 assume 0 == ~mode7~0 % 256; 952#L291 assume ~id1~0 != ~id2~0; 953#L292 assume ~id1~0 != ~id3~0; 962#L293 assume ~id1~0 != ~id4~0; 968#L294 assume ~id1~0 != ~id5~0; 852#L295 assume ~id1~0 != ~id6~0; 853#L296 assume ~id1~0 != ~id7~0; 898#L297 assume ~id2~0 != ~id3~0; 895#L298 assume ~id2~0 != ~id4~0; 896#L299 assume ~id2~0 != ~id5~0; 906#L300 assume ~id2~0 != ~id6~0; 944#L301 assume ~id2~0 != ~id7~0; 957#L302 assume ~id3~0 != ~id4~0; 958#L303 assume ~id3~0 != ~id5~0; 966#L304 assume ~id3~0 != ~id6~0; 939#L305 assume ~id3~0 != ~id7~0; 940#L306 assume ~id4~0 != ~id5~0; 951#L307 assume ~id4~0 != ~id6~0; 863#L308 assume ~id4~0 != ~id7~0; 864#L309 assume ~id5~0 != ~id6~0; 950#L310 assume ~id5~0 != ~id7~0; 924#L311 assume ~id6~0 != ~id7~0;init_~tmp~0#1 := 1; 887#L262-1 init_#res#1 := init_~tmp~0#1; 888#L463 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; 909#L22 assume !(0 == assume_abort_if_not_~cond#1); 911#L21 assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;~p7_old~0 := ~nomsg~0;~p7_new~0 := ~nomsg~0;main_~i2~0#1 := 0; 965#L547-2 [2022-07-23 15:49:15,867 INFO L754 eck$LassoCheckResult]: Loop: 965#L547-2 assume !!(main_~i2~0#1 < 14);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; 1021#L85 assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0#1 := ~p7_old~0;~p7_old~0 := ~nomsg~0; 904#L89 assume !(node1_~m1~0#1 != ~nomsg~0); 902#L89-1 ~mode1~0 := 0; 925#L85-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; 1018#L113 assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 1015#L116 assume !(node2_~m2~0#1 != ~nomsg~0); 1013#L116-1 ~mode2~0 := 0; 1011#L113-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; 1010#L138 assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 1008#L141 assume !(node3_~m3~0#1 != ~nomsg~0); 969#L141-1 ~mode3~0 := 0; 882#L138-2 assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite7#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; 928#L163 assume !(0 != ~mode4~0 % 256); 913#L176 assume !(~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0);node4_#t~ite7#1 := ~p4_new~0; 914#L176-2 ~p4_new~0 := (if node4_#t~ite7#1 % 256 <= 127 then node4_#t~ite7#1 % 256 else node4_#t~ite7#1 % 256 - 256);havoc node4_#t~ite7#1;~mode4~0 := 1; 923#L163-2 assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite8#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; 870#L188 assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 871#L191 assume !(node5_~m5~0#1 != ~nomsg~0); 954#L191-1 ~mode5~0 := 0; 857#L188-2 assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite9#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; 858#L213 assume 0 != ~mode6~0 % 256;node6_~m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; 967#L216 assume !(node6_~m6~0#1 != ~nomsg~0); 878#L216-1 ~mode6~0 := 0; 865#L213-2 assume { :end_inline_node6 } true;assume { :begin_inline_node7 } true;havoc node7_#t~ite10#1, node7_~m7~0#1;havoc node7_~m7~0#1;node7_~m7~0#1 := ~nomsg~0; 866#L238 assume 0 != ~mode7~0 % 256;node7_~m7~0#1 := ~p6_old~0;~p6_old~0 := ~nomsg~0; 885#L241 assume !(node7_~m7~0#1 != ~nomsg~0); 892#L241-1 ~mode7~0 := 0; 927#L238-2 assume { :end_inline_node7 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;~p7_old~0 := ~p7_new~0;~p7_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 973#L471 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 <= 1; 972#L472 assume !(~r1~0 >= 7); 948#L475 assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0; 949#L476 assume ~r1~0 < 7;check_~tmp~1#1 := 1; 1025#L471-1 check_#res#1 := check_~tmp~1#1; 1024#L491 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; 1023#L583 assume !(0 == assert_~arg#1 % 256); 1022#L578 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; 965#L547-2 [2022-07-23 15:49:15,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 15:49:15,871 INFO L85 PathProgramCache]: Analyzing trace with hash 292839954, now seen corresponding path program 3 times [2022-07-23 15:49:15,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 15:49:15,871 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904138699] [2022-07-23 15:49:15,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 15:49:15,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 15:49:15,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 15:49:15,886 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 15:49:15,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 15:49:15,905 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 15:49:15,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 15:49:15,906 INFO L85 PathProgramCache]: Analyzing trace with hash -874268515, now seen corresponding path program 1 times [2022-07-23 15:49:15,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 15:49:15,907 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345704982] [2022-07-23 15:49:15,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 15:49:15,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 15:49:15,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 15:49:15,919 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 15:49:15,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 15:49:15,945 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 15:49:15,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 15:49:15,951 INFO L85 PathProgramCache]: Analyzing trace with hash 1767963948, now seen corresponding path program 1 times [2022-07-23 15:49:15,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 15:49:15,952 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195381845] [2022-07-23 15:49:15,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 15:49:15,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 15:49:15,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 15:49:15,990 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-23 15:49:15,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 15:49:15,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195381845] [2022-07-23 15:49:15,991 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [195381845] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 15:49:15,991 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 15:49:15,991 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-23 15:49:15,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111745913] [2022-07-23 15:49:15,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 15:49:17,194 INFO L210 LassoAnalysis]: Preferences: [2022-07-23 15:49:17,194 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-23 15:49:17,195 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-23 15:49:17,195 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-23 15:49:17,195 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-07-23 15:49:17,195 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 15:49:17,195 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-23 15:49:17,195 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-23 15:49:17,195 INFO L133 ssoRankerPreferences]: Filename of dumped script: pals_lcr.7.1.ufo.BOUNDED-14.pals.c_Iteration4_Loop [2022-07-23 15:49:17,196 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-23 15:49:17,196 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-23 15:49:17,211 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-23 15:49:17,217 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-23 15:49:17,218 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-23 15:49:17,337 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-23 15:49:17,339 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-23 15:49:17,348 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-23 15:49:17,350 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-23 15:49:17,354 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-23 15:49:17,356 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-23 15:49:17,359 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-23 15:49:17,362 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-23 15:49:17,364 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-23 15:49:17,365 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-23 15:49:17,369 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-23 15:49:17,371 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-23 15:49:17,374 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-23 15:49:17,378 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-23 15:49:17,380 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-23 15:49:17,384 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-23 15:49:17,388 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-23 15:49:17,389 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-23 15:49:17,393 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-23 15:49:19,790 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-23 15:49:19,791 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-07-23 15:49:19,793 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 15:49:19,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 15:49:19,794 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-23 15:49:19,801 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-23 15:49:19,802 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-23 15:49:19,802 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-23 15:49:19,834 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2022-07-23 15:49:19,835 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 15:49:19,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 15:49:19,838 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-23 15:49:19,839 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-23 15:49:19,845 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-07-23 15:49:19,845 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-23 15:49:19,954 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-07-23 15:49:19,958 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-23 15:49:19,958 INFO L210 LassoAnalysis]: Preferences: [2022-07-23 15:49:19,958 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-23 15:49:19,958 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-23 15:49:19,958 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-23 15:49:19,958 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-23 15:49:19,958 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 15:49:19,958 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-23 15:49:19,958 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-23 15:49:19,959 INFO L133 ssoRankerPreferences]: Filename of dumped script: pals_lcr.7.1.ufo.BOUNDED-14.pals.c_Iteration4_Loop [2022-07-23 15:49:19,959 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-23 15:49:19,959 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-23 15:49:19,961 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-23 15:49:19,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-23 15:49:19,977 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-23 15:49:19,979 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-23 15:49:19,981 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-23 15:49:20,073 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-23 15:49:20,080 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-23 15:49:20,081 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-23 15:49:20,085 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-23 15:49:20,088 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-23 15:49:20,089 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-23 15:49:20,090 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-23 15:49:20,091 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-23 15:49:20,094 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-23 15:49:20,095 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-23 15:49:20,097 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-23 15:49:20,100 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-23 15:49:20,101 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-23 15:49:20,103 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-23 15:49:20,106 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-23 15:49:20,107 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-23 15:49:20,109 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-23 15:49:22,452 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-23 15:49:22,455 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-23 15:49:22,456 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 15:49:22,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 15:49:22,457 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-23 15:49:22,458 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-23 15:49:22,460 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-23 15:49:22,466 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 15:49:22,466 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 15:49:22,466 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 15:49:22,466 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 15:49:22,466 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 15:49:22,468 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-23 15:49:22,468 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 15:49:22,483 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 15:49:22,499 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-23 15:49:22,499 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 15:49:22,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 15:49:22,500 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-23 15:49:22,501 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-23 15:49:22,503 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-23 15:49:22,509 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 15:49:22,509 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 15:49:22,509 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 15:49:22,509 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 15:49:22,509 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 15:49:22,510 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-23 15:49:22,510 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 15:49:22,522 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 15:49:22,537 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-23 15:49:22,537 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 15:49:22,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 15:49:22,538 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-23 15:49:22,539 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-23 15:49:22,540 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-23 15:49:22,546 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 15:49:22,546 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 15:49:22,546 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 15:49:22,546 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 15:49:22,546 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 15:49:22,547 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-23 15:49:22,547 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 15:49:22,562 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 15:49:22,577 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-23 15:49:22,581 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 15:49:22,581 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 15:49:22,582 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-23 15:49:22,583 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-23 15:49:22,584 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-23 15:49:22,590 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 15:49:22,590 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 15:49:22,590 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 15:49:22,590 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 15:49:22,590 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 15:49:22,591 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-23 15:49:22,591 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 15:49:22,592 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 15:49:22,606 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2022-07-23 15:49:22,607 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 15:49:22,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 15:49:22,608 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-23 15:49:22,609 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-23 15:49:22,610 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-23 15:49:22,618 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 15:49:22,618 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 15:49:22,618 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 15:49:22,618 INFO L204 nArgumentSynthesizer]: 6 loop disjuncts [2022-07-23 15:49:22,618 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 15:49:22,673 INFO L401 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2022-07-23 15:49:22,674 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 15:49:22,707 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 15:49:22,727 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-23 15:49:22,727 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 15:49:22,728 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 15:49:22,729 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-23 15:49:22,730 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-23 15:49:22,731 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 15:49:22,738 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 15:49:22,738 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 15:49:22,738 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 15:49:22,738 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2022-07-23 15:49:22,738 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 15:49:22,751 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-07-23 15:49:22,751 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 15:49:22,753 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 15:49:22,771 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-23 15:49:22,771 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 15:49:22,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 15:49:22,772 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-23 15:49:22,773 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-23 15:49:22,775 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-23 15:49:22,780 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 15:49:22,781 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 15:49:22,781 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 15:49:22,781 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 15:49:22,781 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 15:49:22,781 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-23 15:49:22,781 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 15:49:22,782 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 15:49:22,797 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2022-07-23 15:49:22,798 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 15:49:22,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 15:49:22,799 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-23 15:49:22,802 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-23 15:49:22,802 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-23 15:49:22,808 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 15:49:22,808 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 15:49:22,808 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 15:49:22,808 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 15:49:22,808 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 15:49:22,809 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-23 15:49:22,809 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 15:49:22,811 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 15:49:22,827 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-23 15:49:22,828 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 15:49:22,828 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 15:49:22,829 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-23 15:49:22,830 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-23 15:49:22,831 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-23 15:49:22,836 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 15:49:22,837 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 15:49:22,837 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 15:49:22,837 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 15:49:22,837 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 15:49:22,838 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-23 15:49:22,838 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 15:49:22,839 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 15:49:22,854 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2022-07-23 15:49:22,855 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 15:49:22,856 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 15:49:22,856 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-23 15:49:22,914 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-23 15:49:22,914 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-23 15:49:22,920 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 15:49:22,920 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 15:49:22,920 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 15:49:22,920 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 15:49:22,920 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 15:49:22,921 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-23 15:49:22,921 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 15:49:22,922 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 15:49:22,937 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-23 15:49:22,938 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 15:49:22,938 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 15:49:22,940 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-23 15:49:22,941 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-23 15:49:22,943 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-23 15:49:22,948 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 15:49:22,948 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 15:49:22,948 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 15:49:22,948 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 15:49:22,948 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 15:49:22,949 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-23 15:49:22,949 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 15:49:22,949 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 15:49:22,965 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-23 15:49:22,965 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 15:49:22,965 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 15:49:22,966 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-23 15:49:22,966 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-23 15:49:22,968 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-23 15:49:22,973 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 15:49:22,974 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 15:49:22,974 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 15:49:22,974 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 15:49:22,974 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 15:49:22,974 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-23 15:49:22,974 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 15:49:22,975 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 15:49:22,990 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-23 15:49:22,991 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 15:49:22,991 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 15:49:22,992 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-23 15:49:22,993 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-23 15:49:22,995 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-23 15:49:23,000 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 15:49:23,000 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 15:49:23,000 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 15:49:23,001 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 15:49:23,001 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 15:49:23,001 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-23 15:49:23,001 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 15:49:23,003 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 15:49:23,020 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2022-07-23 15:49:23,020 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 15:49:23,021 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 15:49:23,022 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-23 15:49:23,034 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-23 15:49:23,034 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-23 15:49:23,039 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 15:49:23,039 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 15:49:23,039 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 15:49:23,039 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 15:49:23,040 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 15:49:23,040 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-23 15:49:23,040 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 15:49:23,041 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 15:49:23,056 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2022-07-23 15:49:23,056 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 15:49:23,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 15:49:23,057 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-23 15:49:23,059 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-23 15:49:23,060 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-23 15:49:23,066 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 15:49:23,066 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 15:49:23,066 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 15:49:23,066 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 15:49:23,066 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 15:49:23,067 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-23 15:49:23,067 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 15:49:23,068 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-23 15:49:23,085 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-07-23 15:49:23,085 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-07-23 15:49:23,086 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 15:49:23,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 15:49:23,087 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-23 15:49:23,088 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-23 15:49:23,111 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-23 15:49:23,112 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-07-23 15:49:23,112 INFO L513 LassoAnalysis]: Proved termination. [2022-07-23 15:49:23,112 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i2~0#1) = -2*ULTIMATE.start_main_~i2~0#1 + 27 Supporting invariants [] [2022-07-23 15:49:23,132 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-23 15:49:23,133 INFO L293 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-07-23 15:49:23,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 15:49:23,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 15:49:23,202 INFO L263 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-23 15:49:23,204 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 15:49:23,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 15:49:23,283 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-23 15:49:23,284 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 15:49:23,388 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-23 15:49:23,391 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-23 15:49:23,392 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 182 states and 251 transitions. cyclomatic complexity: 70 Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 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-23 15:49:23,441 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 182 states and 251 transitions. cyclomatic complexity: 70. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 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 307 states and 446 transitions. Complement of second has 4 states. [2022-07-23 15:49:23,442 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-23 15:49:23,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 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-23 15:49:23,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 159 transitions. [2022-07-23 15:49:23,444 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 159 transitions. Stem has 56 letters. Loop has 37 letters. [2022-07-23 15:49:23,445 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-23 15:49:23,445 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 159 transitions. Stem has 93 letters. Loop has 37 letters. [2022-07-23 15:49:23,446 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-23 15:49:23,446 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 159 transitions. Stem has 56 letters. Loop has 74 letters. [2022-07-23 15:49:23,447 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-23 15:49:23,447 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 307 states and 446 transitions. [2022-07-23 15:49:23,448 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-07-23 15:49:23,449 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 307 states to 0 states and 0 transitions. [2022-07-23 15:49:23,449 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2022-07-23 15:49:23,449 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2022-07-23 15:49:23,449 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2022-07-23 15:49:23,449 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-23 15:49:23,449 INFO L369 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-23 15:49:23,449 INFO L392 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-23 15:49:23,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 15:49:23,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 15:49:23,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 15:49:23,449 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 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-23 15:49:23,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 15:49:23,449 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-07-23 15:49:23,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-23 15:49:23,450 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2022-07-23 15:49:23,450 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-07-23 15:49:23,450 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2022-07-23 15:49:23,450 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2022-07-23 15:49:23,450 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2022-07-23 15:49:23,450 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2022-07-23 15:49:23,450 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-23 15:49:23,450 INFO L369 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-23 15:49:23,450 INFO L392 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-23 15:49:23,450 INFO L374 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-23 15:49:23,450 INFO L287 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2022-07-23 15:49:23,450 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2022-07-23 15:49:23,450 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-07-23 15:49:23,450 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-07-23 15:49:23,455 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 23.07 03:49:23 BoogieIcfgContainer [2022-07-23 15:49:23,455 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-07-23 15:49:23,455 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-23 15:49:23,455 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-23 15:49:23,455 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-23 15:49:23,456 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 03:49:14" (3/4) ... [2022-07-23 15:49:23,457 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-07-23 15:49:23,457 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-23 15:49:23,458 INFO L158 Benchmark]: Toolchain (without parser) took 9566.16ms. Allocated memory was 88.1MB in the beginning and 159.4MB in the end (delta: 71.3MB). Free memory was 52.4MB in the beginning and 83.4MB in the end (delta: -31.0MB). Peak memory consumption was 38.4MB. Max. memory is 16.1GB. [2022-07-23 15:49:23,458 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 88.1MB. Free memory was 57.8MB in the beginning and 57.8MB in the end (delta: 22.6kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-23 15:49:23,458 INFO L158 Benchmark]: CACSL2BoogieTranslator took 307.77ms. Allocated memory was 88.1MB in the beginning and 107.0MB in the end (delta: 18.9MB). Free memory was 52.2MB in the beginning and 75.9MB in the end (delta: -23.7MB). Peak memory consumption was 5.5MB. Max. memory is 16.1GB. [2022-07-23 15:49:23,459 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.47ms. Allocated memory is still 107.0MB. Free memory was 75.9MB in the beginning and 73.2MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-23 15:49:23,459 INFO L158 Benchmark]: Boogie Preprocessor took 26.53ms. Allocated memory is still 107.0MB. Free memory was 73.2MB in the beginning and 71.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-23 15:49:23,459 INFO L158 Benchmark]: RCFGBuilder took 601.89ms. Allocated memory is still 107.0MB. Free memory was 71.1MB in the beginning and 72.7MB in the end (delta: -1.5MB). Peak memory consumption was 19.9MB. Max. memory is 16.1GB. [2022-07-23 15:49:23,459 INFO L158 Benchmark]: BuchiAutomizer took 8580.70ms. Allocated memory was 107.0MB in the beginning and 159.4MB in the end (delta: 52.4MB). Free memory was 72.7MB in the beginning and 83.4MB in the end (delta: -10.7MB). Peak memory consumption was 40.0MB. Max. memory is 16.1GB. [2022-07-23 15:49:23,459 INFO L158 Benchmark]: Witness Printer took 2.11ms. Allocated memory is still 159.4MB. Free memory is still 83.4MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-23 15:49:23,461 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.28ms. Allocated memory is still 88.1MB. Free memory was 57.8MB in the beginning and 57.8MB in the end (delta: 22.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 307.77ms. Allocated memory was 88.1MB in the beginning and 107.0MB in the end (delta: 18.9MB). Free memory was 52.2MB in the beginning and 75.9MB in the end (delta: -23.7MB). Peak memory consumption was 5.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 42.47ms. Allocated memory is still 107.0MB. Free memory was 75.9MB in the beginning and 73.2MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 26.53ms. Allocated memory is still 107.0MB. Free memory was 73.2MB in the beginning and 71.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 601.89ms. Allocated memory is still 107.0MB. Free memory was 71.1MB in the beginning and 72.7MB in the end (delta: -1.5MB). Peak memory consumption was 19.9MB. Max. memory is 16.1GB. * BuchiAutomizer took 8580.70ms. Allocated memory was 107.0MB in the beginning and 159.4MB in the end (delta: 52.4MB). Free memory was 72.7MB in the beginning and 83.4MB in the end (delta: -10.7MB). Peak memory consumption was 40.0MB. Max. memory is 16.1GB. * Witness Printer took 2.11ms. Allocated memory is still 159.4MB. Free memory is still 83.4MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (4 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -2 * i2 + 27 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 8.5s and 5 iterations. TraceHistogramMax:1. Analysis of lassos took 7.9s. Construction of modules took 0.0s. Büchi inclusion checks took 0.4s. 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, 254 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 253 mSDsluCounter, 2095 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1316 mSDsCounter, 55 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 36 IncrementalHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 55 mSolverCounterUnsat, 779 mSDtfsCounter, 36 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI2 SFLT0 conc0 concLT1 SILN0 SILU0 SILI1 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital238 mio100 ax100 hnf100 lsp52 ukn89 mio100 lsp100 div127 bol100 ite100 ukn100 eq195 hnf90 smp87 dnf793 smp65 tf100 neg99 sie101 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 100ms VariablesStem: 0 VariablesLoop: 38 DisjunctsStem: 1 DisjunctsLoop: 6 SupportingInvariants: 0 MotzkinApplications: 12 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 1 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.1s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2022-07-23 15:49:23,491 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-23 15:49:23,709 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