./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_lcr.7.ufo.BOUNDED-14.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 20ed64ec 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.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 a2cec71f78ea0b9e775333096aca7e1d3d48cfa3 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.1-dev-20ed64e [2021-08-27 17:10:13,844 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-27 17:10:13,846 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-27 17:10:13,880 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-27 17:10:13,883 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-27 17:10:13,886 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-27 17:10:13,888 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-27 17:10:13,891 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-27 17:10:13,892 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-27 17:10:13,892 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-27 17:10:13,893 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-27 17:10:13,894 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-27 17:10:13,895 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-27 17:10:13,896 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-27 17:10:13,897 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-27 17:10:13,898 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-27 17:10:13,898 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-27 17:10:13,899 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-27 17:10:13,901 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-27 17:10:13,902 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-27 17:10:13,903 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-27 17:10:13,904 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-27 17:10:13,905 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-27 17:10:13,906 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-27 17:10:13,908 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-27 17:10:13,913 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-27 17:10:13,913 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-27 17:10:13,914 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-27 17:10:13,914 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-27 17:10:13,915 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-27 17:10:13,915 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-27 17:10:13,916 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-27 17:10:13,917 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-27 17:10:13,917 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-27 17:10:13,919 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-27 17:10:13,919 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-27 17:10:13,920 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-27 17:10:13,921 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-27 17:10:13,921 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-27 17:10:13,922 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-27 17:10:13,923 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-27 17:10:13,924 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2021-08-27 17:10:13,956 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-27 17:10:13,956 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-27 17:10:13,957 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-27 17:10:13,957 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-27 17:10:13,959 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-27 17:10:13,959 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-27 17:10:13,959 INFO L138 SettingsManager]: * Use SBE=true [2021-08-27 17:10:13,959 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-08-27 17:10:13,959 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-08-27 17:10:13,960 INFO L138 SettingsManager]: * Use old map elimination=false [2021-08-27 17:10:13,960 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-08-27 17:10:13,961 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-08-27 17:10:13,961 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-08-27 17:10:13,961 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-27 17:10:13,961 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-27 17:10:13,961 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-08-27 17:10:13,962 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-27 17:10:13,962 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-27 17:10:13,962 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-27 17:10:13,962 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-08-27 17:10:13,962 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-08-27 17:10:13,962 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-08-27 17:10:13,963 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-27 17:10:13,963 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-27 17:10:13,963 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-08-27 17:10:13,963 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-27 17:10:13,963 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-08-27 17:10:13,964 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-27 17:10:13,964 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-27 17:10:13,964 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-27 17:10:13,964 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-27 17:10:13,965 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-27 17:10:13,966 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-08-27 17:10:13,966 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 -> a2cec71f78ea0b9e775333096aca7e1d3d48cfa3 [2021-08-27 17:10:14,273 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-27 17:10:14,294 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-27 17:10:14,297 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-27 17:10:14,298 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-27 17:10:14,299 INFO L275 PluginConnector]: CDTParser initialized [2021-08-27 17:10:14,299 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_lcr.7.ufo.BOUNDED-14.pals.c [2021-08-27 17:10:14,360 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dd7417c0c/a60e8532a4494aa1a14b63eaf889705a/FLAG8173f9fd0 [2021-08-27 17:10:14,856 INFO L306 CDTParser]: Found 1 translation units. [2021-08-27 17:10:14,857 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr.7.ufo.BOUNDED-14.pals.c [2021-08-27 17:10:14,879 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dd7417c0c/a60e8532a4494aa1a14b63eaf889705a/FLAG8173f9fd0 [2021-08-27 17:10:15,391 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dd7417c0c/a60e8532a4494aa1a14b63eaf889705a [2021-08-27 17:10:15,392 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-27 17:10:15,394 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-08-27 17:10:15,399 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-27 17:10:15,399 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-27 17:10:15,402 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-27 17:10:15,403 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 05:10:15" (1/1) ... [2021-08-27 17:10:15,403 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f5adf5c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:10:15, skipping insertion in model container [2021-08-27 17:10:15,404 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 05:10:15" (1/1) ... [2021-08-27 17:10:15,415 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-27 17:10:15,453 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-27 17:10:15,688 WARN L228 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.ufo.BOUNDED-14.pals.c[20150,20163] [2021-08-27 17:10:15,691 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-27 17:10:15,731 INFO L203 MainTranslator]: Completed pre-run [2021-08-27 17:10:15,828 WARN L228 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.ufo.BOUNDED-14.pals.c[20150,20163] [2021-08-27 17:10:15,829 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-27 17:10:15,850 INFO L208 MainTranslator]: Completed translation [2021-08-27 17:10:15,850 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:10:15 WrapperNode [2021-08-27 17:10:15,851 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-27 17:10:15,852 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-27 17:10:15,852 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-27 17:10:15,852 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-27 17:10:15,858 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:10:15" (1/1) ... [2021-08-27 17:10:15,881 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:10:15" (1/1) ... [2021-08-27 17:10:15,925 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-27 17:10:15,933 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-27 17:10:15,934 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-27 17:10:15,934 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-27 17:10:15,940 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:10:15" (1/1) ... [2021-08-27 17:10:15,941 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:10:15" (1/1) ... [2021-08-27 17:10:15,948 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:10:15" (1/1) ... [2021-08-27 17:10:15,949 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:10:15" (1/1) ... [2021-08-27 17:10:15,959 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:10:15" (1/1) ... [2021-08-27 17:10:15,975 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:10:15" (1/1) ... [2021-08-27 17:10:15,987 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:10:15" (1/1) ... [2021-08-27 17:10:15,990 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-27 17:10:15,991 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-27 17:10:15,991 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-27 17:10:15,991 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-27 17:10:15,992 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:10:15" (1/1) ... [2021-08-27 17:10:16,002 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:10:16,008 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:10:16,026 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) [2021-08-27 17:10:16,052 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 [2021-08-27 17:10:16,076 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-27 17:10:16,076 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-08-27 17:10:16,076 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-27 17:10:16,077 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-27 17:10:16,858 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-27 17:10:16,859 INFO L299 CfgBuilder]: Removed 27 assume(true) statements. [2021-08-27 17:10:16,860 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 05:10:16 BoogieIcfgContainer [2021-08-27 17:10:16,860 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-27 17:10:16,861 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-08-27 17:10:16,861 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-08-27 17:10:16,864 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-08-27 17:10:16,864 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-08-27 17:10:16,865 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 27.08 05:10:15" (1/3) ... [2021-08-27 17:10:16,865 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@69c4f0ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 27.08 05:10:16, skipping insertion in model container [2021-08-27 17:10:16,866 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-08-27 17:10:16,866 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 05:10:15" (2/3) ... [2021-08-27 17:10:16,866 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@69c4f0ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 27.08 05:10:16, skipping insertion in model container [2021-08-27 17:10:16,866 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-08-27 17:10:16,866 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 05:10:16" (3/3) ... [2021-08-27 17:10:16,867 INFO L389 chiAutomizerObserver]: Analyzing ICFG pals_lcr.7.ufo.BOUNDED-14.pals.c [2021-08-27 17:10:16,929 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-08-27 17:10:16,930 INFO L360 BuchiCegarLoop]: Hoare is false [2021-08-27 17:10:16,930 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-08-27 17:10:16,930 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-08-27 17:10:16,930 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-08-27 17:10:16,930 INFO L364 BuchiCegarLoop]: Difference is false [2021-08-27 17:10:16,930 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-08-27 17:10:16,930 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-08-27 17:10:16,942 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) [2021-08-27 17:10:16,963 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 67 [2021-08-27 17:10:16,964 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 17:10:16,964 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 17:10:16,974 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2021-08-27 17:10:16,974 INFO L843 BuchiCegarLoop]: 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] [2021-08-27 17:10:16,974 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-08-27 17:10:16,975 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) [2021-08-27 17:10:16,983 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 67 [2021-08-27 17:10:16,986 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 17:10:16,986 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 17:10:16,989 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2021-08-27 17:10:16,989 INFO L843 BuchiCegarLoop]: 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] [2021-08-27 17:10:17,001 INFO L791 eck$LassoCheckResult]: Stem: 119#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(33);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~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;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[5 := #funAddr~node6.base], ~nodes~0.offset[5 := #funAddr~node6.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[6 := #funAddr~node7.base], ~nodes~0.offset[6 := #funAddr~node7.offset]; 41#L-1true havoc main_#res;havoc main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~nondet29, main_#t~nondet30, main_#t~nondet31, main_#t~nondet32, main_#t~nondet33, main_#t~nondet34, main_#t~nondet35, main_#t~nondet36, main_#t~nondet37, main_#t~nondet38, main_#t~nondet39, main_#t~nondet40, main_#t~nondet41, main_#t~nondet42, main_#t~ret43, main_#t~ret44, main_#t~post45, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet14;havoc main_#t~nondet14;~id1~0 := main_#t~nondet15;havoc main_#t~nondet15;~st1~0 := main_#t~nondet16;havoc main_#t~nondet16;~send1~0 := main_#t~nondet17;havoc main_#t~nondet17;~mode1~0 := main_#t~nondet18;havoc main_#t~nondet18;~id2~0 := main_#t~nondet19;havoc main_#t~nondet19;~st2~0 := main_#t~nondet20;havoc main_#t~nondet20;~send2~0 := main_#t~nondet21;havoc main_#t~nondet21;~mode2~0 := main_#t~nondet22;havoc main_#t~nondet22;~id3~0 := main_#t~nondet23;havoc main_#t~nondet23;~st3~0 := main_#t~nondet24;havoc main_#t~nondet24;~send3~0 := main_#t~nondet25;havoc main_#t~nondet25;~mode3~0 := main_#t~nondet26;havoc main_#t~nondet26;~id4~0 := main_#t~nondet27;havoc main_#t~nondet27;~st4~0 := main_#t~nondet28;havoc main_#t~nondet28;~send4~0 := main_#t~nondet29;havoc main_#t~nondet29;~mode4~0 := main_#t~nondet30;havoc main_#t~nondet30;~id5~0 := main_#t~nondet31;havoc main_#t~nondet31;~st5~0 := main_#t~nondet32;havoc main_#t~nondet32;~send5~0 := main_#t~nondet33;havoc main_#t~nondet33;~mode5~0 := main_#t~nondet34;havoc main_#t~nondet34;~id6~0 := main_#t~nondet35;havoc main_#t~nondet35;~st6~0 := main_#t~nondet36;havoc main_#t~nondet36;~send6~0 := main_#t~nondet37;havoc main_#t~nondet37;~mode6~0 := main_#t~nondet38;havoc main_#t~nondet38;~id7~0 := main_#t~nondet39;havoc main_#t~nondet39;~st7~0 := main_#t~nondet40;havoc main_#t~nondet40;~send7~0 := main_#t~nondet41;havoc main_#t~nondet41;~mode7~0 := main_#t~nondet42;havoc main_#t~nondet42;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 59#L262true assume !(0 == ~r1~0);init_~tmp~0 := 0; 28#L262-1true init_#res := init_~tmp~0; 42#L463true main_#t~ret43 := init_#res;main_~i2~0 := main_#t~ret43;havoc main_#t~ret43;assume_abort_if_not_#in~cond := main_~i2~0;havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; 45#L22true assume !(0 == assume_abort_if_not_~cond); 102#L21true ~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 := 0; 53#L547-2true [2021-08-27 17:10:17,008 INFO L793 eck$LassoCheckResult]: Loop: 53#L547-2true assume !!(main_~i2~0 < 14);havoc node1_#t~ite7, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 39#L85true assume !(0 != ~mode1~0 % 256); 111#L99true assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite7 := ~send1~0; 114#L99-2true ~p1_new~0 := (if node1_#t~ite7 % 256 <= 127 then node1_#t~ite7 % 256 else node1_#t~ite7 % 256 - 256);havoc node1_#t~ite7;~mode1~0 := 1; 6#L85-2true havoc node2_#t~ite8, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 21#L111true assume !(0 != ~mode2~0 % 256); 84#L124true assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite8 := ~send2~0; 69#L124-2true ~p2_new~0 := (if node2_#t~ite8 % 256 <= 127 then node2_#t~ite8 % 256 else node2_#t~ite8 % 256 - 256);havoc node2_#t~ite8;~mode2~0 := 1; 103#L111-2true havoc node3_#t~ite9, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 20#L136true assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 31#L139true assume !(node3_~m3~0 != ~nomsg~0); 12#L139-1true ~mode3~0 := 0; 33#L136-2true havoc node4_#t~ite10, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; 18#L161true assume !(0 != ~mode4~0 % 256); 124#L174true assume !(~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0);node4_#t~ite10 := ~p4_new~0; 113#L174-2true ~p4_new~0 := (if node4_#t~ite10 % 256 <= 127 then node4_#t~ite10 % 256 else node4_#t~ite10 % 256 - 256);havoc node4_#t~ite10;~mode4~0 := 1; 9#L161-2true havoc node5_#t~ite11, node5_~m5~0;havoc node5_~m5~0;node5_~m5~0 := ~nomsg~0; 70#L186true assume !(0 != ~mode5~0 % 256); 52#L199true assume !(~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0);node5_#t~ite11 := ~p5_new~0; 110#L199-2true ~p5_new~0 := (if node5_#t~ite11 % 256 <= 127 then node5_#t~ite11 % 256 else node5_#t~ite11 % 256 - 256);havoc node5_#t~ite11;~mode5~0 := 1; 13#L186-2true havoc node6_#t~ite12, node6_~m6~0;havoc node6_~m6~0;node6_~m6~0 := ~nomsg~0; 108#L211true assume !(0 != ~mode6~0 % 256); 83#L224true assume ~send6~0 != ~nomsg~0 && ~p6_new~0 == ~nomsg~0;node6_#t~ite12 := ~send6~0; 105#L224-2true ~p6_new~0 := (if node6_#t~ite12 % 256 <= 127 then node6_#t~ite12 % 256 else node6_#t~ite12 % 256 - 256);havoc node6_#t~ite12;~mode6~0 := 1; 89#L211-2true havoc node7_#t~ite13, node7_~m7~0;havoc node7_~m7~0;node7_~m7~0 := ~nomsg~0; 63#L236true assume 0 != ~mode7~0 % 256;node7_~m7~0 := ~p6_old~0;~p6_old~0 := ~nomsg~0; 30#L239true assume !(node7_~m7~0 != ~nomsg~0); 22#L239-1true ~mode7~0 := 0; 61#L236-2true ~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;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 27#L471true assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 <= 1);check_~tmp~1 := 0; 109#L471-1true check_#res := check_~tmp~1; 7#L491true main_#t~ret44 := check_#res;main_~c1~0 := main_#t~ret44;havoc main_#t~ret44;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 100#L583true assume !(0 == assert_~arg % 256); 48#L578true main_#t~post45 := main_~i2~0;main_~i2~0 := 1 + main_#t~post45;havoc main_#t~post45; 53#L547-2true [2021-08-27 17:10:17,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:10:17,017 INFO L82 PathProgramCache]: Analyzing trace with hash 2087378158, now seen corresponding path program 1 times [2021-08-27 17:10:17,024 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:10:17,026 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499826834] [2021-08-27 17:10:17,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:10:17,027 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:10:17,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 17:10:17,250 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 17:10:17,251 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 17:10:17,251 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499826834] [2021-08-27 17:10:17,252 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1499826834] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 17:10:17,253 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 17:10:17,253 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-27 17:10:17,255 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105440281] [2021-08-27 17:10:17,271 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-27 17:10:17,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:10:17,274 INFO L82 PathProgramCache]: Analyzing trace with hash 318495630, now seen corresponding path program 1 times [2021-08-27 17:10:17,274 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:10:17,274 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782087432] [2021-08-27 17:10:17,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:10:17,275 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:10:17,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 17:10:17,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 17:10:17,490 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 17:10:17,491 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782087432] [2021-08-27 17:10:17,492 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1782087432] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 17:10:17,492 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 17:10:17,492 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-27 17:10:17,492 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756839738] [2021-08-27 17:10:17,494 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-27 17:10:17,495 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 17:10:17,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-27 17:10:17,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-27 17:10:17,510 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) [2021-08-27 17:10:17,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 17:10:17,701 INFO L93 Difference]: Finished difference Result 130 states and 219 transitions. [2021-08-27 17:10:17,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-27 17:10:17,704 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 130 states and 219 transitions. [2021-08-27 17:10:17,718 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 66 [2021-08-27 17:10:17,724 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 130 states to 122 states and 162 transitions. [2021-08-27 17:10:17,725 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 122 [2021-08-27 17:10:17,726 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 122 [2021-08-27 17:10:17,727 INFO L73 IsDeterministic]: Start isDeterministic. Operand 122 states and 162 transitions. [2021-08-27 17:10:17,728 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 17:10:17,728 INFO L681 BuchiCegarLoop]: Abstraction has 122 states and 162 transitions. [2021-08-27 17:10:17,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states and 162 transitions. [2021-08-27 17:10:17,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2021-08-27 17:10:17,759 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) [2021-08-27 17:10:17,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 162 transitions. [2021-08-27 17:10:17,760 INFO L704 BuchiCegarLoop]: Abstraction has 122 states and 162 transitions. [2021-08-27 17:10:17,760 INFO L587 BuchiCegarLoop]: Abstraction has 122 states and 162 transitions. [2021-08-27 17:10:17,761 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-08-27 17:10:17,761 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 122 states and 162 transitions. [2021-08-27 17:10:17,763 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 66 [2021-08-27 17:10:17,763 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 17:10:17,763 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 17:10:17,767 INFO L842 BuchiCegarLoop]: 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] [2021-08-27 17:10:17,767 INFO L843 BuchiCegarLoop]: 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] [2021-08-27 17:10:17,769 INFO L791 eck$LassoCheckResult]: Stem: 394#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(33);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~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;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[5 := #funAddr~node6.base], ~nodes~0.offset[5 := #funAddr~node6.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[6 := #funAddr~node7.base], ~nodes~0.offset[6 := #funAddr~node7.offset]; 339#L-1 havoc main_#res;havoc main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~nondet29, main_#t~nondet30, main_#t~nondet31, main_#t~nondet32, main_#t~nondet33, main_#t~nondet34, main_#t~nondet35, main_#t~nondet36, main_#t~nondet37, main_#t~nondet38, main_#t~nondet39, main_#t~nondet40, main_#t~nondet41, main_#t~nondet42, main_#t~ret43, main_#t~ret44, main_#t~post45, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet14;havoc main_#t~nondet14;~id1~0 := main_#t~nondet15;havoc main_#t~nondet15;~st1~0 := main_#t~nondet16;havoc main_#t~nondet16;~send1~0 := main_#t~nondet17;havoc main_#t~nondet17;~mode1~0 := main_#t~nondet18;havoc main_#t~nondet18;~id2~0 := main_#t~nondet19;havoc main_#t~nondet19;~st2~0 := main_#t~nondet20;havoc main_#t~nondet20;~send2~0 := main_#t~nondet21;havoc main_#t~nondet21;~mode2~0 := main_#t~nondet22;havoc main_#t~nondet22;~id3~0 := main_#t~nondet23;havoc main_#t~nondet23;~st3~0 := main_#t~nondet24;havoc main_#t~nondet24;~send3~0 := main_#t~nondet25;havoc main_#t~nondet25;~mode3~0 := main_#t~nondet26;havoc main_#t~nondet26;~id4~0 := main_#t~nondet27;havoc main_#t~nondet27;~st4~0 := main_#t~nondet28;havoc main_#t~nondet28;~send4~0 := main_#t~nondet29;havoc main_#t~nondet29;~mode4~0 := main_#t~nondet30;havoc main_#t~nondet30;~id5~0 := main_#t~nondet31;havoc main_#t~nondet31;~st5~0 := main_#t~nondet32;havoc main_#t~nondet32;~send5~0 := main_#t~nondet33;havoc main_#t~nondet33;~mode5~0 := main_#t~nondet34;havoc main_#t~nondet34;~id6~0 := main_#t~nondet35;havoc main_#t~nondet35;~st6~0 := main_#t~nondet36;havoc main_#t~nondet36;~send6~0 := main_#t~nondet37;havoc main_#t~nondet37;~mode6~0 := main_#t~nondet38;havoc main_#t~nondet38;~id7~0 := main_#t~nondet39;havoc main_#t~nondet39;~st7~0 := main_#t~nondet40;havoc main_#t~nondet40;~send7~0 := main_#t~nondet41;havoc main_#t~nondet41;~mode7~0 := main_#t~nondet42;havoc main_#t~nondet42;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 340#L262 assume 0 == ~r1~0; 359#L263 assume ~id1~0 >= 0; 364#L264 assume 0 == ~st1~0; 365#L265 assume ~send1~0 == ~id1~0; 299#L266 assume 0 == ~mode1~0 % 256; 300#L267 assume ~id2~0 >= 0; 313#L268 assume 0 == ~st2~0; 314#L269 assume ~send2~0 == ~id2~0; 295#L270 assume 0 == ~mode2~0 % 256; 296#L271 assume ~id3~0 >= 0; 328#L272 assume 0 == ~st3~0; 347#L273 assume ~send3~0 == ~id3~0; 362#L274 assume 0 == ~mode3~0 % 256; 386#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; 355#L279 assume ~id5~0 >= 0; 356#L280 assume 0 == ~st5~0; 305#L281 assume ~send5~0 == ~id5~0; 277#L282 assume 0 == ~mode5~0 % 256; 278#L283 assume ~id6~0 >= 0; 366#L284 assume 0 == ~st6~0; 367#L285 assume ~send6~0 == ~id6~0; 385#L286 assume 0 == ~mode6~0 % 256; 373#L287 assume ~id7~0 >= 0; 323#L288 assume 0 == ~st7~0; 324#L289 assume ~send7~0 == ~id7~0; 332#L290 assume 0 == ~mode7~0 % 256; 378#L291 assume ~id1~0 != ~id2~0; 379#L292 assume ~id1~0 != ~id3~0; 387#L293 assume ~id1~0 != ~id4~0; 393#L294 assume ~id1~0 != ~id5~0; 287#L295 assume ~id1~0 != ~id6~0; 288#L296 assume ~id1~0 != ~id7~0; 329#L297 assume ~id2~0 != ~id3~0; 326#L298 assume ~id2~0 != ~id4~0; 327#L299 assume ~id2~0 != ~id5~0; 338#L300 assume ~id2~0 != ~id6~0; 374#L301 assume ~id2~0 != ~id7~0; 383#L302 assume ~id3~0 != ~id4~0; 384#L303 assume ~id3~0 != ~id5~0; 389#L304 assume ~id3~0 != ~id6~0; 368#L305 assume ~id3~0 != ~id7~0; 369#L306 assume ~id4~0 != ~id5~0; 377#L307 assume ~id4~0 != ~id6~0; 297#L308 assume ~id4~0 != ~id7~0; 298#L309 assume ~id5~0 != ~id6~0; 376#L310 assume ~id5~0 != ~id7~0; 350#L311 assume ~id6~0 != ~id7~0;init_~tmp~0 := 1; 320#L262-1 init_#res := init_~tmp~0; 321#L463 main_#t~ret43 := init_#res;main_~i2~0 := main_#t~ret43;havoc main_#t~ret43;assume_abort_if_not_#in~cond := main_~i2~0;havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; 341#L22 assume !(0 == assume_abort_if_not_~cond); 346#L21 ~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 := 0; 349#L547-2 [2021-08-27 17:10:17,769 INFO L793 eck$LassoCheckResult]: Loop: 349#L547-2 assume !!(main_~i2~0 < 14);havoc node1_#t~ite7, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 335#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 := ~p7_old~0;~p7_old~0 := ~nomsg~0; 336#L89 assume !(node1_~m1~0 != ~nomsg~0); 334#L89-1 ~mode1~0 := 0; 281#L85-2 havoc node2_#t~ite8, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 282#L111 assume 0 != ~mode2~0 % 256;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 311#L114 assume !(node2_~m2~0 != ~nomsg~0); 353#L114-1 ~mode2~0 := 0; 371#L111-2 havoc node3_#t~ite9, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 306#L136 assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 307#L139 assume !(node3_~m3~0 != ~nomsg~0); 291#L139-1 ~mode3~0 := 0; 292#L136-2 havoc node4_#t~ite10, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; 302#L161 assume !(0 != ~mode4~0 % 256); 304#L174 assume !(~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0);node4_#t~ite10 := ~p4_new~0; 392#L174-2 ~p4_new~0 := (if node4_#t~ite10 % 256 <= 127 then node4_#t~ite10 % 256 else node4_#t~ite10 % 256 - 256);havoc node4_#t~ite10;~mode4~0 := 1; 283#L161-2 havoc node5_#t~ite11, node5_~m5~0;havoc node5_~m5~0;node5_~m5~0 := ~nomsg~0; 284#L186 assume 0 != ~mode5~0 % 256;node5_~m5~0 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 372#L189 assume !(node5_~m5~0 != ~nomsg~0); 344#L189-1 ~mode5~0 := 0; 293#L186-2 havoc node6_#t~ite12, node6_~m6~0;havoc node6_~m6~0;node6_~m6~0 := ~nomsg~0; 294#L211 assume 0 != ~mode6~0 % 256;node6_~m6~0 := ~p5_old~0;~p5_old~0 := ~nomsg~0; 390#L214 assume !(node6_~m6~0 != ~nomsg~0); 343#L214-1 ~mode6~0 := 0; 382#L211-2 havoc node7_#t~ite13, node7_~m7~0;havoc node7_~m7~0;node7_~m7~0 := ~nomsg~0; 361#L236 assume !(0 != ~mode7~0 % 256); 289#L249 assume ~send7~0 != ~nomsg~0 && ~p7_new~0 == ~nomsg~0;node7_#t~ite13 := ~send7~0; 290#L249-2 ~p7_new~0 := (if node7_#t~ite13 % 256 <= 127 then node7_#t~ite13 % 256 else node7_#t~ite13 % 256 - 256);havoc node7_#t~ite13;~mode7~0 := 1; 310#L236-2 ~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;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 317#L471 assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 <= 1);check_~tmp~1 := 0; 318#L471-1 check_#res := check_~tmp~1; 279#L491 main_#t~ret44 := check_#res;main_~c1~0 := main_#t~ret44;havoc main_#t~ret44;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 280#L583 assume !(0 == assert_~arg % 256); 348#L578 main_#t~post45 := main_~i2~0;main_~i2~0 := 1 + main_#t~post45;havoc main_#t~post45; 349#L547-2 [2021-08-27 17:10:17,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:10:17,772 INFO L82 PathProgramCache]: Analyzing trace with hash 292839954, now seen corresponding path program 1 times [2021-08-27 17:10:17,772 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:10:17,773 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743468676] [2021-08-27 17:10:17,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:10:17,773 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:10:17,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:10:17,857 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 17:10:17,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:10:17,920 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 17:10:17,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:10:17,921 INFO L82 PathProgramCache]: Analyzing trace with hash -987003026, now seen corresponding path program 1 times [2021-08-27 17:10:17,922 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:10:17,922 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357883226] [2021-08-27 17:10:17,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:10:17,922 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:10:17,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 17:10:18,052 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 17:10:18,053 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 17:10:18,053 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357883226] [2021-08-27 17:10:18,054 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [357883226] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 17:10:18,055 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 17:10:18,055 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-27 17:10:18,055 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327632254] [2021-08-27 17:10:18,059 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-27 17:10:18,060 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 17:10:18,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-27 17:10:18,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-27 17:10:18,061 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) [2021-08-27 17:10:18,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 17:10:18,148 INFO L93 Difference]: Finished difference Result 125 states and 164 transitions. [2021-08-27 17:10:18,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-27 17:10:18,149 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 125 states and 164 transitions. [2021-08-27 17:10:18,152 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 66 [2021-08-27 17:10:18,154 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 125 states to 122 states and 159 transitions. [2021-08-27 17:10:18,154 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 122 [2021-08-27 17:10:18,154 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 122 [2021-08-27 17:10:18,154 INFO L73 IsDeterministic]: Start isDeterministic. Operand 122 states and 159 transitions. [2021-08-27 17:10:18,156 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 17:10:18,156 INFO L681 BuchiCegarLoop]: Abstraction has 122 states and 159 transitions. [2021-08-27 17:10:18,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states and 159 transitions. [2021-08-27 17:10:18,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2021-08-27 17:10:18,164 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) [2021-08-27 17:10:18,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 159 transitions. [2021-08-27 17:10:18,165 INFO L704 BuchiCegarLoop]: Abstraction has 122 states and 159 transitions. [2021-08-27 17:10:18,165 INFO L587 BuchiCegarLoop]: Abstraction has 122 states and 159 transitions. [2021-08-27 17:10:18,165 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-08-27 17:10:18,165 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 122 states and 159 transitions. [2021-08-27 17:10:18,166 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 66 [2021-08-27 17:10:18,166 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 17:10:18,166 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 17:10:18,167 INFO L842 BuchiCegarLoop]: 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] [2021-08-27 17:10:18,167 INFO L843 BuchiCegarLoop]: 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] [2021-08-27 17:10:18,168 INFO L791 eck$LassoCheckResult]: Stem: 653#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(33);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~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;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[5 := #funAddr~node6.base], ~nodes~0.offset[5 := #funAddr~node6.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[6 := #funAddr~node7.base], ~nodes~0.offset[6 := #funAddr~node7.offset]; 597#L-1 havoc main_#res;havoc main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~nondet29, main_#t~nondet30, main_#t~nondet31, main_#t~nondet32, main_#t~nondet33, main_#t~nondet34, main_#t~nondet35, main_#t~nondet36, main_#t~nondet37, main_#t~nondet38, main_#t~nondet39, main_#t~nondet40, main_#t~nondet41, main_#t~nondet42, main_#t~ret43, main_#t~ret44, main_#t~post45, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet14;havoc main_#t~nondet14;~id1~0 := main_#t~nondet15;havoc main_#t~nondet15;~st1~0 := main_#t~nondet16;havoc main_#t~nondet16;~send1~0 := main_#t~nondet17;havoc main_#t~nondet17;~mode1~0 := main_#t~nondet18;havoc main_#t~nondet18;~id2~0 := main_#t~nondet19;havoc main_#t~nondet19;~st2~0 := main_#t~nondet20;havoc main_#t~nondet20;~send2~0 := main_#t~nondet21;havoc main_#t~nondet21;~mode2~0 := main_#t~nondet22;havoc main_#t~nondet22;~id3~0 := main_#t~nondet23;havoc main_#t~nondet23;~st3~0 := main_#t~nondet24;havoc main_#t~nondet24;~send3~0 := main_#t~nondet25;havoc main_#t~nondet25;~mode3~0 := main_#t~nondet26;havoc main_#t~nondet26;~id4~0 := main_#t~nondet27;havoc main_#t~nondet27;~st4~0 := main_#t~nondet28;havoc main_#t~nondet28;~send4~0 := main_#t~nondet29;havoc main_#t~nondet29;~mode4~0 := main_#t~nondet30;havoc main_#t~nondet30;~id5~0 := main_#t~nondet31;havoc main_#t~nondet31;~st5~0 := main_#t~nondet32;havoc main_#t~nondet32;~send5~0 := main_#t~nondet33;havoc main_#t~nondet33;~mode5~0 := main_#t~nondet34;havoc main_#t~nondet34;~id6~0 := main_#t~nondet35;havoc main_#t~nondet35;~st6~0 := main_#t~nondet36;havoc main_#t~nondet36;~send6~0 := main_#t~nondet37;havoc main_#t~nondet37;~mode6~0 := main_#t~nondet38;havoc main_#t~nondet38;~id7~0 := main_#t~nondet39;havoc main_#t~nondet39;~st7~0 := main_#t~nondet40;havoc main_#t~nondet40;~send7~0 := main_#t~nondet41;havoc main_#t~nondet41;~mode7~0 := main_#t~nondet42;havoc main_#t~nondet42;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 598#L262 assume 0 == ~r1~0; 618#L263 assume ~id1~0 >= 0; 623#L264 assume 0 == ~st1~0; 624#L265 assume ~send1~0 == ~id1~0; 558#L266 assume 0 == ~mode1~0 % 256; 559#L267 assume ~id2~0 >= 0; 572#L268 assume 0 == ~st2~0; 573#L269 assume ~send2~0 == ~id2~0; 554#L270 assume 0 == ~mode2~0 % 256; 555#L271 assume ~id3~0 >= 0; 586#L272 assume 0 == ~st3~0; 606#L273 assume ~send3~0 == ~id3~0; 620#L274 assume 0 == ~mode3~0 % 256; 645#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; 614#L279 assume ~id5~0 >= 0; 615#L280 assume 0 == ~st5~0; 564#L281 assume ~send5~0 == ~id5~0; 536#L282 assume 0 == ~mode5~0 % 256; 537#L283 assume ~id6~0 >= 0; 625#L284 assume 0 == ~st6~0; 626#L285 assume ~send6~0 == ~id6~0; 644#L286 assume 0 == ~mode6~0 % 256; 632#L287 assume ~id7~0 >= 0; 580#L288 assume 0 == ~st7~0; 581#L289 assume ~send7~0 == ~id7~0; 590#L290 assume 0 == ~mode7~0 % 256; 637#L291 assume ~id1~0 != ~id2~0; 638#L292 assume ~id1~0 != ~id3~0; 646#L293 assume ~id1~0 != ~id4~0; 652#L294 assume ~id1~0 != ~id5~0; 546#L295 assume ~id1~0 != ~id6~0; 547#L296 assume ~id1~0 != ~id7~0; 587#L297 assume ~id2~0 != ~id3~0; 584#L298 assume ~id2~0 != ~id4~0; 585#L299 assume ~id2~0 != ~id5~0; 596#L300 assume ~id2~0 != ~id6~0; 633#L301 assume ~id2~0 != ~id7~0; 642#L302 assume ~id3~0 != ~id4~0; 643#L303 assume ~id3~0 != ~id5~0; 648#L304 assume ~id3~0 != ~id6~0; 627#L305 assume ~id3~0 != ~id7~0; 628#L306 assume ~id4~0 != ~id5~0; 636#L307 assume ~id4~0 != ~id6~0; 556#L308 assume ~id4~0 != ~id7~0; 557#L309 assume ~id5~0 != ~id6~0; 635#L310 assume ~id5~0 != ~id7~0; 609#L311 assume ~id6~0 != ~id7~0;init_~tmp~0 := 1; 578#L262-1 init_#res := init_~tmp~0; 579#L463 main_#t~ret43 := init_#res;main_~i2~0 := main_#t~ret43;havoc main_#t~ret43;assume_abort_if_not_#in~cond := main_~i2~0;havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; 599#L22 assume !(0 == assume_abort_if_not_~cond); 605#L21 ~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 := 0; 608#L547-2 [2021-08-27 17:10:18,168 INFO L793 eck$LassoCheckResult]: Loop: 608#L547-2 assume !!(main_~i2~0 < 14);havoc node1_#t~ite7, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 593#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 := ~p7_old~0;~p7_old~0 := ~nomsg~0; 594#L89 assume !(node1_~m1~0 != ~nomsg~0); 592#L89-1 ~mode1~0 := 0; 540#L85-2 havoc node2_#t~ite8, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 541#L111 assume 0 != ~mode2~0 % 256;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 570#L114 assume !(node2_~m2~0 != ~nomsg~0); 612#L114-1 ~mode2~0 := 0; 630#L111-2 havoc node3_#t~ite9, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 565#L136 assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 566#L139 assume !(node3_~m3~0 != ~nomsg~0); 550#L139-1 ~mode3~0 := 0; 551#L136-2 havoc node4_#t~ite10, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; 561#L161 assume 0 != ~mode4~0 % 256;node4_~m4~0 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 562#L164 assume !(node4_~m4~0 != ~nomsg~0); 545#L164-1 ~mode4~0 := 0; 542#L161-2 havoc node5_#t~ite11, node5_~m5~0;havoc node5_~m5~0;node5_~m5~0 := ~nomsg~0; 543#L186 assume !(0 != ~mode5~0 % 256); 610#L199 assume !(~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0);node5_#t~ite11 := ~p5_new~0; 611#L199-2 ~p5_new~0 := (if node5_#t~ite11 % 256 <= 127 then node5_#t~ite11 % 256 else node5_#t~ite11 % 256 - 256);havoc node5_#t~ite11;~mode5~0 := 1; 552#L186-2 havoc node6_#t~ite12, node6_~m6~0;havoc node6_~m6~0;node6_~m6~0 := ~nomsg~0; 553#L211 assume 0 != ~mode6~0 % 256;node6_~m6~0 := ~p5_old~0;~p5_old~0 := ~nomsg~0; 649#L214 assume !(node6_~m6~0 != ~nomsg~0); 601#L214-1 ~mode6~0 := 0; 641#L211-2 havoc node7_#t~ite13, node7_~m7~0;havoc node7_~m7~0;node7_~m7~0 := ~nomsg~0; 621#L236 assume !(0 != ~mode7~0 % 256); 548#L249 assume ~send7~0 != ~nomsg~0 && ~p7_new~0 == ~nomsg~0;node7_#t~ite13 := ~send7~0; 549#L249-2 ~p7_new~0 := (if node7_#t~ite13 % 256 <= 127 then node7_#t~ite13 % 256 else node7_#t~ite13 % 256 - 256);havoc node7_#t~ite13;~mode7~0 := 1; 569#L236-2 ~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;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 576#L471 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 <= 1; 577#L472 assume ~r1~0 >= 7; 589#L476 assume ~r1~0 < 7;check_~tmp~1 := 1; 603#L471-1 check_#res := check_~tmp~1; 538#L491 main_#t~ret44 := check_#res;main_~c1~0 := main_#t~ret44;havoc main_#t~ret44;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 539#L583 assume !(0 == assert_~arg % 256); 607#L578 main_#t~post45 := main_~i2~0;main_~i2~0 := 1 + main_#t~post45;havoc main_#t~post45; 608#L547-2 [2021-08-27 17:10:18,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:10:18,169 INFO L82 PathProgramCache]: Analyzing trace with hash 292839954, now seen corresponding path program 2 times [2021-08-27 17:10:18,169 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:10:18,169 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048643989] [2021-08-27 17:10:18,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:10:18,169 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:10:18,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:10:18,191 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 17:10:18,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:10:18,229 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 17:10:18,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:10:18,229 INFO L82 PathProgramCache]: Analyzing trace with hash -1401354530, now seen corresponding path program 1 times [2021-08-27 17:10:18,230 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:10:18,230 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100988385] [2021-08-27 17:10:18,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:10:18,230 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:10:18,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 17:10:18,260 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 17:10:18,261 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 17:10:18,261 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100988385] [2021-08-27 17:10:18,261 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2100988385] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 17:10:18,261 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 17:10:18,261 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-27 17:10:18,262 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388513294] [2021-08-27 17:10:18,262 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-27 17:10:18,262 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 17:10:18,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-27 17:10:18,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 17:10:18,263 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) [2021-08-27 17:10:18,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 17:10:18,289 INFO L93 Difference]: Finished difference Result 182 states and 251 transitions. [2021-08-27 17:10:18,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-27 17:10:18,290 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 182 states and 251 transitions. [2021-08-27 17:10:18,292 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 126 [2021-08-27 17:10:18,293 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 182 states to 182 states and 251 transitions. [2021-08-27 17:10:18,293 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 182 [2021-08-27 17:10:18,294 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 182 [2021-08-27 17:10:18,294 INFO L73 IsDeterministic]: Start isDeterministic. Operand 182 states and 251 transitions. [2021-08-27 17:10:18,295 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 17:10:18,295 INFO L681 BuchiCegarLoop]: Abstraction has 182 states and 251 transitions. [2021-08-27 17:10:18,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states and 251 transitions. [2021-08-27 17:10:18,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 182. [2021-08-27 17:10:18,304 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) [2021-08-27 17:10:18,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 251 transitions. [2021-08-27 17:10:18,304 INFO L704 BuchiCegarLoop]: Abstraction has 182 states and 251 transitions. [2021-08-27 17:10:18,305 INFO L587 BuchiCegarLoop]: Abstraction has 182 states and 251 transitions. [2021-08-27 17:10:18,305 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-08-27 17:10:18,305 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 182 states and 251 transitions. [2021-08-27 17:10:18,306 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 126 [2021-08-27 17:10:18,306 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 17:10:18,306 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 17:10:18,308 INFO L842 BuchiCegarLoop]: 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] [2021-08-27 17:10:18,308 INFO L843 BuchiCegarLoop]: 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] [2021-08-27 17:10:18,308 INFO L791 eck$LassoCheckResult]: Stem: 966#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(33);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~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;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[5 := #funAddr~node6.base], ~nodes~0.offset[5 := #funAddr~node6.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[6 := #funAddr~node7.base], ~nodes~0.offset[6 := #funAddr~node7.offset]; 906#L-1 havoc main_#res;havoc main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~nondet29, main_#t~nondet30, main_#t~nondet31, main_#t~nondet32, main_#t~nondet33, main_#t~nondet34, main_#t~nondet35, main_#t~nondet36, main_#t~nondet37, main_#t~nondet38, main_#t~nondet39, main_#t~nondet40, main_#t~nondet41, main_#t~nondet42, main_#t~ret43, main_#t~ret44, main_#t~post45, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet14;havoc main_#t~nondet14;~id1~0 := main_#t~nondet15;havoc main_#t~nondet15;~st1~0 := main_#t~nondet16;havoc main_#t~nondet16;~send1~0 := main_#t~nondet17;havoc main_#t~nondet17;~mode1~0 := main_#t~nondet18;havoc main_#t~nondet18;~id2~0 := main_#t~nondet19;havoc main_#t~nondet19;~st2~0 := main_#t~nondet20;havoc main_#t~nondet20;~send2~0 := main_#t~nondet21;havoc main_#t~nondet21;~mode2~0 := main_#t~nondet22;havoc main_#t~nondet22;~id3~0 := main_#t~nondet23;havoc main_#t~nondet23;~st3~0 := main_#t~nondet24;havoc main_#t~nondet24;~send3~0 := main_#t~nondet25;havoc main_#t~nondet25;~mode3~0 := main_#t~nondet26;havoc main_#t~nondet26;~id4~0 := main_#t~nondet27;havoc main_#t~nondet27;~st4~0 := main_#t~nondet28;havoc main_#t~nondet28;~send4~0 := main_#t~nondet29;havoc main_#t~nondet29;~mode4~0 := main_#t~nondet30;havoc main_#t~nondet30;~id5~0 := main_#t~nondet31;havoc main_#t~nondet31;~st5~0 := main_#t~nondet32;havoc main_#t~nondet32;~send5~0 := main_#t~nondet33;havoc main_#t~nondet33;~mode5~0 := main_#t~nondet34;havoc main_#t~nondet34;~id6~0 := main_#t~nondet35;havoc main_#t~nondet35;~st6~0 := main_#t~nondet36;havoc main_#t~nondet36;~send6~0 := main_#t~nondet37;havoc main_#t~nondet37;~mode6~0 := main_#t~nondet38;havoc main_#t~nondet38;~id7~0 := main_#t~nondet39;havoc main_#t~nondet39;~st7~0 := main_#t~nondet40;havoc main_#t~nondet40;~send7~0 := main_#t~nondet41;havoc main_#t~nondet41;~mode7~0 := main_#t~nondet42;havoc main_#t~nondet42;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 907#L262 assume 0 == ~r1~0; 929#L263 assume ~id1~0 >= 0; 933#L264 assume 0 == ~st1~0; 934#L265 assume ~send1~0 == ~id1~0; 869#L266 assume 0 == ~mode1~0 % 256; 870#L267 assume ~id2~0 >= 0; 882#L268 assume 0 == ~st2~0; 883#L269 assume ~send2~0 == ~id2~0; 864#L270 assume 0 == ~mode2~0 % 256; 865#L271 assume ~id3~0 >= 0; 896#L272 assume 0 == ~st3~0; 914#L273 assume ~send3~0 == ~id3~0; 931#L274 assume 0 == ~mode3~0 % 256; 957#L275 assume ~id4~0 >= 0; 844#L276 assume 0 == ~st4~0; 845#L277 assume ~send4~0 == ~id4~0; 968#L278 assume 0 == ~mode4~0 % 256; 924#L279 assume ~id5~0 >= 0; 925#L280 assume 0 == ~st5~0; 874#L281 assume ~send5~0 == ~id5~0; 846#L282 assume 0 == ~mode5~0 % 256; 847#L283 assume ~id6~0 >= 0; 935#L284 assume 0 == ~st6~0; 936#L285 assume ~send6~0 == ~id6~0; 956#L286 assume 0 == ~mode6~0 % 256; 942#L287 assume ~id7~0 >= 0; 891#L288 assume 0 == ~st7~0; 892#L289 assume ~send7~0 == ~id7~0; 899#L290 assume 0 == ~mode7~0 % 256; 949#L291 assume ~id1~0 != ~id2~0; 950#L292 assume ~id1~0 != ~id3~0; 958#L293 assume ~id1~0 != ~id4~0; 965#L294 assume ~id1~0 != ~id5~0; 856#L295 assume ~id1~0 != ~id6~0; 857#L296 assume ~id1~0 != ~id7~0; 897#L297 assume ~id2~0 != ~id3~0; 894#L298 assume ~id2~0 != ~id4~0; 895#L299 assume ~id2~0 != ~id5~0; 905#L300 assume ~id2~0 != ~id6~0; 943#L301 assume ~id2~0 != ~id7~0; 954#L302 assume ~id3~0 != ~id4~0; 955#L303 assume ~id3~0 != ~id5~0; 961#L304 assume ~id3~0 != ~id6~0; 937#L305 assume ~id3~0 != ~id7~0; 938#L306 assume ~id4~0 != ~id5~0; 948#L307 assume ~id4~0 != ~id6~0; 866#L308 assume ~id4~0 != ~id7~0; 867#L309 assume ~id5~0 != ~id6~0; 947#L310 assume ~id5~0 != ~id7~0; 918#L311 assume ~id6~0 != ~id7~0;init_~tmp~0 := 1; 888#L262-1 init_#res := init_~tmp~0; 889#L463 main_#t~ret43 := init_#res;main_~i2~0 := main_#t~ret43;havoc main_#t~ret43;assume_abort_if_not_#in~cond := main_~i2~0;havoc assume_abort_if_not_~cond;assume_abort_if_not_~cond := assume_abort_if_not_#in~cond; 908#L22 assume !(0 == assume_abort_if_not_~cond); 913#L21 ~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 := 0; 960#L547-2 [2021-08-27 17:10:18,310 INFO L793 eck$LassoCheckResult]: Loop: 960#L547-2 assume !!(main_~i2~0 < 14);havoc node1_#t~ite7, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~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 := ~p7_old~0;~p7_old~0 := ~nomsg~0; 903#L89 assume !(node1_~m1~0 != ~nomsg~0); 901#L89-1 ~mode1~0 := 0; 919#L85-2 havoc node2_#t~ite8, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 1018#L111 assume 0 != ~mode2~0 % 256;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 1015#L114 assume !(node2_~m2~0 != ~nomsg~0); 1013#L114-1 ~mode2~0 := 0; 1011#L111-2 havoc node3_#t~ite9, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 1010#L136 assume !(0 != ~mode3~0 % 256); 1009#L149 assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite9 := ~send3~0; 1004#L149-2 ~p3_new~0 := (if node3_#t~ite9 % 256 <= 127 then node3_#t~ite9 % 256 else node3_#t~ite9 % 256 - 256);havoc node3_#t~ite9;~mode3~0 := 1; 1003#L136-2 havoc node4_#t~ite10, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; 1002#L161 assume 0 != ~mode4~0 % 256;node4_~m4~0 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 999#L164 assume !(node4_~m4~0 != ~nomsg~0); 997#L164-1 ~mode4~0 := 0; 995#L161-2 havoc node5_#t~ite11, node5_~m5~0;havoc node5_~m5~0;node5_~m5~0 := ~nomsg~0; 994#L186 assume 0 != ~mode5~0 % 256;node5_~m5~0 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 992#L189 assume !(node5_~m5~0 != ~nomsg~0); 989#L189-1 ~mode5~0 := 0; 987#L186-2 havoc node6_#t~ite12, node6_~m6~0;havoc node6_~m6~0;node6_~m6~0 := ~nomsg~0; 986#L211 assume 0 != ~mode6~0 % 256;node6_~m6~0 := ~p5_old~0;~p5_old~0 := ~nomsg~0; 983#L214 assume !(node6_~m6~0 != ~nomsg~0); 981#L214-1 ~mode6~0 := 0; 979#L211-2 havoc node7_#t~ite13, node7_~m7~0;havoc node7_~m7~0;node7_~m7~0 := ~nomsg~0; 978#L236 assume 0 != ~mode7~0 % 256;node7_~m7~0 := ~p6_old~0;~p6_old~0 := ~nomsg~0; 977#L239 assume !(node7_~m7~0 != ~nomsg~0); 973#L239-1 ~mode7~0 := 0; 971#L236-2 ~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;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 970#L471 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 <= 1; 969#L472 assume !(~r1~0 >= 7); 945#L475 assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0; 946#L476 assume ~r1~0 < 7;check_~tmp~1 := 1; 1025#L471-1 check_#res := check_~tmp~1; 1024#L491 main_#t~ret44 := check_#res;main_~c1~0 := main_#t~ret44;havoc main_#t~ret44;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 1023#L583 assume !(0 == assert_~arg % 256); 1022#L578 main_#t~post45 := main_~i2~0;main_~i2~0 := 1 + main_#t~post45;havoc main_#t~post45; 960#L547-2 [2021-08-27 17:10:18,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:10:18,310 INFO L82 PathProgramCache]: Analyzing trace with hash 292839954, now seen corresponding path program 3 times [2021-08-27 17:10:18,310 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:10:18,311 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759541756] [2021-08-27 17:10:18,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:10:18,311 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:10:18,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:10:18,354 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 17:10:18,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:10:18,414 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 17:10:18,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:10:18,415 INFO L82 PathProgramCache]: Analyzing trace with hash 931303707, now seen corresponding path program 1 times [2021-08-27 17:10:18,415 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:10:18,416 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144228075] [2021-08-27 17:10:18,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:10:18,416 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:10:18,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:10:18,428 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 17:10:18,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 17:10:18,442 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 17:10:18,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:10:18,443 INFO L82 PathProgramCache]: Analyzing trace with hash -721431126, now seen corresponding path program 1 times [2021-08-27 17:10:18,443 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 17:10:18,443 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036820870] [2021-08-27 17:10:18,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 17:10:18,444 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 17:10:18,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 17:10:18,502 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 17:10:18,502 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 17:10:18,502 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036820870] [2021-08-27 17:10:18,502 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036820870] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 17:10:18,503 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 17:10:18,503 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-27 17:10:18,503 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963580462] [2021-08-27 17:10:20,366 INFO L210 LassoAnalysis]: Preferences: [2021-08-27 17:10:20,367 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-08-27 17:10:20,367 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-08-27 17:10:20,367 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-08-27 17:10:20,368 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2021-08-27 17:10:20,368 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:10:20,368 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-08-27 17:10:20,368 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-08-27 17:10:20,368 INFO L133 ssoRankerPreferences]: Filename of dumped script: pals_lcr.7.ufo.BOUNDED-14.pals.c_Iteration4_Loop [2021-08-27 17:10:20,368 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-08-27 17:10:20,368 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-08-27 17:10:20,389 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:10:20,397 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:10:20,399 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:10:20,402 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:10:20,404 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:10:20,419 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:10:20,422 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:10:20,605 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:10:20,610 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:10:20,612 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:10:20,615 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:10:20,619 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:10:20,621 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:10:20,625 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:10:20,628 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:10:20,630 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:10:20,632 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:10:20,634 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:10:20,637 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:10:20,641 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:10:20,642 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:10:20,647 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:10:20,653 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:10:20,660 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:10:20,663 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:10:20,683 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:10:20,686 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:10:20,693 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:10:20,696 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:10:20,699 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:10:20,702 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:10:20,708 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:10:20,715 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:10:20,719 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:10:20,721 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:10:20,724 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:10:23,599 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-08-27 17:10:23,600 INFO L404 LassoAnalysis]: Checking for nontermination... [2021-08-27 17:10:23,602 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:10:23,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:10:23,608 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) [2021-08-27 17:10:23,609 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 [2021-08-27 17:10:23,611 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-08-27 17:10:23,611 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-08-27 17:10:23,646 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2021-08-27 17:10:23,646 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:10:23,646 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:10:23,650 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) [2021-08-27 17:10:23,651 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 [2021-08-27 17:10:23,652 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2021-08-27 17:10:23,652 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-08-27 17:10:23,762 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2021-08-27 17:10:23,765 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 [2021-08-27 17:10:23,766 INFO L210 LassoAnalysis]: Preferences: [2021-08-27 17:10:23,766 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-08-27 17:10:23,766 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-08-27 17:10:23,766 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-08-27 17:10:23,766 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-08-27 17:10:23,766 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:10:23,766 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-08-27 17:10:23,766 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-08-27 17:10:23,766 INFO L133 ssoRankerPreferences]: Filename of dumped script: pals_lcr.7.ufo.BOUNDED-14.pals.c_Iteration4_Loop [2021-08-27 17:10:23,766 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-08-27 17:10:23,766 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-08-27 17:10:23,771 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:10:23,780 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:10:23,782 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:10:23,784 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:10:23,786 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:10:23,799 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:10:23,801 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:10:23,804 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:10:23,809 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:10:23,812 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:10:23,814 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:10:23,816 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:10:23,822 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:10:23,824 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:10:23,828 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:10:24,001 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:10:24,005 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:10:24,010 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:10:24,012 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:10:24,017 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:10:24,019 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:10:24,021 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:10:24,024 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:10:24,028 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:10:24,032 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:10:24,036 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:10:24,039 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:10:24,041 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:10:24,046 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:10:24,052 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:10:24,055 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:10:24,060 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:10:24,066 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:10:24,068 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:10:24,070 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:10:24,072 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 17:10:26,690 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-08-27 17:10:26,694 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-08-27 17:10:26,695 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:10:26,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:10:26,699 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) [2021-08-27 17:10:26,728 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 [2021-08-27 17:10:26,736 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:10:26,736 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 17:10:26,737 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:10:26,737 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:10:26,737 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:10:26,740 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 17:10:26,740 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 17:10:26,743 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 [2021-08-27 17:10:26,745 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:10:26,760 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2021-08-27 17:10:26,761 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:10:26,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:10:26,774 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) [2021-08-27 17:10:26,775 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 [2021-08-27 17:10:26,777 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 [2021-08-27 17:10:26,784 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:10:26,784 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:10:26,784 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:10:26,784 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:10:26,794 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 17:10:26,794 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 17:10:26,804 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:10:26,826 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 [2021-08-27 17:10:26,826 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:10:26,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:10:26,827 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) [2021-08-27 17:10:26,829 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 [2021-08-27 17:10:26,830 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 [2021-08-27 17:10:26,838 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:10:26,839 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 17:10:26,839 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:10:26,839 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:10:26,839 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:10:26,839 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 17:10:26,840 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 17:10:26,852 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:10:26,868 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 [2021-08-27 17:10:26,868 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:10:26,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:10:26,869 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) [2021-08-27 17:10:26,870 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 [2021-08-27 17:10:26,871 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 [2021-08-27 17:10:26,877 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:10:26,878 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 17:10:26,878 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:10:26,878 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:10:26,878 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:10:26,878 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 17:10:26,878 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 17:10:26,880 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:10:26,895 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2021-08-27 17:10:26,896 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:10:26,896 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:10:26,896 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) [2021-08-27 17:10:26,897 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 [2021-08-27 17:10:26,898 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 [2021-08-27 17:10:26,905 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:10:26,905 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 17:10:26,905 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:10:26,905 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2021-08-27 17:10:26,905 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:10:26,908 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2021-08-27 17:10:26,908 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 17:10:26,923 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:10:26,940 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 [2021-08-27 17:10:26,940 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:10:26,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:10:26,941 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) [2021-08-27 17:10:26,941 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 [2021-08-27 17:10:26,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 [2021-08-27 17:10:26,949 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:10:26,949 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 17:10:26,949 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:10:26,949 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:10:26,949 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:10:26,950 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 17:10:26,950 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 17:10:26,951 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:10:26,965 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 [2021-08-27 17:10:26,966 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:10:26,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:10:26,967 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) [2021-08-27 17:10:26,967 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 [2021-08-27 17:10:26,969 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 [2021-08-27 17:10:26,975 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:10:26,975 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:10:26,975 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:10:26,975 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:10:26,978 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 17:10:26,978 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 17:10:26,982 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:10:26,997 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 [2021-08-27 17:10:26,997 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:10:26,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:10:26,998 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) [2021-08-27 17:10:26,999 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 [2021-08-27 17:10:27,000 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 [2021-08-27 17:10:27,006 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:10:27,006 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 17:10:27,007 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:10:27,007 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:10:27,007 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:10:27,008 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 17:10:27,008 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 17:10:27,010 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:10:27,025 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 [2021-08-27 17:10:27,025 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:10:27,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:10:27,027 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) [2021-08-27 17:10:27,030 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 [2021-08-27 17:10:27,031 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 [2021-08-27 17:10:27,037 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:10:27,037 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:10:27,037 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:10:27,037 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:10:27,039 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 17:10:27,039 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 17:10:27,051 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:10:27,068 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2021-08-27 17:10:27,068 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:10:27,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:10:27,069 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) [2021-08-27 17:10:27,070 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 [2021-08-27 17:10:27,071 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 [2021-08-27 17:10:27,077 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:10:27,078 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:10:27,078 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:10:27,078 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:10:27,080 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 17:10:27,080 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 17:10:27,099 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:10:27,114 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2021-08-27 17:10:27,114 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:10:27,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:10:27,115 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) [2021-08-27 17:10:27,115 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 [2021-08-27 17:10:27,117 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 [2021-08-27 17:10:27,123 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:10:27,123 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 17:10:27,123 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:10:27,123 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:10:27,123 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:10:27,124 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 17:10:27,124 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 17:10:27,124 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:10:27,140 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2021-08-27 17:10:27,140 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:10:27,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:10:27,141 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) [2021-08-27 17:10:27,142 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 [2021-08-27 17:10:27,143 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 [2021-08-27 17:10:27,149 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:10:27,149 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 17:10:27,149 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:10:27,149 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:10:27,149 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:10:27,151 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 17:10:27,151 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 17:10:27,152 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:10:27,167 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 [2021-08-27 17:10:27,167 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:10:27,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:10:27,168 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) [2021-08-27 17:10:27,169 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 [2021-08-27 17:10:27,170 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 [2021-08-27 17:10:27,176 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:10:27,176 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:10:27,176 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:10:27,176 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:10:27,178 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 17:10:27,178 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 17:10:27,180 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:10:27,195 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 [2021-08-27 17:10:27,197 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:10:27,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:10:27,197 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) [2021-08-27 17:10:27,200 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 [2021-08-27 17:10:27,201 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 [2021-08-27 17:10:27,207 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:10:27,207 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 17:10:27,207 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:10:27,207 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:10:27,207 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:10:27,208 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 17:10:27,208 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 17:10:27,240 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:10:27,266 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2021-08-27 17:10:27,267 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:10:27,267 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:10:27,275 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) [2021-08-27 17:10:27,277 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 [2021-08-27 17:10:27,280 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 [2021-08-27 17:10:27,286 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:10:27,286 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 17:10:27,287 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:10:27,287 INFO L204 nArgumentSynthesizer]: 4 loop disjuncts [2021-08-27 17:10:27,287 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:10:27,332 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2021-08-27 17:10:27,332 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 17:10:27,363 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:10:27,386 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 [2021-08-27 17:10:27,386 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:10:27,386 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:10:27,387 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) [2021-08-27 17:10:27,400 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 [2021-08-27 17:10:27,406 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:10:27,407 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:10:27,407 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:10:27,407 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:10:27,409 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 17:10:27,409 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 17:10:27,412 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 [2021-08-27 17:10:27,424 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:10:27,449 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 [2021-08-27 17:10:27,449 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:10:27,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:10:27,450 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 17:10:27,458 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 [2021-08-27 17:10:27,464 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:10:27,464 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 17:10:27,464 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:10:27,464 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:10:27,464 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:10:27,466 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 17:10:27,466 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 17:10:27,468 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2021-08-27 17:10:27,476 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:10:27,499 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2021-08-27 17:10:27,499 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:10:27,499 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:10:27,500 INFO L229 MonitoredProcess]: Starting monitored process 21 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) [2021-08-27 17:10:27,508 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 [2021-08-27 17:10:27,514 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:10:27,515 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 17:10:27,515 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:10:27,515 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:10:27,515 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:10:27,515 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 17:10:27,515 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 17:10:27,517 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2021-08-27 17:10:27,524 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 17:10:27,550 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2021-08-27 17:10:27,551 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:10:27,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:10:27,552 INFO L229 MonitoredProcess]: Starting monitored process 22 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) [2021-08-27 17:10:27,560 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 [2021-08-27 17:10:27,568 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 17:10:27,568 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 17:10:27,568 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 17:10:27,568 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 17:10:27,569 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 17:10:27,569 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 17:10:27,569 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 17:10:27,572 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2021-08-27 17:10:27,579 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-08-27 17:10:27,601 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2021-08-27 17:10:27,601 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2021-08-27 17:10:27,603 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 17:10:27,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 17:10:27,613 INFO L229 MonitoredProcess]: Starting monitored process 23 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) [2021-08-27 17:10:27,620 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2021-08-27 17:10:27,621 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-08-27 17:10:27,621 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2021-08-27 17:10:27,621 INFO L513 LassoAnalysis]: Proved termination. [2021-08-27 17:10:27,621 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i2~0) = -2*ULTIMATE.start_main_~i2~0 + 27 Supporting invariants [] [2021-08-27 17:10:27,644 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2021-08-27 17:10:27,646 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2021-08-27 17:10:27,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 17:10:27,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 17:10:27,762 INFO L263 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 2 conjunts are in the unsatisfiable core [2021-08-27 17:10:27,766 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 17:10:27,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 17:10:27,997 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 4 conjunts are in the unsatisfiable core [2021-08-27 17:10:27,999 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 17:10:28,203 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2021-08-27 17:10:28,334 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 17:10:28,338 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 [2021-08-27 17:10:28,338 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) [2021-08-27 17:10:28,387 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. [2021-08-27 17:10:28,388 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 [2021-08-27 17:10:28,388 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) [2021-08-27 17:10:28,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 159 transitions. [2021-08-27 17:10:28,390 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 159 transitions. Stem has 56 letters. Loop has 37 letters. [2021-08-27 17:10:28,392 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-27 17:10:28,392 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 159 transitions. Stem has 93 letters. Loop has 37 letters. [2021-08-27 17:10:28,395 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-27 17:10:28,395 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 159 transitions. Stem has 56 letters. Loop has 74 letters. [2021-08-27 17:10:28,396 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-27 17:10:28,396 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 307 states and 446 transitions. [2021-08-27 17:10:28,398 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2021-08-27 17:10:28,398 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 307 states to 0 states and 0 transitions. [2021-08-27 17:10:28,399 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2021-08-27 17:10:28,399 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2021-08-27 17:10:28,399 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2021-08-27 17:10:28,399 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 17:10:28,399 INFO L681 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-08-27 17:10:28,399 INFO L704 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-08-27 17:10:28,399 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 17:10:28,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-27 17:10:28,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 17:10:28,400 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) [2021-08-27 17:10:28,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 17:10:28,400 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2021-08-27 17:10:28,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-08-27 17:10:28,400 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2021-08-27 17:10:28,401 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2021-08-27 17:10:28,401 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2021-08-27 17:10:28,401 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2021-08-27 17:10:28,401 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2021-08-27 17:10:28,401 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2021-08-27 17:10:28,401 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 17:10:28,401 INFO L681 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-08-27 17:10:28,401 INFO L704 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-08-27 17:10:28,401 INFO L587 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-08-27 17:10:28,402 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2021-08-27 17:10:28,402 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2021-08-27 17:10:28,402 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2021-08-27 17:10:28,402 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2021-08-27 17:10:28,408 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 27.08 05:10:28 BoogieIcfgContainer [2021-08-27 17:10:28,408 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2021-08-27 17:10:28,408 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-08-27 17:10:28,409 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-08-27 17:10:28,409 INFO L275 PluginConnector]: Witness Printer initialized [2021-08-27 17:10:28,409 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 05:10:16" (3/4) ... [2021-08-27 17:10:28,411 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-08-27 17:10:28,411 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-08-27 17:10:28,413 INFO L168 Benchmark]: Toolchain (without parser) took 13018.09 ms. Allocated memory was 54.5 MB in the beginning and 174.1 MB in the end (delta: 119.5 MB). Free memory was 30.6 MB in the beginning and 110.2 MB in the end (delta: -79.6 MB). Peak memory consumption was 39.2 MB. Max. memory is 16.1 GB. [2021-08-27 17:10:28,413 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 54.5 MB. Free memory was 36.9 MB in the beginning and 36.9 MB in the end (delta: 36.8 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-27 17:10:28,419 INFO L168 Benchmark]: CACSL2BoogieTranslator took 452.45 ms. Allocated memory was 54.5 MB in the beginning and 67.1 MB in the end (delta: 12.6 MB). Free memory was 30.4 MB in the beginning and 46.8 MB in the end (delta: -16.4 MB). Peak memory consumption was 7.3 MB. Max. memory is 16.1 GB. [2021-08-27 17:10:28,419 INFO L168 Benchmark]: Boogie Procedure Inliner took 80.33 ms. Allocated memory is still 67.1 MB. Free memory was 46.6 MB in the beginning and 43.9 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-08-27 17:10:28,420 INFO L168 Benchmark]: Boogie Preprocessor took 57.15 ms. Allocated memory is still 67.1 MB. Free memory was 43.9 MB in the beginning and 41.6 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-08-27 17:10:28,420 INFO L168 Benchmark]: RCFGBuilder took 869.72 ms. Allocated memory is still 67.1 MB. Free memory was 41.4 MB in the beginning and 36.8 MB in the end (delta: 4.6 MB). Peak memory consumption was 15.7 MB. Max. memory is 16.1 GB. [2021-08-27 17:10:28,420 INFO L168 Benchmark]: BuchiAutomizer took 11546.75 ms. Allocated memory was 67.1 MB in the beginning and 174.1 MB in the end (delta: 107.0 MB). Free memory was 36.8 MB in the beginning and 110.2 MB in the end (delta: -73.4 MB). Peak memory consumption was 32.4 MB. Max. memory is 16.1 GB. [2021-08-27 17:10:28,421 INFO L168 Benchmark]: Witness Printer took 2.99 ms. Allocated memory is still 174.1 MB. Free memory is still 110.2 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-08-27 17:10:28,424 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.18 ms. Allocated memory is still 54.5 MB. Free memory was 36.9 MB in the beginning and 36.9 MB in the end (delta: 36.8 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 452.45 ms. Allocated memory was 54.5 MB in the beginning and 67.1 MB in the end (delta: 12.6 MB). Free memory was 30.4 MB in the beginning and 46.8 MB in the end (delta: -16.4 MB). Peak memory consumption was 7.3 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 80.33 ms. Allocated memory is still 67.1 MB. Free memory was 46.6 MB in the beginning and 43.9 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 57.15 ms. Allocated memory is still 67.1 MB. Free memory was 43.9 MB in the beginning and 41.6 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 869.72 ms. Allocated memory is still 67.1 MB. Free memory was 41.4 MB in the beginning and 36.8 MB in the end (delta: 4.6 MB). Peak memory consumption was 15.7 MB. Max. memory is 16.1 GB. * BuchiAutomizer took 11546.75 ms. Allocated memory was 67.1 MB in the beginning and 174.1 MB in the end (delta: 107.0 MB). Free memory was 36.8 MB in the beginning and 110.2 MB in the end (delta: -73.4 MB). Peak memory consumption was 32.4 MB. Max. memory is 16.1 GB. * Witness Printer took 2.99 ms. Allocated memory is still 174.1 MB. Free memory is still 110.2 MB. There was no memory consumed. Max. memory is 16.1 GB. * 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 11.4s and 5 iterations. TraceHistogramMax:1. Analysis of lassos took 10.2s. Construction of modules took 0.1s. Büchi inclusion checks took 0.9s. Highest rank in rank-based complementation 3. Minimization of det autom 5. Minimization of nondet autom 0. Automata minimization 40.5ms AutomataMinimizationTime, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 182 states and ocurred in iteration 3. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 779 SDtfs, 253 SDslu, 1316 SDs, 0 SdLazy, 36 SolverSat, 55 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 120.4ms Time LassoAnalysisResults: nont0 unkn0 SFLI2 SFLT0 conc0 concLT1 SILN0 SILU0 SILI1 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital235 mio100 ax135 hnf108 lsp38 ukn82 mio100 lsp100 div127 bol100 ite100 ukn100 eq197 hnf77 smp100 dnf727 smp49 tf100 neg99 sie101 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 95ms VariablesStem: 0 VariablesLoop: 38 DisjunctsStem: 1 DisjunctsLoop: 4 SupportingInvariants: 0 MotzkinApplications: 8 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 1 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.1s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2021-08-27 17:10:28,462 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...